BLISS Seminar: Blind Deconvolution Methods for Short Message Communications
Seminar | November 27 | 3-4 p.m. | 540 Cory Hall
Philipp Walk, Caltech
Blind deconvolution is a challenging problem in signal processing having a long history. We will present new deconvolution algorithms which perform stable and efficient without using any stochastic assumptions on the signals and only demand a coprime zero structure. For the next generation of wireless networks such blind deconvolution methods are crucial to provide a sporadic short message communication over fast fading and noncoherent wireless channels. Herein we introduce a Binary Modulation On Conjugated Zeros (BMOCZ) to communicate reliable over an unknown finite impulse response channel by using a low complexity decoder at the receiver, giving by a Direct Zero Testing (DiZeT) on the magnitude of the received $z-$transform. Moreover, we can significantly improve the bit error performance by introducing a weight for the DiZeT decoder, which we will analyze in more detail for BMOCZ by using Huffman signals. Furthermore, our signaling scheme is applicable to multiple antenna scenarios and is demonstrated to exploit the antenna diversity. Due to the low complexity of the decoder, our scheme looks promising for real-time applications as needed in many mobile and machine type devices.