Constrained Viterbi Algorithm and Viterbi Algorithm Performance Comparison over AWGN and BSC
The Viterbi algorithm (VA) decoding is a kind of efficient maximum-likelihood (ML) decoding method for finite state signals observed in noise environments, it has been widely used in digital communication systems. The constrained Viterbi algorithm (C-VA) makes full use of the information of the known correctly decoded bits to improve the performance. In this paper,we focus on the C-VA algorithm and compare it with the conventional VA. Simulation results show that the decoding performance has been greatly improved while using C-VA in additive white Gaussian noise (AWGN) and binary symmetric channel (BSC).
Viterbi algorithm Constrained Viterbi algorithm (C-VA) AWGN BSC
ZHOU Ting XU Ming CHEN Dongxia YU Lun
Information Engineering College, Fuzhou University Fuzhou, Fujian, P.R.China, 350002
国际会议
厦门
英文
708-711
2006-07-27（万方平台首次上网日期，不代表论文的发表时间）