快速實現(xiàn)盲序列估計的一種新算法
A NOVEL FAST ALGORITHM FOR BLIND SOURCE SEQUENCE ESTIMATION
-
摘要: 當信道響應未知時,盲序列估計(BSE)利用接收到的有噪聲信號直接恢復出源信息。作為一種最優(yōu)信息檢測方法,基于Viterbi算法實現(xiàn)的BSE需要搜索與觀察序列長度成指數(shù)關(guān)系的狀態(tài)樹。當觀察序列的長度不斷增長時,運算消費的急劇上升將嚴重制約算法的實時實現(xiàn)。本文提出的盲序列估計新算法僅利用前幾個信息的估值來恢復當前信息,它與觀察序列的長度無關(guān),因而能大大降低運算消費,仿真結(jié)果表明了該方法的可行性。
-
關(guān)鍵詞:
- 信道響應; 盲估計; 序列; 運算量
Abstract: Under the situation of unknown channel response,blind sequence estimation(BSE) recovers source symbols from received noisy data directly.As an optimal information detection approach,BSE babed on Viterbi algorithm needs searching a trellis whose state number is exponential to the observation length lt is not practical when observation length increases unceasingly.A novel BSE scheme is proposed in this paper,which uses several first estimated resultS tO recover current symbol.The computation burden is lower because it is irrelevent to observation length．The feasibility has been checked by simulation results. -
Qiu W，Bo Y．Performance analysis of the subspace method for blind channel identification．Sisnal Processing 1996，50(1)：71-81．[2]Adachi F Reduced-state Viterbi differential detection using a recursively estimated phase reference for M-ary DPSK．IEE Proc.-I，1995、142(4)：263-270[3]Tong L．Blind sequence estimation．IEEE Trans．On Commun，1995：43(12)：2987-2994．[4]Liu H，Xu G. Closed-form blind symbol estimation in digital communications[J].IEEE Trans．On Signal Processing.1995,43(11):2714-2723[5]Adachi F．Adaptive differential detection for M-ary DPSK IEE Proc.-I,1996，143(1)：21-28. -
計量
- 文章訪問數(shù): 2095
- HTML全文瀏覽量: 141
- PDF下載量: 439
- 被引次數(shù): 0
下載:
