DocumentCode
523321
Title
The construction of tanner graph for iterative PN sequence acquisition
Author
Kang, Yanchao ; Niu, Kai
Author_Institution
Key Lab of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications, China
fYear
2009
fDate
7-9 Dec. 2009
Firstpage
718
Lastpage
721
Abstract
This paper proposes an improved algorithm of PEG, CPEG (Constrained Progressive Edge Growth), for constructing tanner graphs to represent the constraints of PN sequence, which makes the iterative acquisition method applicable for general PN sequences. And simulation results show that the performance of iterative acquisition using CPEG graph is improved by 2.5dB, and the complexity is reduced to the half.
Keywords
PEG (Progressive Edge Growth); Pseudonoise(PN) code acquisition; Tanner graph;
fLanguage
English
Publisher
iet
Conference_Titel
Wireless Mobile and Computing (CCWMC 2009), IET International Communication Conference on
Conference_Location
Shanghai, China
Type
conf
Filename
5521912
Link To Document