Iterative decoding of binary block and convolutional codes-英文文献.pdf

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 42, NO. 2, MARCH 1996 429 Ite rative Decoding of Binary Block and Convo lutional Codes Joachim Hagenauer, Fellow, ZEEE, Elke Offer, and Lutz Papke Abstract- Iterative decoding of two-dimensional systematic with fairly simple component codes in an interleaved scheme. convolutional codes has been termed “turbo ” (de)coding. Using The basic idea is to break up decoding of a fairly complex log-likelihood algebra, we show that any decoder can he used and long code into steps while the transfer of probabilities which accepts soft inputs-including a priori values-and delivers soft outputs that can he split into three terms: the soft channel and or “soft” information between the decoding steps guarantees a priori inputs, and the extrinsic value. The extrinsic value is used almost no loss of information. A flavor of the idea can be as an a priori value for the next iteration. Decoding algorithms in found in the work of Battail, e.g., [2]-[4]. Iterative decoding the log-likelihood domain are given not only for convolutional schemes with “soft-in/soft-out” decoders were proposed in codes hut also for any linear binary systematic block code. [5]-[7]. In [6] an Eb/No of 1.3 dB was achieved for the above The iteration is controlled by a stop criterion derived from