Short-message communication and FIR system identification using Huffman sequences
- Creators
- Walk, Philipp
- Jung, Peter
- Hassibi, Babak
Abstract
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.
Additional Information
© 2017 IEEE. We would like to thank Kishore Jaganathan, 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.Attached Files
Submitted - 1702.00160.pdf
Files
Name | Size | Download all |
---|---|---|
md5:01f65a225ae7ff183a7a97416aa6bec2
|
442.0 kB | Preview Download |
Additional details
- Eprint ID
- 80544
- Resolver ID
- CaltechAUTHORS:20170816-174357172
- NSF
- CNS-0932428
- NSF
- CCF-1018927
- NSF
- CCF-1423663
- NSF
- CCF-1409204
- Qualcomm Inc.
- JPL
- King Abdulaziz University
- King Abdullah University of Science and Technology (KAUST)
- Created
-
2017-08-17Created from EPrint's datestamp field
- Updated
-
2021-11-15Created from EPrint's last_modified field