#### DMCA

## Interleaver design for turbo codes (2001)

### Cached

### Download Links

Venue: | IEEE J. Select. Areas Commun |

Citations: | 32 - 0 self |

### Citations

1776 | Near Shannon Limit Error-Correcting Coding and Decoding
- Berrou, Glavieux, et al.
- 1993
(Show Context)
Citation Context ... criteria. A deterministic interleaver suitable for Turbo codes is also described. Simulation results compare the new interleaver design to different existing interleavers. I. Introduction Turbo codes=-=[1]-=- have an impressive near-Shannon-limit error correcting performance. The superior performance of Turbo codes over convolutional codes is achieved only when the length of the interleaver is very large,... |

1593 |
Optimal decoding of linear codes for minimizing symbol error rate
- Bahl, Cocke, et al.
- 1974
(Show Context)
Citation Context ... the receiver is a maximum likelihood (ML) decoder. However, Turbo codes actually use a sub-optimal iterative algorithm. A soft output decoding algorithm such as maximum a posteriori probability (MAP)=-=[7]-=- is used in the iterative algorithm. The performance of the iterative decoding improves if the information that is sent to each decoder from the other decoders is less correlated with the input inform... |

142 | Weight distributions for turbo codes using random and nonrandom permutations,”
- Dolinar, Divsalar
- 1995
(Show Context)
Citation Context ... weight, resulting in a degradation in the performance of the Turbo code. Papers [8-10] have addressed this question. The paper is organized as follows. In section II random and S-random interleavers =-=[11]-=- are described. Our approach is based on S-random interleavers. The IDS [2] criterion is also briefly discussed. In section III, a two-step S-random interleaver design is presented. Our approach requi... |

130 | Design of parallel concatenated convolutional codes”,
- Montorsi
- 1996
(Show Context)
Citation Context ...then the performance of the iterative November 10, 2000 DRAFT 2sdecoding algorithm improves. The performance of Turbo codes at low BER is mainly dominated by the minimum effective free distance (dmin)=-=[13,16]-=-. It has been shown [6] that the Turbo code asymptotic performance approaches the dmin asymptote. The noise floor that occurs at moderate to high signal-to-noise ratios (SNR) is the result of small dm... |

112 | A distance spectrum interpretation of turbo codes,”
- Perez, Seghers, et al.
- 1996
(Show Context)
Citation Context ... iterative November 10, 2000 DRAFT 2sdecoding algorithm improves. The performance of Turbo codes at low BER is mainly dominated by the minimum effective free distance (dmin)[13,16]. It has been shown =-=[6]-=- that the Turbo code asymptotic performance approaches the dmin asymptote. The noise floor that occurs at moderate to high signal-to-noise ratios (SNR) is the result of small dmin [6]. The noise floor... |

89 | Design and analysis of turbo codes on Rayleigh fading channels”,
- Hall, Wilson
- 1998
(Show Context)
Citation Context ...encoder or in the path of the systematic data sequence, or alternatively over the entire data sequence (both the systematic data and the parity bits) in order to improve the performance of the system =-=[17]-=-. The deterministic interleaver proposed here can be used for these applications without adding too much complexity to the system. V. Simulation Results and Conclusion This section provides simulation... |

32 |
Effective free distance of turbo codes
- Divsalar, McEliece
- 1996
(Show Context)
Citation Context ...then the performance of the iterative November 10, 2000 DRAFT 2sdecoding algorithm improves. The performance of Turbo codes at low BER is mainly dominated by the minimum effective free distance (dmin)=-=[13,16]-=-. It has been shown [6] that the Turbo code asymptotic performance approaches the dmin asymptote. The noise floor that occurs at moderate to high signal-to-noise ratios (SNR) is the result of small dm... |

23 | Combined turbo codes and interleaver design
- Yuan, Vucetic, et al.
- 1999
(Show Context)
Citation Context ...ight wl ≤ wdet with dwl ≤ dmin,wdet . Obviously if dmin,wdet be reduced. is too large, the second step may never converge, and in this case dmin,wdet should An interleaver design proposed in [14] and =-=[15]-=- is based on the joint S-random criteria and elimination of all error patterns of weight wi. However, in practice the joint optimization criteria will not converge easily and therefore the value of S ... |

21 |
Turbo code termination and interleaver conditions
- Blackert, Wilson
- 1995
(Show Context)
Citation Context ...ead to a very small value for because of the existence of data sequences with no trellis termination and low output weight, resulting in a degradation in the performance of the Turbo code. References =-=[8]-=-–[10] have addressed this question. The paper is organized as follows. In Section II, random and -random interleavers [11] are described. Our approach is based on -random interleavers. The IDS [2] cri... |

18 |
Interleaver design for turbo codes based on the performance of iterative decoding,” in
- Hokfelt, Edfors, et al.
- 1999
(Show Context)
Citation Context ...value of IDS is an indication that the correlation properties between W 1 and d are equally spread along the data sequence of length N. An interleaver design based on the IDS condition is proposed in =-=[12]-=-. III. Two-step S-random Interleaver Design A new interleaver design, a two-step S-random interleaver, is presented here. The goal is to increase the minimum effective free distance, dmin, of the Turb... |

16 | Terminating the trellis of turbo codes in the same state - Barbulescu, Pietrobon - 1995 |

15 | New classes of algebraic interleavers for turbo-codes”, ISIT - Takeshita, Costello - 1998 |

10 |
Turbo codes: Correlated extrinsic information and its impact on iterative decoding performance
- Hokfelt, Edfors, et al.
- 1999
(Show Context)
Citation Context ...n the soft output of each decoder corresponding to its parity bits and the information input data sequence. Criterion 2) is sometimes referred to as the iterative decoding suitability (IDS) criterion =-=[2]-=-. This is a measure of the effectiveness of the iterative decoding algorithm and the fact that if these two data sequences are less correlated, then the performance of the iterative November 10, 2000 ... |

8 |
Multilevel Turbo Coding with Short Interleavers
- Herzberg
- 1998
(Show Context)
Citation Context ...re is a need to design short block size interleavers that demonstrate acceptable BER performance. Several authors have suggested interleaver designs for Turbo codes suitable for short block sizes [2]–=-=[5]-=-. There are two major criteria in the design of an interleaver: 1) the distance spectrum properties (weight distribution) of the code, and 2) the correlation between the soft output of each decoder co... |

5 | Jr., ”New classes of algebraic interleavers for turbo codes - Takeshita, Costello - 1998 |

4 | Optimization of the interleaver structure for turbo codes,”
- Khandani
- 1999
(Show Context)
Citation Context ...nce of weight wl ≤ wdet with dwl ≤ dmin,wdet . Obviously if dmin,wdet be reduced. is too large, the second step may never converge, and in this case dmin,wdet should An interleaver design proposed in =-=[14]-=- and [15] is based on the joint S-random criteria and elimination of all error patterns of weight wi. However, in practice the joint optimization criteria will not converge easily and therefore the va... |

3 |
Turbo code termination schemes and a novel alternative for short frames," proceeding
- Reed, Pietrbon
- 1996
(Show Context)
Citation Context ...to a very small value for because of the existence of data sequences with no trellis termination and low output weight, resulting in a degradation in the performance of the Turbo code. References [8]–=-=[10]-=- have addressed this question. The paper is organized as follows. In Section II, random and -random interleavers [11] are described. Our approach is based on -random interleavers. The IDS [2] criterio... |

2 | Group structure of turbo codes with applications to the interleaver design - Khandani - 1998 |

1 | New Classes of Algebraic Interleavers for Turbo - Takeshita, Costello - 1998 |

1 |
Third Generation Partnership Project 2 (3GPP2), “Physical layer standard for CDMA2000 spread spectrum systems,”, Release A, 3GPP2 C.S0002-A
- Hamid
(Show Context)
Citation Context ... here can be used for these applications without adding too much complexity to the system. It should be noted that there are other deterministic interleaver designs such as those provided in [18] and =-=[19]-=- that perform better than random interleavers. It would be of interest in future research to compare our approach with existing deterministic interleaver designs including those mentioned above. V. SI... |