Sparsity Adaptive Compressed Sensing and Reconstruction Architecture Based on Reed-Solomon Codes

被引:4
|
作者
Wang, Hao [1 ]
Zhang, Wei [1 ]
An, Xiangyu [1 ]
Liu, Yanyan [2 ]
机构
[1] Tianjin Univ, Sch Elect Informat Engn, Tianjin 300072, Peoples R China
[2] Nankai Univ, Coll Elect Informat & Opt Engn, Tianjin 300071, Peoples R China
关键词
Decoding; Sparse matrices; Hardware; Reed-Solomon codes; Redundancy; Discrete wavelet transforms; Multiplexing; Compressed sensing; low sampling rate; data reconstruction; low hardware complexity; sparsity adaptive scheme; VLSI architecture;
D O I
10.1109/LCOMM.2020.3040535
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
A novel sparsity adaptive compressed sensing (CS) scheme based on Reed-Solomon (RS) codes is proposed to reduce the amount of sampled data, which can adjust the sampling rate adaptively to achieve data sampling and reconstruct the original data accurately by any decoding algorithm on the finite field. Moreover, the proposed sparsity adaptive reconstruction architecture can greatly improve the data reconstruction efficiency of the proposed CS scheme. The simulation results show that the sparsity adaptive scheme can reduce 83.6% of the sampled data. The results illustrate that the proposed architecture needs about 95k gates and operates at 500 MHz to achieve the throughout of 4.0 Gb/s, which can greatly improve the efficiency of the communication system. Meanwhile, it is at least 21.4% more area-efficient compared with previously reported fixed sampling rate architecture based on RS codes.
引用
收藏
页码:716 / 720
页数:5
相关论文
共 50 条
  • [31] On the IPP Properties of Reed-Solomon Codes
    Fernandez, Marcel
    Cotrina, Josep
    Soriano, Miguel
    Domingo, Neus
    [J]. EMERGING CHALLENGES FOR SECURITY, PRIVACY AND TRUST: 24TH IFIP TC 11 INTERNATIONAL INFORMATION SECURITY CONFERENCE, SEC 2009, PROCEEDINGS, 2009, 297 : 87 - 97
  • [32] Quantum Generalized Reed-solomon codes
    Li Zhuo
    Xing Li-Juan
    [J]. ACTA PHYSICA SINICA, 2008, 57 (01) : 28 - 30
  • [33] ALGORITHMS AND ARCHITECTURES FOR REED-SOLOMON CODES
    ARAMBEPOLA, B
    CHOOMCHUAY, S
    [J]. GEC JOURNAL OF RESEARCH, 1992, 9 (03): : 172 - 184
  • [34] Lifted projective Reed-Solomon codes
    Lavauzelle, Julien
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2019, 87 (07) : 1541 - 1575
  • [35] A Topological View of Reed-Solomon Codes
    Besana, Alberto
    Martinez, Cristina
    [J]. MATHEMATICS, 2021, 9 (05)
  • [36] On error distance of Reed-Solomon codes
    LI YuJuan1 & WAN DaQing21 Institute of Mathematics
    [J]. Science China Mathematics, 2008, (11) : 1982 - 1988
  • [37] ON SHARING SECRETS AND REED-SOLOMON CODES
    MCELIECE, RJ
    SARWATE, DV
    [J]. COMMUNICATIONS OF THE ACM, 1981, 24 (09) : 583 - 584
  • [38] Advances in the performance of Reed-Solomon codes
    Daraiseh, AGA
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1999, 47 (01) : 1 - 5
  • [39] Applications of Maple to Reed-Solomon codes
    Sigmon, NP
    Stitzinger, EL
    [J]. MAPLETECH, 1996, 3 (03): : 53 - 59
  • [40] Quantum Generalized Reed-Solomon codes
    State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an 710071, China
    [J]. Wuli Xuebao, 2008, 1 (28-30):