NSSC OpenIR  > 空间技术部
Algorithms and implementation of long euclidean-geometry LDPC codes for space communications
Ma, Mingxiao; An, Junshe
AbstractThe encoding technique of long Euclidean-geometry LDPC codes is studied to meet the need of space missions. Firstly, the encoding algorithm is analyzed. The parity-check matrix is constructed by the incidence vector of points and lines in Euclidean geometry. The method for computing generator matrix is derived from solving matrix equation over GF(2). Secondly, according to the characteristics of quasi-cyclic matrix, a new encoding circuit of using feedback shift registers is proposed. Last, serial encoding circuit for resource-optimization and parallel encoding circuit for speed-optimization are designed respectively and implemented on Xilinx XC4V SX55 FPGA, with both reaching high encoding speed. The results show that the encoding scheme in this paper performs efficiently enough for space communications. © 2015 IEEE.
Conference Name2015 2nd International Conference on Information Science and Control Engineering, ICISCE 2015
Conference DateApril 24, 2015 - April 26, 2015
Conference PlaceShanghai, China
Indexed ByEI
Document Type会议论文
Recommended Citation
GB/T 7714
Ma, Mingxiao,An, Junshe. Algorithms and implementation of long euclidean-geometry LDPC codes for space communications[C]:Institute of Electrical and Electronics Engineers Inc.,2015:100-104.
Files in This Item: Download All
File Name/Size DocType Version Access License
2015EI100104.pdf(180KB) 开放获取CC BY-NC-SAView Download
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Ma, Mingxiao]'s Articles
[An, Junshe]'s Articles
Baidu academic
Similar articles in Baidu academic
[Ma, Mingxiao]'s Articles
[An, Junshe]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Ma, Mingxiao]'s Articles
[An, Junshe]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: 2015EI100104.pdf
Format: Adobe PDF
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.