z-logo
open-access-imgOpen Access
Simple capacity‐achieving coded modulation strategy
Author(s) -
Cazarotto M.,
Lopes R.R.
Publication year - 2016
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2015.2034
Subject(s) - additive white gaussian noise , channel capacity , decoding methods , algorithm , computer science , binary number , channel (broadcasting) , capacity loss , binary code , interference (communication) , gaussian , simple (philosophy) , electronic engineering , encoding (memory) , single antenna interference cancellation , binary symmetric channel , telecommunications , mathematics , engineering , arithmetic , physics , philosophy , electrode , quantum mechanics , epistemology , artificial intelligence , electrolyte
A simple system that approaches the capacity of the additive white Gaussian noise channel (AWGN) is proposed. It is well known that this capacity is achieved by a Gaussian input, which is hard to obtain in practice. However, if the capacity is <1/2, then the use of a binary input incurs little capacity loss. A parallel between the AWGN and the multiple access channel (MAC) is exploited, which allows for the transformation, without loss of capacity, of the AWGN channel into several parallel channels with capacity <1/2. In this proposal, each channel uses a binary input and a capacity‐achieving code, resulting in a system with simple encoding that operates close to capacity. A decoding scheme based on successive interference cancellation is also proposed. As a result, the receiver consists of a series of simple binary receivers. It is shown that the proposed system works at a small gap to the capacity of the AWGN, and that this gap may be attributed to the gap to capacity of the underlying binary code. Similar method has been proposed but the results have shown that this method is better than the iterative method (bit interleaved coded modulation).

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here