@inproceedings{86ad52f0d6e2430ab40f1c27cf30c55d,
title = "LDPC block-coding schedule based on Queen-matrix",
abstract = "The general coding schedule of low density parity codes (LDPC) have the problems of slow coding speed and difficult implementation in hardware. Based on the irregular Queen-matrix LDPC construction algorithm derived from nqueens problem, this paper designed an optimized block-coding schedule according to construction codes' dimension and memory's bandwidth. The block-coding schedule can reduce the intermedial size of data storages and be propitious to hardware implementation by using data source and generating matrix' s division. The experimental results show that comparing with the general coding schedule, the block-coding schedule can make coding speed be improved by 14.6\%-36.1\% at the cost of a little increasing of bit error ratio (BER) because it arranges the submatrix multiplication in parallel prior to sum of them.",
keywords = "Block coding, LDPC, Queen-matrix",
author = "Xiling Luo and Jiayi Zhang and Jun Zhang",
year = "2008",
doi = "10.1109/WiCom.2008.346",
language = "English",
isbn = "9781424421084",
series = "2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008",
booktitle = "2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008",
note = "2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008 ; Conference date: 12-10-2008 Through 14-10-2008",
}