Systems and methods for communicating by modulating data on zeros

Abstract

Systems and methods for transmitting data using various Modulation on Zeros schemes are described. In many embodiments, a communication system is utilized that includes a transmitter having a modulator that modulates a plurality of information bits to encode the bits in the zeros of the z-transform of a discrete-time baseband signal. In addition, the communication system includes a receiver having a decoder configured to decode a plurality of bits of information from the samples of a received signal by: determining a plurality of zeros of a z-transform of a received discrete-time baseband signal based upon samples from a received continuous-time signal, identifying zeros that encode the plurality of information bits, and outputting a plurality of decoded information bits based upon the identified zeros.

Claims

1. A data transmission method, comprising: receiving a continuous-time signal; sampling the received continuous-time signal, using an analog-to-digital converter, to obtain a discrete-time baseband signal; decoding a plurality of information bits from the discrete-time baseband signal by: determining a plurality of zeros of a z-transform of the discrete-time baseband signal; and identifying, from the plurality of zeros, zeros that encode the plurality of information bits, wherein the identified zeroes comprise at least one zero that has a radius that is not equal to one; and outputting a plurality of decoded information bits based upon the identified zeros.

2. The data transmission method of claim 1, wherein the plurality of zeros of the z-transform comprise: the plurality of zeros that encode the plurality of information bits; and at least one zero introduced by multipath propagation of a transmitted continuous-time signal.

3. The data transmission method of claim 1, wherein the z-transform of the discrete-time baseband signal comprises a zero for each of a plurality of encoded bits.

4. The data transmission method of claim 3, wherein each zero in the z-transform of the discrete-time baseband signal is limited to being one of a set of conjugate-reciprocal pairs of zeros.

5. The data transmission method of claim 4, wherein: each conjugate reciprocal pair of zeros in the set of conjugate-reciprocal pairs of zeros comprises: an outer zero having a first radius that is greater than one; and an inner zero having a radius that is the reciprocal of the first radius; the inner and outer zero have phases that are the same phase; the first radius of the outer zero in each pair of zeros in the set of conjugate-reciprocal pairs of zeros are the same; and the phases of the outer zeros in each pair of zeros in the set of conjugate-reciprocal pairs of zeros are evenly spaced over one complete revolution.

6. The data transmission method of claim 4, wherein the discrete-time baseband signal is a Huffman sequence.

7. The data transmission method of claim 1, wherein at least one zero of the z-transform of the discrete-time baseband signal encodes at least two of the plurality of information bits.

8. The data transmission method of claim 7, wherein the at least one zero of the z-transform of the discrete-time baseband signal that encodes the plurality of information bits is limited to being a zero from a set of more than two zeros.

9. The data transmission method of claim 7, wherein the at least one zero of the z-transform of the discrete-time baseband signal that encodes the plurality of encoded bits is limited to being a zero from a set of multiple conjugate-reciprocal pairs of zeros.

10. The data transmission method of claim 9, wherein each conjugate-reciprocal pair of zeros in the set of multiple conjugate-reciprocal pairs of zeros have unique phases.

11. The data transmission method of claim 9, wherein each zero in the set of multiple conjugate-reciprocal pairs of zeros has the same phase.

12. The data transmission method of claim 11, further comprising determining a most likely set of zeros for the z-transform of the discrete-time baseband signal used to generate a transmitted continuous-time signal using an autocorrelation codebook.

13. The data transmission method of claim 12, further comprising performing a weighted comparison using an inverse discrete Fourier transform of delayed and weighted samples of the received continuous-time signal.

14. The data transmission method of claim 1, wherein the plurality of decoded information bits are obtained by performing a weighted comparison of samples of the z-transform of the discrete-time baseband signal with each zero in a set of zeros.

15. The data transmission method of claim 14, wherein each zero in the z-transform of the discrete-time baseband signal used to generate a transmitted continuous-time signal is limited to being one of a set of conjugate-reciprocal pairs of zeros.

16. The data transmission method of claim 15, further comprising: separating zeros of the discrete-time baseband signal that encode information bits from zeros of the discrete-time baseband signal introduced by multipath propagation of the transmitted continuous-time signal by selecting a predetermined number of the zeros of the discrete-time baseband signal based upon the distance between each zero in the discrete-time baseband signal and a corresponding closest zero in the set of conjugate-reciprocal pairs of zeros.

17. The data transmission method of claim 1, wherein the zeros that encode information bits are identified from the plurality of zeros, based on a set closest to the zeros of the discrete-time baseband signal determined based upon a given distance measure.

18. The data transmission method of claim 1, further comprising estimating characteristics of a channel over which the received continuous-time signal was transmitted.

19. The data transmission method of claim 1, wherein: the continuous-time signal is received by a receiver comprising a plurality of receive antennas; and the plurality of receive antennas determines the plurality of decoded information bits based upon a plurality of received continuous-time signals.

20. The data transmission method of claim 1, wherein the plurality of information bits are encoded so that at least one pole is located at the origin of the z-transform.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

(1) It should be noted that the patent or application file contains at least one drawing executed in color. Copies of this patent or patent application publication with color drawing(s) will be provided by the Office upon request and payment of the necessary fee.

(2) FIG. 1 conceptually illustrates multipath propagation of transmitted signals.

(3) FIG. 2 conceptually illustrates a transmitter and receiver that utilize a binary MOZ scheme over an unknown multipath channel implemented in accordance with an embodiment of the invention.

(4) FIG. 3 conceptually illustrates a process for encoding and decoding data using Modulation on Zeros (MOZ) in accordance with an embodiment of the invention.

(5) FIG. 4A conceptually illustrates the zeros of the z-transform of an arbitrary MOCZ scheme in accordance with an embodiment of the invention.

(6) FIG. 4B conceptually illustrates the zeros of the z-transform of a Huffman Binary Modulation on Conjugate-reciprocal Zeros (BMOCZ) scheme in accordance with an embodiment of the invention.

(7) FIG. 5 conceptually illustrates a gradient decent algorithm in accordance with an embodiment of the invention.

(8) FIG. 6 conceptually illustrates a backtracking line search algorithm in accordance with an embodiment of the invention.

(9) FIG. 7 conceptually illustrates the zeros of the z-transform of a M-ary Phase MOCZ (PMOCZ) scheme in accordance with an embodiment, of the invention.

(10) FIG. 8 is a chart showing the BER performance of a M-ary PMOCZ scheme in accordance with various embodiments of the invention for M=1, 2, 4 over received E.sub.b/N.sub.0.

(11) FIG. 9 is a plot showing simulation results of root neighborhoods for seven noise powers in the range of −22 dB to −5 dB each with 1000 realizations, for a transmitted signal with a z-transform having six Huffman zeros (black square) and 3 channel zeros (red square) for R=1.225.

(12) FIG. 10 conceptually illustrates the zero-patterns of the transform of a Huffman Binary Modulation On Conjugate-reciprocal Zeros (BMOCZ) scheme including their root-neighborhoods with radius δ which allow a maximal zero separation d.sub.min in accordance with an embodiment of the invention.

(13) FIGS. 11A-11C are plots showing simulation of 7 SNR values in 22 dB-5 dB (darker color higher SNR) for a fixed Huffman sequence with K=6 zeros under free different radii implemented in accordance with an embodiment of the invention. For each SNR value 1000 different noise polynomials where generated.

(14) FIG. 12 is a plot of a theoretical worst case noise bound with |x.sub.N|=1, R=1.1, N=7, d.sub.min=0.5 over δ for a system implemented in accordance with an embodiment of the invention.

(15) FIG. 13 is a plot showing the maximal root-neighborhood radius δ of Huffman polynomials over SNR for R.sub.uni(N)=1.5538; 1.3287; 1.1791 for a system implemented in accordance with an embodiment of the invention.

(16) FIGS. 14A and 14B shows simulation results of BMOCZ for simulations performed with MatLab 2017a of the bit-error-rate (BER) over received SNR (3) and average energy/bit/noise-power E.sub.b/N.sub.0 for L independent Rayleigh fading paths for p=1 in (2) and fixed signal length K+1=8.

(17) FIG. 15 is a simulation plot showing various blind modulation schemes for K=7 and K=31 which achieve a target BER of 10.sup.−1 at E.sub.b/N.sub.0 over various channel lengths L=1,4,8,16,32,64,128.

DETAILED DESCRIPTION

(18) Turning now to the drawings, systems and methods for communicating data by transmitting waveforms, where the data is represented by the zeros of the, z-transform of the transmitted waveform in accordance with various embodiments of the invention are illustrated. The process of modulating data on the zeros of the z-transform of the transmitted signal can be referred to as a Modulation on Zeros (MOZ) modulation scheme. A number of MOZ schemes can be implemented in accordance with various embodiments of the invention.

(19) In embodiments, the transmitter modulates data to conjugate-reciprocal zeros of the z-transform of the transmitted signal. Modulation on Conjugate-reciprocal Zeros can be referred to as a MOCZ modulation (pronounced “Moxie”). In several embodiments, MOCZ involves selecting between transmission of conjugate-reciprocal pairs of zeros (in the complex plane) and thereby transmitting a signal that is constructed using a polynomial whose degree is the number of payload bits. In a number of embodiments, a non-linear modulation on polynomial zeros utilizes Huffman segue As is discussed below, use of Huffman sequences can enable implementation of efficient and reliable decoders. In a number of embodiments, a ML decoder is implemented that depends only on the power delay profile of the channel and the noise power. In certain embodiments, a low complexity decoder specifically designed for Huffman sequences is utilized having a complexity which scales only linearly in the number of bits to transmit. In many embodiments, receiver utilizes receiver diversity to improve system performance. In addition to describing a variety of communication systems that utilize MOZ modulation schemes and employing practical decoders, the following discussion presents simulation results that demonstrate that communication systems based upon MOZ schemes are able to outperform noncoherent OFDM-IM and pilot based M-QAM schemes in terms of bit-error rate in a variety of circumstances.

(20) Communication systems and methods that utilize MOZ in accordance with various embodiments of the invention are discussed in detail in the sections that follow. The discussion is structured to introduce some conventions regarding the notation used to describe the various communication systems described herein, a generalized overview of communication systems that utilize MOZ are presented, MOCZ and BMOCZ systems are described (including systems based upon the use of Huffman sequences), a number of practical decoder implementations are presented, and then simulation results are presented that compare the performance of communication systems that employ MOZ schemes and conventional blind communication systems. While much of the discussion that follows focuses on the use of specific MOCZ and Huffman sequence based Binary MOCZ (BMOCZ) schemes, the techniques described herein can be used to extend the MOZ modulation and encoding principles to general codebooks based on polynomial zeros.

Notation

(21) In the discussion that follows, small letters are used for complex numbers in . Capital Latin letters denote natural numbers and refer to fixed dimensions, where small letters are used as indices. The first N natural numbers are denoted by [N]={0, 1, . . . , N−1}. Boldface small letters denote vectors and capitalized letters refer to matrices. Upright capital letters denote complex-valued polynomials in . For a complex number x=a+jb, given by its real part Re(x)=a∈ and imaginary part Im(x)=b∈ with imaginary unit j=√{square root over (−1)} its complex-conjugation is given by x=a−jb and its absolute value by

(22) $.Math.x.Math.=\sqrt{x\stackrel{\_}{x}}.$
For a vector x∈ we denote by x.sup.− its complex-conjugated time-reversal or conjugated-reciprocal, given as x.sup.−.sub.n=x.sub.N−n for a n∈[N]. We use A*=Ā.sup.T for the complex-conjugated transpose of the matrix A. For the identity and all zero matrix in N dimension we write I.sub.N respectively O.sub.N. By D.sub.x we refer to the diagonal matrix generated by the vector x∈. The N×N unitary Fourier matrix F=F.sub.N is given entry-wise by ƒ.sub.l,k=e.sup.j2πlk/N/√{square root over (N)} for l,k∈[N]. The all one respectively all zero vector in dimension N will be denoted by 1.sub.N resp. 0.sub.N. The -norm of a vector x∈ is given by for

(23) ${.Math.x.Math.}_p={\left(\underset{k=1}{\overset{N}{.Math.}}{.Math.x_k.Math.}^p\right)}^{1/p}$
for p≥1. If p=∞ then ∥x∥.sub.∞=max.sub.k|x.sub.k|.The expectation of a random variable x is denoted by [x].

(24) The disclosure also refers to x.Math.y:=diag(x)y as the Hadamard (point-wise) product of the vectors x,y∈.

System Model

(25) Systems and methods in accordance with many embodiments of the invention involve transmission of data of an unknown multipath channel. Multipath propagation of transmitted data is conceptually illustrated in FIG. 1. In the illustrated embodiment, the communication system 100 includes a base station 102 that is acting as a broadcasting transmitter and an arbitrary mobile station 104 that is acting as a receiver. In the illustrated embodiment, the signal transmitted by the base station 102 can be received by the mobile station in 104 via six different 106 paths of propagation. Therefore, the signal received by mobile station 104 is a superposition of the signals received via the different paths subject to the various delays experienced by the signals. The channel also introduces noise.

(26) In order to obtain a general appreciation of the manner in which a system that relies upon MOZ modulation transmits data blindly over a multipath communication channel, a transmitter and receiver that utilize a binary MOZ scheme over an unknown multipath channel implemented in accordance with an embodiment of the invention are conceptually illustrated in FIG. 2. The communication system 200 includes a modulator 204 within the transmitter that performs a modulation operation ƒ to transmit data over a multipath channel 205 and a decoder 206 within a receiver that performs a demodulation/decoder operation g. As discussed below, both the modulation operation ƒ and the decoder operation g rely on at least on shared zero-codebook It is in principal possible that a receiver can blindly identify the used zero-codebook taken from a predefined set of zero-codebooks to allow for example multiple access schemes. As is discussed below, the transmitter and receiver described herein are practical and can be implemented using logic devices including (but not limited to) field programmable gate arrays, digital signal processors, and/or any of a variety of conventional software defined radio platforms.

(27) The binary message sequence m.sub.k∈{0, 1} is chunked at the transmitter in blocks of length K. For BMOCZ, the modulator ƒ encodes the block m to a normalized complex-valued symbol (sequence) x=(x.sub.0, . . . , x.sub.K).sup.T∈ by using the zero-codebook of cardinality 2.sup.K. In many embodiments, when the block size K is small, the discrete-time BMOCZ symbols can be pre-generated using the methods described below for creating a codebook, and is selected using a lookup mechanism such as (but not limited to) a lookup table. The BMOCZ symbol x is typically modulated onto a carrier frequency ƒ.sub.c with a pulse generator running at a sampling clock T=1/W to transmit a real-valued passband signal of bandwidth W to the receiver over an un-known time-invariant channel with a maximum delay spread of T.sub.d=LT which resolves L equally spaced multi-paths (delays). After a down-converting and sampling to the discrete-time baseband, the receiver observes the channel output y under an unknown additive noise vector w. The demodulator/decoder 206 can obtain from the received signal an estimated block codeword {circumflex over (m)} by the knowledge of the zero-codebook .

(28) Although a specific binary MOZ scheme is described above with reference to FIG. 2, as is discussed below, a variety of MOZ schemes can be implemented as appropriate to the requirements of a given application in accordance with various embodiments of the invention including (but not limited to) communication systems that employ M-ary MOZ schemes, MOCZ schemes, multiple receive antennas and/or outer codes to provide additional error correction capabilities enabling recovery of message bits in the face of received bit errors. In order to appreciate these different variants a more complex and generalized model of a communication system that utilizes a MOZ scheme is described below.

System Models for Point-to-Point Communication Systems Employing MOZ Schemes

(29) Many embodiments of the invention can be modeled as a single-antenna point-to-point communication over a frequency-selective block-fading channel, where the channel delay spread T.sub.d=LT is in the order of the signal (block) duration T.sub.s=NT, given by the symbol period or sampling rate T and overall block length N. Over short transmissions, the channel can be assumed to be time-invariant or quasi-static in each block, but may change arbitrarily from block to block. Conventional coherent communication strategies, mostly based on OFDM, are expected to be inefficient in this regime. Accordingly, systems and methods in accordance with various embodiments of the invention utilize a noncoherent modulation scheme, which keeps the information invariant under multipath propagation and thereby can avoid channel estimation and equalization at the receiver. Given these assumptions, the discrete-time baseband model for the system can be expressed as:

(30) $\begin{array}{cc}\begin{array}{cc}{y}_n={\left(h*x\right)}_n+w_n=\underset{l=0}{\overset{L-1}{.Math.}}{h}_l{x}_{n-l}+w_n& \mathrm{for}n\in \left[N\right]:=\left\{0,1,.Math.,N-1\right\},\end{array}& \left(1\right)\end{array}$
where x=(x.sub.0, . . . x.sub.K)∈ denotes the transmitted discrete-time baseband signal (symbol) with coefficients x.sub.k and h=(h.sub.0, . . . , h.sup.L−1)∈ the channel coefficients (taps). The vector y=(y.sub.0, . . . , y.sup.N−1)∈ defines the N=L+K received symbols and w∈ the additive noise at the receiver. Transmit energy E can be assumed to be normalized, i.e.,

(31) ${.Math.x.Math.}_2^2=\underset{k=0}{\overset{K}{.Math.}}={.Math.x_k.Math.}^2=1.$

(32) Note that, contrary to the traditional setting of long data frames, the communications are consider here to be “one-shot” or “burst” communications, where only a single short-packet x will be transmitted. The next transmission might happen at some indefinite future time point so that previous channel knowledge is of no use. As can readily be appreciated, the techniques described herein can also be utilized to transmit long data frames and/or sequences of packets.

(33) In many embodiments, the channel and noise can be modeled as independent circularly symmetric complex Gaussian random variables
h.sub.l˜C(0,p.sup.l) and w.sub.n˜C(0,N.sub.0)   (2)
where it is assumed with p≤1, i.e., an exponential decaying power delay profile (PDP)—see for example. The average received signal-to-noise ratio is therefore:

(34) $\begin{array}{cc}\mathrm{rSNR}=\frac{𝔼\left[{.Math.x*h.Math.}_2^2\right]}{𝔼\left[{.Math.w.Math.}_2^2\right]}=\frac{\underset{k=0}{\overset{K+L-1}{.Math.}}\underset{l=0}{\overset{L-1}{.Math.}}{.Math.x_{k-l}.Math.}^2𝔼\left[{.Math.h_l.Math.}^2\right]}{𝔼\left[{.Math.w.Math.}_2^2\right]}=\frac{{.Math.x.Math.}_2^2.Math.𝔼\left[{.Math.h.Math.}_2^2\right]}{𝔼\left[{.Math.w.Math.}_2^2\right]}=\frac{𝔼\left[{.Math.h.Math.}_2^2\right]}{N.Math.N_0}.& \left(3\right)\end{array}$
Since the average energy of h is then given by

(35) $𝔼\left[{.Math.h.Math.}_2^2\right]=\underset{l=0}{\overset{L-1}{.Math.}}{p}^l,$
the following is obtained for p<1

(36) $\begin{array}{cc}𝔼\left[{.Math.h.Math.}_2^2\right]=\frac{1-p^L}{1-p}\mathrm{and}\mathrm{rSNR}=\frac{1}{N.Math.N_0}\frac{1-p^L}{1-p}.& \left(4\right)\end{array}$

(37) Any of a variety of channel models can be utilized in the design of a communication system that utilizes a MOZ scheme in accordance with various embodiments of the invention as appropriate to the requirements of a given application. As can readily be appreciated, the benefits of a MOZ scheme are likely to be most apparent in channels that exhibit multipath propagation.

Transmission Scheme via Modulation On Zeros

(38) Referring again to FIG. 2, modulators, in accordance with many embodiments of the invention, map by ƒ each binary block m∈{0, 1}.sup.B of B bits to a complex-valued discrete-time baseband signal x∈. Hereby, sender (transmitter) and receiver agree on at least one fixed zero-codebook which is a set of 2.sup.B zero patterns of length K. Each zero can then be chosen from a set of cardinality 2.sup.B/K which allows to encoded B/K bits. Each pattern defines then a polynomial X(z) of order K which is identified with the inverse z-transform to the normalized signal x∈. As is discussed further below, a variety of modulation schemes can be utilized based upon different zero patterns in , which differ in complexity and performance.

(39) The convolution in (1) can be represented by a polynomial multiplication. Let x∈ define the polynomial

(40) $X\left(z\right)=\stackrel{K}{\underset{k=0}{.Math.}}{x}_k{z}^k\mathrm{for}z\in ℂ,$
which has degree K if and only if x.sub.K≠0. The received signal (1) in the z-domain is given by a polynomial of degree K+L−1
Y(z)=X(z)H(z)+W(z),   (5)
where X(z), H(z), and W(z) are the polynomials of degree K, L−1 and K+L−1 respectively generated by x, h and w. Any polynomial X(z) of degree K, can also be represented by its K zeros α.sub.k and its leading coefficient x.sub.K as

(41) 0$\begin{array}{cc}X\left(z\right)=x_K\underset{k=1}{\overset{K}{.Math.}}\left(z-{\alpha }_k\right).& \left(6\right)\end{array}$

(42) When x is normalized, x.sub.K is fully determined by its zeros α.sub.k, which define K degrees of freedom. The notation X(z) is commonly used for the z-transform or transfer function. However, since each polynomial of degree K with non-vanishing zeros corresponds to a unilateral (one-sided) z-transform with the same zeros and an additional pole at z=0, both “zero” representations above can be considered equivalent.

(43) The multiplication by the channel polynomial H(z) adds at most L−1 zeros, say {β.sub.l}.sup.L.sub.i=1, which may be arbitrarily distributed over the complex plane depending on the channel realization. However, for typical random channel models, it holds with probability one that the channel and signal polynomials, generated by a finite codebook set ⊂, do not share a common zero. The no common zero property is typically regarded as a necessary condition for blind deconvolution.

(44) The high-level idea underlying the MOCZ modulation scheme is as follows. In the absence of noise, under the no common zero property the zeros of X(z) appear as zeros of Y(z)=X(z)H(z) no matter what the channel length or realization is. Thus, the zero structure of the transmitted signal goes through the channel “unaltered”. This suggests the benefits of encoding the message on the zero structure of X(z). Accordingly, systems and methods in accordance with various embodiments of the invention encode data in the zeros of the z-transform of the transmitted signal.

(45) Contrary to conventional modulation schemes, where usually each data symbol (coefficent), either in time or frequency domain, can be placed at any point e complex plane, the K “zero-symbols” in the z-domain have to share the complex-plane. Hence, the modulation scheme typically involves partitioning the complex plane in MK disjoint (connected) decoding sets {}.sub.k=1,m=0.sup.K,M−1 and clustering them to K sectors (constellation domains) :=∪.sub.m=0.sup.M−1 for k=1, 2, . . . , K of size M each. In many embodiments, exactly one zero α.sub.k.sup.(m) is associated with each set . In this way, K zero constellation sets of M zeros each (={α.sub.k.sup.(0), . . . , α.sub.k.sup.(m−1)} for k=1, 2, . . . , K) are defined.

(46) Modulation of data can be achieved by constructing codebooks by choosing a particular zero α.sub.k from each and therefore constructing M.sup.K different zero vectors α=(α.sub.1, . . . ,α.sub.K)∈=× . . . ×⊂. Such a zero-codebook allows one to encode K log M bits using a discrete-time baseband signal having zeros in its z-transform corresponding to a zero vector from the zero-codebook.

(47) The message vector of an M-ary alphabet sequence can be partitioned into words m=(m.sub.1, . . . , m.sub.K) of length K and each letter m.sub.k is assigned to the kth zero-symbol α.sub.k∈ and the decoder attempts to recover the message vector based upon the zeros of the detected signal. The process of encoding and decoding data in the manner described above using MOZ in accordance with an embodiment of the invention is conceptually illustrated in FIG. 3. While FIG. 3 includes specific implementation details, as is discussed further below various components can be utilized in the implementation of transmitters and receivers that utilize MOZ schemes as appropriate to the requirements of specific applications in accordance with various embodiments of the invention.

(48) Note that in many embodiments, the zero constellation sets are ordered in the zero-codebook to enable a unique letter assignment. The zero vector α and the leading coefficient x.sub.K defines the vector x of polynomial coefficients. However, there are many methods to calculate the coefficients. In many embodiments, a computationally efficient method is utilized that exploits the Toeplitz structure of elementary convolutions with α.sub.k=(−α.sub.k,1).sup.T as x=x.sub.Kα.sub.1*α.sub.2*α.sub.K=x.sub.Kx.sub.K−1*α.sub.K=x.sub.Kx.sub.K which can be written iteratively as

(49) $\begin{array}{cc}{x}_q=\left(\begin{array}{c}{x}_{q,0}\\ .Math.\\ x_{q,q}\end{array}\right)=\left(\begin{array}{cc}{x}_{q-1,0}& 0\\ x_{q-1,1}& x_{q-1,0}\\ .Math.& .Math.\\ x_{q-1,q-1}& x_{q-1,q-2}\\ 0& x_{q-1,q-1}\end{array}\right)\left(\begin{array}{c}-{\alpha }_q\\ 1\end{array}\right)=\left(\begin{array}{c}0\\ x_{q-1}\end{array}\right)-\left(\begin{array}{c}{\alpha }_q{x}_{q-1}\\ 0\end{array}\right)=x_{q-1}*{\alpha }_q& \left(7\right)\end{array}$
for q∈{2, 3, . . . , K} and x.sub.1=α.sub.1. Note, this iterative process is also used in the Matlab function poly.

(50) To obtain normalized signals x.sub.K can be set to x.sub.K=1/∥x.sub.K∥.sub.2. The matrix operation in (7) needs q multiplications and q−1 additions, which results in 1+(K.sup.2−K)/2 multiplications and (K.sup.2−K)/2 additions for x, plus the normalizing which involves K−1 multiplications and K−1 additions more. Thus, a (K+1)−block codebook of non-orthogonal signals (sequences) in the time-domain can be generated in polynomial time O(K.sup.2). Although much of the focus herein is single-shot transmission, for consecutive transmissions or a multiple user access a guard interval of length L−1 resulting in a transmit and receive block length of N=K+L taps can be utilized. Having introduced the general MOZ modulation approach, various communication systems that utilize Modulation on Conjugate-reciprocal Zeros (MOCZ) schemes and the benefits of such schemes are discussed below.

Modulation On Conjugate-reciprocal Zeros (MOCZ)

(51) In many embodiments, the MOZ modulation scheme involves the modulation of data using conjugate-reciprocal 2M-ary MOZ constellations. In several of these embodiments, the complex plane is partitioned into K sectors of arc width 2π/K containing distinct conjugate-reciprocal zero pairs ordered by increasing phase and radius
={{(α.sub.k.sup.(1), 1/α.sub.k.sup.(1)) }, {(α.sub.k.sup.(2), 1/α.sub.k.sup.(2))}, . . . , {(α.sub.k.sup.(m), 1/α.sub.k.sup.(M))}},   (8)
where it is assumed that w.l.o.g. |α.sub.k.sup.(m)|>1. The above modulation scheme can be referred to as M-ary Modulation On Conjugate-reciprocal Zeros (MOCZ), pronounced as “Moxie ”. Thus, log M bits are encoded per zero and overall K log M bits are encoded on sequences of length K+1.

(52) For M=2 this yields one bit per transmitted zero and hence K bits in the transmitted signal x, see FIG. 4A where the blue circles denote the zero pairs from the zero codebook and solid blue circles actual transmitted zeros and red squares received zeros, given by channel and data zeros. The zero-codebook :={α∈═{tilde over (α)}.sub.k∈{α.sub.k, 1/α.sub.k}, k−1, 2, . . . , K} is defined by K distinct conjugate-reciprocal zero pairs generated by a fixed zero-vector α={α.sub.k}.sub.k=1.sup.K ∈ with zeros α.sub.k=R.sub.k.sub.e.sup.jϕ.sup.k outside the unit circle for some R.sub.k>1 and ordered by their phases ϕ.sub.1<ϕ.sub.2< . . . ϕ.sub.K. Hence, the cardinality of is 2.sup.K. The encoding rifle of the bit block can be given in the zero-domain by

(53) $\begin{array}{cc}{\tilde{\alpha }}_k=e^{j{\varphi }_k}\{\begin{array}{cc}{R}_k& ,m_k=1\\ R_k^{-1}& ,m_k=0\end{array},k=1,2,.Math.,K& \left(9\right)\end{array}$
The zero-codeword {tilde over (α)} generates in the z-domain a polynomial of order K

(54) $\begin{array}{cc}X\left(z\right)=\underset{k=0}{\overset{K}{.Math.}}{x}_k{z}^k=x_K\underset{k=1}{\overset{K}{.Math.}}\left(z-{\tilde{\alpha }}_k\right)\in ℂ\left[z\right].& \left(10\right)\end{array}$

(55) Taking the inverse z-transform of X(z) gives the discrete-time-codeword (symbol) x∈, where x.sub.K is chosen such that x is normalized in the -norm. The time-codebook or signal constellation set, is then the set of all normalized sequences of length K+1 with the same autocorrelation. This defines the Binary MOCZ modulator as

(56) $\begin{array}{cc}f:{\left\{0,1\right\}}^K\times {ℂ}^K.fwdarw.{ℂ}^{K+1}\left(m,\alpha \right)\mapsto f\left(m,\alpha \right)={𝒵}^{-1}\left(x_K\underset{k=1}{\overset{K}{.Math.}}\left(z-R_k^{2m_k-1}{e}^{j{\varphi }_k}\right)\right)=x& \left(11\right)\end{array}$

(57) In several embodiments, K ordered phases ϕ.sub.1<ϕ.sub.2< . . . <ϕ.sub.K and K radii 1<R.sub.1R.sub.2, . . . ,R.sub.K can be chosen. A block m∈{0, 1}.sup.K of K bits to α=(α.sub.1, . . . , α.sub.K).sup.T can be encoded as conjugate-reciprocal zeros

(58) $\begin{array}{cc}{a}_k:=\{\begin{array}{cc}{a}_k^{\left(1\right)}=R_k{e}^{j{\varphi }_k}& ,m_k=1\\ a_k^{\left(0\right)}=R_k^{-1}{e}^{j{\varphi }_k}& ,m_k=0\end{array},k\in \left\{1,2.Math.,K\right\},& \left(12\right)\end{array}$
which defines with (7) x∈, see FIG. 4A. This binary modulation scheme can be referred to as a Binary Modulation On Conjugate-reciprocal Zeros (BMOCZ), pronounced “Bi-Moxie”. For appropriate radii R.sub.k and phases ϕ.sub.k, these zero constellations exhibit remarkable robustness against additive noise.

(59) If the radii and phases are chosen such that R.sub.k=const and ϕ.sub.k=2π(k−1)/K for all k=1, 2, . . . , K, then x is called a Huffman sequence and the modulation scheme can be referred to Huffman BMOCZ encoding (see discussion below and FIG. 4B), otherwise the modulation scheme can be referred to an Arbitrary BMOCZ encoding (see FIG. 4A). The bitrate for the BMOCZ scheme over an L multi-path channel can be given as

(60) $\begin{array}{cc}{R}_b=\frac{K}{K+L}& \left(13\right)\end{array}$

(61) For an arbitrary BMOCZ zero-codebook , the 2K zeros ∪ of the K pairs are then the zeros of an autocorrelation polynomial with coefficients a=x*x.sup.−∈, where the leading coefficient α.sub.2K is such that α.sub.K=1 (normalization of x). From this construction it follows that all such zero-encoded signals x have the same autocorrelation a. The codebook is therefore defined by the 2.sup.K non-trivial ambiguities x of the autocorrelation which allows one to encode K bits of information.

(62) While specific MOCZ, BMOCZ, and Huffman BMOCZ schemes are described above, any of a variety of MOZ schemes including any cardinatity, and/or with or without conjugate-reciprocal zeros in the Z-transforms of the transmitted signals can be utilized as appropriate to the requirements of specific applications in accordance with various embodiments of the invention. Systems and methods for decoding data transmitted via MOZ and MOCZ in accordance with various embodiments of the invention are discussed below.

Demodulation and Decoding via Root-Finding and Minimum Distance

(63) A variety of decoders can be implemented in accordance with different embodiments of the invention. Before discussing specific decoder implementations, it can be helpful to first explain in principle how to demodulate data transmitted using a MOZ scheme. The following discussion then provides a framework for discussing, specific efficient demodulation/equalization implementations.

(64) At the receiver it can be observed by (1) in the z-domain a disturbed version of the transmitted polynomial

(65) $\begin{array}{cc}Y\left(z\right)=X\left(z\right).Math.H\left(z\right)+W\left(z\right)=x_K{h}_{L-1}\stackrel{K}{\underset{k=1}{.Math.}}\left(z-{\alpha }_k\right)\stackrel{L-1}{\underset{l=1}{.Math.}}\left(z-{\beta }_l\right)+w_{N-1}\stackrel{N-1}{\underset{n=1}{.Math.}}\left(z-{\gamma }_n\right)& \left(14\right)\end{array}$
where new channel zeros β.sub.l appear in addition to the transmitted zeros α.sub.k of X(z) and both are perturbed by the noise polynomial W(z). From the received signal coefficients y, the zeros ζ.sub.n of Y(z) can be computed using any of a variety of root finding algorithms.

(66) The decoding can be performed in two steps: (i) ζ.sub.n is assigned to sector if and only if for all k′

(67) $\begin{array}{cc}\underset{m}{\min }d\left({\zeta }_n,{\alpha }_k^{\left(m\right)}\right)\le \underset{m}{\min }d\left({\zeta }_n,{\alpha }_{k^{\prime }}^{\left(m\right)}\right)& \left(15\right)\end{array}$
holds. Here d(.Math.,.Math.) defines a distance on . Then, (ii) separation of data and channel zeros is done by minimum distance (MD) decision

(68) $\begin{array}{cc}{\hat{m}}_k=\underset{m\in \left\{1,.Math.,M\right\}}{\mathrm{argmin}}\underset{{\zeta }_n\in }{\min }\begin{array}{ccc}d\left({\alpha }_k^{\left(m\right)},{\zeta }_n\right)& ,& k=1,2,.Math.,K.\end{array}& \left(16\right)\end{array}$

(69) The above approach can be abbreviated as the Root-Finding Minimal Distance (RFMD) decoder. For BMOCZ this is illustrated in FIG. 4A, where d.sub.k,n.sup.(m)=d(ζ.sub.n,α.sub.k.sup.(m)) is used for m=0, 1 with M=2. In many instances, only the (unweighted) Euclidean distance d(x, y)=x |x−y| is considered for RFMD, but other distance measures may be suitable as appropriate to the requirements of given applications.

(70) The decoding sets are Voronoi cells of the zeros α.sub.k.sup.(m) with respect to the distance function d. In the case of a uniform distribution of the received zeros this can yield optimal performance in (16). If a sector contains multiple zeros, (16) will select the smallest distance, see FIG. 4A, where for k=2 the zero ζ.sub.n is closer to α.sub.2.sup.(0) as ζ.sub.n+1 is to α.sub.2.sup.(1). If contains no zeros, m.sub.k can not be reliably decoded, resulting in an error. This decoding scheme differs therefore from conventional decoding, since more zeros are observed in a multipath channel at the receiver than were transmitted.

Autocorrelation Maximum-Likelihood Decoders

(71) An Autocorrelation Maximum-Likelihood (AML) decoder is a maximum-likelihood decoder based on a fixed normalized autocorrelation codebook . The AML is then independent of the channel and gives the optimal estimation by

(72) 0$\begin{array}{cc}\hat{x}=\arg \underset{x\in }{\max }{y}^{*}{X\left(I_L+{\sigma }^{-2}{X}^{*}X\right)}^{-1}{X}^{*}y& \left(17\right)\end{array}$
for additive noise power σ.sup.2. Here X∈ are the banded Toeplitz matrices generated by z∈ and I.sub.L is the L×L identity matrix.

(73) While the discussion above relates to general decoders. Different decoder have different complexities, which might perform fast or very slow, and a certain error probability, depending on the used MOZ modulation scheme. Moreover, several estimation algorithms obtain a channel estimation which might be useful depending on the scenario. Specific sequences that can be utilized within BMOCZ schemes that enable the use of simple practical decoders and the characteristics of those decoders in accordance with many embodiments of the invention are discussed further below.

Huffman BMOCZ

(74) A BMOCZ scheme can be applied to any autocorrelation sequence a=x*x.sup.−∈ generating a polynomial with simple zeros (all zeros are distinct). However, among these autocorrelations a={α.sub.k}.sub.k=0.sup.2K, autocorrelations described in Huffman, D.,1962. The generation of impulse-equivalent pulse trains. IRE Transactions on Information theory, 8(5), pp.10-16, the disclosure of which is incorporated by reference herein in its entirety, have beneficial impulsive characteristics, since the Huffman sequences are “almost” white. For a given peak-to-side-lobe (PSL) η∈(0, ½), all coefficients are zero except for the side-lobes α.sub.0=α.sub.2K=−η and the main-lobe α.sub.K=1. Hence, such an autocorrelation generates the polynomial (or power spectral density):
A(z)=−η+z.sup.K−η.sub.z.sup.2K and A(e.sup.j2πω)=2ηcos(2πKω)+1   (18)

(75) Since η<½ the z-transform A(z) has no zeros on the unit circle. Taking A(z)=0 as a quadratic equation in z.sup.K, one can immediately determine all the zeros α.sub.k=R.sub.k.sub.e.sup.jϕ.sup.k by

(76) $\begin{array}{cc}{R}_k=R^{\pm 1}={\left(\frac{1\pm \sqrt{1-4{\eta }^2}}{2\eta }\right)}^{1/K},{\varphi }_k=2\pi \frac{k-1}{K}\mathrm{for}k=1,2,.Math.,K.& \left(19\right)\end{array}$

(77) The K conjugate-reciprocal zero pairs are uniformly placed on two circles with radii R<1 and R.sup.−1, i.e.,

(78) ${\alpha }_k\in =\left\{{\mathrm{Re}}^{2\pi j\frac{k-1}{K}},R^{-1}{e}^{2\pi j\frac{k-1}{K}}\right\}.$
The zeros are vertices of two regular polygons, centered at the origin, see FIG. 4B. The blue circles in FIG. 4B denote the conjugate-reciprocal zero pairs from the zero codebook that are uniformly placed on the two circles with radii R>1 and R.sup.−1, the solid blue circles indicate the actual transmitted zeros, and red squares received zeros, given by channel and data zeros. Expressing (18) by its zeros, gives

(79) $\begin{array}{cc}A\left(z\right)=-\eta \stackrel{K}{\underset{k=1}{.Math.}}\left(z-{\alpha }_k\right)\left(z-\stackrel{\_}{{\alpha }_k^{-1}}\right)=x_K\stackrel{K}{\underset{k=1}{.Math.}}\left(z-{\alpha }_k\right).Math.\stackrel{\_}{x_0}\stackrel{K}{\underset{k=1}{.Math.}}\left(z-\stackrel{\_}{{\alpha }_k^{-1}}\right)=X\left(z\right).Math.X^{*}\left(z\right),& \left(20\right)\end{array}$
where X*(z)=Σ.sub.kx.sub.K−kz.sup.k is the conjugate-reciprocal polynomial generated by x.sup.−. Each such X(z) respectively X*(z) is called a Huffman polynomial and their coefficients a Huffman sequence. Since the autocorrelation is constant for each α∈ the following identity can be obtained

(80) $\stackrel{K}{\underset{k=1}{.Math.}}{\alpha }_k=\underset{k}{.Math.}{R}^{2m_k-1}{e}^{j2\pi \frac{\left(k-1\right)}{K}}=R^{2{.Math.m.Math.}_1-K}{e}^{j2\pi \frac{{.Math.}_{k=1}^{K-1}k}{K}}=R^{2{.Math.m.Math.}_1-K}{e}^{j2\pi \frac{\left(K-1\right)}{2K}}={R^{2{.Math.m.Math.}_1-K}\left(-1\right)}^{K-1},\stackrel{\_}{x_0}{x}_K=-\eta ,\mathrm{and}{x_K\left(-1\right)}^K{.Math.}_k{\alpha }_k=x_0,$
which is obtained by comparing the coefficients with the polynomials in (20) respectively X(z)=x.sub.kΠ(z−α.sub.k) the relation

(81) $\begin{array}{cc}{.Math.x_K.Math.}^2=\begin{array}{ccc}\frac{\eta }{{\left(-1\right)}^{K-1}{.Math.}_k{\alpha }_k}& \iff & x_0=e^{j{\varphi }_0}\sqrt{\eta }{R}^{{.Math.m.Math.}_1-\frac{K}{2}},\end{array}{x}_K=-e^{j{\varphi }_0}\sqrt{\eta }{R}^{\frac{K}{2}-{.Math.m.Math.}_1}& \left(21\right)\end{array}$
for a message m=(m.sub.1, . . . , m.sub.K) with a global phase ϕ.sub.0. By rewriting η in terms of the radius η=1/(R.sup.K+R.sup.−K) and setting ϕ.sub.0=0, the first and last coefficients of the normalized Huffman sequence x simplifies to
x.sub.0=√{square root over (R.sup.2∥m∥.sup.1/(1+R.sup.2K))} and x.sub.K=−√{square root over (R.sup.−2∥m∥.sup.1/(1+R.sup.−2K).)}  (22)
This suggests, that the first and last coefficients of Huffman sequences are dominant if 1≃R.sup.K, which will help for time synchronisation and detection of the channel length at the receiver. More-over, if m is i.i.d. uniformly distributed we get by the binomial theorem [|x.sub.K|.sup.2]=[|x.sub.0|.sup.2]=2.sup.−K(1+R.sup.2).sup.K/(1+R.sup.2K). In fact, the magnitude of the first and last coefficients can be used for parity checks.

(82) Impulse-like autocorrelations have also been used in radar. Hence, Huffman BMOCZ can be a promising approach for combined radar and wireless communication applications such as in vehicle-to-vehicle communication. As can readily be appreciated, the potential uses of Huffman BMOCZ schemes is only limited by the requirements of particular applications.

BMOCZ Maximum Likelihood Decoding

(83) Efficient decoding techniques can be implemented for the BMOCZ scheme by explicitly relying upon a codebook having a fixed autocorrelation property. The convolution in (1) can be written as h*x=Xh where X is the N×L banded Toeplitz matrix having (x.sub.0, . . . , x.sub.L, 0, . . . , 0)∈ as its first column. The Toeplitz matrix A∈ generated by the autocorrelation a can also be introduced, If L=K+1 then

(84) $\begin{array}{cc}A=X^{*}X=\left(\begin{array}{ccc}{a}_K& .Math.& a_0\\ .Math.& \setminus & .Math.\\ a_{2K}& .Math.& a_K\end{array}\right)& \left(23\right)\end{array}$
If L≤K, a L×L principal submatrix can be cut out and for L>K the submatrix can be filled up with zeros:

(85) $\begin{array}{cc}{A}_L=\left(\begin{array}{ccc}{a}_K& .Math.& a_{K-L}\\ .Math.& \setminus & .Math.\\ a_{K+L}& .Math.& a_K\end{array}\right)\mathrm{for}L\le K,A_L=\left(\begin{array}{ccccc}{a}_K& .Math.& a_0& & 0\\ .Math.& \setminus & .Math.& \setminus & \\ a_{2K}& .Math.& a_K& .Math.& a_0\\ & \setminus & .Math.& \setminus & .Math.\\ 0& & a_{2K}& .Math.& a_K\end{array}\right)\mathrm{for}L>K.& \left(24\right)\end{array}$
The maximum likelihood (sequence) estimator (MLSE), can be given as:

(86) $\begin{array}{cc}\hat{x}=\arg \underset{x\in }{\max }p\left(y.Math.x\right),& \left(25\right)\end{array}$
which determines the codeword x in the codebook that maximizes the conditional probability. By assumption (2) the channel and noise are independent zero-mean Gaussian random variables, such that the received signal y=Xh+w in (1) will also be a complex Gaussian random vector with mean zero and covariance matrix R.sub.y=[yy*]. The probability for y under the condition that codeword x was transmitted is therefore

(87) $\begin{array}{cc}p\left(y.Math.x\right)=\frac{e^{-y^{*}{R}_y^{-1}y}}{{\pi }^N\det \left(R_y\right)},& \left(26\right)\end{array}$

(88) The covariance matrix of y is given by
R.sub.y=[Xhh*X*]+[Xhw*]+[wh*X*]+[ww*]=X[hh*]X*+σ.sup.2I.sub.N,   (27)
where the two middle terms vanish, since w and h are independent random variables with zero-mean. The PDP p=(p.sup.0, .sup.1, . . . , p.sup.L−1) generates the channel covariance matrix [hh*]=D.sub.p, which is a L×L diagonal matrix with diagonal p, resulting in the covariance matrix
R.sub.y=N.sub.0I.sub.N+XD.sub.pX*.   (28)
By setting X.sub.p:=XD.sub.p.sup.1/2∈ equation (25) separates with (26) to

(89) 0$\begin{array}{cc}\arg \underset{x}{\max }p\left(y.Math.x\right)=\arg \underset{x}{\min }\left({y^{*}\left(N_0{I}_N+X_p{X}_p^{*}\right)}^{-1}y+\log \left({\pi }^N\det \left(N_0{I}_N+X_p{X}_p^{*}\right)\right)\right).& \left(29\right)\end{array}$
By using Sylvester's determinant identity, the following expression is obtained
det(N.sub.0I.sub.N+X.sub.pX*.sub.p)=det(N.sub.0I.sub.L=X*.sub.pX.sub.p)=det(N.sub.0I.sub.LD.sub.p.sup.1/2A.sub.LD.sub.p.sup.1/2)=const.   (30)
Hence, this term can be omitted in (29). By applying Woodbury matrix identity
y*(N.sub.0I.sub.N+X.sub.pI.sub.LX*.sub.p).sup.−1y=N.sub.0∥y∥.sup.2.sub.2−N.sub.0y*X.sub.p(N.sub.0I.sub.L+X*.sub.pX.sub.p).sup.−1X*.sub.py.   (31)

(90) Since ∥y∥.sub.2 is positive and constant, the ML estimator simplifies to {circumflex over (x)}=arg max.sub.xy*X.sub.p(N.sub.0I.sub.L+X*.sub.pX.sub.p).sup.−1X*.sub.py. Inserting the diagonal power delay profile matrix results in

(91) $\begin{array}{cc}\hat{x}=\arg \underset{x}{\max }{y}^{*}{{\mathrm{XD}}_p^{1/2}\left(N_0{I}_L+D_p^{1/2}{X}^{*}{\mathrm{XD}}_p^{1/2}\right)}^{-1}{D}_p^{1/2}{X}^{*}y=\arg \underset{x}{\max }{y}^{*}{\mathrm{XB}}^{-1}{X}^{*}y,& \left(32\right)\end{array}$
where A.sub.L∈ is given by (24) and 0B=X.sub.0D.sub.p.sup.−1+A.sub.L∈ is a matrix which reflects the codebook, power delay profile, and noise power and acts as a weighting for the projections of y to the shifted codewords. Hence, the Maximum Likelihood (ML) decoder becomes:

(92) $\begin{array}{cc}\hat{x}=\arg \underset{x}{\max }{.Math.B^{-1/2}{X}^{*}y.Math.}_2^2.& \left(33\right)\end{array}$

(93) Note, for L=1 the ML reduces to the correlation receiver which solves max.sub.x|x*y|.sup.2 and BMOCZ becomes a 2.sup.K-ary non-orthogonal scheme. If L≤K and the codebook are the Huffman sequences, then A.sub.L=I.sub.L and B=D.sub.b becomes a diagonal matrix with b=N.sub.0p.sup.−1+1.sub.L. Hence, the result is a Rake receiver, where the weights for the lth finger (correlator) are given by b.sub.l.sup.−1=(p.sup.l+N.sub.0)/N.sub.0, which reflects the sum power of channel gain and SNR of the lth path.

(94) As can readily be appreciated, the maximum likelihood decoder described above can be implemented in hardware using an FPGA or DSP processor. Furthermore, the decoder could provide soft metrics to an outer code that can be utilized to perform error correction. While specific implementations of Maximum Likelihood decoders are described above, decoders utilized within communication systems that employ MOZ schemes are not limited to the use of ML decoders. A variety of practical decoders that can be utilized within communication systems that employ a number of MOZ schemes including (but not limited to) Huffman BMOCZ schemes in accordance with various embodiments of the invention are discussed below.

Weighted Direct Zero Testing (DiZeT) Decoders

(95) In a number of embodiments, demodulation at a receiver is performed in one operation by evaluating each bit using the following demodulation rule, called weighted Direct Zero Testing (DiZeT),

(96) $\begin{array}{cc}{\hat{m}}_k=\{\begin{array}{cc}0& ,{\omega }_k^{-}{.Math.Y\left({\alpha }_k\right).Math.}^2\le {\omega }_k^{+}{.Math.Y\left(1/\stackrel{\_}{{\alpha }_k}\right).Math.}^2\\ 1& ,\mathrm{else}\end{array},k=1,2,.Math.,K& \left(34\right)\end{array}$
where the weights are given by the geometric series

(97) $\begin{array}{cc}{\omega }_k^{\pm }=\underset{\eta =0}{\overset{N-1}{.Math.}}{.Math.{\alpha }_k.Math.}^{\pm 2n}=\frac{1-|{\alpha }_k{|}^{\pm 2N}}{1-{.Math.\alpha .Math.}^{\pm 2}},k=1,2,.Math.,K& \left(35\right)\end{array}$
and called therefore geometric weights (GW). The GWs are independent on the rSNR and the channel realizations. The only assumption is the length L of the channel impulse response h which yields to the received dimension N=K+L. Other weights to are also possible and might depend on the chosen zero-modulation used in as well as the channel and noise parameters. However, the receiver has the possibility to estimate the channel length and stop the sampling at N taps if the magnitude falls below a certain noise level. The transmitter needs to append to each transmitted symbol x a guard time of length L−1 to avoid ISI at the receiver if successive symbol or multiple user transmission is used. DiZeT decoders in accordance with a number of embodiments of the invention are discussed further below with respect to the specific example of communication systems that utilize Huffman BMOCZ schemes.

Direct Zero Testing Decoder for Huffman BMOCZ

(98) Huffman sequences not only allow a simple encoding by its zeros, but also a simple decoding, since the autocorrelations of the sequences are by design highly impulsive-like autocorrelations. By setting η=(0.sub.K,η1.sub.K−L).sup.T∈ for L>K, (18) provides the autocorrelation

(99) $\begin{array}{cc}{A}_L=X^{*}X=\{\begin{array}{cc}{I}_L,& L\le K\\ I_L-\eta {\delta }_1^{*}-{\delta }_1{\eta }^{*},& L>K\end{array}.& \left(36\right)\end{array}$

(100) Considering the case L≤K, B=D.sub.b=D.sub.bX*X is obtained. If and only if D.sub.b=bI.sub.L for some b≠0, i.e., if either N.sub.0.fwdarw.∞ (high SNR) or p˜1 (constant power delay profile), the orthogonal projector P=b.sup.−1X(X*X).sup.−1X* onto the range of X can be identified in (32) to obtain with the left null space V of X the identity P=I.sub.N−V(V*V).sup.−1V*. A K×N generalized Vandermonde matrix generated by the zeros of X(z) can be defined as

(101) $\begin{array}{cc}{V}_{\alpha }^{*}=\left(\begin{array}{ccccc}1& {\alpha }_1& {\alpha }_1^2& .Math.& {\alpha }_1^{N-1}\\ 1& {\alpha }_2& {\alpha }_2^2& .Math.& {\alpha }_2^{N-1}\\ .Math.& & & & .Math.\\ 1& {\alpha }_K& {\alpha }_K^2& .Math.& {\alpha }_K^{N-1}\end{array}\right).& \left(37\right)\end{array}$

(102) Since each zero is distinct, the Vandermonde matrix has full rank K. Then, each complex-conjugated column is in the left null space of the matrix X. More precisely

(103) $\begin{array}{cc}{V}_{\alpha }^{*}X=\left(\begin{array}{cccc}X\left({\alpha }_1\right)& {\alpha }_{1}X\left({\alpha }_1\right)& .Math.& {\alpha }_1^{L-1}X\left({\alpha }_1\right)\\ X\left({\alpha }_2\right)& {\alpha }_{2}X\left({\alpha }_2\right)& .Math.& {\alpha }_2^{L-1}X\left({\alpha }_2\right)\\ .Math.& & & .Math.\\ X\left({\alpha }_K\right)& {\alpha }_{K}X\left({\alpha }_K\right)& .Math.& {\alpha }_K^{L-1}X\left({\alpha }_K\right)\end{array}\right)=O\iff X^{*}{V}_{\alpha }=O.& \left(38\right)\end{array}$

(104) In fact, the dimension of the left null space of X (null space of X*) is exactly K for each X generated by x∈, since it holds N=L×K=rank(X*)+nullity(X*), where rank(X)=rank(X*)=L and the shifts of x are all linear independent for any x≠0. Hence,
y*X(X*X).sup.−1X*y=y*(I.sub.N−V.sub.α(V*.sub.αV.sub.α).sup.−1V*.sub.α)y=∥y∥.sup.2.sub.2−∥(V*.sub.αV.sub.α).sup.−1/2V*.sub.αy∥.sup.2.sub.2   (39)
which yields with the weighting matrix M.sub.α=(V*.sub.αV.sub.α).sup.−1/2 and the fact that y is fixed to

(105) $\begin{array}{cc}\arg {\max }_{\alpha }p\left(y.Math.x\left(\alpha \right)\right)=\arg \underset{\alpha }{\min }{.Math.{\left(V_{\alpha }^{*}{V}_{\alpha }\right)}_2^{-1/2}{V}_{\alpha }^{*}y.Math.}^2=\arg \underset{\alpha }{\min }{.Math.M_{\alpha }{V}_{\alpha }^{*}y.Math.}_2^2.& \left(40\right)\end{array}$

(106) The last minimization in (40) describes the ML estimator as a joint search over the K-zeros of the sequence and turns it into an MLSE over zero-sequences. In what follows an approximation is described that allows a receiver in accordance with an embodiment of the invention to search over each zero independently. For Huffman zeros, α.sub.k=R.sub.k.sub.e.sup.j2π(k−1)/K with R.sub.k∈{R, R.sup.−1}, which yields the following

(107) $\begin{array}{cc}{V}_{\alpha }^{*}{V}_{\alpha }=\left(\begin{array}{cccc}1& {\alpha }_1& .Math.& {\alpha }_1^{N-1}\\ .Math.& & & .Math.\\ 1& {\alpha }_K& .Math.& {\alpha }_K^{N-1}\end{array}\right)\left(\begin{array}{ccc}1& .Math.& 1\\ \stackrel{\_}{{\alpha }_1}& .Math.& \stackrel{\_}{{\alpha }_K}\\ .Math.& & .Math.\\ \stackrel{\_}{{\alpha }_1^{N-1}}& .Math.& \stackrel{\_}{{\alpha }_1^{N-1}}\end{array}\right)=\left(\begin{array}{cccc}{c}_{1,1}& c_{1,2}& .Math.& c_{1,K}\\ c_{2,1}& c_{2,2}& .Math.& c_{2,K}\\ .Math.& & \ddots & .Math.\\ c_{K,1}& c_{K,2}& .Math.& c_{K,K}\end{array}\right),& \left(41\right)\end{array}$
where

(108) 0$c_{k,m}=\underset{n=0}{\overset{N-1}{.Math.}}{\left({\alpha }_k{\stackrel{\_}{\alpha }}_m\right)}^n=\underset{n=0}{\overset{N-1}{.Math.}}{\left(R_k{R}_m\right)}^n{e}^{j2\pi n\frac{\left(k-m\right)}{K}}$
and in particular

(109) $c_{k,k}=\frac{1-R_k^{2N}}{1-R_k^2}.$
In expectation, for uniform bit sequences, [R.sub.kR.sub.m]≈1 for k≠M and hence for N=lK the off-diagonals are roughly vanishing, since

(110) $\underset{n=0}{\overset{K-1}{.Math.}}{e}^{j2\pi n\left(k-m\right)/K}=0.$
Hence, (41) can be approximated with ω(|α.sub.k|)=c.sub.k,k.sup.−1/2 as a diagonal matrix
M.sub.α≈diag (ω(|α.sub.1|), . . . , ω(|α.sub.K|)).   (42)
By observing that

(111) $V_{\alpha }^{*}y={\left(Y\left({\alpha }_1\right).Math.Y\left({\alpha }_K\right)\right)}^T$
the exhaustive search of the ML in (40) simplifies to independent decisions for each zero symbol

(112) $\begin{array}{cc}{\hat{\alpha }}_k:=\underset{{\alpha }_k\in \left\{R,R^{-1}\right\}{e}^{j2\pi \left(k-1\right)/K}}{\arg \min }.Math.\omega \left(.Math.{\alpha }_k.Math.\right)Y\left({\alpha }_k\right).Math..& \left(43\right)\end{array}$

(113) This gives the Direct Zero Testing (DiZeT) decoding rule for k∈{1, . . . , K}

(114) $\begin{array}{cc}{\hat{m}}_k=\frac{1}{2}+\frac{1}{2}\mathrm{sign}\left(R^{N-1}.Math.Y\left(R^{-1}{e}^{j2\pi \frac{k-1}{K}}\right).Math.-.Math.Y\left(R{e}^{j2\pi \frac{k-1}{K}}\right).Math.\right)& \left(44\right)\end{array}$
since it holds

(115) $\sqrt{\frac{1-R^{2N}}{1-R^{-2N}}\frac{1-R^{-2}}{1-R^2}}=R^{N-1}.$
If L≥K+1, A.sub.L≈I.sub.L. Then the same approximation yields to the same DiZeT decoder.

(116) Geometrical interpretation: The DiZeT decoder in (34) tests each conjugate-reciprocal pair of zeros {R.sup.±1e.sup.j2π(k−1)/K} to see which is more likely a zero of Y(z). It does so by evaluating the polynomial Y(z) at these two zeros and by scaling them by ω(|z|). In many embodiments, the scaling is necessary because polynomials scale exponentially in |z|. This scaling can be used as a general rule of thumb for zero-patterns other than Huffman BMOCZ. The DiZeT decoder can be readily implemented using an FPGA or Digital Signal Processor to process digital output from an analog to digital conversion of the received signal (either directly or following mixing down to an intermediate frequency or baseband).

(117) While specific implementations of DiZeT decoders are described above, it should be readily appreciated that a variety of decoder implementations that decode the received signal by determining which of the conjugate-reciprocal pairs of zeros is present in the z-transform of the transmitted signal can be utilized as appropriate to the requirements of a given application in accordance with various embodiments of the invention including (but not limited to) various implementations discussed below. Furthermore, communication systems that utilize Huffman BMOCZ schemes in accordance with several embodiments of the invention can utilize any of a variety of alternative decoders including (but not limited to) ML decoders and/or any of the various other types of decoders described and/or incorporated by reference herein.

FFT Implementation of the DiZeT Decoder for Huffman BMOCZ

(118) The DiZeT decoder for Huffman MOCZ allows a simple hardware implementation at the receiver. Assume two copy's of the received samples y.sub.n. One is scaled with the positive radius R.sup.n and the other with R.sup.−n, i.e., we apply to y the diagonal matrix D.sub.R.sub.±1:=diag(1,R.sup.±1, . . . , R.sup.±(N−1)), and apply afterwards the QK-point unitary IDFT matrix F* on the Ñ zero-padded signal, with Q:=┌N/K┐ and Ñ=QK−N , the following is obtained with

(119) ${\tilde{D}}_{\underset{¯}{R}}={\left(\begin{array}{cc}{D}_{\underset{¯}{R}}& 0_{N\times \tilde{N}}\end{array}\right)}^T$

(120) $\begin{array}{cc}\sqrt{\mathrm{QK}}{F}^{*}{\tilde{D}}_{\underset{¯}{R}}y=\left(\begin{array}{c}\begin{array}{c}{.Math.}_{n=0}^{N-1}{y}_n{R}^n{e}^{j2\pi \frac{0.Math.n}{{\mathrm{QK}}^{}}}\\ .Math.\end{array}\\ {.Math.}_{n=0}^{N-1}{y}_n{R}^n{e}^{j2\pi \frac{\left(\mathrm{QF}-1\right)}{\mathrm{QK}}}\end{array}\right)\text{=:}Y\left({\alpha }_Q^{\left(1\right)}\right),\sqrt{\mathrm{QK}}{F}^{*}{\tilde{D}}_{{\underset{¯}{R}}^{-1}}y=Y\left({\alpha }_Q^{\left(0\right)}\right),& \left(45\right)\end{array}$
where α.sub.Q,k.sup.(m)α.sub.k.sup.(m)[e.sup.0, . . . ,e.sup.j2π(Q−1)/QK]∈. Then the decoding rule (44) becomes

(121) $\begin{array}{cc}{\hat{m}}_k=\frac{1}{2}+\frac{1}{2}\mathrm{sign}\left(R^{N-1}.Math.{\left(F^{*}{\tilde{D}}_{R^{-1}}y\right)}_{Q\left(k-1\right)}.Math.-.Math.{\left(F^{*}{\tilde{D}}_{{\underset{¯}{R}}^{-1}}y\right)}_{Q\left(k-1\right)}.Math.\right),k=1,.Math.,K.& \left(46\right)\end{array}$

(122) Here, Q≥2 acts as an oversampling factor of the IDFT, with each Qth sample utilized by the decision rule. Hence, the decoder can be fully implemented by a simple IDFT from the delayed amplified received signal by using for example an FPGA, a DSP, or even analog front-end circuitry of a type that is conventional in many current receivers. As noted above, the principles utilized in the construction of the decoders described above are not limited to binary MOZ schemes. The discussion that follows considers the manner in which M-ary Huffman MOCZ schemes can be utilized within communication systems in accordance with various embodiments of the invention.

Combined Channel Estimation and Decoding

(123) Systems and methods in accordance with a number of embodiments of the invention are capable of performing blind channel estimation and decoding. A number of processes can be utilized to perform an reconstruction/estimation {circumflex over (x)} of the transmitted symbol. From the estimated signal the same decoders as above can be used to decode the bits. If the Huffman sequences are used, an estimation of the channel covariance (autocorrelation) is possible, by using the zero-forcing equalization (frequency-domain-equalization) on the autocorrelation

(124) 0$\begin{array}{cc}{\hat{a}}_h=F^{*}\left({\mathrm{Fa}}_y/{\mathrm{Fa}}_x\right)=F^{*}([F\left(\begin{array}{c}{a}_x\\ 0_{2L-2}\end{array}\right).Math.F\left(\begin{array}{c}{a}_h\\ 0_{2K}\end{array}\right)+F\tilde{w})]/F\left(\begin{array}{c}{a}_x\\ 0_{2L-2}\end{array}\right))& \left(47\right)\end{array}$
where a.sub.x,a.sub.y, and a.sub.h are the autocorrelation of x, y, and h respectively, given by

(125) $\begin{array}{cc}\begin{array}{ccc}{\left(a_x\right)}_{l+K}=\underset{k=0}{\overset{K}{.Math.}}{x}_k\stackrel{\_}{x_{k+l}}& ,& l=-K,.Math.-1,0,1,.Math.,K.\end{array}& \left(48\right)\end{array}$

(126) Moreover, F denotes the unitary 2N−1×2N−1. Fourier matrix. The notation .circle-solid. refers to element-wise multiplication and/to element-wise division. Note, {tilde over (w)} is colored noise. This approach can also be used for other autocorrelations as long as the Fourier matrix of their autocorrelations is non-vanishing.

Semi-Definite-Program (SDP) via Channel Covariance

(127) Using the linear measurement map on N×N.fwdarw. provides the following measurements

(128) $\begin{array}{cc}b:=𝒜\left({\mathrm{zz}}^{*}\right)=\left(\begin{array}{c}{a}_x\\ a_y\\ y\\ \stackrel{\_}{y^{-}}\end{array}\right)& \left(49\right)\end{array}$
where z=[x,h].sup.T∈. The convex optimization problem
find X0 s.t. (X)=b  (50)
has then a unique solution {circumflex over (Z)}. Obtaining by an SVD the best rank-1 approximation {circumflex over (z)} yields to the estimation of the channel ĥ and signal {circumflex over (x)} up to a global phase e.sup.jθ.

Wirtinger-Flow Process via Channel Covariance

(129) The equivalent non-convex optimization problem is given by minimizing
F(z)=∥(zz*)−b∥.sup.2.sub.2.   (51)
over all z∈. The Wirtinger derivative can be derived as follows,
∇F(z)=∇∥A vec(zz*)−b∥.sup.2.sub.2=∇∥A(z.Math.I.sub.N)z−b∥.sup.2.sub.2 =(z.sup.T.Math.I.sub.N)A*(A vec(zz*)−b),
where .Math. the Kronecker matrix product. The matrix A is the matrix version of the linear map

(130) Then the problem (51) can be solved by a gradient decent algorithm shown in FIG. 5 and a backtracking line search algorithm shown in FIG. 6. The parameters z.sup.(0), c, η.sub.0, β are chosen manually.

(131) If the transmitted data is decoded by the DiZeT decoder or any other proposed decoder, an estimate of the transmitted signal {circumflex over (x)} can be obtained by the receiver with the knowledge of the encoder ƒ, which then can be used to estimate the channel h for example by a frequency-domain-equalization as

(132) $\begin{array}{cc}\hat{h}=P_L\left(F^{*}\left(\mathrm{Fy}/F\left(\begin{array}{c}\hat{x}\\ 0_{N-K}\end{array}\right)\right)\right)& \left(52\right)\end{array}$
where P.sub.L, projects on the first L coefficients. Note, that {circumflex over (x)}∈ and has therefore no zeros on the unit circle such that the discrete Fourier transform F of the zero padded vector {circumflex over (x)} has full support. For a fixed L, the estimation quality will increase if K increases. If L>K then no zero--padding of {circumflex over (x)} is necessary.

Hybrid MOZ/OFDM Systems

(133) In a number of embodiments, MOZ schemes are utilized by hybrid systems in which an initial communication is exchanged between a transmitter and a receiver using a MOZ scheme. From the initial communication, the receiver and the transmitter (if duplex communication is used) can determine the characteristics of the channel (reciprocity in duplex mode) and this channel characteristic can then be utilized to transition to coherent OFDM or other modulation methods which are more suitable and efficient for longer-packet transmissions. Stated another way, the communication system utilizes a MOZ scheme to perform an initial bootstrap and, once the communication system has determined a channel model, the transmitter and receiver can switch over to an OFDM communication scheme. Here, the channel learning period can be much shorter than in classical OFDM systems, see (52), whereby at the same time digital data can be communicated between transmitter and receiver in a duplex communication mode.

(134) Although a variety of channel estimation techniques are described above, it should be readily appreciated that communication systems that utilize MOZ schemes in accordance with various embodiments of the invention are by no means limited to particular decoder implementation and/or channel estimation techniques. Systems and methods that are suitable for the transmission and decoding of a variety of higher order MOZ schemes in accordance with several embodiments of the invention are discussed below.

Higher Order Modulations for MOCZ

(135) As noted above, higher order modulation schemes can be constructed for MOCZ for M>1, by combining Huffman codebooks. The following discussion presents two 2M-ary MOCZ schemes that are implemented by quantizing the radius or the phase positions in each of the K sectors, which can be seen as combining rotated or scaled Huffman zero-codebooks. Hence, the number of transmitted zeros and, therefore, the block length K+1 will not change.

M-Phase MOCZ

(136) A Huffman zero-codebook is defined by K uniform phase positions, where for each phase either the zero inside or outside the unit circle is selected. By quantizing the k-th sector uniformly in M phase positions

(137) $\frac{2\pi \left(k-1\right)}{K}+\frac{2\pi m}{\mathrm{MK}}\mathrm{for}m\in \left[M\right],$
an additional log M bits can be decoded per zero. The encoding rule is then given for a block message m of length K, where m.sub.k=[c.sub.k,b.sub.k] is a binary word of length log 2M, where the first bit c.sub.k is separated from the other log M bits in b.sub.k. The first bit is encoded on the radius and the other log M bits on the phase:

(138) $\begin{array}{cc}{m}_k\mapsto {\alpha }_k=R^{1-2_{c_k}}{e}^{j2\pi \frac{\left(k-1\right)M+{.Math.}_{l=1}^{\log M}{b}_{k,l}{2}^{\log M-l}}{\mathrm{MK}}},k=1,.Math.,K.& \left(53\right)\end{array}$
See FIG. 7 for a schematic illustration in which the encoding of a first bit on the radius is indicated by blue circles, and the encoding of an additional log M bits is shown as phase slices from 1, . . . , M. The location of the zeros of the received signal are indicated by red squares. Note, bit splitting is utilized, since a mismatch of inside or outside the unit circle, will only affect the first bit and not the phase bits. Although, the polynomial coefficients will not have a perfect autocorrelation matrix X*X=1.sub.K, for K≤L the DiZeT decoder can still be utilized to decide for the 2M zero positions of the kth zero-symbol

(139) $\begin{array}{cc}{\hat{c}}_k=\frac{1}{2}+\frac{1}{2}\mathrm{sign}(R^{N-1}.Math.Y(R^{-1}{e}^{j2\pi \frac{kM+{\tilde{m}}_k}{\mathrm{MK}}}.Math.-.Math.Y\left({\mathrm{Re}}^{j2\pi \frac{\mathrm{kM}+{\tilde{m}}_k}{\mathrm{MK}}}\right).Math.),{\hat{b}}_k=\mathrm{De}2\mathrm{Bi}\left({\tilde{m}}_k\right)& \left(54\right)\end{array}$
with

(140) ${\tilde{m}}_k=\arg {\min }_{m\in \left[M\right]}\left\{\min \left\{.Math.Y\left({\mathrm{Re}}^{j2\pi \frac{\left(k-1\right)M+m}{\mathrm{MK}}}\right).Math.,R^{N-1}.Math.Y(R^{-1}{e}^{j2\pi \frac{\left(k-1\right)M+m_k}{\mathrm{MK}}}.Math.\right\}\right\}$
and De2Bi denotes the decimal-to-binary map. Here, the assumption is made again that the kth symbol decision is independent of the other K−1 symbols. In FIG. 8, the BER performance for M=1, 2, 4 over received E.sub.b/N.sub.0 is plotted. Since on each circle there are MK uniformly spaced zero-positions, the radius in (66) is adapted to R=√{square root over (1+(logM−0.3)sin(π/(MK)).)} As can readily be appreciated, BER performance can be improved through use of an error correcting outer code. In many embodiments, the code could be designed to provide greater error correction with respect to the phase bits. The specific outer code that is utilized is largely dependent upon the requirements of a given application.

M -Phase MOZ

(141) If modulation on conjugate-reciprocal pairs is omitted by setting R=1, one bit of information is lost per zero-symbol and the modulation scheme becomes an M-ary Phase Modulation on Zeros (PMOZ). The encoder and decoder are the same by omitting c.sub.k and setting R=. The BER performance is a little bit better than M-PMOCZ but worse than (M−1)-PMOCZ, which has the same bit-rate as M-PMOZ, see FIG. 8.

M-Radius MOCZ

(142) Analogously, each zero-symbol over M radii can be quantized to obtain an M-Radius Modulation on Conjugated Zeros (RMOCZ) scheme. M radii can be chosen as 1<R.sub.0<R.sub.1< . . . <R.sub.M−1. Encoding can be performed as for a M-PMOCZ a message word m of K binary words m.sub.k each of log 2M bits m.sub.k=[c.sub.k, b.sub.k] to

(143) $\begin{array}{cc}{m}_k\mapsto {\alpha }_k=R_{m_k}^{1-2c_k}{e}^{j2\pi \frac{k-1}{K}},m_k=\underset{l=1}{\overset{\log M}{.Math.}}{b}_{k,l}{2}^{l-1}.& \left(55\right)\end{array}$

(144) For decoding, the splitting decoder can be utilized

(145) $$\begin{gathered} \begin{array}{cc}{\hat{c}}_k=\frac{1}{2}+\frac{1}{2}\mathrm{sig}n\left(R_{{\tilde{m}}_k}^{N-1}.Math.Y(R_{{\tilde{m}}_k}^{-1}{e}^{j2\pi \frac{k-1}{K}}.Math.-.Math.Y\left(R_{{\tilde{m}}_k}{e \\ }^{j2\pi \frac{k-1}{K}}\right).Math.\right),{\hat{b}}_k=\mathrm{De}2\mathrm{Bi}\left({\tilde{m}}_k\right)\mathrm{with}{\tilde{m}}_k=\arg {\min }_{m\in \left[M\right]}\{\min \{Y\left(R_m{e}^{j2\pi \frac{k-1}{K}}\right).Math.,R_m^{N-1}Y\left(R_m^{-1}{e}^{j2\pi \frac{k-1}{K}}\right).Math.\}\}.& \left(56\right)\end{array} \end{gathered}$$

(146) While a variety of higher order MOZ modulation schemes are described above, any of a variety of higher order MOZ schemes can be utilized as appropriate to the requirements of given applications including higher order MOZ schemes in which the phase and/or radii can be unevenly quantized based upon a variety of factors including (but not limited to) any of a number of appropriate capacity measures. The robustness of various MOZ schemes described above is discussed below.

(147) For higher order modulations various bit mappings to the zero constellation points are possible, which can depend on the channel zero distribution, the noise distribution, as well as the constellation sets of the zero-codebook . For M-ary PMOCZ a Gray labeling/coding can be used to encode the bits between the even spaced M conjugate-reciprocal zero pairs in the kth zero sector depcitured in FIG. 7. Such a Gray labeling ensures that the next neighbor zeros only differ by one bit position, which is useful if the channel and noise zeros are uniformly distributed in an annulus around the unit circle.

(148) It is also possible to exploit list-decoding and other soft-threshold decisions by using multiple received signals of the same transmit signal or by using error detection and error correcting codes. An error can be easily identified if for the kth transmitted zero two zeros are dose to two different zero positions in .

Continuity and Robustness of Zeros Against Small Perturbations

(149) The robustness of various modulation schemes and decoder implementations based upon the characteristics of the channel and non-linearities within the communication system are now considered. Due to the nonlinear nature of the MOZ modulation, finding tight analytic expressions for the BER of MOZ and MOCZ, for the various decoders that can be implemented in accordance with certain embodiments of the invention can be challenging. To gain some insight into the problem, the stability of the single root-neighborhoods of each transmitted zero when the coefficient of the received polynomial are perturbed by additive noise is considered.

(150) MOZ constitutes a new modulation scheme on the signal zeros that can be decoded using general decoders as well as a simple DiZeT decoder. For communication systems and methods in accordance with various embodiments of the invention to provide a robust recovery, and hence a reliable communication, zero-codebooks should be chosen in such a way that the patterns remain identifiable at the receiver in the presence of additive noise perturbing the polynomial coefficients. Since the mapping between the coefficients and zeros is highly non-linear, studying such robustness requires a delicate analysis. It can be shown, by polynomial perturbation analysis, that indeed zero-patterns exists which remain stable against additive noise.

(151) An analysis of the robustness of a codebook can be performed by considering the Euclidean norm and how much the zeros will be disturbed if the coefficients are perturbed with any w∈ having ∥w∥.sub.2≤ε for some ε>0. The answer can be given in terms of the root neighborhood or pseudozero set

(152) 0$\begin{array}{cc}Z\left(\epsilon ,X\right)=\left\{z\in ℂ.Math.\frac{{.Math.{.Math.}_n{x}_n{z}^n.Math.}^2}{{.Math.}_n{.Math.z.Math.}^{2n}}\le {\epsilon }^2\right\}& \left(57\right)\end{array}$
of the polynomial X(z) for a coefficient perturbation with ∥w∥.sub.2≤ε. When ε=0, Z(0, X) is simply the set of N zeros of X(z) (assuming the zeros are distinct). As increases Z(ε, X) starts off as the union of N disjoint sets representing the neighborhood sets of the N distorted zeros of X(z). As ε is further increased at some point the N single root neighborhood sets start to intersect each other, at which point additive perturbations to the coefficients of the polynomial result in a confusion of the zeros and in a possible error by the RFMD decoder (16). In FIG. 9, a plot is provided for a fixed polynomial with N=K=6 Huffman zeros (black squares) and L−1=3 channel zeros (red squares), and the distorted zeros obtained due to distortions by Gaussian random vectors with different noise powers from −22 dB to −5 dB. The additional channel zeros have only little impact on the root neighborhoods of the Huffman zeros. However, they can have a heavy impact on the zero separation (decoding), if they get close to the zero-codebook. Since the distribution of the channel zeros is random, only the perturbation analysis of a given polynomial X(z) is considered.

(153) To derive such a quantized result, Rouché's Theorem can be exploited to bound the single root neighborhoods by discs. Specifically, Rouché's Theorem directs that by setting X(z) and W(z) to be analytic functions in the interior to a simple closed Jordan curve C and continuous on C. If
∥W(z)|≤|X(z)|, z∈C,   (58)
then Y(z)=X(z)+W(z) has the same number of zeros interior to C as does X(z).

(154) The Theorem allows one to prove that the zeros α.sub.n(x) of a given polynomial is a continuous function of its coefficients x. However, to obtain an explicit robustness result for the zeros of a given polynomial with coefficients x, a quantized version of the continuity is beneficial, i.e., a local Lipschitz bound of the zero functions with respect to the / norm in a ε-neighborhood of x. As simple closed Jordan curves, the Euclidean circle and the disc can be considered as its interior, which contain the single root neighborhoods. Define for α.sub.n∈ the closed Euclidean ball (disc) of radius δ>0 and its boundary as
B.sub.n(δ)=B(δ,α.sub.n)={z∈||z−α.sub.n|≤δ}, C.sub.n(δ)={z∈||z−α.sub.n|=δ}.   (59)

(155) The arbitrary polynomial

(156) $X\left(z\right)=\underset{n=0}{\overset{N}{.Math.}}{x}_n{z}^n$
of degree N≥1 can then be considered. If the coefficients are disturbed by w∈B(ε, x), the maximal perturbation of the zeros should be bounded by

(157) $\begin{array}{cc}\underset{n}{\max }.Math.{\alpha }_n\left(x+w\right)-{\alpha }_n\left(x\right).Math.\le \delta .Math.{.Math.x+w-x.Math.}_2=\delta .Math.{.Math.w.Math.}_2,& \left(60\right)\end{array}$
where the bound δ=δ(ε,x)>0 is the local Lipschitz constant. If w.sub.N=−x.sub.N, the leading coefficient of the perturbed polynomial will vanish, and α.sub.N(x+w) can be set to 0, since the degree of the perturbed polynomial will reduce to N−1.

(158) A maximal noise power bound can be proven for a given local Lipschitz bound of a certain class of polynomials. The proof relies on the assumption that one zero is outside the unit circle. This is not much of a restriction, since all but one of the 2.sup.N Huffman polynomials have this property.

(159) Theorem 1 Let X(z)∈[z] be a polynomial of degree N>1 with coefficient vector ∥x∥.sub.2=1 and simple zeros α.sub.1, . . . , α.sub.N⊂ inside a disc of radius R=arg max.sub.n ═α.sub.n|>1 with minimal pairwise distance d.sub.min:=min.sub.n≠k|α.sub.n−α.sub.k|>0. Let w∈ with ∥w∥.sub.2≤ε be an additive perturbation on the polynomial coefficients and δ∈[0,d.sub.min/2)Then the nth zero ζ.sub.n of Y(z)=X(z)+W(z) lies in B.sub.n(δ) if

(160) $\begin{array}{cc}\epsilon =\epsilon \left(x,\delta \right)\le \frac{.Math.x_N.Math.{\delta \left(d_{\min }-\delta \right)}^{N-1}}{\sqrt{1+N}{\left(R+\delta \right)}^N}.& \left(61\right)\end{array}$

(161) The minimal pairwise distance of the zeros is also called the zero separation. The number min.sub.δ∈[0,d.sub.min.sub./2) ε(|x.sub.N|, R, N, d.sub.min, δ) will determine an upper bound on the noise power for the worst combination of noise vector and polynomial in the class. A plot of (61) with |x.sub.N|=1, R=1.1, N=7, d.sub.min=0.5 over δ is shown in FIG. 12. By controlling the modulus of the noise polynomial |W(z)|≤|X(z)| for z∈C.sub.m(δ) one can predict with Rouche's Theorem for δ<d.sub.min/2, that the zero ζ.sub.m of the perturbed polynomial will remain the only zero in the neighborhood B.sub.m(δ). If this holds for all N zeros, then each zero will be distorted by less than δ for a perturbation by w.

(162) Since it is desirable for this to hold for every perturbation ∥w∥.sub.2≤ε, ideally the following condition is satisfied

(163) $\begin{array}{cc}\underset{{.Math.w.Math.}_2\le \epsilon }{\max }\underset{m=1,.Math.,N}{\max }\underset{z\in C_m\left(\delta \right)}{\max }{.Math.W\left(z\right).Math.}^2/{.Math.X\left(z\right).Math.}^2\le 1.& \left(62\right)\end{array}$

(164) Note, that X(z) has no zeros on ∪C.sub.m(δ), hence division can be performed. Defining z=(z.sup.0,z.sup.1, . . . , z.sup.N).sup.T, where 0.sup.0 is set to 1. An upper bound on the magnitude of W(z) can be obtained by using Cauchy-Schwarz

(165) $\begin{array}{cc}{.Math.W\left(z\right).Math.}^2={.Math.w^T\underset{\_}{z}.Math.}^2\le {.Math.w.Math.}_2^2.Math.{.Math.\underset{\_}{z}.Math.}_2^2={\epsilon }^2.Math.\stackrel{N}{\underset{n=0}{.Math.}}{.Math.z.Math.}^{2n}.& \left(63\right)\end{array}$

(166) Since the noise w is in a ball with radius ε, all directions can be chosen and equality will be achieved in (63). Hence, (62) is equivalent to

(167) $\begin{array}{cc}{\epsilon }^2\le \frac{1}{{\max }_m{\max }_{z\in C_m\left(\delta \right)}\frac{\underset{n}{.Math.}{.Math.z.Math.}^{2n}}{{.Math.X\left(z\right).Math.}^2}}=\underset{m}{\min }\underset{z\in C_m\left(\delta \right)}{\min }\frac{{.Math.X\left(z\right).Math.}^2}{\underset{n}{.Math.}{.Math.z.Math.}^{2n}}=\underset{m}{\min }\underset{\theta }{\min }{f}_m\left(\theta \right)& \left(64\right)\end{array}$
where the parametrization z=α.sub.m+δe.sup.iθ for some θ∈[0, 2π) is used and defined

(168) $\begin{array}{cc}{f}_m\left(\theta \right):=\frac{{.Math.X\left({\alpha }_m+\delta e^{i\theta }\right).Math.}^2}{\underset{n}{.Math.}{.Math.{\alpha }_m+\delta e^{i\theta }.Math.}^{2n}}={.Math.x_N.Math.}^2\frac{\underset{n}{.Math.}{.Math.{\alpha }_m+\delta e^{i\theta }-{\alpha }_n.Math.}^2}{\underset{n}{.Math.}{.Math.{\alpha }_m+\delta e^{i\theta }.Math.}^{2n}}.& \left(65\right)\end{array}$

(169) A search for a uniform radius δwhich keeps all root neighborhoods disjoint can be performed by searching for the worst α.sub.m. The only available information of the zeros is the minimal pairwise distance d.sub.min and the largest moduli R>1. By upper bounding the denominator with Σ.sub.n(R+δ).sup.2n≤(1+N)(R+δ).sup.2N and lower bounding the numerator with Π.sub.m∥α.sub.n−α.sub.m|−δ|.sup.2 the following expression is obtained

(170) $\epsilon \le .Math.x_N.Math.\frac{{\delta \left(d_{\min }-\delta \right)}^{N-1}}{\sqrt{1+N}{\left(R+\delta \right)}^N}\le \underset{m}{\min }\underset{\theta }{\min }\begin{array}{cc}\sqrt{f_m\left(\theta \right)}& \end{array}$

(171) Unfortunately, the bound (61) does not increases with δ for fixed |x.sub.N|, N, R and d.sub.min, see FIG. 12. By the continuity of the zeros this behavior is very unlikely and hence might be due to the worst case lower bound estimation in (61).

(172) The observation can be made that as for general code constructions, only a finite number of good zero-pattern or codes are necessary to enable a reliable communication. The above theorem sheds some light on how to construct good zero patterns.

(173) As can be seen from FIG. 12, a maximal zero separation provides good robustness. Since the maximal zero-separation of X(z) is bounded from above by the maximal moduli R=|α.sub.max|≥d.sub.min/2 an increase of d.sub.min typically requires an increase of R. Setting |α.sub.max|=td.sub.min/2 for some t≥1 results in ε.sup.2≤|x.sub.N|.sup.2(t+1).sup.−2N/(1+N)≤2 .sup.−2N/(1+N), which decreases exponentially in N. Hence this suggests to place zeros at the boundary of the ball to ensure the maximal possible d.sub.min and hence t close to 1. However, an increase of R means also a decrease of the leading coefficient, since it holds that |α.sub.max|≤1+max.sub.l<N|x.sub.k/x.sub.N|. If x is normalized, the result yields |α.sub.max|≤1+|x.sub.N|.sup.−1 and therefore |x.sub.N|≤(|α.sub.max|−1).sup.−1 since |α.sub.max|>1. Hence, if R=|α.sub.max| increases, the leading coefficient has to decrease and ε decreases rapidly for t=1. Therefore an arbitrary increasing of the radius seems not to be the solution.

(174) Since zeros of Huffman polynomials are placed on vertices of two regular polygons, they explore a large zero separation. Evaluating numerically the minimization problem for Huffman polynomials with fixed radius, by quantizing (65) with 1000 random error vectors, results in good noise bounds 1/ε, as plotted in FIG. 13, which also suggests a better analytic bound for Huffman polynomials.

(175) In the case in which the zeros are bound on the unit circle (R=1), very good noise stability is obtained, as can be seen in FIG. 11A. It is known, that a polynomial with i..d. Gaussian distributed coefficients has zeros concentrated around the unit circle and is called a Kac polynomial. If the degree N goes to infinity, all zeros will be uniformly distributed on the unit circle with probability one. In fact, this even holds for other random polynomials with non Gaussian distributions. This is an important observation, since it implies for fixed K and hence R, that an increase of L will concentrate channel zeros on the unit circle, such that for sufficiently large R channel zeros will not interfere with codebook zeros.

(176) The analysis of the stability radius for a certain zero-codebook and noise power, allows in principle an error detection for the RFMD decoder. Here, an error for the lth zero can only occur if the noise power is larger than the RHS of (61). However, in the presence of multipaths, the dimension N and x.sub.N.fwdarw.x.sub.Kh.sub.L−1 can be adopted under the assumption that the absolute values of the zeros of H(z) are not larger than R. The minimal distance might be fulfilled with a certain probability.

Radius for Huffman BMOCZ Allowing Maximal Zero Separation

(177) The preceding zero perturbation analysis and the numerical simulations in FIGS. 11A-11C for polynomials with zeros near the unit circle, show a zero distortion depending in first order linearly from the average coefficient perturbation and suggest therefore a quantization in decoding sets with respect to the Euclidean distance. To prevent a confusion of a zero with its conjugate-reciprocal and their next-neighbor pairs, their Euclidean distances should be maximized, i.e., should be set equal d.sub.cp=(R−R.sup.−1)/2=R.sup.−1sin(π/K)=d.sub.nn, yielding to zero-patterns with maximal zero separation d.sub.min, see FIG. 10. However, simulations of perturbed Huffman polynomials in FIGS. 11A-11C show a stronger phase distortion than radial distortion. To adjust the trade-off between radial and phase distance λ≤1 is introduced as a weight parameter
λd.sub.cp=dnn⇔λ(R.sup.2−1)=2sin(π/K).Math.R.sub.uni(K,λ)=√{square root over (1+2λsin(π/K).)}  (66)

(178) Finding the optimal radius and hence the optimal Voronoi cells is in fact a quantization problem. Note, that the zeros for Huffman BMOCZ are not the centroids of the Voronoi cells, which suggest a much more complex metric for an optimal quantizer. From simulation of the BER performance and the noise perturbation in FIGS. 11A-11C it can be observed that λ≃½. It can also be seen from (22), that for λ=½ the first and last coefficients carry half of the energy. Note, that the positive zero α.sub.1 has a conic distortion. Simulation showed that the cone direction depends on the placement of the other N−1 zeros and on the number of zeros N. Hence, for uniform distributed messages the distortion for α.sub.1 will appear also circular.

PAPR for Huffman Sequences

(179) From (22) the magnitudes of the first and last coefficients can be obtained (1+R.sup.±2K).sup.−1, where the maximum is attained if m∈{0, 1}, i.e., the all zero or all one bit message. By noting that their magnitude (22) exploits a symmetry for 2∥m∥.sub.1 and K−2∥m∥.sub.1, an average need only be performed for uniform bit distributions over ∥m∥.sub.1∈{0, . . . , K/2} (assuming K even), which gets

(180) $𝔼\left[{.Math.x.Math.}_{\infty }^2\right]=\frac{2^{-K/2}}{R^{2K}+1}\stackrel{2^{K/2}}{\underset{n=1}{.Math.}}{R}^{-2{.Math.}_{k=1}^{K/2}{m}_k^{\left(n\right)}}=\frac{2^{-K/2}}{R^{2K}+1}\stackrel{K/2}{\underset{m=0}{.Math.}}\left(\begin{array}{c}K/2\\ m\end{array}\right)R^{-2m}={\left(\frac{1+R^{-2}}{2}\right)}^{\frac{K}{2}}\frac{1}{R^{2K}+1}.$

(181) Since the Huffman sequences have all unit energy, the peak-to-average-power ratio (PAPR) is for the optimal radius R=R.sub.uni(K, 1) in (66) for large K

(182) 0$\begin{array}{cc}\mathrm{PAPR}=\left(K+1\right)\frac{𝔼{.Math.x.Math.}_{\infty }^2}{𝔼{.Math.x.Math.}_2^2}=\frac{\left(K+1\right){\left(\left(1+R^{-1}\right)/2\right)}^{K/2}}{R^{2K}+1}\approx \frac{K+1}{{\left(1+2\pi /K\right)}^K+1}.& \left(67\right)\end{array}$

(183) Upper bounding by

(184) $\frac{K+1}{2+2\pi }\approx K/9$
shows a well-known behavior for multi-carrier systems.

Numerical Simulations

(185) Following the standard definition of SNR

(186) $\begin{array}{cc}\mathrm{rSNR}:=\frac{\mathrm{average}\mathrm{received}\mathrm{signal}\mathrm{energy}\mathrm{per}\mathrm{symbol}\mathrm{time}}{\mathrm{average}\mathrm{noise}\mathrm{energy}\mathrm{per}\mathrm{symbol}\mathrm{time}}.& \left(68\right)\end{array}$
A simulation was performed with MatLab 2017a of the bit-error-rate (BER) over average received SNR (3) and transmit energy bit/noise-power E.sub.b/N.sub.0 for L independent Rayleigh fading paths with p=1/L in (2) and fixed transmission length N=K+L for all signaling schemes. Note, for BMOCZ, PPM, and Pilot-QPSK, we add a zero-guard interval of length L−1 to separate consecutive blocks, which is needed to enable multiple users or multiple transmissions. In all simulations, we set the transmit signal energy to E=N, such that the received average power [∥x*h∥.sup.2]/N=E/N=1 (noise-free) will be normalized and equal to the average transmit power. Hence, the SNR=1/N.sub.0 and the transmit energy per bit E.sub.n=N/B=R.sub.n.sup.−1 is given as the inverse of the bit rate R.sub.b=B/N per sampling time T, such that E.sub.b/N.sub.0=SNR/R.sub.b. In each simulation run, we draw a channel and noise realization by (2) and a uniformly binary message of length B for which we determined the number of bit errors. Averaging the resulting bit errors over all simulation runs obtain the uncoded BER over an averaged SNR respectively E.sub.b/N.sub.0.

(187) As a benchmark, reference is made to the ideal coherent case, where an assumption is made of only one line-of-sight path (LOS) resulting in a flat-fading channel, using binary phase shift keying (BPSK) to modulate uncoded data. Assuming knowledge of the channel phases at the receiver, coherent BPSK demodulation can be performed. As an equivalent, a cyclic prefix of length L can be added to exploit K+1 independent Rayleigh flat-fading channels in the frequency domain, where the frequency-symbols are modulated by BPSK and the power and delay overhead of the cyclic prefix is ignored. If L<<K this is a valid approximation that can be used in the classical OFDM approach, where long data packets are transmitted over time-invariant channels. The theoretical bit error probability (bit per symbol duration) for BPSK is known as P.sub.e=(1−√{square root over (rSNR/(1+rSNR)))}/2.

(188) Since the rSNR is equal to E.sub.b/N.sub.0=E.sub.b[|h.sub.0|.sup.2]/N.sub.0 the BPSK curves are the same over rSNR and E.sub.b/N.sub.0, pictured as thick red curves in FIGS. 14A and 14B and FIG. 8. BPSK modulation over a coherent flat fading channel can be seen as the optimal binary signaling performance if no channel state information is available at the transmitter or the receiver and no outer codes are used. Schemes above this line suffer from multipath and schemes below benefit from it.

(189) A comparison between MOZ modulation schemes and noncoherent frequency-selective fading channels can be performed using simulations involving only one packet (block) in a sporadic pulse-like communication, The following discussion provides a comparison of MOZ to training, orthogonal, and so called self-coherent OFDM schemes. By using the same signal lengths for all schemes, plots were generated for a fixed target BER rate of 0.1 the corresponding E.sub.b/N.sub.0 over different channel lengths L in FIG. 15. Each data point is averaged over >10.sup.4 different bit/channel/noise realizations. In all simulations, p=1 was used.

Comparison to Blind Schemes

(190) The following presents a comparison between a MOZ scheme and a blind scheme, which will not estimate the channel, but directly decodes the data from the received signal. However, knowledge of the CIR length is required at the receiver and for OFDM also at the transmitter.

Noncoherent PPM with ML Decoder

(191) The simplest noncoherent modulation scheme for multipath channels, is given by orthogonal signaling, where the transmitted discrete-time signals of the codebook are mutually orthogonal. For the purpose of comparison a codebook is chosen in time-domain that is the Euclidean basis ={δ.sub.0, . . . , δ.sub.K}⊂. The encoding of D=└log(K+1)┘ bits m is given by a K+1-ary pulse position modulation (PPM) as

(192) $\begin{array}{cc}x=\begin{array}{ccc}{\delta }_k& \mathrm{with}& k=\stackrel{D-1}{\underset{d=0}{.Math.}}{m}_d{2}^{D-1-d}.\end{array}& \left(69\right)\end{array}$

(193) If p.sub.l=const. for all L taps, the channel covariance matrix is a multiple of the identity and the ML decoder in (33) simplifies to {circumflex over (x)}=arg∥(X*X).sup.−1/2X*y∥.sup.2.sub.2, which reduces to the square-law detector

(194) $\hat{k}=\arg {\max }_{k\in \left[M\right]}\underset{l=0}{\overset{L-1}{.Math.}}{.Math.y_{l+k}.Math.}^2$
since X*X=I.sub.L. Although, orthogonal schemes can only encode log(K+1) bits instead of K bits as for BMOCZ, they enable a reliable data transmission for signal lengths less than the channel K≤L (no sparsity). In FIG. 15, it can be seen that indeed PPM (green curves) outperform BMOCZ (blue curves) in BER performance, but suffers much more from long CIRs than BMOCZ. For K=7 and L=64, BMOCZ is by 1 dB better than PPM, by simultaneously transmitting double the number of bits in the same time. For K=31 and L=32 the gap increases to 5 dB where at the same time the throughput for BMOCZ is 6 times higher than PPM (green curve, dot markers).

(195) If the receiver has knowledge of instantaneous path gains (amplitude) or the PDP, an “optimal” path combiner can be exploited to obtain a better BER performance. Since MOZ schemes are fully blind, assuming knowledge of PDP is not a fair comparison.

(196) Another disadvantage of PPM, is the need for a perfect synchronization between transmitter and receiver to identify the correct time-lags, a requirement which needs further resources, The time and frequency synchronizations can be handled very well for Huffman BMOCZ by using only a small fraction of bits to encode the payload in a rotation invariant code.

Noncoherent OFDM with IM

(197) Index-Modulation (IM) techniques are one of the most recent and promising developments in wireless communication for 5G applications. The following discussion concentrates on a subcarrier (frequency) index-modulation which selects Q active carries out of K+1. For noncoherent OFDM-IM, as proposed in Choi, J., 2018. Noncoherent OFDM-IM and its performance analysis. IEEE Transactions on Wireless Communications, 17(1), pp. 352-360, the relevant disclosure from which is incorporated by reference herein in its entirety, the receiver will only detect the energies on each subcarrier and pick the Q largest (active) ones.

(198) The active subcarrier combinations define a set of index sets {I.sub.1, . . . , I.sub.M}⊂[K+1], which can be sorted in a lexicographically order to map it in an efficient manner to bits. For Q>1 this yields to a codebook of size M=(.sup.K+1.sub.Q) and allows one to transmit D=└log M┘ bits per signal block.

(199) By using factorial bounds, the largest codebook size for Q=(K+1)/2 can be bounded to M=(.sub.(K+1)/2.sup.K+1)<└2.sup.K−log√{square root over ((K+1)/2)}┘ which obtains for K>1 less than K−1 bits and therefore less than the proposed MOZ schemes. However, to enable OFDM a cyclic prefix (CP) of length L−1 is added to the data signal s, which results in an N=K+L dimensional transmit signal x=(s.sub.L−(L−2), . . . , s.sub.L, s)∈. This requires a data signal length K+1 of at least the channel length L, otherwise, the transmitted signal cannot be complemented with a CP and the channel action can not be written as a circular convolution. The circular convolution is then represented in the frequency domain by the FFT as a pointwise multiplication of K+1 independent flat-fading channels with the OFDM symbol d=Fs∈. To make a fair comparison to the BMOCZ scheme, the CP power is included in the transmit power. This reduces the effective power of x by a factor of up to two, if K≈L. Recall that [∥s*h∥.sup.2.sub.2]=∥s∥.sup.2.sub.2.Math.[∥h∥.sup.2.sub.2], see (3), and therefore [∥h∥.sup.2.sub.2]=1 is enforced by dividing with the expected energy given by the PDP (4). However, the receiver will only use from the N+L−1 received samples K+1, i.e. {tilde over (y)}=(y.sub.L−1, . . . , y.sub.N−1), {tilde over (w)}=(w.sub.L−1, . . . , w.sub.N−1)), to reveal the K+1 point circular convolution:

(200) $\begin{array}{cc}\tilde{y}=s\left(\begin{array}{c}h\\ 0_{K+1-L}\end{array}\right)+\tilde{w}.Math.\tilde{Y}=F\left(s\left(\begin{array}{c}h\\ 0_{K+1-L}\end{array}\right)+\tilde{w}\right)=\mathrm{diag}\left(d\right)F\left(\begin{array}{c}h\\ 0_{K+1-L}\end{array}\right)+F\tilde{w}.& \left(70\right)\end{array}$
Note, {tilde over (Y)}=F{tilde over (y)} are K+1 sample values of the z-transform of {tilde over (y)} on the unit circle. In fact, the index set I.sub.m defines K+1−Q zeros {e.sup.−j2πl/(K+1)|l∈[K+1]\I.sub.m} of the data polynomials

(201) $S_m\left(z\right)=\underset{k=0}{\overset{K}{.Math.}}{s}_k{z}^k$
since 0=d.sub.l=Σ.sub.k.sub.s.sub.kα.sub.m,l.sup.k with α.sub.m,l=e.sup.−j2πl/(k+1) for l∈[K+1]\I.sub.m. Hence, the mth OFDM-IM symbol s.sub.m generates a polynomial with K+1−|I.sub.m| zeros on the unit circle. If Q=1 then x generates a polynomial of order K with K zeros uniformly spaced on the unit circle with spacing 2π/(K+1), i.e. form the K+1 uniform positions on the unit circle we select K many. He OFDM-IM can be seen as a special MOZ design defining K different zero-patterns α.sub.1, . . . , α.sub.K⊂ by choosing K out of K+1 uniform placed zero positions on the unit circle. Since the various BMOCZ schemes described herein are not restricted to the unit circle a BMOCZ codebook size can be much larger. Let us note here, that this special case is only possible if K≥L. Comparing the BER performance over E.sub.b/N.sub.0 in FIG. 15 for K=7 and various channel lengths L≤8, it can be seen that indeed BMOCZ outperforms OFDM-IM. Furthermore, the performance of OFDM-IM decreases if Q or L increases.

Comparison to Training Schemes

(202) The most common approach in wireless communication, is to learn the CIR by placing known training or pilot data in the transmitted signals. Training is very efficient at high SNR and if the learned channel is used many times or equivalent if the signal length is much larger as the CIR. In a sporadic short-packet setup, this is typically not the case, and it can be shown that the overhead reduces the reliable throughout and prevents at a certain packet length a reliable communication at all.

(203) As a simple pilot signaling scheme x=[δ.sub.1, d] can be separated into a delta pilot δ.sub.1∈ of length P and a data signal d∈ the remaining taps to encode 2D bits per packet with QPSK modulation by allocating the available transmit power equally between pilot and data signals. Depending on the SNR and signal length it might be more beneficial to allocate more or less power to the pilots. But since the transmitter does not know the channel state or the SNR, the following discussion considers a blind allocation. The CIR estimation ĥ is simply given by the first L received samples, assuming a perfect time synchronization and p=1. By using a Frequency-Domain-Equalization (FDE) receiver in the frequency domain, the estimated data is obtained by

(204) $\begin{array}{cc}\tilde{d}=F_N^{*}\left(F_N\left(\begin{array}{c}{y}_L\\ .Math.\\ y_{L+N-1}\end{array}\right)/F_N\left(\begin{array}{c}\hat{h}\\ 0_{N-L}\end{array}\right)\right).Math.\hat{d}={\left({\tilde{d}}_0,.Math.,{\tilde{d}}_{D-1}\right)}^T.& \left(71\right)\end{array}$
which can be decoded by hard-thresholding of real and imaginary part.

(205) $\begin{array}{cc}{\hat{m}}_k=\frac{1}{2}+\frac{1}{2}\mathrm{sign}\left(\mathrm{Re}\left(d_k\right)\right),{\hat{m}}_{k+L}=\frac{1}{2}+\frac{1}{2}\mathrm{sign}\left(\mathrm{Im}\left({\hat{d}}_k\right)\right),k\in \left[D\right].& \left(72\right)\end{array}$

(206) To encode with enough pilots, knowledge of the maximal CIR length at the transmitter is typically required. If the pilot signal is too short (P<L), it is impossible to estimate exactly the channel, even in the noiseless case. As can be seen in FIG. 15 a scenario, where the transmitter assumes blindly a CIR length {circumflex over (L)}=16 (dashed yellow) by using P=16 pilots and D=16 QPSK data symbols (32 bits), where the receiver knows the true CIR length and will consider all N=P+D+L−1 taps. Here, the target BER=0.1 can not be achieved if the true channel length at the transmitter s underestimated (pictured by vertical lines), whereas BMOCZ only suffers slightly from increased CIR length.

Multiple Receive Antennas

(207) While the discussion and simulations described above have largely considered the case of a single transmitter and a single transmitter. Communications that include MOZ schemes can incorporate multiple transmitters and/or multiple receivers in accordance with various embodiments of the invention. If the receiver has M antennas, receive antenna diversity can be exploited, since each antenna will receive the MOCZ symbol over an independent channel realization (best case).

(208) Due to the short wavelength in the mmWave band large antenna arrays can be easily installed on small devices. The DiZeT decoder and channel estimation techniques described above can be implemented in a straight forward single-input-multiple-output SIMO antenna system. A number of simulations of such a SIMO system are presented below and it is assumed in these simulations that: The B information bits m∈ are drawn uniformly. All signals arrive with the same timing-offset τ.sub.0 at the receive antennas. (dense antenna array, fixed relative antenna positions (no movements)) The maximal CIR length L, sparsity level S, and PDP p are the same for all antennas. Each received signal experience an independent noise and channel realization, with random Sparsity pattern s.sub.m∈{0, 1}.sup.L with |supp(s.sub.m)|=S CIR h.sub.m∈ where h.sub.m,l=C(0, s.sub.m,lp.sup.l) for l∈[L].

(209) Although the present invention has been described in certain specific aspects, many additional modifications and variations would be apparent to those skilled in the art. It is therefore to be understood that the present invention can be practiced otherwise than specifically described including communication systems that are SISO, SIMO, MIMO, massively MIMO, and/or that employ binary MOZ, binary MOCZ, M-ary MOZ, and/or M-ary MOCZ. Thus, embodiments of the present invention should be considered in all respects as illustrative and not restrictive. Accordingly, the scope of the invention should be determined not by the embodiments illustrated, but by the appended claims and their equivalents.