Reduced complexity super-trellis decoding for convolutionally encoded transmission over ISI-channels

Abstract

Abstract-In this paper we propose a matched encoding (ME) scheme for convolutionally encoded transmission over intersymbol interference (usually called ISI) channels. A novel trellis description enables to perform equalization and decoding jointly, i.e., enables efficient super-trellis decoding. By means of this matched non-linear trellis description we can significantly reduce the number of states needed for the receiver-side Viterbi algorithm to perform maximum-likelihood sequence estimation. Further complexity reduction is achieved using the concept of reduced-state sequence estimation.

Optimized Design for NB-LDPC-Coded High-Order CPM: Power and Iterative Efficiencies

“…For the given η and R, the B 99% T b can be attained using (13). The competitive CPM scheme can be determined by the highest d 2 min among these candidate CPM signals with corresponding B 99% T b .…”

“…The competitive CPM scheme can be determined by the highest d 2 min among these candidate CPM signals with corresponding B 99% T b . For example, η and R are 0.5 bit/s/Hz and 2/3, respectively, B 99% T b is approximately computed as 1.33 using (13). Table 1 shows that the 8M2RC with h = 1/2, 8M1REC with h = 2/5, and 4M2RC with h = 2/3 can approximately meet the constraint of B 99% T b , and the d 2 min of the three schemes are 5.56, 4.60, and 3.47, respectively.…”

“…Consequently, 8M2RC with h = 1/2 is preferred as the competitive CPM scheme due to its highest d 2 min relative to other candidates. The competing CPM schemes for other η and R can also be selected according to (13) and Table 1.…”

“…To further enhance the power and bandwidth efficiencies, coded CPM with symbol mapping using iterative decoding was presented. Considering the excellent properties of CPM and the serially concatenated principles [10,11], some particularly attractive solutions have become the focus of research, such as the convolutional [12,13], turbo [14][15][16], and low-density parity-check (LDPC) coded CPM [17][18][19][20].…”

Performance on Joint Turbo Coding for Overloaded MIMO-OFDM Systems

“…In rapid unraveling, this difficulty seems in the LLR calculations, which affects the concept of the LLR values.In a convolutional-primarily based thoroughly channel code, in any event trellis outlines can be partaken in a dynamite trellis role. In [15]- [17], the very first rate trellis graph is included Fig (4) which consolidations the trellis states from encoded depictions with its conceded shape to conflict the amongst image impedance (ISI). In [18], the notable trellis diagram is done to take a crack on the trellis US from encoders inside the quicker codes that allows you to engage non-iterative disentangling inside the gatherer aspect.…”