|
|
|
| DIGITAL CHANNEL BLIND ESTIMATION USING VITERBI ALGORITHM AND THE BRANCH TRANSITION RULES OF TRELLIS |
| Ouyang Congxing; Le Guangxin |
| School of Telecom., Beijing Univ. of Posts and Telecom., Beijing 100876 China |
|
|
|
|
Abstract A novel discrete-time digital channel blind estimation algorithm is proposed, which reduces the complexity of the optimal estimation considerably by using the one-step branch transition rules of trellis. In this paper, the optimal estimation algorithm based on the maximum likelihood sequence estimation is introduced first. Then the idea of selecting trellises based on the one-step branch transition rules in a trellis is explained. Following the presentation of the novel channel blind estimation algorithm, the performance of this algorithm is studied with computer simulation.
|
|
Received: 11 March 1999
|
|
|
|
|
|
|
|
|
2001, Vol. 23 
