TY - GEN
T1 - Short-message communication and FIR system identification using Huffman sequences
AU - Walk, Philipp
AU - Jung, Peter
AU - Hassibi, Babak
N1 - KAUST Repository Item: Exported on 2022-06-28
Acknowledgements: We would like to thank Kishore Ja-ganathan, Fariborz Salehi, Anatoly Khina and Götz Pfander for helpful discussions. The work of Babak Hassibi was supported in part by the National Science Foundation under grants CNS-0932428, CCF-1018927, CCF-1423663 and CCF-1409204, by a grant from Qualcomm Inc., by NASA’s Jet Propulsion Laboratory through the President and Director’s Fund, by King Abdulaziz University, and by King Abdullah University of Science and Technology.
This publication acknowledges KAUST support, but has no KAUST affiliated authors.
PY - 2017/8/15
Y1 - 2017/8/15
N2 - Providing short-message communication and simultaneous channel estimation for sporadic and fast fading scenarios is a challenge for future wireless networks. In this work we propose a novel blind communication and deconvolution scheme by using Huffman sequences, which allows to solve three important tasks at once: (i) determination of the transmit power (ii) identification of the instantaneous discrete-time FIR channel if the channel delay is less than L/2 and (iii) simultaneously communicating L-1 bits of information. Our signal reconstruction uses a recent semi-definite program that can recover two unknown signals from their auto-correlations and cross-correlations. This convex algorithm shows numerical stability and operates fully deterministic without any further channel assumptions.
AB - Providing short-message communication and simultaneous channel estimation for sporadic and fast fading scenarios is a challenge for future wireless networks. In this work we propose a novel blind communication and deconvolution scheme by using Huffman sequences, which allows to solve three important tasks at once: (i) determination of the transmit power (ii) identification of the instantaneous discrete-time FIR channel if the channel delay is less than L/2 and (iii) simultaneously communicating L-1 bits of information. Our signal reconstruction uses a recent semi-definite program that can recover two unknown signals from their auto-correlations and cross-correlations. This convex algorithm shows numerical stability and operates fully deterministic without any further channel assumptions.
UR - http://hdl.handle.net/10754/679388
UR - http://ieeexplore.ieee.org/document/8006672/
UR - http://www.scopus.com/inward/record.url?scp=85031683138&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2017.8006672
DO - 10.1109/ISIT.2017.8006672
M3 - Conference contribution
SN - 9781509040964
SP - 968
EP - 972
BT - 2017 IEEE International Symposium on Information Theory (ISIT)
PB - IEEE
ER -