Message Passing-Based Decoding of Convolutional Codes: Performance and Complexity Analysis

Mani, Hossein; Saeedi, Hamid

doi:10.1109/lcomm.2015.2508459

Cited by 4 publications

(5 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We compared the performance of the proposed algorithm with harddecision decoder as well as soft decoding algorithms, including KV and the ADP-HDD decoder. of 0.5 dB can be further achieved for RS (31,25). Moreover, Fig.…”

Section: Rayleigh Fading Channelmentioning

confidence: 72%

“…Our simulation results show that by increasing τ , the performance of the SSBT-SCA can be improved. In particular, by increasing τ from 1K to 16K, coding gain DRAFT July 17, 2017 of 0.5 dB can be further achieved for RS (31,25). Moreover, Fig.…”

Section: Symbolic Search Bit-wise Transmission-scamentioning

confidence: 85%

“…Iterative decoding and belief propagation (BP) algorithms was originally proposed for low density parity-check (LDPC) codes [23]. But they can be applied to other block and convolutional DRAFT July 17,2017 codes [24] [25]. The parity-check matrix of RS code in symbolic form is defined as…”

Section: B Iterative Soft Decodingmentioning

confidence: 99%

“…If τ has high value, it may provide unnecessary complexity for particular FER performance, on the other hands, small values for τ may not be able to find the best test-vector. Table II shows the gap to ML bound for (31,25) RS code at FER 10 −3 . Different iteration number provided with the gap to ML bound to denote the peace of convergence.…”

Section: A Awgn Channelmentioning

confidence: 99%

“… show the FER performance of S-SCA when applied to the(31,25) and (255, 239) RS codes over q-ary modulations. Considering HDD algorithm and S-CA, simulation results confirm that S-SCA provides more than 3 dB gain in q-ary modulations.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Symbol-Level Stochastic Chase Decoding of Reed-Solomon and BCH Codes

Mani

Hemati

2019

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

This paper proposes the Symbolic-Stochastic Chase Decoding Algorithm (S-SCA) for the Reed-Solomon (RS) and BCH codes. By efficient usage of void space between constellation points for q-ary modulations and using soft information at the input of the decoder, the S-SCA is capable of outperforming conventional Symbolic-Chase algorithm (S-CA) with less computational cost. Since the S-SCA starts with the randomized generation of likely test-vectors, it reduces the complexity to polynomial order and also it does not need to find the least reliable symbols to generate test-vectors. Our simulation results show that by increasing the number of test-vectors, the performance of the algorithm can approach the ML bound. The S-SCA(1K) provides near 2 dB gain in comparison with S-CA(1K) for (31, 25) RS code using 32-QAM. Furthermore, the algorithm provides near 3 dB further gain with 1K iteration compared with S-CA(65K) when (255, 239) RS code is used in an AWGN channel. For the Rayleigh fading channel and the same code, the algorithm provides more that 5 dB gain. Also for (63, 57) BCH codes and 8-PSK modulation the proposed algorithm provides 3dB gain with less complexity.This decoder is Soft-Input Soft-Output (SISO) decoder and is highly attractive in low power applications. Finally, the Symbolic-Search Bitwise-Transmission Stochastic Chase Algorithm (SSBT-SCA) was introduced for RS codes over BPSK transmission that is capable of generating symbolic test-vectors that reduce complexity and mitigate burst errors.The authors are with the DRAFT F n q (codeword space). The parameter d is the radius in which the codeword can be recovered [1].When a small fraction of the F n q space is used for codewords, a large d can be created. Specifically for Reed-Solomon (RS) codes, the code minimum distance is d = n − k + 1, which provides the largest possible code minimum distance for any linear code with the same input/output length.RS codes and Bose, Chaudhuri, and Hocquenghem (BCH) codes are linear codes suitable for high rate applications due to their large minimum distance. RS codes can be considered as a non-binary form of the BCH codes. In the same length n and approximately same rate, the BCH codes outperform RS codes, but the main reason that RS codes have frequent usage is that they can correct burst errors, which can occur in many applications like data storage devices.These codes are widely used in storage channels, satellite telecommunications (ETS 300 456), space telemetry systems (CCSDS and NTSS), digital video broadcasting (DVB-x) and wireless broadband systems (IEEE 802.x).The decoding problem is the problem of finding a codeword C ∈ F n q within a specific distance from a received code R ∈ R n q . The brute-force decoding method suffers from exponential complexity while the code length is increased linearly. The most common decoding algorithm for RS/BCH codes is hard decision decoding Berlekamp-Massey (HDD-BM) algorithm [2]. The HDD-BM algorithm has a running time complexity of O(n 2 ) and produces unique decoded message, w...

show abstract

Section: Rayleigh Fading Channelmentioning

confidence: 72%

Section: Symbolic Search Bit-wise Transmission-scamentioning

confidence: 85%