Abstract
In this paper, we study the minimum free distance of the Consultative Committee for Space Data Systems (CCSDS) standard turbo encoder with Möbius interleavers. We introduce a new class of deterministic interleavers based on the Möbius interleavers called truncated Möbius interleavers and investigate their cycle structure. We find the exact number of total cycles of these interleavers and an upper bound on the binary fixed points in all of their cycles shifts. We derive the run time of the binary fixed point algorithm, which is used for estimating the minimum free distance of the employed turbo codes. Finally, we introduce some criteria to reduce the number of total cycles. This leads us to reduce the run time of the aforementioned algorithm.
Original language | English |
---|---|
Title of host publication | IWCIT 2015 - Iran Workshop on Communication and Information Theory |
Subtitle of host publication | 6-7 May 2015, Tehran, Iran |
Editors | J. A. Salehi |
Place of Publication | Danvers MA USA |
Publisher | IEEE, Institute of Electrical and Electronics Engineers |
Number of pages | 6 |
ISBN (Print) | 9781479982356 |
DOIs | |
Publication status | Published - 2015 |
Externally published | Yes |
Event | Iran Workshop on Communication and Information Theory (IWCIT) 2015 - Sharif University of Technology, Tehran, Iran Duration: 6 May 2015 → 7 May 2015 http://www.iwcit.com/2015/ |
Workshop
Workshop | Iran Workshop on Communication and Information Theory (IWCIT) 2015 |
---|---|
Abbreviated title | IWCIT 2015 |
Country/Territory | Iran |
City | Tehran |
Period | 6/05/15 → 7/05/15 |
Internet address |
Keywords
- Mobius Interleaver
- Turbo Code
- Permutation
- Cycle Structure