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 条
  • [21] Graph codes with Reed-Solomon component codes
    Hoholdt, Tom
    Justesen, Jorn
    [J]. 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 2022 - +
  • [22] On the concatenation of turbo codes and Reed-Solomon codes
    Zhou, GC
    Lin, TS
    Wang, WZ
    Lindsey, WC
    Lai, D
    Chen, E
    Santoru, J
    [J]. 2003 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5: NEW FRONTIERS IN TELECOMMUNICATIONS, 2003, : 2134 - 2138
  • [23] Improved Adaptive Belief Propagation Decoding of Reed-Solomon Codes With SPC Codes
    Jing, Yizhe
    Zhang, Wei
    Wang, Hao
    Chang, Yanyan
    Liu, Yanyan
    [J]. IEEE COMMUNICATIONS LETTERS, 2022, 26 (07) : 1464 - 1468
  • [24] MATRIX FORMALISM OF THE REED-SOLOMON CODES
    Marov, A., V
    Uteshev, A. Yu
    [J]. VESTNIK SANKT-PETERBURGSKOGO UNIVERSITETA SERIYA 10 PRIKLADNAYA MATEMATIKA INFORMATIKA PROTSESSY UPRAVLENIYA, 2016, 12 (04): : 4 - 17
  • [25] On error distance of Reed-Solomon codes
    YuJuan Li
    DaQing Wan
    [J]. Science in China Series A: Mathematics, 2008, 51 : 1982 - 1988
  • [26] Proximity Gaps for Reed-Solomon Codes
    Ben-Sasson, Eli
    Carmon, Dan
    Ishai, Yuval
    Kopparty, Swastik
    Saraf, Shubhangi
    [J]. 2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 900 - 909
  • [27] FNT-based Reed-Solomon Erasure Codes
    Soro, Alexandre
    Lacan, Jerome
    [J]. 2010 7TH IEEE CONSUMER COMMUNICATIONS AND NETWORKING CONFERENCE-CCNC 2010, 2010, : 466 - 470
  • [28] Cryptanalysis of a system based on twisted Reed-Solomon codes
    Lavauzelle, Julien
    Renner, Julian
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2020, 88 (07) : 1285 - 1300
  • [29] Cryptographic hardness based on the decoding of Reed-Solomon codes
    Kiayias, Aggelos
    Yung, Moti
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (06) : 2752 - 2769
  • [30] Distance Distribution in Reed-Solomon Codes
    Li, Jiyou
    Wan, Daqing
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (05) : 2743 - 2750