Matched filter decoding of random binary and Gaussian codes in broadband Gaussian channel
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 modula...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2014
|
| Online Access: | http://hdl.handle.net/1721.1/90436 https://orcid.org/0000-0002-5157-8086 https://orcid.org/0000-0002-1428-7124 https://orcid.org/0000-0003-4059-407X |
| _version_ | 1826193788008136704 |
|---|---|
| author | Abdrashitov, Vitaly Medard, Muriel Moshkovitz Aaronson, Dana Hadar |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Abdrashitov, Vitaly Medard, Muriel Moshkovitz Aaronson, Dana Hadar |
| author_sort | Abdrashitov, Vitaly |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T09:45:25Z |
| format | Article |
| id | mit-1721.1/90436 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T09:45:25Z |
| publishDate | 2014 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/904362022-09-30T16:35:59Z Matched filter decoding of random binary and Gaussian codes in broadband Gaussian channel Abdrashitov, Vitaly Medard, Muriel Moshkovitz Aaronson, Dana Hadar Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Abdrashitov, Vitaly Medard, Muriel Moshkovitz Aaronson, Dana Hadar 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. VT iDirect, Inc. (Award 020903-001) 2014-09-29T16:55:37Z 2014-09-29T16:55:37Z 2013-07 Article http://purl.org/eprint/type/ConferencePaper 978-1-4799-0446-4 2157-8095 http://hdl.handle.net/1721.1/90436 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). https://orcid.org/0000-0002-5157-8086 https://orcid.org/0000-0002-1428-7124 https://orcid.org/0000-0003-4059-407X en_US http://dx.doi.org/10.1109/ISIT.2013.6620682 Proceedings of the 2013 IEEE International Symposium on Information Theory Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) MIT web domain |
| spellingShingle | Abdrashitov, Vitaly Medard, Muriel Moshkovitz Aaronson, Dana Hadar Matched filter decoding of random binary and Gaussian codes in broadband Gaussian channel |
| title | Matched filter decoding of random binary and Gaussian codes in broadband Gaussian channel |
| title_full | Matched filter decoding of random binary and Gaussian codes in broadband Gaussian channel |
| title_fullStr | Matched filter decoding of random binary and Gaussian codes in broadband Gaussian channel |
| title_full_unstemmed | Matched filter decoding of random binary and Gaussian codes in broadband Gaussian channel |
| title_short | Matched filter decoding of random binary and Gaussian codes in broadband Gaussian channel |
| title_sort | matched filter decoding of random binary and gaussian codes in broadband gaussian channel |
| url | http://hdl.handle.net/1721.1/90436 https://orcid.org/0000-0002-5157-8086 https://orcid.org/0000-0002-1428-7124 https://orcid.org/0000-0003-4059-407X |
| work_keys_str_mv | AT abdrashitovvitaly matchedfilterdecodingofrandombinaryandgaussiancodesinbroadbandgaussianchannel AT medardmuriel matchedfilterdecodingofrandombinaryandgaussiancodesinbroadbandgaussianchannel AT moshkovitzaaronsondanahadar matchedfilterdecodingofrandombinaryandgaussiancodesinbroadbandgaussianchannel |