ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 An Efficient ZJ-based Decoding Algorithm for Space-Time Trellis Codes in Slow Rayleigh Fading Channels
Cited 0 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
차종섭, 김용옥, 이형섭, 강준혁
발행일
201102
출처
IEEE Transactions on Communications, v.59 no.2, pp.337-342
ISSN
0090-6778
출판사
IEEE
DOI
https://dx.doi.org/10.1109/TCOMM.2010.120710.090291
협약과제
10MC2700, 실시간 위치추적 기술개발, 이형섭
초록
In this paper, we propose a computationally efficient decoding algorithm for space-time trellis codes in slow Rayleigh fading channels. The proposed scheme is based on a stack algorithm with two key ideas: (i) a variable stack size depending upon the signal-to-noise ratio to avoid the exhaustive search of paths and (ii) a normalized metric, which is defined as each cumulative path metric divided by its own length in the stack, to provide an appropriate comparison of the paths with different lengths. Simulation results demonstrate that the proposed algorithm achieves near-ML performance with significant reduction in complexity, compared with the conventional Viterbi algorithm. © 2011 IEEE.
키워드
maximum likelihood decoding, normalized metric, Space-time codes, space-time trellis codes, stack algorithm
KSP 제안 키워드
Computationally Efficient, Efficient decoding, Rayleigh Fading Channel, Signal noise ratio(SNR), Signal-to-Noise, Space time(ST), Space-time codes, Stack algorithm, Viterbi Algorithm, decoding algorithm, exhaustive search(ES)