On permutor designs based on cycles for serially concatenated convolutional codes

IEEE Transactions on Communications

Volumn 52, Issue 9, 2004, Pages 1494-1503

  Huebner, Axel ^a   Truhachev, Dmitri V ^b   Zigangirov, Kamil Sh ^b  

^a UNIVERSITY OF ULM   (Germany)

^b LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONVOLUTIONAL CODES; MATRIX ALGEBRA; THEOREM PROVING;

PERMUTATION MATRIX; PERMUTOR DESIGN; SERIALLY CONCATENATED CONVOLUTIONAL CODES (SCCCS);

ENCODING (SYMBOLS);

EID: 5144221793     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2004.833060     Document Type: Article

References (17)

1. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near-Shannon-limit error-correcting coding and decoding: Turbo codes," in Proc. Int. Conf. Communications, Geneva, Switzerland, May 1993, pp. 1064-1070.
2. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding," IEEE Trans. Inform. Theory, vol. 44, pp. 909-926, May 1998.
3. N. Kahale and R. Urbanke, "On the minimum distance of parallel and serially concatenated codes," IEEE Trans. Inform. Theory, to be published.
4. N. Kahale and R. Urbanke, "On the minimum distance of parallel and serially concatenated codes," in Proc. Int. Symp. Information Theory, Boston, MA, Aug. 1998, p. 31.
5. R. Jordan, S. Höst, M. Bossert, R. Johannesson, and V. V. Zyablov, "Woven convolutional codes II: Decoding aspects," IEEE Trans. Inform. Theory, submitted for publication.
6. J. Freudenberger, M. Bossert, S. Shavgulidze, and V. V. Zyablov, "Woven codes with outer warp: Variations, design, and distance properties," IEEE J. Select. Areas Commun., vol. 19, pp. 813-824, May 2001.
7. J. L. Ramsey, "Realization of optimum interleavers," IEEE Trans. Inform. Theory, vol. IT-16, pp. 338-345, May 1970.
8. R. Jordan, S. Höst, and R. Johannesson, "On the construction of convolutional permuters with large separations," IEEE Trans. Inform. Theory, to be published.
9. A. Huebner, R. Jordan, and J. Grill, "On permutations with second-order separations between cascaded convolutional encoders," in Proc. Int. Symp. Inform. Theory, Lausanne, Switzerland, July 2002, p. 484.
10. A. Huebner and R. Jordan, "A first encounter with higher order separations for serially concatenated convolutional codes," IEEE Trans. Inform. Theory, submitted for publication.
11. D. V. Truhachev, M. Lentmaier, and K. Sh. Zigangirov, "Some results concerning design and decoding of turbo codes," Probl. Inform. Transm., vol. 37, no. 3, pp. 190-205, July-Sept. 2001.
12. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
13. D. V. Truhachev, M. Lentmaier, O. Wintzell, and K. Sh. Zigangirov, "On the minimum distance of turbo-codes," in Proc. Int. Symp. Inform. Theory, Lausanne, Switzerland, July 2002, p. 84.
14. S. Höst, R. Johannesson, K. Sh. Zigangirov, and V. V. Zyablov, "Active distances for convolutional codes," IEEE Trans. Inform. Theory, vol. 45, pp. 658-669, Mar. 1999.
15. R. Johannesson and K. Sh. Zigangirov, Fundamentals of Convolutional Coding. Piscataway, NJ: IEEE Press, 1999.
16. S. Höst, R. Johannesson, and V. V. Zyablov, "Woven convolutional codes I: Encoder properties," IEEE Trans. Inform. Theory, vol. 48, pp. 149-161, Jan. 2002.
17. S. Dolinar and D. Divsalar, "Weight distributions for turbo codes using random and nonrandom permutations," Jet Propulsion Lab., Pasadena, CA, TDA Prog. Rep. 42-122, Aug. 1995.