Presentation 2001/9/7
Code matched interleaver for parallel concatenated trellis-coded modulation
Haruo Ogiwara, Yao-Jun Wu,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A design method of a code matched interleaver(CMI)for parallel concatenated trellis-coded modulation(TCM)is proposed. By reducing the effects of some input symbol sequences of weight 2 which give large contribution to the error probability and combining with S-random, we can come at a particular interleaver which might improve error performance and lower the"error floor"at moderate to high signal-to-noise ratio(SNR)by comparing the results of simulations on AWGN channels for different types of interleaver when applying the modified BCJR decoding algorithm. Simulation results show the proposal effective.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Turbo TCM / Coded Matched Interleaver / BCJR algorithm / S-random / interleaver
Paper # IT2001-42
Date of Issue

Conference Information
Committee IT
Conference Date 2001/9/7(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) Code matched interleaver for parallel concatenated trellis-coded modulation
Sub Title (in English)
Keyword(1) Turbo TCM
Keyword(2) Coded Matched Interleaver
Keyword(3) BCJR algorithm
Keyword(4) S-random
Keyword(5) interleaver
1st Author's Name Haruo Ogiwara
1st Author's Affiliation Department of Electrical Engineering Nagaoka University of Technology()
2nd Author's Name Yao-Jun Wu
2nd Author's Affiliation Department of Electrical Engineering Nagaoka University of Technology
Date 2001/9/7
Paper # IT2001-42
Volume (vol) vol.101
Number (no) 304
Page pp.pp.-
#Pages 6
Date of Issue