基于可變擬陣搜索算法構造碼率為1/p的二進制系統(tǒng)準循環(huán)碼

張水平; 林平平; 巫光福; 江林偉

doi:10.11999/JEIT160074

基于可變擬陣搜索算法構造碼率為1/p的二進制系統(tǒng)準循環(huán)碼

doi: 10.11999/JEIT160074

基金項目:

國家自然科學基金(11461031, 61562037)，江西省自然科學基金(20151BAB217016)

計量
- 文章訪問數(shù): 1368
- HTML全文瀏覽量: 118
- PDF下載量: 338
- 被引次數(shù): 0
出版歷程
- 收稿日期: 2016-01-19
- 修回日期: 2016-06-15
- 刊出日期: 2016-11-19

Construct the Systematic Binary Quasi-cyclic Codes with Rate 1/p Based on Variable Matroid Search Algorithm

Funds:

The National Natural Science Foundation of China (11461031, 61562037), The Natural Science Foundation of Jiangxi Province (20151BAB217016)

摘要

摘要: 該文針對擬陣搜索算法復雜度高以及局部擬陣搜索算法無法搜索到全部最優(yōu)碼的問題，通過研究擬陣搜索算法，提出可變擬陣搜索算法，并用于搜索準循環(huán)碼。該算法通過減少重復搜索從而降低運算復雜度；基于該算法構造碼率為1/p的二進制系統(tǒng)準循環(huán)碼，隨著整數(shù)p的變化，生成矩陣減少或者增加一個循環(huán)矩陣，產生碼率均為1/p的最優(yōu)碼。通過實驗得到兩個最小距離比現(xiàn)有最優(yōu)碼更大的準循環(huán)碼，表明算法的可行性和優(yōu)越性。
- 擬陣理論 /
- 準循環(huán)碼 /
- 最小距離 /
- 可變擬陣搜索算法
Abstract: Because the matroid search algorithm is very complicated and the local matroid search algorithm can not search all optimal codes, this paper proposes a variable matroid search algorithm to search the quasi-cyclic codes by researching matroid search algorithm. The algorithm reduces the computational complexity by reducing the repeated search. Based on this algorithm, the systematic binary quasi-cyclic codes of which the rate is 1/p are constructed. With the change of integer p, the optimal codes of rate 1/p can be obtained by the generator matrix reducing or adding a loop matrix. Through experiments, two new codes of which the minimum distance is larger than the existing optimal codes are worked out, which indicate the feasibility and superiority of the algorithm.
- Matroid theory /
- Quasi-cyclic codes /
- Minimum distance /
- Variable matroid sear

HTML全文

參考文獻(23)

TOWNSEND R and WELDON E. Self-orthogonal quasi-cyclic codes[J]. IEEE Transactions on Information Theory, 1967, 13(2): 183-195. doi: 10.1109/TIT.1967. 1053974.

CHEN Z. New results on binary quasi-cyclic codes[C]. Proceedings of IEEE International Symposium on Information Theory, Sorrento Italy, 2000: 151-154.

HEIJNEN P, VAN T H, VERHOEFF T, et al. Some new binary quasi-cyclic codes[J]. IEEE Transactions on Information Theory, 1998, 44(5): 1994-1996. doi: 10.1109/ 18.705580.

張軼, 達新宇, 蘇一棟. 利用等差數(shù)列構造大圍長準循環(huán)低密度奇偶校驗碼[J]. 電子與信息學報, 2015, 37(2): 394-398. doi: 10.11999/JEIT140538.

ZHANG Yi, DA Xinyu, and SU Yidong. Construction of quasi-cyclic low-density parity-check codes with a large girth based on arithmetic progression[J]. Journal of Electronics Information Technology, 2015, 37(2): 394-398. doi: 10.11999/JEIT140538．

郭銳, 劉春于, 張華, 等. 分簇無線傳感器網(wǎng)絡中根校驗全分集LDPC碼設計與能效分析[J]. 電子與信息學報, 2015, 37(7): 1580-1585. doi: 10.11999/JEIT141294.

GUO Rui, LIU Chunyu, ZHANG Hua, et al. Full diversity LDPC codes design and energy efficiency analysis for clustering wireless sensor networks[J]. Journal of Electronics Information Technology, 2015, 37(7): 1580-1585. doi: 10.11999/JEIT141294.

陳震華, 許肖梅, 陳友淦, 等. 淺海水聲信道中原模圖LDPC碼的設計及性能分析[J]. 電子與信息學報, 2016, 38(1): 153-159. doi: 10.11999/JEIT150415．

CHEN Zhenhua, XU Xiaomei, CHEN Yougan, et al. Design and analysis of Protograph-based LDPC codes in shallow water acoustic channels[J]. Journal of Electronics Information Technology, 2016, 38(1): 153-159. doi: 10.11999/ JEIT150415.

蘭亞柱, 楊海鋼, 林郁. 動態(tài)自適應低密度奇偶校驗碼譯碼器的FPGA實現(xiàn)[J]. 電子與信息學報, 2015, 37(8): 1937-1943. doi: 10.11999/JEIT141609.

LAN Yazhu, YANG Haigang, and LIN Yu. Design of dynamic adaptive LDPC decoder based on FPGA[J]. Journal of Electronics Information Technology, 2015, 37(8): 1937-1943. doi: 10.11999/JEIT141609.

WHITNEY H. On the abstract properties of linear dependence[J]. The American Mathematical Society, 1935, 57(1): 509-533. doi: 10.1007/978-1-4612-2972-8_10.

GREENE C. Weight enumeration and the geometry of linear codes[J]. Studies in Applied Mathematics, 1976, 55(55): 119-128. doi: 10.1002/sapm1976552119.

BARG A. The matroid of supports of a linear code[J]. Applicable Algebra in Engineering Communication Computing, 1997, 8(2): 165-172. doi: 10.1007/s 002000050060.

KASHYAP N. A decomposition theory for binary linear codes[J]. IEEE Transactions on Information Theory, 2008, 54(7): 3035-3058. doi: 10.1109/TIT.2008.924700.

巫光福, 王琳. 一種短的高碼率LDPC碼設計[J].應用科學學報, 2013, 31(6): 559-563. doi: 10.3969/j.issn.0255-8297. 2013.06.002.

WU Guangfu and WANG Lin. Design of a short high rate LDPC code[J]. Journal of Applied Sciences, 2013, 31(6): 559-563. doi: 10.3969/j.issn.0255-8297.2013.06.002.

WU Guangfu, WANG Lin, and TRUONG T K. Use of matroid theory to construct a class of good binary linear codes[J]. IET Communications, 2014, 8(6): 893-898. doi: 10.1049/iet-com.2013.0671.

WU Guangfu, Chang H C, WANG Lin, et al. Constructing rate 1/p systematic binary quasi-cyclic codes based on the matroid theory[J]. Designs Codes and Cryptography, 2014, 71(1): 47-56. doi: 10.1007/s10623-012-9715-1.

WU Guangfu, LI Yong, ZHANG Shuiping, et al. A random local matroid search algorithm to construct good rate 1/p systematic binary Quasi-Cyclic codes[J]. IEEE Communications Letters, 2015, 19(5): 699-702. doi: 10.1109/ LCOMM.2015.2401572.

OXLEY J. Matroid Theory [M]. Oxford U K, Oxford University Press, 2011: 5-26．

TILBURG H C A V. On quasi-cyclic codes with rate 1/m [J]. IEEE Transactions on Information Theory, 1978, 24(5): 628-629. doi: 10.1109/TIT.1978.1055929.

GULLIVER T A and BHARGAVA V K. An updated table of rate 1/p binary quasi-cyclic codes[J]. Applied Mathematics Letters, 1995, 8(5): 81-86. doi: 10.1016/0893-9659 (95)00071-W.

施引文獻

資源附件(0)

訪問統(tǒng)計