Matched filter decoding of random binary and Gaussian codes in broadband Gaussian channel
Name
Medard_Matched filter.pdf
Size
324.25 KB
Format
Adobe PDF
Checksum (MD5)
8ae0741c4bda12dec20f2401cc9306ca
Author(s)
Abdrashitov, Vitaly
Medard, Muriel
Moshkovitz Aaronson, Dana Hadar
Date Issued
July 2013
Journal
Proceedings of the 2013 IEEE International Symposium on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Abdrashitov, Vitaly, Muriel Medard, and Dana Moshkovitz. “Matched Filter Decoding of Random Binary and Gaussian Codes in Broadband Gaussian Channel.” 2013 IEEE International Symposium on Information Theory (July 2013).
Version
Author's final manuscript
Abstract
In this paper we consider the additive white Gaussian noise channel with an average input power constraint in the power-limited regime. A well-known result in information theory states that the capacity of this channel can be achieved by random Gaussian coding with analog quadrature amplitude modulation (QAM). In practical applications, however, discrete binary channel codes with digital modulation are most often employed. We analyze the matched filter decoding error probability in random binary and Gaussian coding setups in the wide bandwidth regime, and show that the performance in the two cases is surprisingly similar without explicit adaptation of the codeword construction to the modulation. The result also holds for the multiple access and the broadcast Gaussian channels, when signal-to-noise ratio is low. Moreover, the two modulations can be even mixed together in a single codeword resulting in a hybrid modulation with asymptotically close decoding behavior. In this sense the matched filter decoder demonstrates the performance that is largely insensitive to the choice of binary versus Gaussian modulation.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2013.6620682
