Proposed Deterministic Interleavers for Ccsds Turbo Code Standard

  • Published 2010


It is well known that an interleaver with random properties, quite often generated by pseudo-random algorithms, is one of the essential building blocks of turbo codes, however, randomly generated interleavers has a lack of a compact representation that leads to a simple implementation. Especially for satellite application, we avoid using memories to save a look-up table, but the best way to do is to generate these interleavers on the fly from simple algorithms. One of those algorithmic interleavers is used by CCSDS (Consultative Committee for Space Data Systems). In this paper, several deterministic interleavers will be suggested of length matched with CCSDS standards to be used in the satellite applications and their performances were compared with CCSDS interleaver performance. The minimum Hamming distance and their multiplicities are the criteria for comparison. The simulation results show a larger minimum distance which leads to decrease the error floor to be applicable in satellite new missions. Moreover, the results give a larger minimum distance by factor of 1.12dB compared with the CCSDS interleaver. The suggested deterministic interleaver can be used in turbo code systems without any encoder/decoder configurations change or adding any system complexity. The simulation is applied for frame length 1784, and code rate 1/2. Keywords; (turbo codes, CCSDS, algorithmic interleaver)

6 Figures and Tables

Cite this paper

@inproceedings{ELDINHASSAN2010ProposedDI, title={Proposed Deterministic Interleavers for Ccsds Turbo Code Standard}, author={ALAA ELDIN.HASSAN and ABOU ELAZM}, year={2010} }