TY - GEN
T1 - Error correction for asynchronous communication
AU - Yi, Chen
AU - Kliewer, Jorg
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/10/17
Y1 - 2016/10/17
N2 - We propose a forward error correction scheme for asynchronous sensor communication where the dominant errors consist of pulse deletions and insertions, and where encoding is required to take place in an instantaneous fashion. The presented scheme consists of a combination of a systematic convolutional code, an embedded marker code, and power-efficient frequency-shift keying (FSK) modulation at the sensor node. Decoding is first obtained via a maximum a-posteriori (MAP) decoder for the marker code which achieves synchronization for the insertion and deletion channel, followed by MAP decoding for the convolutional code. Besides investigating the rate trade-off between marker and convolutional codes, we also show that residual redundancy in the asynchronously sampled and quantized source signal can be successfully exploited in combination with redundancy only from a marker code. This provides a low complexity alternative for deletion and insertion error correction compared to using explicit redundancy.
AB - We propose a forward error correction scheme for asynchronous sensor communication where the dominant errors consist of pulse deletions and insertions, and where encoding is required to take place in an instantaneous fashion. The presented scheme consists of a combination of a systematic convolutional code, an embedded marker code, and power-efficient frequency-shift keying (FSK) modulation at the sensor node. Decoding is first obtained via a maximum a-posteriori (MAP) decoder for the marker code which achieves synchronization for the insertion and deletion channel, followed by MAP decoding for the convolutional code. Besides investigating the rate trade-off between marker and convolutional codes, we also show that residual redundancy in the asynchronously sampled and quantized source signal can be successfully exploited in combination with redundancy only from a marker code. This provides a low complexity alternative for deletion and insertion error correction compared to using explicit redundancy.
UR - http://www.scopus.com/inward/record.url?scp=84994460189&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84994460189&partnerID=8YFLogxK
U2 - 10.1109/ISTC.2016.7593127
DO - 10.1109/ISTC.2016.7593127
M3 - Conference contribution
AN - SCOPUS:84994460189
T3 - International Symposium on Turbo Codes and Iterative Information Processing, ISTC
SP - 310
EP - 314
BT - 2016 9th International Symposium on Turbo Codes and Iterative Information Processing
PB - IEEE Computer Society
T2 - 9th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2016
Y2 - 5 September 2016 through 9 September 2016
ER -