Low-complexity decoding of block turbo-coded system with antenna diversity

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35) Other types of codes (94B60)

Review text

Summary: The goal of this paper is to reduce the decoding complexity of a space-time block turbo-coded system with low performance degradation. Two block turbo-coded systems with antenna diversity are considered. These include the simple serial concatenation of an error control code with a space-time block code, and the recently proposed transmit antenna diversity scheme using forward error correction techniques. It is shown that the former performs better when compared to the latter in terms of bit error rate (BER) under the same spectral efficiency (up to 7 dB at the BER of \(10^{-5}\) for a quasistatic channel with two transmit and two receive antennas). For the former system, a computationally efficient decoding approach is proposed for the soft decoding of the space-time block code. Compared to its original maximum likelihood decoding algorithm, it can reduce the computation by up to 70\% without any performance degradation. Additionally, for the considered outer code block turbo code, through reduction of test patterns scanned in the Chase algorithm and the alternative computation of its extrinsic information during iterative decoding, an extra 0.3 dB to 0.4 dB coding gain is obtained when compared to previous approaches with negligible hardware overhead. The overall decoding complexity is approximately ten times less than that of the near-optimum block turbo decoder with coding gain loss of 0.5 dB at the BER of \(10^{-5}\) over an AWGN channel.

Recommendations

Cited in

(6)

This page was built for publication: Low-complexity decoding of block turbo-coded system with antenna diversity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1773677)