Open Access. Powered by Scholars. Published by Universities.®
Social and Behavioral Sciences Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Social and Behavioral Sciences
Fast Encodable And Decodable Irregular Repeat Accumulate Codes From Circulant Permutation Matrices, S Tong, S Zhang, B Bai, X Wang
Fast Encodable And Decodable Irregular Repeat Accumulate Codes From Circulant Permutation Matrices, S Tong, S Zhang, B Bai, X Wang
Faculty of Engineering and Information Sciences - Papers: Part A
An approach to construct irregular repeat accumulate (RA) codes from circulant permutation matrices is presented. The constructed irregular RA codes can be encoded with shift registers and decoded in the turbo decoding fashion, which leads to a much faster convergence rate compared to the conventional full parallel decoding fashion.
On The Performance Of Short Forward Error-Correcting Codes, Sheng Tong, Dengsheng Lin, Aleksandar Kavcic, Li Ping, Baoming Bai
On The Performance Of Short Forward Error-Correcting Codes, Sheng Tong, Dengsheng Lin, Aleksandar Kavcic, Li Ping, Baoming Bai
Faculty of Engineering and Information Sciences - Papers: Part A
This letter investigates the performance of short forward error-correcting (FEC) codes. Reed-Solomon (RS) codes and concatenated zigzag codes are chosen as representatives of classical algebraic codes and modern simple iteratively decodable codes, respectively. Additionally, random binary linear codes are used as a baseline reference. Our main results (demonstrated by simulations and ensemble distance spectrum analysis) are as follows: 1) Short RS codes are as good as random binary linear codes; 2) Carefully designed short low-density parity-check (LDPC) codes are almost as good as random binary linear codes; 3) Low complexity belief propagation decoders incur considerable performance loss at short coding …
On Short Forward Error-Correcting Codes For Wireless Communication Systems, Sheng Tong, Dengsheng Lin, Aleksandar Kavcic, Baoming Bai, Li Ping
On Short Forward Error-Correcting Codes For Wireless Communication Systems, Sheng Tong, Dengsheng Lin, Aleksandar Kavcic, Baoming Bai, Li Ping
Faculty of Engineering and Information Sciences - Papers: Part A
For real-time wireless communications, short forward error-correcting (FEC) codes are indispensable due to the strict delay requirement. In this paper we study the performance of short FEC codes. Reed-Solomon (RS) codes and concatenated zigzag (CZ) codes are chosen as representatives of classical algebraic codes and modern simple iterative decodable codes, respectively. Additionally, we use random binary linear codes as a baseline reference for comparison. Our main results (demonstrated by both simulation and ensemble distance spectrum analysis) are as follows: 1) Short RS codes are as good as random binary linear codes; 2) Carefully designed short low- density parity-check (LDPC) codes …