Abstract
This is a slightly edited version of a paper written, but not published, in the mid-eighties. Its age is symbolic of my much older friendship and respect for Dave Forney, and it is dedicated to that friendship. It’s age should not be taken as any claim for precedence of the results, but merely to excuse the lack of up-to-date references.
We consider a class of communication channels modelling situations in which there is an energy constraint but almost an unlimited number of degrees of freedom per unit time. Examples of such channels are broadband additive Gaussian noise channels, fading dispersive channels, and quantum optical channels. We start by restricting such channels to binary inputs and then find the reliability function. In the limit of infinite bandwidth, the reliability function for these channels can be found exactly for all rates if there is a finite capacity in terms of bits per unit energy. Particular attention is paid to how this limiting reliability is approached as bandwidth increases. We then show that the restriction to binary inputs is essentially optimal in the broadband limit. Finally we apply these results to multiaccess use of such channels. Multiaccess coding for these broadband channels provides us with an abstraction of spread spectrum communication.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. G. Gallager, Information Theory and Reliable Communication, New York: Wiley, 1968
A. J. Viterbi and J. K. Omura, Principles of Digital Communication and Coding, New York: McGraw Hill, 1979.
J. M. Wozercraft and I. M. Jacobs, Principles of Communication Engineering, New York: Wiley, 1965.
R. S. Kennedy, Fading Dispersive Channels, New York: Wiley, 1969.
J. S. Richters, “Communication over Fading Dispersive Channels,” MIT RLE Tech Report 464, 1967.
C. E. Shannon, R. G. Gallager, and E. R. Berlekamp, “Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels,” Information and Control 10, pp. 65–103 (part I), pp. 522–552 (part II).
R. J. McEliece, “Practical Codes for Photon Communication,” IEEE Transactions on Information Theory, Vol. IT-27, 4, July 1981.
J. L. Massey, “Capacity, Cutoff Rate, and Coding for a Direct Detection Optical Channel,” IEEE Transactions on Communications, Vol. COMM-29, 11, pp 1615–1621, Nov. 1981.
P. A. Humblet, “Error Exponents for a Direct Detection Optical Channel,” M.I.T. LIDS Report LIDS-P-1337, Oct. 1983; also Proceedings. 23rd Allerton Conference on Communication, Control and Computing, Monticello, Ill., Oct. 1985.
R. Ahlswede, “Multi-way Communication Channels,” Proceedings of the 1971 IEEE International Symposium on Information Theory Tsahkadsor, Armenian S.S.R., 1971.
H. Liao, “A Coding Theorem for Multiple Access Communications,” in Proceedings of the 1972 IEEE International Symposium on Information Theory, Asilomar, CA, 1972; also “Multiple Access Channels,” Ph.D. thesis, Univ. of Hawii, 1972.
A. El Gamal and T. M. Cover, “Multiple user Information Theory,” Proceedings of the IEEE, Vol. 68, pp. 1466–1483, Dec. 1980
E. C. van der Meulen, “A Survey of Multi-way Channels in Information Theory 1961–1976,” IEEE Transactions on Information Theory, Vol. IT-23, Jan 1977.
I. Csiszar and J. Korner, Information Theory: Coding Theorems for Discrete Memoryless Systems, New York: Academic Press 1981.
T. Kasami, S. Lin, V. K. Wei, and S. Yamamura, “Graph Theoretic Approaches to the Code Construction for the Two-user Multipleaccess Binary Adder Channel,” IEEE Transactions on Information Theory, Vol. IT-20, pp. 114–130, Jan. 1983.
M. B. Pursley, “Frequency-Hop Transmission for Satellite Packet Switching and Terrestrial Packet Radio Networks,” IEEE Transactions on Information Theory, Vol. IT32, pp 652–668, Sept. 1986.
Special Issue on Spread Spectrum: IEEE Transactions on Communications, May 1982.
A. J. Viterbi, “Spread Spectrum Multiple Access with Binary Modulation can Approach Shannon Capacity for the Aggregate Gaussian Channel” Manuscript.
S. Verdu, “Maximum Likelihood Sequence Detection for Intersymbol Interference Channels: A New Upper Bound on Error Probability,” IEEE Transactions on Information Theory, Vol. IT-33, pp. 62–69, Jan. 1987.
E. Arikan, Sequential Decoding for Multiple Access Channels, Ph. D. Thesis, Dept. of EECS, M.I.T., Nov. 1985.
D. Slepian and J. Wolf, “A Coding Theorem for Multiple Access Channels with Correlated Sources,” Bell System Technical Journal, Vol. 52, pp. 1037–1076, Sept. 1973.
R. G. Gallager, “A Perspective on Multiaccess Channels,” IEEE Transactions on Information Theory, Vol. IT-31, pp. 124–143, Mar. 1985.
J. Y. N. Hui and P. A. Humblet, “The Capacity region of the Totally Asynchronous Multiple-Access Channel,” IEEE Transactions on Information Theory, Vol. IT-31, pp. 207–217, Mar. 1985.
T. M. Cover, R. J. McEliece, and E. C. Posner, “Asynchronous Multi-access channel Capacity,” IEEE Transactions on Information Theory, Vol. IT-26,pp. 291–298, Nov. 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gallager, R.G. (2002). Power Limited Channels: Coding, Multiaccess, and Spread Spectrum. In: Blahut, R.E., Koetter, R. (eds) Codes, Graphs, and Systems. The Kluwer International Series in Engineering and Computer Science, vol 670. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0895-3_14
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0895-3_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5292-1
Online ISBN: 978-1-4615-0895-3
eBook Packages: Springer Book Archive