Design of High-Rate Serially Concatenated Codes with Low Error Floor(<Special Section>Information Theory and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
In this paper we look at the serial concatenation of short linear block codes with a rate-1 recursive convolutional encoder, with a goal of designing high-rate codes with low error floor. We observe that under turbo-style decoding the error floor of the concatenated codes with extended Hamming codes is due to detectable errors in many cases. An interleaver design addressing this is proposed in this paper and its effectiveness is verified numerically. We next examine the use of extended BCH codes of larger minimum distance, resulting in an improved weight spectrum of the overall code. Reduced complexity list decoding is used to decode the BCH codes in order to obtain low decoding complexity for a negligible loss in performance.
- 社団法人電子情報通信学会の論文
- 2007-09-01
著者
-
ISAKA Motohiko
Dept. of Informatics, Kwansei Gakuin University
-
Fossorier Marc
Dept. Of Electrical Engineering University Of Hawaii At Manoa
-
Isaka Motohiko
Kwansei Gakuin Univ. Sanda‐shi Jpn
-
Isaka Motohiko
Dept. Of Informatics Kwansei Gakuin University
-
MARTIN Philippa
Dept. of Electrical and Computer Engineering, University of Canterbury
-
Martin Philippa
Dept. Of Electrical And Computer Engineering University Of Canterbury
関連論文
- Unconditionally Secure Oblivious Transfer from Algebraic Signaling over the Gaussian Channel
- Coded Modulation for Satellite Broadcasting Based on Unconventional Partitionings (Special Section on Information Theory and Its Applications)
- Design of High-Rate Serially Concatenated Codes with Low Error Floor(Information Theory and Its Applications)
- Efficient Reliability-Based Turbo Decoding
- Unconditionally Secure Oblivious Transfer from Algebraic Signaling over the Gaussian Channel
- Oblivious Transfer from the Additive White Gaussian Noise Channel
- Lossy Coding of Binary Sources with Short Linear Codes
- Granular Gain of Low-Dimensional Lattices from Binary Linear Codes