The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper a coded modulation method for the additive white Gaussian noise channel is presented which incorporates signal shaping. The scheme uses a modulation map to map bits to channel inputs. A modulation map is considered that has the advantage it is can easily be combined with binary error-correcting codes. The decoding strategy is a combination of bit-interleaved coded modulation and multistage...
Deliberately designed bits-to-symbols mappings were introduced to provide significant coding gains compared to the simple Gray mapping for iteratively-decoded BICM on both AWGN and fading channels. The performance of these powerful mappings has always been illustrated in conjunction with relatively weak outer channel codes like convolutional codes with up to 16 states. However, when a powerful outer...
We present lower bounds on the minimum pseudocodeword effective Euclidean distance (or minimum ldquopseudodistancerdquo) for coded modulation systems using linear codes with q-ary phase-shift keying (PSK) modulation over the additive white Gaussian noise (AWGN) channel. These bounds apply to both binary and nonbinary coded modulation systems which use direct modulation mapping of coded symbols. The...
Repeat accumulate (RA) codes combine both the advantages of turbo codes and low-density parity-check (LDPC) codes by having low encoding complexity of turbo codes with low decoding complexity of LDPC codes. The RA interleaver is chosen by random construction using the bit-filling method. In this paper, we investigate the performance of bit interleaved coded modulation (BICM) with iterative decoding...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.