-

Transcription

1 Pulkit Grover, Curriculum vitæ: Page 1 of 6 Pulkit Grover (pulkit@cmu.edu) Assistant Professor B-202 Hamerschlag Hall Carnegie Mellon University - Research interests Understanding information flows for engineering efficient systems and understanding biological networks via unifying information communication, acquisition, processing, and usage. Towards this, I am currently focused on: (i) Developing science and practice of green communications and computing, and using it to understand natural computation networks, such as the brain, and engineered networks, such as short-distance communication and circuits; (ii) Obtaining fundamental mathematical limits interactions of energy and information; (iii) Understanding fundamentals of cyber-physical systems via the intersection of communication and control. Career path Assistant Professor, Electrical & Computer Eng. Carnegie Mellon University (Jan 2013 present) Postdoctoral researcher, Electrical Eng. Stanford University (Sept 2011 Dec 12) Focus area: Theoretical limits to information-energy interaction Postdoctoral researcher, UC Berkeley. (Feb 2011 Aug 2011) Graduate student, UC Berkeley (Aug Dec. 2010) Dissertation topic: Actions can speak more clearly than words. Eliahu Jury Award. Master of Technology in Electrical Engineering, IIT Kanpur ( ) CPI : 10.0/10, Ranked 1 st. Dissertation topic: Fundamental bounds on the rate of LDPC codes Bachelor of Technology, Electrical Engineering, IIT Kanpur, India ( ). CPI : 9.1/10, in major 9.5/10. Honors, awards and Scholarships 2014 NSF CAREER award Best Paper Award at the International Symposium on Integrated Circuits (ISIC), Singapore Leonard G. Abraham award by the IEEE Communications society for the best original paper published in any journal of the IEEE Communications Society in the previous 3 calendar years. 2011Eliahu Jury award by the department of Electrical Engineering and Computer Sciences, UC Berkeley, for the best thesis in EE theoretical research Best student paper award at IEEE Conference on Decision and Control (CDC), Atlanta, GA, for the paper Is Witsenhausen s counterexample a relevant toy? 2010 best student paper award finalist at IEEE International Symposium on Information Theory (ISIT). Vodafone Fellowship for , and by Dept. of EECS, UC Berkeley Microsoft Award for Innovation at IEEE Computer Society International Design Competition (CSIDC). National Talent Search Scholarship (Govt. of India ) and State Science Talent Search Scholarship (Govt. of Rajasthan) in recognition of science talent. Represented Rajasthan in Indian National Physics Olympiad (1998). Research and teaching grants/funding PI (with co-pi Prof. A Sankaranarayanan), for $16, 940, for Innovations in Engineering Education, funded by Carnegie Mellon.

2 Pulkit Grover, Curriculum vitæ: Page 2 of 6 PI, NSF Career award (NSF-CCF ), for $596,000, (five years), Towards Green Communications Using an Information-Lens: Foundations of the Joint Design of Communication Strategies and Circuits. Co-PI (with PI Prof. J Paramesh, CMU) for NSF EARS proposal NSF-ECCS , for $800,000 (total), , Energy-Efficient Millimeter-wave Communication via Adaptation and Reconfiguration. PI for Teaching Science of Information (SoI), for $ 10,000 for a class taught in Fall 14 at CMU on science of information, funded by the NSF Center for Science of Information (CSoI). PI for two student seed-grant teams, each for $ 5,000 funded by the NSF Center for Science of Information (CSoI), ( boolean functions in information theory and info-energy interactions ). Teaching and guidance record Taught ECE Signals and Systems at CMU. Introduced multiple applications of core mathematical concepts to make them more accessible. Currently advising research for 4 Ph.D. students, 6 undergraduates, 1 MS student, and serving as an official advisor for 14 other undergraduate students. As a graduate student and a postdoc, advised two UC Berkeley undergraduates, one Stanford undergraduate, on joint design of green systems using fundamental results and Cadence/SPICE simulations (Oct. 10-Dec. 12). Helped design course project for EE 141 an implementation of LDPC Codes for Digital Integrated Circuits (EE 141), taught by Prof. Jan Rabaey (Spring 10). Teaching assistant for EE120 Signals and Systems, UC Berkeley (Fall 2007). Teaching assistant for EE40 Electronic circuits lab, Spring 2005, IIT Kanpur, India. Service & outreach Serving as a research advisor to 6 undergraduate students at Carnegie Mellon University (including 4 women and 2 minority women). Also serving as faculty advisor (as a part of the undergraduate advising committee) for 14 other undergraduate students. Founder and co-organizer, Energy and Information Systems Seminar, Carnegie Mellon University (2013 ). Video abstracts organizer for Workshop on Information Theory and its Applications (ITA) 2013 and I organize this session to have fun videos made on deep technical work that could be accessible to a general audience. Volunteered to teach elementary mathematics to prison inmates in the San Quentin prison, California, as a part of the Prison University Project (PUP). Student co-organizer of Net/Comm/DSP Seminar, UC Berkeley ( ). Co-founder and organizer of EE Graduate Student Seminar, UC Berkeley ( ). Coordinator of Ham and amateur radio club, IIT Kanpur ( ). Reviewer for (journals) IEEE Trans. Information Theory, IEEE Jour. Selected areas in Communications, IEEE Trans. Communications, Systems and Control letters, IEEE Jour. Auto. Control. For (conferences) IEEE Inter. Symp. Info. Theory (ISIT), IEEE Conf. Decision and Control, IEEE Communication Theory Workshop (CTW), IEEE Information Theory Workshop (ITW), American Control Conference (ACC), among others. Invited talks and seminars (excluding conference paper presentations) Green communications, computation, and information friction IIT Bombay, IIT Delhi, LNMIIT (Jaipur) and TIFR (Mumbai), CMU, UC San Diego (ITA Workshop, ), Cornell University, Carnegie Mellon University, UC Santa Barbara, MIT, Imperial College London, Banff (Canada; Workshop on interactive information theory), UC Berkeley (Berkeley Wireless Research Center summer retreat 2011); Decentralized control UToronto, GaTech, USC, UCLA, MIT, ITA, UC San Diego, U Michigan. Journal papers, Magazine articles In preparation:

3 Pulkit Grover, Curriculum vitæ: Page 3 of 6 [J9] Joint designs for minimizing transmit and decoding power: an empirical viewpoint. Karthik Ganesan, Yang Wen, Pulkit Grover, Jan Rabaey, Andrea Goldsmith. In prep. for submission to IEEE Trans. on comm., In press/published: [J9] Energy Harvesting Wireless Communications: A Review of Recent Advances. S. Ulukus, A. Yener, E. Erkip, O. Simeone, M. Zorzi, P. Grover, and K. Huang. JSAC special issue on Wireless Comm via Energy Harvesting and Wireless Power, 2015, to appear. [J8] Information-friction and its impact on minimum energy per communicated bit. Pulkit Grover. IEEE Trans. on Information Theory, 2015, to appear. Short description: The full version of the conference paper [C34], this paper proposes a new model of energy consumption in computation that captures the energy requirements in moving information. It then derives fundamental limits on the energy required for encoding and decoding in a communication system. [J7] Information Structures, the Witsenhausen Counterexample, and Communicating Using Actions. Pulkit Grover. Encyclopedia of Systems and Control, Springer Reference Works, edited by J. Baillieul and T. Samad in press. [J6] Approximately-optimal solutions to the finite-dimensional Witsenhausen counterexample. Pulkit Grover, Se Yong Park and Anant Sahai. IEEE Transactions on Automatic Control, Sept Short description: Building on [J2, J5], provides the first approximately-optimal solution to original (scalar) Witsenhausen counterexample, and its vector extensions. Uses tools from large-deviations and information theory, establishing that understanding implicit communication is important for decentralized control. [J5] Information embedding and the triple role of control. Pulkit Grover, Aaron Wagner and Anant Sahai. Submitted to IEEE Trans. on Information Theory, Short description: Building on [J2], provides tightest known upper and lower bounds for infinite-dimensional Witsenhausen counterexample. Shows dirty-paper coding is optimal in the limit of zero error. Establishes connections with information-embedding problems in information theory. [J4] Towards a communication-theoretic understanding of system-level power consumption. Pulkit Grover, Kristen Ann Woyach and Anant Sahai. IEEE Journal on Selected Areas in Communication (JSAC), special issue on Energy-Efficient Wireless Communication, vol. 29, no. 8, Sept Winner of the 2012 Leonard G. Abraham award. Also featured in top 25 accessed JSAC articles, Sept and Oct Also voted as one of the best reads in Green communications by the IEEE Communications Society. Short description: Provides the first fundamental bounds on energy/power required in computational nodes at the decoder. Shows that regular LDPC Codes are order optimal in this model, while capacity-approaching LDPCs are not. [J3] Demystifying the Witsenhausen Counterexample. Pulkit Grover and Anant Sahai. IEEE CSM ( Ask the experts ), vol. 30, no. 6, pp , Dec Short description: Why is Witsenhausen s counterexample so important? How can understanding this toy problem enhance our understanding of decentralized control significantly? This paper addresses these questions from a big-picture perspective. [J2] Witsenhausen s counterexample as Assisted Interference Suppression. Pulkit Grover and Anant Sahai. IJSCC, 2(1), Jan Pages: Short description: Proposes an information-theoretic path to obtain approximate solutions to the counterexample. For an asymptotically infinite-length extension of the scalar problem, I derive upper and lower bounds that are within a factor of 2 of each other for all problem parameters. [J5] establishes tighter bounds for the asymptotic problem, and [J6] takes the result all the way to scalar (and other finite-length problems).

4 Pulkit Grover, Curriculum vitæ: Page 4 of 6 [J1] Upper Bounds on the Rate of LDPCCs for a Class of Finite State Markov Channels. Pulkit Grover and AK Chaturvedi. IEEE Trans. on Information Theory 53(2), Feb Pages: Conference Papers Computing and communication: fundamental limits [C41] Xin Li, Ronald (Shawn) Blanton, Pulkit Grover and Donald Thomas. Ultra-Low-Power Biomedical Circuit Design and Optimization: Catching The Don t Cares. International Symposium on Integrated Circuits, Singapore, 2014 (Received the Best Paper Award). [C40] Pooja Vyavahare, Majid Mahzoon, Pulkit Grover, Nutan Limaye, D Manjunath. Information-Friction Limits on Computation. 52nd Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, [C39] Majid Mahzoon, Hassan Alabawi, Xin Li, Pulkit Grover. Quantifying Relevance of Data Pieces for Efficient- Big Data Communication, with an Application to Neural Data Acquisition. 52nd Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, [C38] Yaoqing Yang, Pulkit Grover, Soummya Kar. Can a Noisy Encoder be Used to Communicate Reliably? 52nd Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, [C37] Pulkit Grover. Is the Shannon capacity of Noisy Computing zero? IEEE International Symposium on Information Theory (ISIT), [C36] Pulkit Grover. Understanding Information Friction for Minimizing Power Consumed in Data Centers and Big Data Processing CMU Electricity Conference, 2014 [C35] Pulkit Grover. What do we need to do to green data-center networks? IEEE Online Conference on Green Communications, [C34] Max Regan and Pulkit Grover. Intrusion detection for wireless power networks, near-field communication, and side-channel attacks. Proceedings of the 47th Asilomar Conference on Signals, Systems and Computers, [C33] Information-Friction and its impact on minimum energy per communicated bit Pulkit Grover. IEEE International Symposium on Information Theory (ISIT), [C32] How far are LDPC codes from fundamental limits on total power consumption?, Karthik Ganesan, Pulkit Grover, and Andrea Goldsmith, 49th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, Oct [C31] Choosing green codes by simulation-based modeling of implementations, Karthik Ganesan, Yang Wen, Pulkit Grover, Andrea Goldsmith and Jan Rabaey IEEE Globecom [C30] Securing Inductively Coupled Communication, Lav Varshney, Pulkit Grover and Anant Sahai, Workshop on Information Theory and its Applications (ITA), San Diego, 2012 [C29] Fundamental limits on power consumption for lossless signal reconstruction. Pulkit Grover. IEEE Information Theory Workshop (ITW) 2012, Lausanne, Switzerland. [C28] Fundamental limits on the power consumption of encoding and decoding. Pulkit Grover, Andrea Goldsmith, and Anant Sahai. IEEE International Symposium on Information Theory (ISIT), Boston, MA, July [C27] Information theory meets circuit design: why capacity-approaching requires more chip area and power. Pulkit Grover, Andrea Goldsmith, Anant Sahai and Jan Rabaey. 49th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, [C26] Simple models for power optimization across transmission, equalization and decoding. Pulkit Grover, Anant Sahai and Ji-Hoon Park, European Signal Processing Conference (EUSIPCO) [C25] The power cost of over-designing codes. Karthik Ganesan, Pulkit Grover and Jan Rabaey. IEEE Workshop on Signal Processing Systems (SiPS) [C24] Decoding power consumption can increase significantly with increased wire-lengths and code performance: Empirical results. Karthik Ganesan and Pulkit Grover, DAC 11, Work-In-Progress session.

5 Pulkit Grover, Curriculum vitæ: Page 5 of 6 [C23] Fundamental lower bounds on wiring complexity of decoder implementations. Pulkit Grover and Anant Sahai. Conference on Information Sciences and Systems (CISS) [C22] An interference-aware perspective on decoding power. Pulkit Grover, Kristen Ann Woyach, Hari Palaiyanur and Anant Sahai. 6th Int. Symp. on turbo codes and iterative information processing (ISTC), Brest, France, [C21] Shannon meets Tesla: wireless information and power transfer. Pulkit Grover and Anant Sahai. IEEE International Symposium on Information Theory (ISIT) 2010, Austin, Texas. [C20] Information-theoretic tradeoffs on throughput and chip power consumption for decoding error-correcting codes. Pulkit Grover, Hari Palaiyanur and Anant Sahai. IEEE International Symposium on Information Theory (ISIT) 2010, Austin, Texas. [C19] Time-division multiplexing for green broadcasting. Pulkit Grover and Anant Sahai. IEEE International Symposium on Information Theory (ISIT), Seoul, South Korea, [C18] Green Codes: Energy-Efficient Short-Range Communication. Pulkit Grover and Anant Sahai. International Symposium on Information Theory (ISIT), Toronto, [C17] Bounds on the tradeoff between decoding complexity and rate. Pulkit Grover. IEEE Information Theory Workshop (ITW), Lake Tahoe. Communicating using actions [C16] The role of common context in facilitating coordination. Pulkit Grover and Cedric Langbort. IEEE Conference on Decision and Control [C15] The source-simplification aspect of signaling. Pulkit Grover and Anant Sahai. IEEE International Symposium on Information Theory (ISIT) 2011, St. Petersburg, Russia. [C14] Distributed signal cancelation inspired by Witsenhausen s counterexample. Pulkit Grover and Anant Sahai. IEEE International Symposium on Information Theory (ISIT) 2010, Austin, Texas. Finalist for Student Best Paper Award. [C13] Is Witsenhausen s counterexample a relevant toy? Pulkit Grover and Anant Sahai. IEEE Conference on Decision and Control 2010, Atlanta, Georgia. Recipient of the Student Best Paper Award. [C12] Implicit and explicit communication in decentralized control. Pulkit Grover and Anant Sahai. 48th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, [C11] Information embedding meets distributed control. Pulkit Grover, Aaron Wagner and Anant Sahai. IEEE Information Theory Workshop (ITW), Cairo, Egypt, [C10] On a Generalized Witsenhausen Counterexample. Pulkit Grover, Se Yong Park and Anant Sahai. 47th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, [C9] The Finite Dimensional Witsenhausen Counterexample. Pulkit Grover, Anant Sahai and Se Yong Park. Control over Communication channels (ConCom), Seoul, South Korea, [C8] A constant factor approximately optimal solution to the Witsenhausen counterexample. Se Yong Park, Pulkit Grover and Anant Sahai. IEEE Conference on Decision and Control, Shanghai, China, [C7] A vector version of Witsenhausen s counterexample : Towards convergence of control, communication and computation. Pulkit Grover and Anant Sahai. IEEE Conf. on Decision and Control, Mexico, Cognitive radios and wireless communication [C6] On the need for knowledge of the phase in exploiting known primary transmissions. Pulkit Grover and Anant Sahai. IEEE Inter. Dynamic Spectrum Access Networks (DySPAN) symp., Dublin, Ireland, [C5] Near vs far field: interference aggregation in TV whitespaces. Kristen Ann Woyach, Pulkit Grover and Anant Sahai. IEEE Globecom [C4] Writing on Rayleigh faded dirt: a computable upper bound to the outage capacity Pulkit Grover and Anant Sahai. IEEE International Symposium on Information Theory (ISIT) [C3] Upper Bounds on the Rate of LDPC codes for a class of Finite-State Markov Channels. Pulkit Grover and Ajit Kumar Chaturvedi. National Conference on Communications (NCC) 2005.

6 Pulkit Grover, Curriculum vitæ: Page 6 of 6 [C2] Upper Bounds on the Rate of LDPC codes for Gilbert-Elliott Channels. Pulkit Grover and Ajit Kumar Chaturvedi. IEEE Information Theory Workshop (ITW) 2004, San Antonio, Texas, USA. [C1] Geolocation Using Transmit and Receive Diversity. Pulkit Grover, R Agarwal and Ajit Kumar Chaturvedi. IEEE Globecom 2004, November 27 December , Dallas, Texas, USA Theses [T2, Ph.D. Thesis] Actions can speak more clearly than words, UC Berkeley, December 10. [T1, MS Thesis] Low-Density Parity-Check Codes: Bounds on the rate and some results on minimal stopping sets, IIT Kanpur, July 05.