Turbo equalizer

In digital communications, a turbo equalizer is a type of receiver used to receive a message corrupted by a communication channel with intersymbol interference (ISI). It approaches the performance of a maximum a posteriori (MAP) receiver via iterative message passing between a soft-in soft-out (SISO) equalizer and a SISO decoder.[1] It is related to turbo codes in that a turbo equalizer may be considered a type of iterative decoder if the channel is viewed as a non-redundant convolutional code. The turbo equalizer is different from classic a turbo-like code, however, in that the 'channel code' adds no redundancy and therefore can only be used to remove non-gaussian noise.

History

Turbo codes were invented by Claude Berrou in 1990–1991. In 1993, turbo codes were introduced publicly via a paper listing authors Berrou, Glavieux, and Thitimajshima.[2] In 1995 a novel extension of the turbo principle was applied to an equalizer by Douillard, Jézéquel, and Berrou.[3] In particular, they formulated the ISI receiver problem as a turbo code decoding problem, where the channel is thought of as a rate 1 convolutional code and the error correction coding is the second code. In 1997, Glavieux, Laot, and Labat demonstrated that a linear equalizer could be used in a turbo equalizer framework.[4] This discovery made turbo equalization computationally efficient enough to be applied to a wide range of applications.[5]

Overview

Standard communication system overview

Before discussing turbo equalizers, it is necessary to understand the basic receiver in the context of a communication system. This is the topic of this section.

At the transmitter, information bits are encoded. Encoding adds redundancy by mapping the information bits a to a longer bit vector – the code bit vector b. The encoded bits b are then interleaved. Interleaving permutes the order of the code bits b resulting in bits c. The main reason for doing this is to insulate the information bits from bursty noise. Next, the symbol mapper maps the bits c into complex symbols x. These digital symbols are then converted into analog symbols with an D/A converter. Typically the signal is then up-converted to pass band frequencies by mixing it with a carrier signal. This is a necessary step for complex symbols. The signal is then ready to be transmitted through the channel.

At the receiver, the operations performed by the transmitter are reversed to recover \hat{a}, an estimate of the information bits. The down-converter mixes the signal back down to baseband. The A/D converter then samples the analog signal, making it digital. At this point, y is recovered. The signal y is what would be received if x were transmitted through the digital baseband equivalent of the channel plus noise. The signal is then equalized. The equalizer attempts to unravel the ISI in the received signal to recover the transmitted symbols. It then outputs the bits \hat{c} associated with those symbols. The vector \hat{c} may represent hard decisions on the bits or soft decisions. If the equalizer makes soft decisions, it outputs information relating to the probability of the bit being a 0 or a 1. If the equalizer makes hard decisions on the bits, it quantizes the soft bit decisions and outputs either a 0 or a 1. Next, the signal is deinterleaved which is a simple permutation transformation that undoes the transformation the interleaver executed. Finally, the bits are decoded by the decoder. The decoder estimates \hat{a} from \hat{b}.

A diagram of the communication system is shown below. In this diagram, the channel is the equivalent baseband channel, meaning that it encompasses the D/A, the up converter, the channel, the down converter, and the A/D.

Turbo equalizer overview

The block diagram of a communication system employing a turbo equalizer is shown below. The turbo equalizer encompasses the equalizer, the decoder, and the blocks in between.

The difference between a turbo equalizer and a standard equalizer is the feedback loop from the decoder to the equalizer. Due to the structure of the code, the decoder not only estimates the information bits a, but it also discovers new information about the coded bits b. The decoder is therefore able to output extrinsic information, \tilde{b} about the likelihood that a certain code bit stream was transmitted. Extrinsic information is new information that is not derived from information input to the block. This extrinsic information is then mapped back into information about the transmitted symbols x for use in the equalizer. These extrinsic symbol likelihoods, \tilde{x}, are fed into the equalizer as a priori symbol probabilities. The equalizer uses this a priori information as well as the input signal y to estimate extrinsic probability information about the transmitted symbols. The a priori information fed to the equalizer is initialized to 0, meaning that the initial estimate \hat{a} made by the turbo equalizer is identical to the estimate made by the standard receiver. The information \hat{x} is then mapped back into information about b for use by the decoder. The turbo equalizer repeats this iterative process until a stopping criterion is reached.

Turbo equalization in practical systems

In practical turbo equalization implementations, an additional issue need to be considered. The channel state information (CSI) that the equalizer operates on comes from some channel estimation technique, and hence un-reliable. Firstly, in order to improve the reliability of the CSI, it is desirable to include the channel estimation block also into the turbo equalization loop, and parse soft or hard decision directed channel estimation within each turbo equalization iteration.[6][7] Secondly, incorporating the presence of CSI uncertainty into the turbo equalizer design leads to a more robust approach with significant performance gains in practical scenarios.[8][9]

References

  1. ↑ Koetter, R.; Singer, A.C.; Tuchler, M. (2004). "Turbo equalization". IEEE Signal Processing Magazine 21: 67. doi:10.1109/MSP.2004.1267050.
  2. ↑ Berrou, Claude; Glavieux, Alain; Thitimajshima, Punya (1993). "Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1". Near Shannon Limit Error – Correcting 2. p. 1064. doi:10.1109/ICC.1993.397441. ISBN 0-7803-0950-2.
  3. ↑ Douillard, Catherine; Jézéquel, Michel; Berrou, Claude (1995). "Iterative Correction of Intersymbol-Interference: Turbo-Equalization". European Transactions on Telecommunications 6 (5): 507. doi:10.1002/ett.4460060506.
  4. ↑ Glavieux, A.; Laot, C. and Labat, J. (1997). "Turbo equalization over a frequency selective channel". Proc. Int. Symp. Turbo Codes, Brest, France. pp. 96–102.
  5. ↑ Tüchler, M.; Koetter, R. and Singer, A.C. (2002). "Turbo Equalization: Principles and New Results". IEEE Transactions on Communications 50 (5): 754–767.
  6. ↑ Nefedov, N.; Pukkila, M.; Visoz, R.; Berthet, A.O. (2003). "Iterative data detection and channel estimation for advanced TDMA systems". IEEE Transactions on Communications 51 (2): 141. doi:10.1109/TCOMM.2003.809218.
  7. ↑ Park, S.Y.; Kang, C.G. (2004). "Complexity-Reduced Iterative MAP Receiver for Interference Suppression in OFDM-Based Spatial Multiplexing Systems". IEEE Transactions on Vehicular Technology 53 (5): 1316. doi:10.1109/TVT.2004.832383.
  8. ↑ Nisar, Muhammad Danish; Utschick, Wolfgang (2011). "Minimax Robust a Priori Information Aware Channel Equalization". IEEE Transactions on Signal Processing 59 (4): 1734. doi:10.1109/TSP.2010.2101068.
  9. ↑ Kalantarova, Nargiz; Kozat, Suleyman S.; Erdogan, Alper T. (2011). "Robust turbo equalization under channel uncertainties". 2011 IEEE Radio and Wireless Symposium. p. 359. doi:10.1109/RWS.2011.5725469. ISBN 978-1-4244-7687-9.

External links

See also

This article is issued from Wikipedia - version of the Tuesday, January 12, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.