The Journal of Korea Institute of Information, Electronics, and Communication Technology (한국정보전자통신기술학회논문지)

Korea Information Electronic Communication Technology (한국정보전자통신기술학회)
권호 표지
DOI QR코드

DOI QR Code

Development of A Recovery Algorithm for Sparse Signals based on Probabilistic Decoding

확률적 희소 신호 복원 알고리즘 개발

  • Seong, Jin-Taek (Department of Information and Communication Engineering, Honam University)
  • Received : 2017.09.27
  • Accepted : 2017.10.22
  • Published : 2017.10.30
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we consider a framework of compressed sensing over finite fields. One measurement sample is obtained by an inner product of a row of a sensing matrix and a sparse signal vector. A recovery algorithm proposed in this study for sparse signals based probabilistic decoding is used to find a solution of compressed sensing. Until now compressed sensing theory has dealt with real-valued or complex-valued systems, but for the processing of the original real or complex signals, the loss of the information occurs from the discretization. The motivation of this work can be found in efforts to solve inverse problems for discrete signals. The framework proposed in this paper uses a parity-check matrix of low-density parity-check (LDPC) codes developed in coding theory as a sensing matrix. We develop a stochastic algorithm to reconstruct sparse signals over finite field. Unlike LDPC decoding, which is published in existing coding theory, we design an iterative algorithm using probability distribution of sparse signals. Through the proposed recovery algorithm, we achieve better reconstruction performance as the size of finite fields increases. Since the sensing matrix of compressed sensing shows good performance even in the low density matrix such as the parity-check matrix, it is expected to be actively used in applications considering discrete signals.

본 논문은 유한체(finite fields)에서 압축센싱(compressed sensing) 프레임워크를 살펴본다. 하나의 측정 샘플은 센싱행렬의 행과 희소 신호 벡터와의 내적으로 연산되며, 본 논문에서 제안하는 확률적 희소 신호 복원 알고리즘을 이용하여 그 압축센싱의 해를 찾고자 한다. 지금까지 압축센싱은 실수(real-valued)나 복소수(complex-valued) 평면에서 주로 연구되어 왔지만, 이와 같은 원신호를 처리하는 경우 이산화 과정으로 정보의 손실이 뒤따르게 된다. 이에 대한 연구배경은 이산(discrete) 신호에 대한 희소 신호를 복원하고자 하는 노력으로 이어지고 있다. 본 연구에서 제안하는 프레임워크는 센싱행렬로써 코딩 이론에서 사용된 LDPC(Low-Density Parity-Check) 코드의 패러티체크 행렬을 이용한다. 그리고 본 연구에서 제안한 확률적 복원 알고리즘을 이용하여 유한체의 희소 신호를 복원한다. 기존의 코딩 이론에서 발표한 LDPC 복호화와는 달리 본 논문에서는 희소 신호의 확률분포를 이용한 반복적 알고리즘을 제안한다. 그리고 개발된 복원 알고리즘을 통하여 우리는 유한체의 크기가 커질수록 복원 성능이 우수한 결과를 얻었다. 압축센싱의 센싱행렬이 LDPC 패러티체크 행렬과 같은 저밀도 행렬에서도 좋은 성능을 보여줌에 따라 이산 신호를 고려한 응용 분야에서 적극적으로 활용될 것으로 기대된다.

Keywords

References

  1. D. L. Donoho, "Compressed Sensing," IEEE Tran. on Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006. https://doi.org/10.1109/TIT.2006.871582
  2. R. G. Gallager, Low-Density Parity-Check Codes, Cambridge, MA, MIT. Press, 1963.
  3. J.-T. Seong and H.-N. Lee, "Necessary and Sufficient Conditions for Recovery of Sparse Signals over Finite Fields," IEEE Comm. Lett., vol. 17, no. 10, pp. 1976-1979, Oct. 2013. https://doi.org/10.1109/LCOMM.2013.090313.130753
  4. S. C. Draper and S. Malekpour, "Compressed Sensing over Finite Fields," IEEE International Symposium on Information Theory Proceedings (ISIT), Seoul, Korea, pp. 669-673, Jul. 2009.
  5. A. K. Das and S. Vishwanath, "On finite alphabet compressive sensing," IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Vancouver, Canada, May. 2013.
  6. V. Bioglio, G. Coluccia, and E. Magli "Sparse image recovery using compressed sensing over finite alphabets," IEEE International Conference on Image Processing (ICIP), Paris, France, pp. 1287-1291, Oct. 2014.
  7. G. Gankhuyag, E. Hong, and Y. Choe, "Sparse Recovery Using Sparse Sensing Matrix Based Finite Field Optimization in Network Coding," IEICE Trans. Inf. and Syst., vol. E100-D, no. 2, pp. 375-378, Feb. 2017. https://doi.org/10.1587/transinf.2016EDL8189
  8. F. Zhang and H.D. Pfister, "Compressed sensing and linear codes over real numbers," in Proc. 3rd Annual Workshop in Inform. and its Appl., San Diago, CA, Jan. 2008.
  9. A. G. Dimakis and P. O. Vontobel, "LP decoding meets LP decoding: A connection between channel coding and compressed sensing," in Proc. 47th Allerton Conf. on Commun. Cont. and Comp., IL, USA, pp. 8 -15, Sep. 2009.
  10. S. Sarvotham, D. Baron, and R. G. Baraniuk, "Compressed sensing reconstruction via belief propagation," Tech. Report ECE-06-01 in Rice Univ., July 2006.
  11. D. L. Donoho, A. Maleki, and A. Montanari, "Message-passing algorithms for compressed sensing," Proceedings of the National Academy of Sciences, vol. 106, no. 45, pp. 18914-18919, 2009.
  12. M. C. Davey and D. Mackey, "Low-density parity-check codes over GF(q)," IEEE Commun. Lett., vol. 2, no. 6, pp. 165-167, Jan. 1998. https://doi.org/10.1109/4234.681360
  13. A. Hedayat and W. D. Wallis, "Hadamard matrices and their applications," The Annals of Statistics, vol. 6, no. 6, pp. 1184-1238. Nov. 1978. https://doi.org/10.1214/aos/1176344370