Tree-Search Techniques for Joint Iterative Compressive Sensing and LDPC Decoding in Wireless Sensor Networks

Jue Chen, Tsang Yi Wang, Jwo Yuh Wu, Chih Peng Li, Soon Xin Ng, Robert G. Maunder, Lajos Hanzo*

*此作品的通信作者

研究成果: Article同行評審

1 引文 斯高帕斯(Scopus)

摘要

Novel techniques are conceived for joint compressive sensing (CS) and low-density parity check (LDPC) coding in wireless sensor networks (WSNs), namely, a soft-input soft-output (SISO) tree search sphere decoding (SD) technique and an SISO Hamming distance (HD)-based solution. Factor graphs are utilized to describe the connectivity between the signals and sensors, as well as with the LDPC codes. In the fusion center (FC), the factor graphs may be used for iterative joint LDPC-CS decoding in order to recover the signals observed. However, the CS decoder of the FC suffers from high complexity if the exhaustive Maximum A Posteriori (e-MAP) technique is employed, which considers all possible combinations of source signals detected by each of the associated sensors. Hence, in the proposed SD and HD schemes, only the more likely combinations of source signals are tested for reducing the CS decoding complexity. More specifically, a tree search technique is used in the first step to find the most likely combination of source signal values. Then, in the second step, the proposed SD continues the tree search to find a set of alternative hypotheses. This facilitates the generation of high-quality extrinsic information, which may be iteratively exchanged with the LDPC decoder. By contrast, in the HD approach, the second step obtains the alternative hypotheses within a certain HD of the most likely source signal combination. Both our BLock Error Rate (BLER) results and EXtrinsic Information Transfer (EXIT) charts show that the proposed SD and HD techniques approach the performance of the full-search e-MAP approach at a significantly reduced complexity. In particular, we show that the e-MAP solution is about 56 times more complex than the SD approach and around 210 times more complex than the HD approach. Compared to a separate source-channel coding (SSCC) hard information benchmarker, the proposed SISO schemes improve the decoding performance by about {1}.{7} text {dB}. Furthermore, the SISO schemes allow the iterations inside the CS decoding to eliminate the error floors and obtain a further {2}.{45} -dB gain.

原文English
頁(從 - 到)434-451
頁數18
期刊IEEE Sensors Journal
23
發行號1
DOIs
出版狀態Published - 1 1月 2023

指紋

深入研究「Tree-Search Techniques for Joint Iterative Compressive Sensing and LDPC Decoding in Wireless Sensor Networks」主題。共同形成了獨特的指紋。

引用此