Short-message communication and FIR system identification using Huffman sequences

Walk, Philipp; Jung, Peter; Hassibi, Babak

doi:10.1109/isit.2017.8006672

Cited by 10 publications

(4 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If η = 1/2 then the two coefficients (the exterior signaturex) will carry all the energy of the Huffman sequence. But then also R = 1 and the only Huffman sequences (real valued first and last coefficient) are given by x 0 = ±1/ √ 2, x K = ±1/ √ 2 and x k = 0 for k else, which are the coefficients of polynomials with K uniform zeros on the unit circle, see [18]. For R given by (4) the autocorrelation side-lobe η is exponentially decaying in K but is bounded to η ≥ 1/5 for K = 1, 2, .…”

Section: Timing Offset and Effective Delay Spread For Bmoczmentioning

confidence: 99%

MOCZ for Blind Short-Packet Communication: Basic Principles

Walk

Jung

Hassibi

2019

IEEE Trans. Wireless Commun.

Self Cite

View full text Add to dashboard Cite

We will investigate practical aspects for a recently introduced blind (noncoherent) communication scheme, called modulation on conjugate-reciprocal zeros (MOCZ), which enables reliable transmission of sporadic and short-packets at ultra-low latency in unknown wireless multipath channels, which are static over the receive duration of one packet. Here the information is modulated on the zeros of the transmitted discrete-time baseband signal's z−transform. Due to ubiquitous impairments between transmitter and receiver clocks a carrier frequency offset (CFO) will occur after a down-conversion to the baseband, which results in a common rotation of the zeros. To identify fractional rotations of the base angle in the zero-pattern, we propose an oversampled direct zero testing decoder to identify the most likely one. Integer rotations correspond to cyclic shifts of the binary message, which we compensate by a cyclically permutable code (CPC). Additionally, the embedding of CPCs into cyclic codes, allows to exploit additive error correction which reduces the bit-error-rate tremendously. Furthermore, we use the trident structure in the signals autocorrelation to estimate timing offsets and the channels effective delay spread. We finally demonstrate how these impairment estimations can be largely improved by receive antenna diversity, which enables extreme bursty reliable communication at low latency and SNR.

show abstract

Section: Timing Offset and Effective Delay Spread For Bmoczmentioning

confidence: 99%

MOCZ for Blind Short-Packet Communication: Basic Principles

Walk

Jung

Hassibi

2019

IEEE Trans. Wireless Commun.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Sequences with impulsive auto-correlation performance are desired in signal synchronization [1], compressed sensing [2], active sensing systems for medical [3], short-message communication, FIR system identification [4] and other application scenarios [5]. Due to the cost limitation of hardware, constant modulus sequences are generally used.…”

Section: Introductionmentioning

confidence: 99%

A Novel Approach to Construct Huffman Sequences with Low PAPR

WANG,

GU,

ADHIKARY

et al. 2024

IEICE Trans. Fundamentals

View full text Add to dashboard Cite

The auto-correlation property of Huffman sequence makes it a good candidate for its application in radar and communication systems. However, high peak-to-average power ratio (PAPR) of Huffman sequence severely limits its application value. In this paper, we propose a novel algorithm to construct Huffman sequences with low PAPR. We have used the roots of the polynomials corresponding to Huffman sequences of length M + 1 to construct Huffman sequences of length 2M + 1, with low PAPR.

show abstract

“…We refer the readers to [5]- [9] and the references therein for further discussions in these areas. With this motivation, in this work, we propose a new OAC approach based on a recently proposed modulation technique, i.e., modulation on conjugate-reciprocal zeros (MOCZ) [10]- [12], and introduce several methods to compute the MV function Alphan Şahin is with the Electrical Engineering Department, University of South Carolina, Columbia, SC, USA. E-mail: asahin@mailbox.sc.edu…”

Section: Introductionmentioning

confidence: 99%

“…MOCZ is a non-linear modulation technique where information bits are encoded into the zeros of a polynomial, and the transmitted sequence corresponds to the polynomial coefficients [10]. As comprehensively analyzed in [11], the merit of MOCZ is that the zero structure of the transmitted signal is preserved at the receiver regardless of channel impulse response (CIR).…”

Section: Introductionmentioning

confidence: 99%

Over-the-Air Computation over Balanced Numerals

Şahin

Yang

2022

2022 IEEE Globecom Workshops (GC Wkshps)

View full text Add to dashboard Cite

In this study, we propose a new approach to compute the majority vote (MV) function based on modulation on conjugate-reciprocal zeros (MOCZ) and introduce three different methods. The proposed methods rely on the fact that when a linear combination of polynomials is evaluated at one of the roots of a polynomial in the combination, that polynomial does contribute to the evaluation. To utilize this property, each transmitter maps the votes to the zeros of a Huffman polynomial, and the corresponding polynomial coefficients are transmitted. The receiver evaluates the polynomial constructed by the elements of the superposed sequence at conjugate-reciprocal zero pairs and detects the MV with a direct zero-testing (DiZeT) decoder. With differential and index-based encoders, we eliminate the need for power-delay information at the receiver while improving the computation error rate (CER) performance. The proposed methods do not use instantaneous channel state information at the transmitters and receiver. Thus, they provide robustness against phase and time synchronization errors. We theoretically analyze the CERs of the proposed methods. Finally, we demonstrate their efficacy in a distributed median computation scenario in a fading channel.

show abstract

Short-message communication and FIR system identification using Huffman sequences

Cited by 10 publications

References 16 publications

MOCZ for Blind Short-Packet Communication: Basic Principles

MOCZ for Blind Short-Packet Communication: Basic Principles

A Novel Approach to Construct Huffman Sequences with Low PAPR

Over-the-Air Computation over Balanced Numerals

Contact Info

Product

Resources

About