In 2003 an LDPC code beat six turbo codes to become the new standard for the satellite transmission of digital television.
LDPC codes are also known as Gallager codes, in honor of RobertG. Gallager, who developed the LDPC concept in his doctoral dissertation at MIT in 1960.
These codes were first designed by Gallager in 1962.
The practical implication of this work of Gallager is that one can perform radio trans-mission such as in mobile networks with the lowest possible power.
These Gallager codes are further used in deep spce transmission, in satellite communications and for high density magnetic recording.
Last but not least, Professor Gallager is an excellent university teacher who has introduced generations of students, engineers and researchers in the fascinating field of information theory, coding theory and computer networks.
The Co-Directors of the laboratory are Professors RobertG. Gallager, Sanjoy K. Mitter, and John N. Tsitsiklis (Acting Co-Director).
In continuation of this research, Dr. Steven G. Finn, Professor RobertG. Gallager, and a number of graduate students from LIDS are collaborating with Lincoln Laboratory on All-Optical Networks.
Professors RobertG. Gallager and Mitchell D. Trott, together with several students, have ongoing projects in mobile communication aimed at developing a cohesive theory and set of insights for wireless multiple access.
obert G. Gallager received the BSEE degree from the University of Pennsylvania in 1953, and the S.M. and Sc.D. degrees in electrical engineering from the Massachusetts Institute of Technology in 1957 and 1960, respectively.
His book, Information Theory and Reliable Communication, Wiley 1968, placed Information Theory on a sound mathematical foundation and was the standard text book in the information theory area for many years.
rofessor Gallager was involved in the founding of Codex Corporation in 1962 (now part of Motorola) and consulted there for many years.
RobertG. Gallager was born in Philadelphia, Penn., on May 29, 1931.
Parekh, "A Generalized Processor Sharing Approach to Flow Control in ISN won the IEEE Communication Society's William Bennett Prize Paper Award "for the best original paper published in the IEEE/ACM Transactions on Networking in the past year" and a preliminary version won the Prize Paper Award for Infocomm 1993.
He was Chairman of the Advisory committee to the NSF Division on Networking and Communication Research and Infrastructure from 1989 to 1992, and has been on numerous visiting committees for Electrical Engineering and Computer Science departments.
To honor the influence and contributions of Professor Thomas Kailath—who directed the Information Systems Laboratory during a period of rapid growth from 1971 to 1980 and who celebrates his 70th birthday this month—former students and colleagues have established an endowment to support an annual lecture, as well as colloquia, workshops and other research-enhancing activities.
MIT Professor Emeritus RobertG. Gallager will deliver the first Kailath Lecture, titled "The Golden Years of Information Theory," at 3 p.m.
Gallager is a member of the National Academy of Engineering and the National Academy of Sciences.
Frosch, Robert A. Fruehan, Richard J. Fuchs, Henry
Fuerstenau, Douglas W. Fuerstenau, Maurice C. Fugate, Robert Q. Fuhrman, Robert A. Fujimoto, James G. Fuller, Gerald G. Fuller, Samuel H. Fung, Yuan-Cheng B. Futran, Mauricio
Gallager, RobertG. Galloway Jr., Gerald E. Galvin, Robert W. Gambino, Richard
BANDWIDTH SCALING FOR FADING MULTIPATH CHANNELS(Site not responding. Last check: 2007-11-01)
RobertG. Gallager (Joint work with Muriel Medard)
We show that very large bandwidths on fading multipath channels cannot be effectively utilized by spread spectrum systems that (in a particular sense) spread the available power uniformly over both time and frequency.
We explain this result intuitively in terms of the interplay between channel estimation and symbol detection.
Abhay K. Parekh, RobertG. Gallager, A generalized processor sharing approach to flow control in integrated services networks: the single-node case IEEE/ACM Transactions on Networking (TON), Volume 1, Issue 3, pp.
Abhay K. Parekh, RobertG. Gallagher, A generalized processor sharing approach to flow control in integrated services networks: the multiple node case, IEEE/ACM Transactions on Networking (TON), v.2 n.2, p.137-150, April 1994
Shreedhar and G. Varghese, Efficient Fair Queuing Using Deficit Round-Robin, in Proceedings of ACM SIGCOMM '95, 4(3), Sept. 1995.
Impacts of the Early Cold War on the Formulation of U.S. Sputnik, Scientists and Eisenhower: A Memoir of the First Special Assistant to the President for Science and Technology
Robert Lucky on Anarchy and it's role in the Internet's success
Handbook of Nonlinear Optical Crystals,V. Dmitriev, G. Gurzadyan, D. Nikogosyan, Arthur L. Schawlow (Editor), A. Siegman (Editor)
Krzysztof Pawlikowski, "Steady-state simulation of queuing processes: a survey of problems and solutions", ACM Computing Surveys, June 1990, pp.
Abhay K. Parekh and RobertG. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The single node case," IEEE/ACM Transactions on Networking, vol.
Abhay K. Parekh and RobertG. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The multiple node case," IEEE/ACM Transactions on Networking, vol.
A bibliography of packet scheduling algorithms in communication switches and routers.(Site not responding. Last check: 2007-11-01)
Reading list on scheduling algorithms in packet switches.
Rahul Garg and Huzur Saran, "Scheduling Algorithms for Bounded Delay Service in Virtual Networks", In Proceedings of IEEE Global Telecommunication Conference, Globecom'99, Dec. 1999, Rio de Janeiro, Brazil.
Suri, G. Varghese, and G. Chandranmenon, " Leap Forward Virtual Clock: A New Fair Queueing Scheme with Guaranteed Delays and Throughput fairness", in Proceeding of IEEE INFOCOM '97.
