Thumbnail
Access Restriction
Subscribed

Author Fertonani, D. ♦ Barbieri, A. ♦ Colavolpe, G.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©1972
Language English
Subject Domain (in DDC) Natural sciences & mathematics ♦ Physics ♦ Electricity & electronics
Subject Keyword Intersymbol interference ♦ Iterative algorithms ♦ Performance loss ♦ Fading ♦ Algorithm design and analysis ♦ Detection algorithms ♦ Computer simulation ♦ Decoding ♦ Convolutional codes ♦ Viterbi algorithm ♦ turbo equalization ♦ Complexity reduction ♦ intersymbol interference (ISI) ♦ maximum a posteriori (MAP) symbol detection
Abstract We propose novel techniques to reduce the complexity of the well-known Bahl, Cocke, Jelinek, and Raviv (BCJR) algorithm when it is employed as a detection algorithm in turbo equalization schemes. In particular, by also considering an alternative formulation of the BCJR algorithm, which is more suitable than the original one for deriving reduced-complexity techniques, we describe three reduced-complexity algorithms, each of them particularly effective over one of the three different classes of channels affected by intersymbol interference (minimum-phase, maximum-phase, and mixed-phase channels). The proposed algorithms do not explore all paths on the trellis describing the channel memory, but they work only on the most promising ones, chosen according to the maximum a posteriori criterion. Moreover, some optimization techniques improving the effectiveness of the proposed solutions are described. Finally, we report the results of computer simulations showing the impressive performance of the proposed algorithms, and we compare them with other solutions in the literature.
Description Author affiliation :: Parma Univ., Parma
ISSN 00906778
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2007-12-01
Publisher Place U.S.A.
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Volume Number 55
Issue Number 12
Size (in Bytes) 240.24 kB
Page Count 9
Starting Page 2279
Ending Page 2287


Source: IEEE Xplore Digital Library