Short-message communication and FIR system identification using Huffman sequences

  title={Short-message communication and FIR system identification using Huffman sequences},
  author={Philipp Walk and Peter Jung and Babak Hassibi},
  journal={2017 IEEE International Symposium on Information Theory (ISIT)},
  • P. WalkP. JungB. Hassibi
  • Published 1 February 2017
  • Computer Science
  • 2017 IEEE International Symposium on Information Theory (ISIT)
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… 

Figures from this paper

Noncoherent Short-Packet Communication via Modulation on Conjugated Zeros

A novel blind (noncoherent) communication scheme, called modulation on conjugate-reciprocal zeros (MOCZ), to reliably transmit short binary packets over unknown finite impulse response systems as used to model underspread wireless multipath channels.

MOCZ for Blind Short-Packet Communication: Basic Principles

This work introduces a novel blind (noncoherent) communication scheme, called modulation on conjugate-reciprocal zeros (MOCZ), pronounced as “Moxie,” to reliably transmit sporadic short-packets over unknown wireless multipath channels and shows that MOCZ is not only invariant to the CIR but also robust against additive noise.

MOCZ for Blind Short-Packet Communication: Practical Aspects

It is demonstrated how this joint data and channel estimation can be largely improved by receive antenna diversity at low SNR.

MOCZ for Blind Short-Packet Communication: Some Practical Aspects

Modulation on conjugate-reciprocal zeros (MOCZ), which enables reliable transmission of sporadic and short-packets at ultra-low latency in unknown wireless multipath channels, is investigated.

Physical Layer Secure Communications over Wireless Channels via Common Zeros

  • P. WalkU. Mitra
  • Computer Science
    2018 IEEE International Symposium on Information Theory (ISIT)
  • 2018
A novel approach to secure communication over wireless channels is provided by using the Binary Modulation on Conjugated Zeros design, where the blind deconvolution of a transmitted sequence via a wireless channel with Rayleigh fading is rendered impossible through the introduction of common zeros.

Noise-Resilient Blind Deconvolution using Error-Correcting Codes

An intelligent perturbation algorithm (IPA) is proposed that uses the ECC decoder to assist the random coding solver iteratively in solving the blind deconvolution problem and the theoretical bounds for the optimal rate of the generator matrix of ECC are defined.

Constrained blind deconvolution using Wirtinger flow methods

  • P. WalkP. JungB. Hassibi
  • Computer Science
    2017 International Conference on Sampling Theory and Applications (SampTA)
  • 2017
This work considers one-dimensional blind deconvolution with prior knowledge of signal autocorrelations in the classical framework of polynomial factorization with numerically shown that such an approach has performance comparable to the semidefinite program in the noisy case.



A new approach to blind identification and equalization of multipath channels

  • L. TongG. XuT. Kailath
  • Engineering
    [1991] Conference Record of the Twenty-Fifth Asilomar Conference on Signals, Systems & Computers
  • 1991
A novel blind channel identification and equalization method is proposed by exploiting the cyclostationarity of communication signals and achieves equalization with fewer samples than most techniques based on higher-order statistics.

A least-squares approach to blind channel identification

A new blind identification algorithm based solely on the system outputs is proposed and necessary and sufficient identifiability conditions in terms of the multichannel systems and the deterministic input signal are presented.

Blind channel identification based on second-order statistics: a frequency-domain approach

In this communication, necessary and sufficient conditions are presented for the unique blind identification of possibly nonminimum phase channels driven by cyclostationary processes and a new identification algorithm is proposed.

Ill-convergence of Godard blind equalizers in data communication systems

The existence of stable undesirable equilibria for the Godard algorithm is demonstrated through a simple autoregressive (AR) channel model and it is shown that attaining the global minimum of the mean cost necessarily implies correct equalization.

Reconstruction of Signals From Their Autocorrelation and Cross-Correlation Vectors, With Applications to Phase Retrieval and Blind Channel Estimation

We consider the problem of reconstructing two signals from the autocorrelation and cross-correlation measurements. This inverse problem is a fundamental one in signal processing, and arises in many

Sparse Signal Processing Concepts for Efficient 5G System Design

This paper describes a variety of scenarios in which signal sparsity arises naturally in 5G wireless systems and describes applications of this sparse signal processing paradigm in Multiple Input Multiple Output random access, cloud radio access networks, compressive channel-source network coding, and embedded security.

Blind Demixing and Deconvolution at Near-Optimal Rate

It is shown that robust recovery of message and channel vectors can be achieved via convex optimization when random linear encoding using i.i.d. complex Gaussian matrices is used at the devices and the number of required measurements at the receiver scales with the degrees of freedom of the overall estimation problem.

Blind system identification

A number of recently developed concepts and techniques for BSI, which include the concept of blind system identifiability in a deterministic framework, the blind techniques of maximum likelihood and subspace for estimating the system's impulse response, and other techniques for direct estimation of the system input are reviewed.

The generation of impulse-equivalent pulse trains

  • D. Huffman
  • Computer Science
    IRE Trans. Inf. Theory
  • 1962
It is demonstrated that all impulse-equivalent pulse trains can be generated by exciting a linear digital filter with two input pulses that correspond in time to the initiation and the termination of the desired output sequence.

Rapid, Robust, and Reliable Blind Deconvolution via Nonconvex Optimization