Presentation 2004-07-29
Some High-Rate Serially Concatenated Codes
Motohiko ISAKA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper studies (very) high-rate serially concatenated codes employing a rate-1 recursive convolutional encoder as inner code. For a memory-1 encoder, use of extended Hamming codes results in capacity-approaching performance under iterative decoding and for large block lengths. When we employ a memory-2 encoder, low error floor performance can be obtained due to the increased inter leaver gain. These serially concatenated codes can be decoded with (relatively) low complexity, and have adaptability in code lengths and code rates.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) serial concatenation / high-rate coding / (extended) Hamming codes / single parity-check codes / turbo decoding
Paper # IT2004-20
Date of Issue

Conference Information
Committee IT
Conference Date 2004/7/22(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Theory (IT)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Some High-Rate Serially Concatenated Codes
Sub Title (in English)
Keyword(1) serial concatenation
Keyword(2) high-rate coding
Keyword(3) (extended) Hamming codes
Keyword(4) single parity-check codes
Keyword(5) turbo decoding
1st Author's Name Motohiko ISAKA
1st Author's Affiliation Dept. of Informatics, Kwansei Gakuin University()
Date 2004-07-29
Paper # IT2004-20
Volume (vol) vol.104
Number (no) 229
Page pp.pp.-
#Pages 6
Date of Issue