# Patent

## Title
QLM demodulation

## Abstract

A method for deriving a bound on communications capacity with ideal quadrature layered communications QLM and a set of demodulation algorithms for QLM. Communications links using QLM can approximate this bound and support higher data rates than allowed by the Shannon bound. Demodulation algorithms can be grouped into symbol algorithms and bit algorithms. Bit algorithms support higher data rates than symbol algorithms with lower computational complexities at the expense of demodulation loss which can be reduced with bit correlation error correction decoding which is orthogonal to the channel error correction decoding. Representative symbol and bit implementation algorithms are derived. Modulation performance is compared with phase-shift-keying PSK and quadrature amplitude modulation QAM. The invention describes how QLM can be used with PSK, QAM and with gaussian minimum shift keying GMSK, orthogonal frequency division multiple access OFDMA, code division multiple access CDMA, and wavelet division multiple access WDMA.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This patent application is a continuation in part of application Ser. Nos. 10/826,118 filed on Apr. 16, 2004, now U.S. Pat. No. 7,006,830, 10/266,256 filed on Oct. 8, 2002, now U.S. Pat. No. 7,391,819 and application Ser. No. 10/772,597 filed on Feb. 6, 2004 now U.S. Pat. No. 7,337,383.


U.S. PATENT DOCUMENTS














U.S.-9.826,117
October 2007
von der Embse, U. A.


U.S. Pat. No. 7,010,048
March 2006
Shattil, Stephen J.


U.S.-6-856,652
February 2006
West et. al.


U.S.-2002/0176486
November 2002
Okubo, et. al.


U.S.-2002/0101936
August 2002
Wright et. al.


U.S.-2002/0031189
March 2002
Hiben et. al.


U.S. Pat. No. 6,804,307
October 2004
Popović, Branislav SE


U.S. Pat. No. 6,798,737
September 2004
Dabak et. al.


U.S. Pat. No. 6,731,618
May 2004
Chung et. al.


U.S. Pat. No. 6,731,668
May 2004
John Ketchum


U.S. Pat. No. 6,728,517
April 2004
Sugar et. al.


U.S. Pat. No. 6,711,528
March 2004
Dishman et. al.


U.S. Pat. No. 6,687,492
February 2004
Sugar et. al.


U.S. Pat. No. 6,674,712
January 2004
Yang et. al.


U.S. Pat. No. 6,647,078
November 2003
Thomas et. al.


U.S. Pat. No. 6,636,568
October 2003
Tamer Kadous


U.S. Pat. No. 6,504,506
January 2003
Thomas et. al.


U.S. Pat. No. 6,426,723
July 2003
Smith et. al.









U.S. PATENT APPLICATIONS














U.S. application Ser. No. 10/772,597
February 2004
von der Embse, U. A.


U.S. application Ser. No. 10/266,256
October 2002
von der Embse, U. A.


U.S. application Ser. No. 09/846,410
February 2001
von der Embse, U. A.


U.S. application Ser. No. 09/826,118
January 2001
von der Embse, U. A.









OTHER PUBLICATIONS


    C. Heegard and S. B. Wicker's book “Turbo Coding”, Kluwer Academic Publishers 1999
    B. Vucetic and J. Yuan's book “Turbo Codes”, Kluwer Academic Publishers 2000
    J. G. Proakis's book “Digital Communications”. McGraw Hill, Inc. 1995
    L. Hanzo, C. H. Wong, M. S. Lee's book “Adaptive Wireless Transceivers”, John Wiley & Sons 2002
    C. E. Shannon “A Mathematical Theory of Communications”, Bell System Technical Journal, 27:379-423, 623-656, October 1948


BACKGROUND OF THE INVENTION
I. Field of the Invention
The present invention relates to the Shannon bound on communications capacity and also relates to symbol modulation and demodulation for high-data-rate wired, wireless, and optical communications and includes the symbol modulations phase-shift-keying PSK, quadrature amplitude modulation QAM, bandwidth efficient modulation BEM, gaussian minimum shift keying GMSK, pulse position modulation PPM, and the plurality of current and future modulations for single links and multiple access links which include time division multiple access TDMA, frequency division multiple access FDMA, code division multiple access CDMA, spatial division multiple access SDMA, frequency hopping FH, optical wavelength division multiple access WDMA, orthogonal Wavelet division multiple access OWDMA, combinations thereof, and the plurality of radar, optical, laser, spatial, temporal, sound, imaging, and media applications. Communication application examples include electrical and optical wired, mobile, point-to-point, point-to-multipoint, multipoint-to-multipoint, cellular, multiple-input multiple-output MIMO, and satellite communication networks.
II. Description of the Related Art
The Shannon bound is the Shannon capacity theorem for the maximum data rate C and equivalently can be restated as a bound on the corresponding number of modulation bits per symbol as well as a bound on the communications efficiency and is complemented by the Shannon coding theorem. From Shannon's paper “A Mathematical Theory of Communications” Bell System Technical Journal, 27:379-423, 623-656, October 1948 and B. Vucetic and J. Yuan's book “Turbo Codes”, Kluwer Academic Publishers 2000, the Shannon (Shannon-Hartley theorem) capacity theorem, the corresponding Shannon bound on the information bits b per symbol, the Shannon bound on the communications efficiency η, and the Shannon coding theorem can be written as equations (1).




  
    
      
        
          
            
              Shannon
              ⁢
              
                
              
              ⁢
              bounds
              ⁢
              
                
              
              ⁢
              and
              ⁢
              
                
              
              ⁢
              coding
              ⁢
              
                
              
              ⁢
              theorem
            
            ⁢
            
              
            
            ⁢
            
              

            
            ⁢
            
              1.
              ⁢
              
                
              
              ⁢
              Shannon
              ⁢
              
                
              
              ⁢
              capacity
              ⁢
              
                
              
              ⁢
              theorem
            
            ⁢
            
              

            
            ⁢
            
              
            
            ⁢
            
              
                
                  
                    C
                    =
                    
                    ⁢
                    
                      B
                      ⁢
                      
                        
                      
                      ⁢
                      
                        
                          log
                          2
                        
                        ⁡
                        
                          (
                          
                            1
                            +
                            
                              S
                              /
                              N
                            
                          
                          )
                        
                      
                    
                  
                
              
              
                
                  
                    
                      =
                      
                      ⁢
                      
                        
                          Channel
                          ⁢
                          
                            
                          
                          ⁢
                          capacity
                          ⁢
                          
                            
                          
                          ⁢
                          in
                          ⁢
                          
                            
                          
                          ⁢
                          bits
                          ⁢
                          
                            /
                          
                          ⁢
                          second
                        
                        =
                        
                          Bps
                          ⁢
                          
                            
                          
                          ⁢
                          for
                          ⁢
                          
                            
                          
                          ⁢
                          an
                        
                      
                    
                    ⁢
                    
                      
                    
                  
                
              
              
                
                  
                    
                    ⁢
                    
                      additive
                      ⁢
                      
                        
                      
                      ⁢
                      white
                      ⁢
                      
                        
                      
                      ⁢
                      Gaussian
                      ⁢
                      
                        
                      
                      ⁢
                      noise
                      ⁢
                      
                        
                      
                      ⁢
                      A
                      ⁢
                      
                        
                      
                      ⁢
                      W
                      ⁢
                      
                        
                      
                      ⁢
                      G
                      ⁢
                      
                        
                      
                      ⁢
                      N
                      ⁢
                      
                        
                      
                      ⁢
                      channel
                    
                  
                
              
              
                
                  
                    
                    ⁢
                    
                      with
                      ⁢
                      
                        
                      
                      ⁢
                      bandwidth
                      ⁢
                      
                        
                      
                      ⁢
                      B
                      ⁢
                      
                        
                      
                      ⁢
                      wherein
                      ⁢
                      
                        
                      
                      ⁢
                      
                        “
                        
                          log
                          2
                        
                        ”
                      
                      ⁢
                      
                        
                      
                      ⁢
                      is
                      ⁢
                      
                        
                      
                      ⁢
                      the
                    
                    ⁢
                    
                      
                    
                  
                
              
              
                
                  
                    
                    ⁢
                    
                      logarithm
                      ⁢
                      
                        
                      
                      ⁢
                      to
                      ⁢
                      
                        
                      
                      ⁢
                      the
                      ⁢
                      
                        
                      
                      ⁢
                      base
                      ⁢
                      
                        
                      
                      ⁢
                      2
                    
                  
                
              
              
                
                  
                    =
                    
                    ⁢
                    
                      Maximum
                      ⁢
                      
                        
                      
                      ⁢
                      rate
                      ⁢
                      
                        
                      
                      ⁢
                      at
                      ⁢
                      
                        
                      
                      ⁢
                      which
                      ⁢
                      
                        
                      
                      ⁢
                      information
                      ⁢
                      
                        
                      
                      ⁢
                      can
                      ⁢
                      
                        
                      
                      ⁢
                      be
                    
                  
                
              
              
                
                  
                    
                    ⁢
                    
                      reliably
                      ⁢
                      
                        
                      
                      ⁢
                      transmitted
                      ⁢
                      
                        
                      
                      ⁢
                      over
                      ⁢
                      
                        
                      
                      ⁢
                      a
                      ⁢
                      
                        
                      
                      ⁢
                      noisy
                      ⁢
                      
                        
                      
                      ⁢
                      channel
                    
                    ⁢
                    
                      
                    
                  
                
              
              
                
                  
                    
                    ⁢
                    
                      where
                      ⁢
                      
                        
                      
                      ⁢
                      
                        S
                        /
                        N
                      
                      ⁢
                      
                        
                      
                      ⁢
                      is
                      ⁢
                      
                        
                      
                      ⁢
                      the
                      ⁢
                      
                        
                      
                      ⁢
                      
                         signal-to-noise
                      
                      ⁢
                      
                        
                      
                      ⁢
                      ratio
                      ⁢
                      
                        
                      
                      ⁢
                      in
                      ⁢
                      
                        
                      
                      ⁢
                      B
                    
                  
                
              
            
          
          ⁢
          
            

          
          ⁢
          
            
              2.
              ⁢
              
                
              
              ⁢
              Shannon
              ⁢
              
                
              
              ⁢
              bound
              ⁢
              
                
              
              ⁢
              on
              ⁢
              
                
              
              ⁢
              b
            
            ,
            η
            ,
            
              and
              ⁢
              
                
              
              ⁢
              
                
                  E
                  b
                
                /
                
                  N
                  o
                
              
            
          
          ⁢
          
            

          
          ⁢
          
            
              
                
                  
                    
                  
                  ⁢
                  
                    
                      max
                      ⁢
                      
                        {
                        b
                        }
                      
                    
                    =
                    
                    ⁢
                    
                      max
                      ⁢
                      
                        {
                        
                          C
                          /
                          B
                        
                        )
                      
                    
                  
                
              
            
            
              
                
                  =
                  
                  ⁢
                  
                    
                      log
                      2
                    
                    ⁡
                    
                      (
                      
                        1
                        +
                        
                          S
                          /
                          N
                        
                      
                      )
                    
                  
                
              
            
            
              
                
                  =
                  
                  ⁢
                  
                    max
                    ⁡
                    
                      (
                      η
                      )
                    
                  
                
              
            
            
              
                
                  
                    
                      E
                      b
                    
                    /
                    
                      N
                      o
                    
                  
                  =
                  
                  ⁢
                  
                    
                      
                        [
                        
                          
                            
                              2
                              ^
                              max
                            
                            ⁢
                            
                              {
                              b
                              }
                            
                          
                          -
                          1
                        
                        ]
                      
                      /
                      max
                    
                    ⁢
                    
                      {
                      b
                      }
                    
                  
                
              
            
          
          ⁢
          
            

          
          ⁢
          
            
          
          ⁢
          wherein
        
        ⁢
        
          

        
        ⁢
        
          
        
        ⁢
        
          
            b
            =
            
              C
              /
              B
            
          
          ,
          
            
          
          ⁢
          
            
              Bps
              ⁢
              
                /
              
              ⁢
              Hz
            
            =
            
              Bits
              ⁢
              
                /
              
              ⁢
              symbol
            
          
        
        ⁢
        
          

        
        ⁢
        
          
        
        ⁢
        
          
            η
            =
            
              
                b
                /
                
                  T
                  s
                
              
              ⁢
              B
            
          
          ,
          
            
          
          ⁢
          
            Bps
            ⁢
            
              /
            
            ⁢
            Hz
          
        
        ⁢
        
          

        
        ⁢
        
          
        
        ⁢
        
          
            T
            s
          
          =
          
            symbol
            ⁢
            
              
            
            ⁢
            interval
          
        
        ⁢
        
          

        
        ⁢
        
          3.
          ⁢
          
            
          
          ⁢
          Shannon
          ⁢
          
            
          
          ⁢
          coding
          ⁢
          
            
          
          ⁢
          theorem
          ⁢
          
            
          
          ⁢
          for
          ⁢
          
            
          
          ⁢
          the
          ⁢
          
            
          
          ⁢
          infomation
          ⁢
          
            
          
          ⁢
          bit
        
        ⁢
        
          

        
        ⁢
        
          
        
        ⁢
        
          rate
          ⁢
          
            
          
          ⁢
          
            R
            b
          
        
        ⁢
        
          

        
        ⁢
        
          
            
              
                
                  
                
                ⁢
                
                  
                    For
                    ⁢
                    
                      
                    
                    ⁢
                    
                      R
                      b
                    
                  
                  <
                  C
                
              
            
            
              
                
                  there
                  ⁢
                  
                    
                  
                  ⁢
                  exists
                  ⁢
                  
                    
                  
                  ⁢
                  codes
                  ⁢
                  
                    
                  
                  ⁢
                  which
                  ⁢
                  
                    
                  
                  ⁢
                  support
                
                ⁢
                
                  
                
              
            
          
          
            
              
                
              
            
            
              
                reliable
                ⁢
                
                  
                
                ⁢
                communications
              
            
          
          
            
              
                
                  
                
                ⁢
                
                  
                    For
                    ⁢
                    
                      
                    
                    ⁢
                    
                      R
                      b
                    
                  
                  >
                  C
                
              
            
            
              
                
                  there
                  ⁢
                  
                    
                  
                  ⁢
                  are
                  ⁢
                  
                    
                  
                  ⁢
                  no
                  ⁢
                  
                    
                  
                  ⁢
                  codes
                  ⁢
                  
                    
                  
                  ⁢
                  which
                  ⁢
                  
                    
                  
                  ⁢
                  support
                
                ⁢
                
                  
                
              
            
          
          
            
              
                
              
            
            
              
                reliable
                ⁢
                
                  
                
                ⁢
                communications
              
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




Using the assumption that the symbol rate 1/Ts is maximized which means 1/Ts=Nyquist rate=bandwidth B and is equivalent TsB=1, enables 1 in equations (1) defining C to be rewritten to calculate max{b} as a function of the signal-to-noise ratio S/N, and to calculate Eb/No which is the ratio of energy per information bit Eb to the noise power density No, as a function of the max{b} in 2 and wherein max{b} is the maximum value of the number of information bits per symbol b. Since the communications efficiency η=b/(TsB) in bits/sec/Hz it follows that maximum values of b and η are equal. The derivation of the equation for Eb/No uses the definition Eb/No=(S/N)/b in addition to 1 and 2. Reliable communications in the statement of the Shannon coding theorem 3 means an arbitrarily low bit error rate BER.
SUMMARY OF THE INVENTION
This invention introduces a bound on communications capacity that can be supported by a communications channel with frequency bandwidth B and signal-to-noise ratio S/N, a quadrature parallel-layered modulation QLM, and QLM demodulation algorithms. QLM is used to derive this bound and the QLM performance validates the bound by providing a modulation which becomes close to this bound with error correcting codes such as turbo codes. QLM is a layered topology for transmitting higher data rates than possible with each layer of communications and is implemented by transmitting each layer with a differentiating or equivalently a discriminating parameter which enables separation and decoding of each layer. Performance verification of a representative trellis demodulation algorithm is given for QLM modulation using PSK for each layer. Symbol demodulation algorithms primarily are maximum likelihood ML and trellis algorithms. Trellis algorithms provide the best demodulation performance at the cost of computational complexity. Suboptimal reduced-state iterative trellis demodulation algorithms help to reduce the computational complexity. A second category of demodulation algorithms are trellis bit algorithms which offer substantially lower complexity demodulation at the cost of a demodulation loss. This loss can be reduced with bit correlation error correction decoding which coding is orthogonal to the normal bit sequential error correction decoding of each communication channel.



BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS
The above-mentioned and other features, objects, design algorithms, and performance advantages of the present invention will become more apparent from the detailed description set forth below when taken in conjunction with the drawings and performance data wherein like reference characters and numerals denote like elements, and in which:
FIG. 1 calculates information bits b per symbol interval versus Eb/No for the new bound, Shannon bound, and for PSK, QAM at BER=1e−6 with turbo coding.
FIG. 2 calculates information bits b per symbol interval versus S/N=C/I for the new bound, Shannon bound, and for PSK, QAM at BER=1e−6 with turbo coding wherein C/I is the carrier power to interference power ratio in B.
FIG. 3 calculates the performance of QLM PSK and QLM QAM as Bps/Hz=Bits/(symbol Interval)=b vs. Eb/No.
FIG. 4 calculates the performance of QLM PSK and QLM QAM as Bps/Hz=Bits/(symbol Interval)=b vs. S/N=C/I.
FIG. 5 plots the ideal waveform in time and frequency, the correlation function of the waveform, and a QLM correlation function for np=4.
FIG. 6 plots a OWDMA Wavelet waveform in time, the Wavelet correlation function in time, and the ideal correlation function in time.
FIG. 7 plots a OFDMA DFT waveform in frequency, the DFT correlation function in frequency, and the ideal correlation function in frequency wherein DFT is the discrete fourier transform.
FIG. 8 illustrates the pulse waveform time offsets for QLM with np layers of communications.
FIG. 9A is a block diagram of a trellis symbol demodulation algorithm.
FIG. 9B is the flow diagram of the trellis symbol demodulation algorithm.
FIG. 9C is the continuation of the flow diagram of the trellis symbol demodulation algorithm.
FIG. 10 plots the measured bit error rate BER performance for the uncoded 4-PSK QLM with a np=2 layered QLM pulse waveform in FIG. 8 using the trellis demodulation algorithm in FIG. 9.
FIG. 11 is a block diagram of a QLM trellis symbol iterative demodulation algorithm.
FIG. 12 plots complexity metric performance of a trellis symbol demodulation algorithm vs. the information bits b.
FIG. 13 plots complexity metric performance of a trellis bit demodulation algorithm vs. the information bits b.
FIG. 14 illustrates decisioning manifolds for 8-PSK for the first two bits of the 3 bit 8-PSK data symbol.
FIG. 15 is a block diagram of a QLM trellis bit demodulation algorithm.
FIG. 16 is a block diagram of a QLM trellis bit iterative demodulation algorithm.
FIG. 17 is a representative transmitter implementation block diagram for OFDMA QLM.
FIG. 18 is a representative transmitter implementation block diagram for CDMA QLM.
FIG. 19 is a representative transmitter implementation block diagram for OWDMA QLM.
FIG. 20 is a representative receiver implementation block diagram for OFDMA QLM.
FIG. 21 is a representative receiver implementation block diagram for CDMA QLM.
FIG. 22 is a representative receiver implementation block diagram for OWDMA QLM.



DETAILED DESCRIPTION OF THE INVENTION
Quadrature parallel-layered modulation QLM is a new invention that increases the data rate supported by a channel by adding layers of independent communications channels or signals over the existing communications such that each layer can be uniquely separated and demodulated in the receiver. These layers of communications channels are parallel sets of communications channels occupying the same bandwidth B as the 1st layer which is the original set of communications channels occupying the bandwidth B. Layering of parallel channels or signals is not necessarily an addition of signals in the algebra of the real or complex field since for example for GMSK the layering is in the frequency domain of the FM signal.
The new bound on communications capacity recognizes that one can increase the average symbol rate from the Nyquist rate 1/Ts=B assumed in the Shannon bound in equations (1) to the value np/Ts=npB=npx(Nyquist Rate) with np layers of the communications or equivalently with the addition of (np−1) parallel communications channels with differing characteristics which make them separable and recoverable in the receiver with implementation of a trellis type demodulation algorithm or the equivalent in terms of capabilities and performance where “equivalent” includes the plurality of all possible mathematical techniques to provide alternative solutions compared to the broad class of trellis algorithms. Note that “×” is the multiplication symbol for “times”. In this patent disclosure the term “separable” is intended to mean there is a differentiating parameter or equivalently a discriminating parameter which allows the np layers or equivalently channels to be uniquely recoverable.
The capacity bound and coding theorem in equations (5) are derived for convenience using time as the differentiating parameter without restrictions on the differentiating parameter. Step 1 in the derivation observes a suitably constructed trellis algorithm will successfully invert the transmitted layers 1, . . . , np of communications channels for QLM to recover estimates of the transmitted symbols when the layers are time synchronized for transmission at Ts/np2Ts/np, . . . , (np−1)Ts/np offsets respectively for layers 2,3, . . . , (np−1) relative to the 1st layer at zero offset corresponding to transmitting symbols at ΔTs intervals with ΔTs=Ts/np. Maximum capacity for each layer is equal to the Shannon bound in 1 in equations (2) which is the Shannon bound in 2 in equations (1) with b, S/N replaced by bp, (S/N)p for each layer with the subscript “p” referring to each communications layer. Maximum capacity b in 2 in equations (2) for the np layers is the product of np and bp 
Step 1

1 max{bp}=log2[1+(S/N)p]

2. b=np log2[1+(S/N)p]  (2)

where b=npbp=Bps/Hz=Bits/(Symbol Interval) is the number of bits over a Ts interval, (S/N)p=S/N per symbol in each of the parallel-layered communications sets of channels, and the maximum label for b has been removed since there is a dependency on both np and (S/N)p which must be defined in order to transform this equation into a maximum for b.

Step 2 observes the communications layers will equally share in the transmitted S/N and the signal power available for demodulation in each layer is equal to the signal power in each layer over the separation interval ΔTs. This means for demodulation, each layer receives the signal power over the fraction ΔTs=Ts/np of the symbol interval Ts and np(S/N)p=(S/N)s is equal to the signal to noise ratio (S/N)s over Ts for each layer in 1 in equations (3). The total S/N over Ts is the sum of the (S/N)s for each layer which yields 2 in equations (3).
Step 2

1 np(S/N)p=(S/N)s

2 S/N=(np^2)(S/N)p  (3)

Results of steps 1 and 2 are used to derive the Eb/No from the value (Eb/No)p in each layer. Substituting the identities S/N=bEb/No, (S/N)p=bp(Eb/No)p, and b=npbp into 2 in equations (3) yields equation (4).

Eb/No=np (Eb/No)p  (4)

Equations (2) and (3) for step 1 and step 2 respectively can be combined with the identity S/N=bEb/No to yield the equations (5) for the new bounds on C, max{b}, and max{η} as a function of S/N, Eb/No and for the minimum Eb/No written as min{Eb/N0} as a function of b wherein the optimization is over the number of communications layers np.
Upper bounds for b and η defined in 2 in equations (5) are derived from 2 in equations (2), 2 in equations (3), and the identities S/N=bEb/No and max(η}=max{b} in the form of a maximum with respect to the selection of the parameter np for fixed values of S/N in the first expression and in the second for fixed values of Eb/No with an interactive evaluation of b from the first expression.
Upper bound for C in 1 in equations (5) is derived from the capacity equation for max{b} in 2 in equations (2) and the identities b=C/B and S/N=bEb/No in the form of an upper bound on C with respect to the selection of the parameter np for fixed values of S/N in the first expression and in the second for fixed values of Eb/No with an interactive evaluation of b from 2.
Lower bound on Eb/No which is the minimum value min{Eb/No} in 3 in equations (5) is derived by solving the second expression in 2 and taking the minimum over all allowable values of np.
The new coding theorem in 4 in equations (5) states that C is the upper bound on the information data rate Rb in bits/second for which error correcting codes exist to provide reliable communications with an arbitrarily low bit error rate BER where C is defined in 1 in equations (5) and upgrades the Shannon coding theorem 3 in equatios (1) using new capacity bound C in 1 in equations (5) and introduces the new data symbol rate 5 whose maximum value max{np/Ts} is np times the Nyquist rate for a bandwidth B.




  
    
      
        
          
            
              New
              ⁢
              
                
              
              ⁢
              capacity
              ⁢
              
                
              
              ⁢
              bounds
              ⁢
              
                
              
              ⁢
              and
              ⁢
              
                
              
              ⁢
              coding
              ⁢
              
                
              
              ⁢
              theorem
            
            ⁢
            
              

            
            ⁢
            
              1.
              ⁢
              
                
              
              ⁢
              
                
                  
                    
                      C
                      =
                      
                        max
                        ⁢
                        
                          {
                          
                            
                              n
                              p
                            
                            ⁢
                            B
                            ⁢
                            
                              
                            
                            ⁢
                            
                              
                                log
                                2
                              
                              ⁡
                              
                                [
                                
                                  1
                                  +
                                  
                                    
                                      (
                                      
                                        S
                                        /
                                        N
                                      
                                      )
                                    
                                    /
                                    
                                      
                                        n
                                        p
                                      
                                      ^
                                      2
                                    
                                  
                                
                                ]
                              
                            
                          
                          }
                        
                      
                    
                  
                
                
                  
                    
                      =
                      
                        max
                        ⁢
                        
                          {
                          
                            
                              n
                              p
                            
                            ⁢
                            B
                            ⁢
                            
                              
                            
                            ⁢
                            
                              
                                log
                                2
                              
                              ⁡
                              
                                [
                                
                                  1
                                  +
                                  
                                    
                                      (
                                      
                                        
                                          bE
                                          b
                                        
                                        /
                                        
                                          N
                                          o
                                        
                                      
                                      )
                                    
                                    /
                                    
                                      
                                        n
                                        p
                                      
                                      ^
                                      2
                                    
                                  
                                
                                ]
                              
                            
                          
                          }
                        
                      
                    
                  
                
              
            
            ⁢
            
              

            
            ⁢
            
              2.
              ⁢
              
                
              
              ⁢
              
                
                  
                    
                      
                        
                      
                      ⁢
                      
                        
                          max
                          ⁢
                          
                            {
                            b
                            }
                          
                        
                        =
                        
                          max
                          ⁢
                          
                            {
                            
                              
                                n
                                p
                              
                              ⁢
                              
                                
                                  log
                                  2
                                
                                ⁡
                                
                                  [
                                  
                                    1
                                    +
                                    
                                      
                                        (
                                        
                                          S
                                          /
                                          N
                                        
                                        )
                                      
                                      /
                                      
                                        
                                          n
                                          p
                                        
                                        ^
                                        2
                                      
                                    
                                  
                                  ]
                                
                              
                            
                            }
                          
                        
                      
                    
                  
                
                
                  
                    
                      =
                      
                        max
                        ⁢
                        
                          {
                          
                            
                              n
                              p
                            
                            ⁢
                            
                              
                                log
                                2
                              
                              ⁡
                              
                                [
                                
                                  1
                                  +
                                  
                                    
                                      (
                                      
                                        
                                          bE
                                          b
                                        
                                        /
                                        
                                          N
                                          o
                                        
                                      
                                      )
                                    
                                    /
                                    
                                      
                                        n
                                        p
                                      
                                      ^
                                      2
                                    
                                  
                                
                                ]
                              
                            
                          
                          }
                        
                      
                    
                  
                
                
                  
                    
                      =
                      
                        max
                        ⁢
                        
                          {
                          η
                          }
                        
                      
                    
                  
                
              
            
            ⁢
            
              

            
            ⁢
            
              
                3.
                ⁢
                
                  
                
                ⁢
                min
                ⁢
                
                  {
                  
                    
                      E
                      b
                    
                    /
                    
                      N
                      o
                    
                  
                  }
                
              
              =
              
                min
                ⁢
                
                  {
                  
                    
                      
                        
                          [
                          
                            
                              
                                n
                                p
                              
                              ^
                              2
                            
                            /
                            b
                          
                          ]
                        
                        [
                        
                          2
                          ^
                          b
                        
                        }
                      
                      /
                      
                        n
                        p
                      
                    
                    -
                    1
                  
                  ]
                
              
            
          
          }
        
        ⁢
        
          

        
        ⁢
        
          4.
          ⁢
          
            
          
          ⁢
          New
          ⁢
          
            
          
          ⁢
          coding
          ⁢
          
            
          
          ⁢
          theorem
        
        ⁢
        
          

        
        ⁢
        
          
        
        ⁢
        
          
            
              
                
                  For
                  ⁢
                  
                    
                  
                  ⁢
                  
                    R
                    b
                  
                
                <
                C
              
            
            
              
                
                  there
                  ⁢
                  
                    
                  
                  ⁢
                  exists
                  ⁢
                  
                    
                  
                  ⁢
                  codes
                  ⁢
                  
                    
                  
                  ⁢
                  which
                  ⁢
                  
                    
                  
                  ⁢
                  support
                
                ⁢
                
                  
                
              
            
          
          
            
              
                
              
            
            
              
                reliable
                ⁢
                
                  
                
                ⁢
                communications
              
            
          
          
            
              
                
                  For
                  ⁢
                  
                    
                  
                  ⁢
                  
                    R
                    b
                  
                
                >
                C
              
            
            
              
                
                  there
                  ⁢
                  
                    
                  
                  ⁢
                  are
                  ⁢
                  
                    
                  
                  ⁢
                  no
                  ⁢
                  
                    
                  
                  ⁢
                  codes
                  ⁢
                  
                    
                  
                  ⁢
                  which
                  ⁢
                  
                    
                  
                  ⁢
                  support
                
                ⁢
                
                  
                
              
            
          
          
            
              
                
              
            
            
              
                reliable
                ⁢
                
                  
                
                ⁢
                communications
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          5.
          ⁢
          
            
          
          ⁢
          New
          ⁢
          
            
          
          ⁢
          symbol
          ⁢
          
            
          
          ⁢
          rate
          ⁢
          
            
          
          ⁢
          
            
              n
              p
            
            /
            
              T
              s
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            
              
                
                  
                
                ⁢
                
                  
                    max
                    ⁢
                    
                      {
                      
                        
                          n
                          p
                        
                        /
                        
                          T
                          s
                        
                      
                      }
                    
                  
                  =
                  
                    
                      n
                      p
                    
                    ⁢
                    B
                    ⁢
                    
                      
                    
                    ⁢
                    for
                    ⁢
                    
                      
                        
                      
                      ⁢
                      
                        
                      
                    
                    ⁢
                    
                      n
                      p
                    
                    ⁢
                    
                      
                    
                    ⁢
                    layers
                    ⁢
                    
                      
                    
                    ⁢
                    of
                    ⁢
                    
                      
                    
                    ⁢
                    communications
                  
                
              
            
          
          
            
              
                =
                
                  
                    n
                    p
                  
                  ⁢
                  x
                  ⁢
                  
                    
                  
                  ⁢
                  
                    (
                    
                      Nyquist
                      ⁢
                      
                        
                      
                      ⁢
                      rate
                    
                    )
                  
                
              
            
          
        
      
    
    
      
        (
        5
        )
      
    
  




FIG. 1,2 calculate the Shannon bound 63,68, the new bound 62,67, the quadrature amplitude QAM and phase shift keying PSK turbo coded performance, and the QLM performance example from equations (6). The new bound is from equations (4),(5) and the Shannon bound from equations (1) wherein the units for b are Bps/Hz=bits/(symbol interval) consistent with the Shannon bound where “symbol interval” refers to the Ts interval The turbo coded PSK 65,70 and turbo coded QAM 66,71 plot the number of information bits per symbol b versus measured S/N and Eb/No for 4-PSK, 8-PSK, 16-QAM, 64-QAM, 256-QAM, 4096-QAM. The 4-PSK, 8-PSK are 4-phase, 8-phase phase shift keying modulations which respectively encode 2,3 bits per symbol and 16-QAM, 64-QAM, 256-QAM, 1024-QAM are 16,64, 256, 4096 state QAM modulations which respectively encode 4,6,8,12 bits. For no coding the information bits per symbol b is equal to the modulation bits per symbol bs so that b=bs=2,3,4,6,8,12 bits per symbol respectively for 4-PSK, 8-PSK, 16-QAM, 64-QAM, 256-QAM, 4096-QAM. Turbo coding performance assumes a modest 4 state recursive systematic convolutional code RSC, 1024 bit interleaver, and 4 turbo decoding iterations. The assumed coding rates R=3/4, 2/3, 3/4, 2/3, 3/4, 2/3 reduce the information bits per symbol to the respective values b=1.5,2,3,4,6,8 bits. Performance data is from C. Heegard and S. B. Wicker's book “Turbo Coding”, Kluwer Academic Publishers 1999, B. Vucetic and J. Yuan's book “Turbo Codes”, Kluwer Academic Publishers 2000, J. G. Proakis's book “Digital Communications”, McGraw Hill, Inc. 1995, and L. Hanzo, C. H. Wong, M. S. Lee's book “Adaptive Wireless Transceivers”, John Wiley & Sons 2002.
FIG. 1,2 calculate the coded QLM performance 64,69 using equations (6) for QLM PSK (which reads “QLM modulation using PSK data symbol modulation”) using the scaling laws for Eb/No=np (Eb/No)p in equations (4) and for S/N=(np^2) (S/N)p in 2 in equations (3). In 1 examples of QLM PSK for 4,8-PSK are given for b=3,4,6,8,12,16 bits per symbol interval as functions of bs=2,3 uncoded bits per data symbol for 4,8-PSK, QLM layers np=2,4,8, and coding rate R=(information bits/data bits)=2/3,3/4. It is well known that the most bandwidth efficient coding for 4,8-PSK use R=3/4,2/3 in 1. In 2 the corresponding values of Eb/No=3.0,4.1 dB for 4,8-PSK at BER=1e−6 are from the turbo coding data in FIG. 1, 2. In 3 the Eb/No for np layers is calculated from the measured values for the 1st or ground layer in 2 using equations (3). In 4 the S/N is calculated as a function of the Eb/No in 3,4 and the b in 1. It should be clear that the combinations of parameters bs,np,R in 1 in equations (6) are a limited subset of possible values. The selected subset is intended to illustrate the principles, algorithms, implementation, and performance, and is not necessarily the preferred subset for overall performance.

















QLM PSK performance
(6)





1 Information bits b per symbol




























  
    
      
        P
        ⁢
        
          
        
        ⁢
        S
        ⁢
        
          
        
        ⁢
        K
      
    
    
      
        
          b
          s
        
        ×
        
          n
          p
        
        ×
        R
      
    
    
      =
    
    
      b
    
  
  
    
      
        4-PSK
      
    
    
      
        2
        ×
        2
        ×
        
          3
          /
          4
        
      
    
    
      =
    
    
      3
    
  
  
    
      
        8-PSK
      
    
    
      
        3
        ×
        2
        ×
        
          2
          /
          3
        
      
    
    
      =
    
    
      4
    
  
  
    
      
        4-PSK
      
    
    
      
        2
        ×
        4
        ×
        
          3
          /
          4
        
      
    
    
      =
    
    
      6
    
  
  
    
      
        8-PSK
      
    
    
      
        3
        ×
        4
        ×
        
          2
          /
          3
        
      
    
    
      =
    
    
      8
    
  
  
    
      
        4-PSK
      
    
    
      
        2
        ×
        8
        ×
        
          3
          /
          4
        
      
    
    
      =
    
    
      12
    
  
  
    
      
        8-PSK
      
    
    
      
        3
        ×
        8
        ×
        
          2
          /
          3
        
      
    
    
      =
    
    
      16
    
  
















    2 PSK turbo coding measurements
    
        4-PSK Eb/No=3.0 dB
        
            for turbo coding, rate R=3/4, BER=1e−6
        
        
        8-PSK Eb/No=4.1 dB
        
            for turbo coding, rate R=2/3, BER=1e−6
        
        
    
    
    3 Eb/No estimates
    
        4-PSK Eb/No=3.0+10 log10(np) dB
        8-PSK Eb/No=4.1+10 log10(np) dB
    
    
    4 S/N estimates
    
        S/N=Eb/No+10 log10(b), dB
    
    


FIG. 3,4 calculate some of the available options for supporting b=Bps/Hz=bits/(symbol interval) performance to 12 Bps/Hz using the scaling laws for Eb/No=np (Eb/No)p in equations (4), the scaling laws for S/N=(np^2)(S/N)p in equations (3), the QLM bound, and the 4-PSK, 8-PSk, 16-QAM, 64-QAM, 256-QAM modulations. FIG. 3 calculates the QLM bound in 24, the QLM 4-PSK b vs. Eb/No in 25 for np=1,2,4,8, the QLM 8-PSK b vs. Eb/No in 26 for np=1,2,4,6 in 26, and the QLM 16-QAM, 64-QAM, 256-QAM b vs. Eb/No for np=1,2,4, np=1,2,3, np=1,2, respectively in 27, 28, 29. FIG. 4 calculates the QLM bound in 30 and these modulations for b vs. S/N=C/I for 4-PSK in 31, 8-PSK in 32, 16-QAM in 33, 64-QAM in 34, and 256-QAM I 35. To achieve b=12 Bps/Hz=Bits/(symbol length) the QLM 4-PSK, 8-PSK, 16-QAM, 64-QAM, 256-QAM require successively fewer layers of communications np=8,6,4,3,2 with attendant successively higher values for the required Eb/No and S/N=C/I.
Demodulation algorithms for QLM implement the steps in the signal processing (7):
QLM Demodulation Signal Processing (7)

    
    
        step 1 detects the received QLM signal to remove the waveform and recover the stream of correlated transmitted data symbols at the rate np/Ts=npB data symbols per second,
        step 2 processes this stream of correlated data symbols to recover estimates of the data symbols for each of the np communication channels or sets of channels or layers, and
        step 3 converts the data symbol stream for each channel or each set of channels to a data bit stream and implements error correction decoding of the data bit stream to recover estimates of the transmitted data bits.
    
    


In step 2 the ability of the demodulation algorithms to recover the transmitted data symbols from the received QLM communications signal depends on the correlation (auto-correlation) function being well-behaved. A correlation function of a discriminating parameter or equivalently a differentiating parameter such as time offset or frequency offset enables the QLM layers to be demodulated to recover the transmitted data symbols. Plots of representative correlation functions in time and frequency offsets are given in FIG. 5,6,7. The correlations in FIG. 5,6,7 are used to implement step 2 of the demodulation signal processing (7) since their symmetry property makes these correlations equal to convolutions of the waveforms with their stored replicas which is a requirement in step 2 of the demodulation signal processing (7).
FIG. 5 presents an ideal impulse response waveform (pulse waveform) in both time and frequency and the corresponding correlation in time and frequency. In time 12 the ideal impulse response 10 waveform 11 extends over the data symbol Ts second interval 13 and has a correlation function 14 in time 15 with a triangular mainlobe 16 extending over 2Ts seconds 18 with zero sidelobes 17. This waveform is the ideal pulse waveform in FIG. 8. In frequency 12 the ideal impulse response 10 waveform 11 extends over the frequency interval B Hz 13 and has a correlation function 14 in frequency 15 with a triangular mainlobe 16 extending over 2B Hz 18 with zero sidelobes 17. The correlation function for the pulse waveform in FIG. 8 for np=4 is overlayed on the triangular correlation function as a set of circles 19 on the mainlobe and on the sidelobes 17. It is observed there are 2np−1=2×4−1=7 correlation values in the mainlobe.
FIG. 6 presents a Wavelet waveform in patent application 09/826,118 for OWDMA in time, the correlation function, and an ideal correlation function in time. The correlation function closely approximates the waveform and the ideal triangular correlation closely approximates the mainlobe and has a mainlobe 20 extending over 2Ts second interval with low sidelobes 21.
FIG. 7 presents a N=64 point discrete fourier transform DFT for OFDMA in frequency, the correlation function, and an ideal correlation function in frequency. The correlation function closely approximates the waveform and the ideal triangular correlation closely approximates the mainlobe and has a mainlobe extending over 2B=2/Ts Hz interval with low sidelobes 23 wherein the symbol rate 1/Ts is at the Nyquist rate and equal to the bandwidth B for each channel.
FIG. 8 defines the QLM modulation for an ideal pulse modulation with timing offset as the differentiating parameter between the QLM layers and whose waveform and correlation function are defined in FIG. 5. The reference pulse 33 pi=pi(t) defined over time 34 t is 35 Ts seconds long and normalized with amplitude 36 1/Ts. Starting time 37 is t=i1Ts and ending time 38 is Ts seconds later. Indexing convention is a pulse i has no offset relative to the reference time, pulse i+1 41 has a ΔAs offset 37, pulse i−1 43 has a −ΔTs offset 37, and this convention applies to all i. Symbol modulation 39 Ae^(jΦi) when multiplied by the pulse amplitude 36 1/√{square root over (Ts)} is the complex envelope of the pulse waveform. Consecutive pulses are spaced at 40 ΔTs=Ts/np second intervals. Also shown are the consecutive later pulse 41 and the continuation 42, and the earlier pulses 43 and 44 and the continuation 45. Starting times for these additional pulses are given in 37. This QLM architecture has a pulse overlap of nearest neighbor pulses with a corresponding correlation between these pulses given in FIG. 5 for np=4 pulses or layers.
Step 2 demodulation algorithms are grouped into maximum likelihood ML symbol algorithms, trellis symbol algorithms, and trellis bit algorithms. Trellis symbol algorithms are trellis algorithms over the correlated data symbol fields and use ML, maximum a-posteriori MAP, or other decisioning metrics. Trellis bit algorithms are trellis algorithms over the data symbol correlated bit fields. MAP decisioning metrics have been introduced in patent application Ser. No. 10/772,597 for trellis and convolutional decoding using trellis algorithms. This classification of demodulation algorithms is introduced to illustrate representative methods for constructing demodulation algorithms and is not a limitation on the scope of this invention which encompasses all possible demodulation algorithms for QLM.
For step 2 consider a ML symbol detection algorithm using a block algorithm approach with the pulse waveform in FIG. 8. Demodulation for QLM implements signal detection in step 1 to remove the waveform and recover estimates of the transmitted complex baseband signal in step 2 followed by signal decoding in step 3 to recover estimates of the transmitted data. The received pulse waveform is removed by a convolution of the received signal {circumflex over (z)}(t) with the complex conjugate of the transmitted pulse waveform and this receiver convolution generates the received Rx estimate Yi=Xi+ni of the transmitted Tx symbol wherein the received noise-free waveform after symbol detection is Xi=Σδi Zi+δi c(δi) equal to the correlated sum of the data symbols Zi+δi=Ai+δi e^(jφi+δi) with each data symbol encoded with the signal amplitude Ai and signal phase φi for PSK and QAM symbol encoding and where c(δi) is the correlation coefficient of the pulse waveform pi(t) in FIG. 5,8 over neighboring symbols at i+δi=i+/−1,i+/−2, . . . in FIG. 8 and by definition c(δi)=∫pi(t)pi+δi(t)dt which is normalized so that c(0)=1, and ni is the data symbol detection noise. Also, one can partition this integration into integrations over the pulse separations ΔT6 whereupon the symbol estimates {circumflex over (Z)}i have different values for the correlation coefficients c(δi). The signal detection correlation matrix R is constructed from the set of correlation coefficients {c(δi)} by the equation of definition R=[R(i,k)]=[c(k−i)] and is an n×n matrix for full symbol Ts integration and an (n+np−1)×(n+np−1) matrix for partial symbol ΔTs integration where n is the number of data symbols and the notation “n×n” reads “n by n”. Correlation coefficients for np=4 pulses are the values of the correlation function plotted in FIG. 5.
Equations (8) constructs a block length n=5, np=2 pulses, pulse length Ts example of the correlation matrix R for FIG. 8 for full symbol integration over the Ts pulse length specified by the parameter set Ts, n, np.




  
    
      
        
          
            Signal
            ⁢
            
              
            
            ⁢
            detection
            ⁢
            
              
            
            ⁢
            correlation
            ⁢
            
              
            
            ⁢
            matrix
          
          ⁢
          
            

          
          ⁢
          
            1.
            ⁢
            
              
            
            ⁢
            Correlation
            ⁢
            
              
            
            ⁢
            matrix
            ⁢
            
              
            
            ⁢
            R
            ⁢
            
              
            
            ⁢
            definition
          
          ⁢
          
            
          
          ⁢
          
            
          
          ⁢
          
            
              
                
                  
                    R
                    ⁡
                    
                      (
                      
                        i
                        ,
                        k
                      
                      )
                    
                  
                  =
                  
                  ⁢
                  
                    R
                    ⁡
                    
                      (
                      
                        row
                        ,
                        column
                      
                      )
                    
                  
                
              
            
            
              
                
                  =
                  
                  ⁢
                  
                    R
                    ⁡
                    
                      (
                      
                        output
                        ,
                        input
                      
                      )
                    
                  
                
              
            
            
              
                
                  =
                  
                  ⁢
                  
                    
                      [
                      
                        c
                        ⁡
                        
                          (
                          
                            δ
                            ⁢
                            
                              
                            
                            ⁢
                            i
                          
                          )
                        
                      
                      ]
                    
                    ⁢
                    
                      
                    
                    ⁢
                    matrix
                    ⁢
                    
                      
                    
                    ⁢
                    with
                    ⁢
                    
                      
                    
                    ⁢
                    elements
                    ⁢
                    
                      
                    
                    ⁢
                    
                      c
                      ⁡
                      
                        (
                        
                          δ
                          ⁢
                          
                            
                          
                          ⁢
                          i
                        
                        )
                      
                    
                  
                
              
            
            
              
                
                  =
                  
                  ⁢
                  
                    n
                    ×
                    n
                    ⁢
                    
                      
                    
                    ⁢
                    matrix
                    ⁢
                    
                      
                    
                    ⁢
                    for
                    ⁢
                    
                      
                    
                    ⁢
                    
                      T
                      s
                    
                    ⁢
                    
                      
                    
                    ⁢
                    integration
                  
                
              
            
            
              
                
                  =
                  
                  ⁢
                  
                    
                      (
                      
                        n
                        +
                        
                          n
                          p
                        
                        -
                        1
                      
                      )
                    
                    ×
                    
                      (
                      
                        n
                        +
                        
                          n
                          p
                        
                        -
                        1
                      
                      )
                    
                    ⁢
                    
                      
                    
                    ⁢
                    matrix
                  
                
              
            
            
              
                
                  
                    
                    ⁢
                    
                      
                    
                  
                  ⁢
                  
                    for
                    ⁢
                    
                      
                    
                    ⁢
                    Δ
                    ⁢
                    
                      
                    
                    ⁢
                    
                      T
                      s
                    
                    ⁢
                    
                      
                    
                    ⁢
                    integration
                  
                
              
            
          
          ⁢
          
            

          
          ⁢
          
            
              2.
              ⁢
              
                
              
              ⁢
              R
              ⁢
              
                
              
              ⁢
              for
              ⁢
              
                
              
              ⁢
              
                T
                s
              
            
            ,
            
              n
              =
              5
            
            ,
            
              
                n
                p
              
              =
              2
            
          
          ⁢
          
            

          
          ⁢
          
            
          
          ⁢
          
            R
            =
            
              [
              
                
                  
                    1
                  
                  
                    0.5
                  
                  
                    0
                  
                  
                    0
                  
                  
                    0
                  
                
                
                  
                    0.5
                  
                  
                    1
                  
                  
                    0.5
                  
                  
                    0
                  
                  
                    0
                  
                
                
                  
                    0
                  
                  
                    0.5
                  
                  
                    1
                  
                  
                    0.5
                  
                  
                    0
                  
                
                
                  
                    0
                  
                  
                    0
                  
                  
                    0.5
                  
                  
                    1
                  
                  
                    0.5
                  
                
                
                  
                    0
                  
                  
                    0
                  
                  
                    0
                  
                  
                    0.5
                  
                  
                    1
                  
                
              
              ]
            
          
        
        ⁢
        
          

        
      
    
    
      
        (
        8
        )
      
    
  




In equations (8) in 1 the data symbols for the array of n transmitted Tx pulses is the n×1 column vector Z with components {Zi} and where [(o)]′ is the transpose of [(o)]. In 2 components of the n×1 detected signal vector Y=[Y1, Y2, . . . , Yn]′ are equal to Yi=Xi+ni introduced in the previous. In 3 the matrix equation for Y is defined where R is the correlation matrix and U is the n×1 Rx noise vector. The definition E{UU′}=2σ2R enables the ML solution of 3 to be derived {circumflex over (Z)}=[R′(2σ2R)−1R]−1R(2σ2R)−1Y and simplified to the equivalent equation in 4 where {circumflex over (Z)} is the estimate of Z and σ is the one-sigma value of the Rx additive white Gaussian noise AWGN for each Rx detected data symbol.




  
    
      
        
          M
          ⁢
          
            
          
          ⁢
          L
          ⁢
          
            
          
          ⁢
          symbol
          ⁢
          
            
          
          ⁢
          detection
          ⁢
          
            
          
          ⁢
          for
          ⁢
          
            
          
          ⁢
          Q
          ⁢
          
            
          
          ⁢
          L
          ⁢
          
            
          
          ⁢
          M
        
        ⁢
        
          

        
        ⁢
        
          1.
          ⁢
          
            
          
          ⁢
          
            
              
                
                  Z
                  =
                  
                    
                      [
                      
                        
                          Z
                          i
                        
                        ,
                        
                          Z
                          2
                        
                        ,
                        
                          
                        
                        ⁢
                        ...
                        ⁢
                        
                          
                        
                        ,
                        
                          Z
                          n
                        
                      
                      ]
                    
                    ′
                  
                
              
            
            
              
                
                  =
                  
                    [
                    
                      
                        
                          A
                          1
                        
                        ⁢
                        
                          exp
                          ⁡
                          
                            (
                            
                              j
                              ⁢
                              
                                
                              
                              ⁢
                              
                                φ
                                1
                              
                            
                            )
                          
                        
                      
                      ,
                      
                        
                          A
                          2
                        
                        ⁢
                        
                          exp
                          ⁡
                          
                            (
                            
                              j
                              ⁢
                              
                                
                              
                              ⁢
                              
                                φ
                                2
                              
                            
                            )
                          
                        
                      
                      ,
                      
                        
                      
                      ⁢
                      ...
                      ⁢
                      
                        
                      
                      ,
                      
                        
                          A
                          n
                        
                        ⁢
                        
                          exp
                          ⁡
                          
                            (
                            
                              j
                              ⁢
                              
                                
                              
                              ⁢
                              
                                φ
                                n
                              
                            
                            )
                          
                        
                      
                    
                  
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            
              2.
              ⁢
              
                
              
              ⁢
              
                Y
                i
              
            
            =
            
              
                X
                i
              
              +
              
                
                  n
                  i
                
                ⁢
                
                  
                
                ⁢
                for
                ⁢
                
                  
                
                ⁢
                all
                ⁢
                
                  
                
                ⁢
                i
              
            
          
          ,
          
            
              X
              i
            
            =
            
              
                Σ
                
                  δ
                  ⁢
                  
                    
                  
                  ⁢
                  i
                
              
              ⁢
              
                Z
                
                  i
                  +
                  
                    δ
                    ⁢
                    
                      
                    
                    ⁢
                    I
                  
                
              
              ⁢
              
                c
                ⁡
                
                  (
                  
                    δ
                    ⁢
                    
                      
                    
                    ⁢
                    i
                  
                  )
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            3.
            ⁢
            
              
            
            ⁢
            Y
          
          =
          
            RZ
            +
            U
          
        
        ⁢
        
          

        
        ⁢
        
          
            4.
            ⁢
            
              
            
            ⁢
            
              Z
              ^
            
          
          =
          
            
              R
              
                -
                1
              
            
            ⁢
            Y
          
        
      
    
    
      
        (
        8
        )
      
    
  




A similar matrix inversion algorithm can be derived for the recovery of estimates {circumflex over (Z)} of the transmitted symbol set using the set of signal detection measurements over ΔTs.

For step 2 consider a trellis symbol algorithm in FIG. 9 using a ML decisioning metric or a MAP decisioning metric disclosed in patent application Ser. No. 10/772,597 or another decisioning metric. FIG. 9A is the top level block diagram of the trellis algorithm for a non-iterative application. Basic elements of the algorithm are the trellis parameters 170, trellis algorithm 171 structured by the parameter set in 170, and the trellis decoding algorithm 172. The trellis algorithm completes or partially completes trellis demodulation before handing off the data symbol estimates and metrics to the trellis decoding algorithm 172 or alternatively, interleaves the trellis error correction decoding 172 with trellis demodulation by accepting one or more data symbol estimates from the trellis algorithm for decoding before returning 173 to the trellis algorithm for processing the next data symbols. Decoding data estimates 174 are handed off to the receiver for further processing. The parameter set 170 is applicable to the ideal pulse modulation defined in FIG. 5,8 with time as the differentiating parameter as well as to the pulse waveforms in FIG. 6,7 and to other applications with other differentiating parameters. The correlation function in FIG. 5 for the pulse waveform in FIG. 8 has zero sidelobes which means only the mainlobe correlation has to be considered in the trellis algorithm. Mainlobe correlation values for np=4 are plotted in FIG. 5. It is sufficient to use a one-sided correlation function since the correlation is symmetrical about the origin whereupon the correlation vector C whose elements are the mainlobe correlation coefficients is observed to be equal to C=[c(0),c(1),c(2),c(3)]=[1,3/4,1/2,1/4] for np=4 where the correlation coefficients are c(0),c(1),c(2),c(3). Other trellis parameters are the number of data symbols n, number of parallel QLM channels np, number of data symbol states ns, and the number of trellis states nt=n3^(2np−2)=2^bs(2np−2) wherein ns=2^bs=4,8,16,64,356 for 4-PSK,8-PSK,16-QAM,64-QAM,256-QAM for the correlation function in FIG. 5.
FIG. 9B uses the trellis parameters 170 in the initialization 150 prior to the start k=0 with an empty shift register SR which normally contains the 2np−1 Rx correlated data symbols for the mainlobe plus the correlated symbols for the sidelobes for each of the possible trellis paths. At k=0 the path metric α0(xi) is set equal to a negative or zero initialization constant for all of the nodes xi=0,1,2, . . . , (ns^(2np−2)−1} of the trellis diagram where α0(xi) is the logarithm of the state S0 path metric at k=0 for node xi, ns is the number of states of the data symbol modulation, the Rx symbols are indexed over k with k=0 indicating the initial value prior to the Rx symbol k=1, nodes of the trellis diagram are the states of the SR, and state Sk refers to the trellis diagram paths and metrics at symbol k in the trellis algorithm. In the previous for ML block decoding the symbols were indexed over i.
Loop 151 processes the Rx symbols k=1,2, . . . , n where the index k also refers to the corresponding algorithm steps and to the states of the trellis algorithm. In 152 the Rx signals are pulse detected to remove the carrier frequency and waveform to recover a normalized correlated data symbol Yk. For each Rx symbol Yk the state transition decisioning metrics Rk(jxi) are calculated by the logarithm transition metric equations {Rk(jxi)=−|Yk−{circumflex over (X)}k(jxi)|^2} for a ML metric, {Rk(jxi)=|{circumflex over (x)}k|^2−2Real(Yk{circumflex over (X)}k(jxi))*} for a MAP metric wherein (o)* is the complex conjugate of (o), and {Rk(jxi)=metric(Yk,{circumflex over (X)}k)} for another metric, for all possible transition paths {jxi} from the previous state Sk−1(xi) at node xi to the new state Sk(jx) at node jx in the trellis diagram snd where {circumflex over (X)}k(jxi) is the hypothesized normalized detected correlated symbol k for the path jxi. For a mainlobe correlation function the {circumflex over (X)}k(jxi) is defined by the equation {circumflex over (X)}k(jxi)=c(np−1) [sr(1)+sr(2np−1)]+ . . . +c(1) [sr(np−1)+sr(np+1)]+c(0) [sr(np)] which calculates {circumflex over (X)}k(jxi) as the correlated weighted sum of the elements of the shift register SR=[sr(1),sr(2), . . ., sr(2np−1)]′ with {circumflex over (Z)}k=sr(np),{circumflex over (Z)}k−1=sr(np−1), {circumflex over (Z)}k+1==sr(np+1), . . . where c(0)=1, the normalized data symbol estimates {{circumflex over (Z)}k} correspond to the transition index jxi, and the state k estimated symbol {circumflex over (Z)}k is the SR center element sr(np) with correlation coefficient c(0)=1. Symbols move from left to right starting with “j” with each new received symbol or step in the trellis recursion algorithm, and ending with “i”. With this convention “j” is indexed over the states of sr(1), “x” is indexed over the current states of sr(2), . . . ,sr(2np−2), and “i” is indexed over the states of sr(2np−1). Index over the paths of the trellis diagram is defined by the equation jxi=sr(1)+ns sr(2)+ns ^2 sr(3)+ . . . +ns^(2np−2) sr(2np−1)=0,1,2, . . . , ns^(2np−1)−1 when the contents of the SR elements are the indices corresponding to the assumed data symbol state values.
Loop 153 calculates the best trellis transition paths from state Sk−1 to the new state Sk for the new nodes jx=0,1,2, . . . , ns^(2np−2)−1. In 154 the path metric αk(Sk) is defined by the recursive logarithm equation αk(Sk)=αk−1(Sk−1)+R(Sk−1−>Sk) which can be rewritten as αk(jx)=αk−1(xi)+R(jxi) since the state Sk corresponds to node jx, state Sk−1 corresponds to node xi and the state transition from Sk−1 to Skrepresented symbolically as Sk−1−>Sk corresponds to the path jxi.
The best path metric αk(jx) for each new node jx is chosen by the decisioning equation αk(jx)=maximum{αk−1(xi)+Rk(jxi)} with respect to the admissible xi. For each jx, the corresponding xi yielding the highest value of the path metric αk(jx) is used to define the new symbol {circumflex over (Z)}k and path.
For k≧D the state metric Sk is upgraded for this new path jxi by the update operation Sk(:,jx)=[{circumflex over (Z)}k(jxi); Sk−1(1:D−1, xi)] using Matlab notation which replaces the column jx vector with the column xi vector after the elements of xi have been moved down by one symbol and the new symbol {circumflex over (Z)}k added to the top of the column vector which is the row 1 element. State Sk is a D by (n101^(2np−2) matrix with the column vectors equal to the trellis states over the past D symbols where “D” is the trellis decoding memory extending over several correlation lengths (2np−1) for the solution to be stabilized. In Matlab notation the Sk(:,jx) is the column vector jx of Sk consisting of the new symbol {circumflex over (Z)}k and the previous D−1 symbols along the trellis path to node jx and the Sk−1(1:D,xi) is the D×1 column vector of Sk−1 for the previous node xi.
For k≦D the state metric Sk is upgraded for this new path jxi by the operation Sk(:;jx)=[{circumflex over (Z)}k(jxi); Sk−1(:;xi)] which replaces the column jx vector with the column xi vector after the new symbol {circumflex over (Z)}k has been added to the top of the column which is the row 1 element to increase the path size by one. State Sk is a k by (n101^(2np−2) matrix with the column vectors equal to the trellis states over the past k symbols.
Metric values for each path in Sk are stored for later use in soft decisioning turbo and convolutional decoding. Metrics of interest for each symbol k and for each jx are the values of {αk−1(xi)+R(jxi)} for all admissible xi states for the new path symbol {circumflex over (Z)}k for jx for k.
For symbols k≧D the best path jx is found which maximizes αk(jx) and the estimated value {circumflex over (Z)}k−D for symbol k−D is the last row element of the column corresponding to this best path in state metric Sk. This continues until k=n and ends the jx loop 153 and the k loop 151.
Processing 162 continues with steps k=n+1, . . . ,n+D−1 160,161 to recover the estimated values {circumflex over (Z)}k−D of the Tx symbols Zk which are read from the corresponding row elements D−1, D−2, . . . , 1 of the column in the state metric Sn corresponding to the best path jx found for the last symbol k=n. This ends the jx loop 161.
Outputs 164 of the trellis algorithm used for trellis decoding are the estimates {{circumflex over (Z)}k} of the transmitted symbols {Zk} and the corresponding metric values for all admissible states for each new path symbol {circumflex over (Z)}k for all k. Trellis error correction turbo or convolutional decoding 165 recovers data estimates and hands off the data estimates 166 to the receiver for further processing.
The trellis algorithm for QLM example FIG. 9 using partial symbol ΔTs integration presents another approach to a trellis algorithm for symbol recovery which offers a potential reduction in computational complexity compared to the algorithm for full symbol Ts integration in the trellis algorithm in FIG. 9. The largest computational burden is the calculation of the metrics, paths, and states. For the trellis algorithm in FIG. 9 the number of calculations is essentially determined by the number ns^(2np−2) of nodes in the trellis algorithm. For the ΔTs integration in the trellis algorithm the number of nodes reduces to a significantly lower number ns^(np−1). For this invention disclosure it is sufficient to demonstrate the trellis algorithm defined in FIG. 9.
FIG. 10 measures the trellis decoding performance for uncoded 4-PSK np=1 and for np=2 layers of QLM modulation implementing the decoding algorithm FIG. 9. Performance is plotted as bit error rate BER versus the normalized value (Eb/No)/np of the Eb/No for the new bound from equation (4). Normalization means that for a given BER the (Eb/No)/np has the same value for all np. For example, this means that BER=0.001 requires (Eb/No)/np=6.8 dB and for np=1,2,4 this requires Eb/No=6.8+0=6.8, 6.8+3=9.8, 6.8+6=12.8 dB respectively. Measured performance values for np=2 are from a direct error count Monte Carlo simulation of the trellis algorithm and are plotted in FIG. 10 as discrete measurement points.
For step 2 consider an iterative trellis symbol algorithm in FIG. 11. The correlation function observed in FIG. 6, 7 for OWFMA, OFDMA waveforms have sidelobes which cause a degradation in BER performance unless they are incorporated into the trellis algorithm. A method for reducing this loss of BER performance without increasing the number of trellis states is to use an iterative algorithm which calculates the estimated data symbols in the first iteration using part or all of the mainlobe correlation function, uses these estimates to fill in the contributions of the sidelobes in the calculation of the estimated data symbols in the second iteration of the trellis algorithm, and continues this iteration if necessary.
FIG. 11 is a flow diagram of an interative trellis symbol algorithm wherein the iteration is used to incorporate the effects of the sidelobes of the correlation function into the trellis state transition metric function Rk(jxi) in 152 in FIG. 9B in the non-iterative trellis symbol algorithm with a relatively small increase in computational complexity. In FIG. 9 the algorithm is initialized with the parameter set in 176 which is the parameter set in 170 in FIG. 9A with the partitioning of the correlation vector C into the mainlobe vector C0 plus the sidelobe vector C1 and adding the specification of the stopping rule for the iterations. For a correlation vector C=[c(0),c(1), . . . , c(np−1),c(np), . . . , c(nc)] consisting of nc correlation coefficients, the mainlobe vector is C0=[c(0),c(1), . . . ,c(np−1), 0,0, . . . ,0] and the sidelobe vector is C1=[0,0, . . . , 0,c(np), . . . , c(nc)] which partitions C into the vector sum C=C0+C1.
The iterative algorithm starts 177 by implementing the trellis algorithm 171 in FIG. 9A for the correlation mainlobe using the non-zero C0 coefficients. Output data symbol estimates are used to calculate the a-priori estimated sidelobe contribution {circumflex over (X)}k|1 in 179 to {circumflex over (X)}k(jxi) which is the hypothesized normalized detected correlated symbol k for the path jxi in the calculation of the metric Rk(jxi) in 152 in FIG. 9B. In this implementation 180 of the trellis algorithm 152,154 in FIG. 9B, the {circumflex over (X)}k(jxi)={circumflex over (X)}k|0(jxi)+{circumflex over (X)}k|1 is the sum of the hypothesized mainlobe contribution {circumflex over (X)}k|0(jxi) using the non-zero C0 coefficients as described in FIG. 9 and the sidelobe contribution {circumflex over (X)}k|1 using the data symbol estimates from 177 and the non-zero C1 coefficients and wherein the subscripts “k|0” reads “index k given C0” and “k|1” reads “index k given C1”. From 152 in FIG. 9B we find the {circumflex over (X)}k|0(jxi) is defined by the equation {circumflex over (X)}k|0(jxi)=c(np−1) [sr(1)+sr(2np−1)]+ . . . +c(1) [sr(np−1)+sr(np+1)]+c(0) [sr(np)] which calculates {circumflex over (X)}k|0(jxi)={circumflex over (X)}k(jxi) in FIG. 9B as the correlated weighted sum of the elements of the shift register SR=[sr(1),sr(2), . . . , sr(2np−1)]′ with {circumflex over (Z)}k=sr(np),{circumflex over (Z)}k−1=sr(np−1), {circumflex over (Z)}k+1=sr(np+1), . . . where c(0)=1, the normalized data symbol estimates {{circumflex over (Z)}k} correspond to the transition index jxi, and the state k estimated symbol {circumflex over (Z)}k is the SR center element sr(np) with correlation coefficient c(0)=1. Symbols move from left to right starting with “j” with each new received symbol or step in the trellis recursion algorithm, and ending with “i”. With this convention “j” is indexed over the states of sr(1), “x” is indexed over the current states of sr(2), . . . , sr(2np−2), and “i” is indexed over the states of sr(2np−1). Index over the paths of the trellis diagram is defined by the equation jxi=sr(1)+ns sr(2)+ns^2 sr(3)+ . . . +ns^(2np−2) sr(2np−1)−1=0,1,2, . . . , ns^(2np−1)−1 when the contents of the SR elements are the indices corresponding to the assumed data symbol state values. The sidelobe contribution is equal to {circumflex over (X)}k|1=c(np)({circumflex over (Z)}k−np+{circumflex over (Z)}k+np)+c(np+1) ({circumflex over (Z)}k−1−np+{circumflex over (Z)}k+1+np)+c(np+2) ({circumflex over (Z)}k−2−np+{circumflex over (Z)}k+2+np)+ . . . until the end of the sidelobe correlation coefficients or the end of the data symbol estimates and wherein {circumflex over (Z)}k−np is the data symbol estimate in 179 for symbol k−np.
Output of this modified trellis algorithm 180 is the set of data symbol estimates. A stopping rule in 176 is used to decide 182 if another iteration is required. When another iteration is required the data symbol estimates are used 184 to update the calculation 179 of the a-priori contribution {circumflex over (X)}k|1 of the sidelobes to the {circumflex over (X)}k(jxi) in the modified trellis algorithm 180. With no further iteration the trellis error correction decoding 183 implements the trellis error correction decoding 172 in FIG. 9A, hands off the data estimates 186 to the receiver for further processing. and returns 185 to the trellis algorithm for processing the next data symbol or symbols when the trellis error correction decoding 183 is interleaved with the trellis demodulation. Alternatively, the trellis demodulation is completed or partially completed before handing off the data symbol estimates and metrics to the trellis decoding algorithm 183.
For step 2 a method to reduce the number of trellis states is to use a sequential trellis bit algorithm. With this method the data symbol bits are individually estimated by a trellis algorithm over the correlation function using the corresponding bits of each data symbol for each trellis pass. A comparison of the number of trellis states nt for the symbol and bit algorithms is given in 1,2 in equations (9). This number nt of trellis states is required to support each step k of the trellis demodulation and there are np demodulation steps in each data symbol interval Ts which means the number of trellis states per Ts second interval is equal to npnt. The number of trellis states requires a SR length 2np−2 and is equal to ns^(2np−2) whereas the number of trellis paths requires a SR length 2np−1 and is equal to ns^(2np−1). The computational complexity of a trellis algorithm is driven by the number of trellis states.




  
    
      
        
          Number
          ⁢
          
            
          
          ⁢
          of
          ⁢
          
            
          
          ⁢
          trellis
          ⁢
          
            
          
          ⁢
          states
          ⁢
          
            
              
            
            ⁢
            
              
            
          
          ⁢
          
            n
            t
          
        
        ⁢
        
          

        
        ⁢
        
          1.
          ⁢
          
            
          
          ⁢
          Trellis
          ⁢
          
            
          
          ⁢
          symbol
          ⁢
          
            
          
          ⁢
          algorithm
          ⁢
          
            
          
          ⁢
          trellis
          ⁢
          
            
          
          ⁢
          states
        
        ⁢
        
          

        
        ⁢
        
          
            
              
                
                  
                
                ⁢
                
                  
                    n
                    t
                  
                  =
                  
                    
                      n
                      s
                    
                    ^
                    
                      (
                      
                        
                          2
                          ⁢
                          
                            
                          
                          ⁢
                          
                            n
                            p
                          
                        
                        -
                        2
                      
                      )
                    
                  
                
              
            
          
          
            
              
                =
                
                  2
                  ^
                  
                    
                      b
                      s
                    
                    ⁡
                    
                      (
                      
                        
                          2
                          ⁢
                          
                            
                          
                          ⁢
                          
                            n
                            p
                          
                        
                        -
                        2
                      
                      )
                    
                  
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          2.
          ⁢
          
            
          
          ⁢
          Trellis
          ⁢
          
            
          
          ⁢
          bit
          ⁢
          
            
          
          ⁢
          algorithm
          ⁢
          
            
          
          ⁢
          trellis
          ⁢
          
            
          
          ⁢
          states
        
        ⁢
        
          

        
        ⁢
        
          
        
        ⁢
        
          
            n
            t
          
          =
          
            
              b
              s
            
            ⁢
            
              2
              ^
              
                (
                
                  
                    2
                    ⁢
                    
                      
                    
                    ⁢
                    
                      n
                      p
                    
                  
                  -
                  2
                
                )
              
            
          
        
      
    
    
      
        (
        9
        )
      
    
  




FIG. 12,13 calculate the number of trellis states nt for the information bits b per data symbol interval for values to b=12 Bits/Hz=Bits/(Symbol Interval) for the trellis symbol demodulation algorithm and the trellis bit demodulation algorithm respectively using equations (9) to calculate the number of trellis states and calculating the information bits b vs. np performance for PSK and QAM from FIG. 3,4. For trellis symbol demodulation, FIG. 12 calculates the number of trellis states nt vs. b for 4-PSK in 200, 8-PSK in 201, 16-QAM in 202, 64-QAM in 203, and 256-QAM in 204. For trellis bit demodulation, FIG. 13 calculates the number of trellis states nt vs. b for 4-PSK in 205, 8-PSK in 206, 16_QAM in 207, 64-QAM in 208, and 256-QAM in 209. FIG. 13 compared to FIG. 12 illustrates a reduction in computational complexity using the trellis bit demodulation algorithm compared to the trellis symbol demodulation algorithm.
In FIG. 13 the number of bit passes is equal to the number of modulation bits bs per data symbol which number multiplies the number of trellis states to calculate the equivalent number of trellis states for the bit algorithm. The data symbol rate reduction required to implement the bit error correction decoding is not factored into these plots since the required code rates are expected to be relatively high and have not been established. With the bit algorithm the complexity of the data symbol modulation may require the simultaneous demodulation of more than one bit for each data symbol in order to reduce the bit(s) decisioning loss and this could increase the complexity of the bit algorithm. Also not factored into these plots is the impact of the differences in the np over the Ts interval for the same values of b since the number of data symbol modulations is equal to npnt over a Ts interval for the same values of b.
FIG. 14 illustrates the decisioning manifolds and bit sequencing for QLM 8-PSK demodulation using a trellis bit detection algorithm. In 190 the 8-PSK data symbol modulation is mapped onto a unit circle in the complex plane using the binary representation b0b1b2 for the bs=3 bit phase states ns=8=2^(3 bit) with the zero state 191 equal to b0b1b2=000. The 8-PSK phase states are arranged as a Gray code with the third bit b2=0,1 values on the respective bit b0,b1 decisioning boundaries 195,199 of their manifolds in the complex plane to reduce the impact of the undecided bit b2 on the decisioning performance of b0, b1. It is well known that the Gray code reduces the probability of a multibit error and the BER for a given data symbol error since the neighboring symbols differ from each other by only one bit position.
In 192 the decisioning manifolds for the first bit b0 are the respective subspaces of the complex plane 194 with real axis x and complex axis jy wherein j=√(−1), specified by b0=0 decisioning 193 and b1=1 decisioning 193 with the decisioning boundary 195 separating the manifolds. In 196 the decisioning manifolds for the second bit b1 are the respective subspaces of the complex plane 198 specified by b1=0 decisioning 197 and b1=1 decisioning 197 with the decisioning boundary 199 separating the manifolds. In 196 the bit b1 decisioning is conditioned on the knowledge of the first bit b0 being b0=0,1. This means for b0=0 the decisioning manifolds in 196 are restricted to the b0=0 manifold in 192 and for b0=1 to the b0=1 manifold in 192.
FIG. 15 is a flow diagram of a trellis bit demodulation algorithm with correlated bit error correction encoding and decoding. The algorithm is initialized with the parameter set in 210 which is the parameter set 170 in FIG. 9A with the identification of the bit representation b0b1b2 . . . bs−1 of the bs bit trellis states for the data modulation and definition of the corresponding decisioning boundaries and metrics for calculation of the trellis state transition metric Rk(jxi) in 152 in FIG. 9B in the trellis symbol algorithm.
The trellis bit algorithm 211 implements the trellis symbol algorithm in FIG. 9 with the symbols reduced to the first bit b0 for each of the correlated data symbols to initiate the algorithm in the first trellis pass, implements the data symbol words b0b1 for the next trellis pass with the bits b0 estimated from the first pass, and so forth until the complete data symbol words b0b1b2 . . . bs−1 have been recovered. In each pass the trellis state transition metric Rk(jxi) in 152 in FIG. 9B in the trellis symbol algorithm is calculated using the definition of the corresponding decisioning boundaries and metrics in 210 following the procedure outlined in FIG. 14 for 8-PSK and the estimated bit values from the previous trellis passes.
Bit estimates from the trellis bit algorithm are error correction decoded and re-encoded 213 to correct the decisioning errors resulting from a combination of noise and the non-optimal nature of the bit decisioning metrics. Bit decisioning metrics are non-optimal when there are unknown higher order bits which are undefined since the multi-layer correlations of the parallel QLM channels introduce random fluctuations contributed by these higher order bits. The error correction code finds the correct bit sequence and then regenerates the original encoded bit sequence to enable the next bit pass to be implemented with a relatively clean estimate of the bits in the previous pass. This bit error correction is intended to improve the performance of the trellis bit algorithm. Depending on the tolerance to performance loss this bit error correction can be deleted to avoid the relatively small loss in communications capacity due to the anticipated relatively high rate of the bit encoder.
The sequencing continues 214 when there is another bit to be processed whereupon the corrected bit estimate from the bit error correction 213 is handed off 216 to the trellis bit algorithm 211 for the next pass. When the next-to-last bit has been estimated and corrected by the bit error correction 213 the algorithm stops the sequencing 212 and hands off the estimated data symbols and metrics 217 to the trellis decoding 215 which implements the trellis error correction decoding 172 in FIG. 9A, hands off the bit estimates 219 to the receiver for further processing, and returns 218 to the trellis algorithm for the processing of the next data symbol or symbols. Alternatively, the trellis demodulation is completed or partially completed before handing off the data symbol estimates and metrics to the trellis decoding algorithm 215.
FIG. 16 is a flow diagram of an interative trellis bit algorithm wherein the iteration is used to incorporate the effects of the sidelobes of the correlation function into the trellis state transition metric Rk(jxi) in 152 in FIG. 9B in the non-iterative trellis symbol algorithm with a relatively small increase in computational complexity. In FIG. 16 the algorithm is initialized with the parameter set in 220 which is the parameter set in 210 in FIG. 15 with the partitioning of the correlation vector C into the mainlobe vector C0 plus the sidelobe vector C1 and adding the specification of the stopping rule for the iterations. For a correlation vector C=[c(0),c(1), . . . , c(np−1),c(np), . . . , c(nc)] consisting of nc correlation coefficients, the mainlobe vector is C0=[c(0),c(1), . . . , c(np−1),0,0, . . . , 0] and the sidelobe vector is C1=[0,0, . . . , 0,c(np), . . . , c(nc)] to partition C=C0+C1.
The iterative algorithm starts 221 by implementing the trellis algorithm 171 in FIG. 9A with the symbols reduced to the first bits b0 for the correlation mainlobe using the non-zero C0 coefficients. Output bit estimates from the trellis bit algorithm 221 are used to calculate the a-priori estimated sidelobe contribution {circumflex over (X)}k|1 in 223 to {circumflex over (X)}k(jxi) which is the hypothesized normalized detected correlated symbol k for the path jxi in the calculation of the metric Rk(jxi) in 152 in FIG. 9B. In this implementation 224 of the trellis algorithm 171 in FIG. 9A, the {circumflex over (X)}k(jxi)={circumflex over (X)}k|0(jxi)+{circumflex over (X)}k|1 is the sum of the hypothesized mainlobe contribution {circumflex over (X)}k|0(jxi) using the non-zero C0 coefficients as described in FIG. 9 and the sidelobe constibution {circumflex over (X)}k|1 using the bit estimates from 221 and the non-zero C1 coefficients and wherein the subscripts “k|0” reads “index k given C0” and “k|1” reads “index k given C1”. From 152 in FIG. 9B we find the {circumflex over (X)}k|0(jxi) is defined by the equation {circumflex over (X)}k|0(jxi)=c(np−1) [sr(1)+sr(2np−1)]+ . . . +c(1) [sr(np−1)+sr(np+1)]+c(0) [sr(np)] which calculates {circumflex over (X)}k|0(jxi)={circumflex over (X)}k(jxi) in FIG. 9B as the correlated weighted sum of the elements of the shift register SR=[sr(1),sr(2), . . . , sr(2np−1)]′ with {circumflex over (Z)}k=sr(np),{circumflex over (Z)}k−1=sr(np−1),{circumflex over (Z)}k+1=sr(np+1), . . . where c(0)=1, the normalized data symbol estimates {{circumflex over (Z)}k} correspond to the transition index jxi, and the state k estimated symbol {circumflex over (Z)}k is the SR center element sr(np) with correlation coefficient c(0)=1. Symbols(bits) move from left to right starting with “j” with each new received symbol or step in the trellis recursion algorithm, and ending with “i”. With this convention “j” is indexed over the states of sr(1), “x” is indexed over the current states of sr(2), . . . , sr(2np−2), and “i” is indexed over the states of sr(2np−1). Index over the paths of the trellis diagram is defined by the equation jxi=sr(1)+ns sr(2)+ns^2 sr(3)+ . . . +ns^(2np−2) sr(2np−1)−1=0,1,2, . . . , ns^(2np−1)−1 when the contents of the SR elements are the indices corresponding to the assumed data symbol state values. The sidelobe contribution is equal to {circumflex over (X)}k|1=c(np) ({circumflex over (Z)}k−np+{circumflex over (Z)}k+np)+c(np+1) ({circumflex over (Z)}k−1−np{circumflex over (Z)}k+1+np)+c(np+2) ({circumflex over (Z)}k−2−np+{circumflex over (Z)}k+2+np)+ . . . until the end of the sidelobe correlation coefficients or the end of the data symbol bit estimates and wherein {circumflex over (Z)}k−np is the data symbol bit estimate in 223 for symbol k−np.
Output of this modified trellis bit algorithm 224 is the set of data symbol bit estimates which are error correction decoded and re-encoded 226 to correct the decisioning errors. A stopping rule in 227 is used to decide if another iteration is required. When another iteration is required the data symbol bit estimates are used 230 to update the calculation 223 of the a-priori contribution {circumflex over (X)}k|1 of the sidelobes to the {circumflex over (X)}k(jxi) in the modified trellis algorithm 224. With no further iteration the next bit 228 is processed 225 by the trellis bit algorithm 221 whereupon the corrected bit estimate from the bit error correction 226 is used to generate the sidelobes 223 for the trellis bit algorithm 224 to begin the next set of iterations. When the next-to-last bit has been estimates and corrected by the bit error correction 226 and the iteration algorithm completed 227, the estimated data symbols and metrics are handed off to the trellis error correction decoding 229 which implements the trellis error decoding 172 in FIG. 9A, hands off the data estimates 232 to the receiver for further processing, and returns 231 to the trellis bit algorithm for processing the next data symbol or symbols when the trellis error correction decoding 229 is interleaved with the trellis demodulation. Alternatively, the trellis demodulation is completed or partially completed before handing off the data symbol estimates and metrics to the trellis decoding algorithm 229.
For step 2 there are several ways to reduce the computational complexity at the expense of some performance loss for the trellis symbol and bit algorithms and the iterative trellis symbol and bit algorithms. A method to reduce computational complexity is to reduce the number of trellis states jx and transition paths jxi in 151, 152, 153, 154 in FIG. 9B in the trellis algorithm by eliminating the trellis states and trellis paths in 154 in FIG. 9B which have relatively poor values of the path metric αk(jx) used to define the new symbol {circumflex over (Z)}k and path. A second method to reduced the computational complexity is to reduce the number of trellis states by eliminating the lower correlation values of the sidelobes and mainlobe. A third method to reduce the computational complexity is to modify the iterative algorithm to calculate the forward trellis performance using the forward half of the mainlobe and followed by a backward trellis algorithm using the other half of the mainlobe wherein the trellis algorithm in FIG. 9 is a forward algorithm and the backward algorithm simply replaces the forward recursive metric equation αk(jx)=αk−1(xi)+R(jxi) with the backward recursive equation βk−1(jx)=βk(xi)+R(jxi) and runs the trellis algorithm in reverse by proceeding with k, k−1, k−2, . . . and wherein βk−1(jx) is the backward state metric used to define the new symbol {circumflex over (Z)}k−1 and path as described in application Ser. No. 10/772,597. A fourth method to reduce the computational complexity it so change the forward-backward algorithm to incorporate techniques to eliminate the trellis state and trellis paths with relatively poor performance metrics. These are examples of the various algorithms for reducing the computational complexity at the expense of reducing the demodulation performance. Sequential demodulation techniques, partial symbol and bit integration over ΔTs and Δk intervals, and other demodulation techniques are available as potential candidates for QLM demodulation. The present invention is not intended to be limited to these QLM demodulation methods and techniques shown herein but is to be accorded the wider scope consistent with the principles and novel features disclosed herein.
OFDMA quadrature parallel-layered modulation QLM can increase the data rate either using timing offsets or using frequency offsets or using a combination of both, as the communications parameter which is changed between layers to allow separability of the layers and recovery of the layered transmitted data in the receiver. OFDMA QLM with frequency offsets is implemented in FIG. 17 in a transmitter and in FIG. 20 in a receiver.
FIG. 17 is a transmitter block diagram modified to support OFDMA QLM with frequency offsets to increase the symbol transmission rate from 1/Ts to the QLM rate np/Ts and with an increase in transmitter power to support this increased data rate. Ideal OFDMA modulates N input data symbols at the sample rate 1/Ts over the time interval NTs with an N-point inverse fast fourier transform FFT−1 to generated N harmonic waveforms e^j2nkn/N with each modulated by the corresponding data symbol wherein the normalized frequencies k=0,1, . . . N−1 correspond to channels 0,1, . . . , N−1, “j”=√(−1), “n=pi”, and “n” is a time index,. Data symbol output rates are 1/NTs per channel and the N channels have a total symbol rate equal to N/NTs=1/Ts=B=(Nyquist sample rate). Signal processing starts with the stream of user input data words (dk} 46 with k indexed over the words. Frame processor 47 accepts these data words and performs turbo error correction encoding, error detection cyclic redundant encoding CRC, frame formatting, and passes the outputs to the symbol encoder 48 which encodes the frame data words into data symbols for handover to the OFDMA QLM signal processing. QLM transmits in parallel N received data symbols for each of the np FFT−1 signal processing steams. Each set of received N data symbols are offset in frequency by 0, Δk, 2Δk, . . . , (np−1)Δk with Δk=1/np using the normalized frequency index k and are implemented in 49 by the frequency translation operator with FFT−1 time sample index n. Following this frequency translation and FFT−1 signal processing, the output streams of the OFDMA encoded symbols for the np frequency offsets are summed 51 and waveform encoded. The output stream of up-sampled complex baseband signal samples 52 {z(ti)} at the digital sample times ti with digitization index i, is handed over to the digital-to-analog converter DAC, and the DAC output analog signal z(t) is single sideband SSB upconverted 52 to RF and transmitted as the analog signal v(t) wherein v(t) is the real part of the complex baseband signal z(t) at the RF frequency. Non-ideal OFDMA has a separation interval between contiguous FFT−1 data blocks to allow for timing offsets and the rise and fall times of the channelization filter prior to the FFT−1 processing.
CDMA quadrature parallel-layered modulation QLM can increase the data rate either using timing offsets or using frequency offsets or using a combination of both, as the communications parameter which is changed between layers to allow separability of the layers and recovery of the layered transmitted data in the receiver. CDMA QLM with frequency offsets is implemented in FIG. 18 in a transmitter and in FIG. 21 in a receiver. Using a Hybrid Walsh or a generalized Hybrid Walsh CDMA orthogonal channelization code developed in U.S. Pat. No. 7,277,382 and patent application Ser. No. 09/846,410 localizes the frequency spread of the decoded CDMA signal so that it is feasible to use a trellis algorithm for decoding. With timing offsets the CDMA block codes have to be reshuffled so that the encoded data symbols Z(n(k))=ΣuZ(u)C(u,n(k)) over blocks k=0,1,2, . . . are grouped together for each n to ensure that the timing offsets are not introducing unwanted cross-correlations between CDMA channels.
FIG. 18 is a transmitter block diagram modified to support CDMA QLM with frequency offsets to increase the symbol transmission rate from 1/Ts to the QLM rate np/Ts and to increase the transmitter power level to support this increased data rate. Signal processing starts with the stream of user input data words (dk} 101 with k indexed over the words. Frame processor 102 accepts these data words and performs the turbo error correction encoding, error detection cyclic redundant encoding CRC, frame formatting, and passes the outputs to the symbol encoder 103 which encodes the frame data words into data symbols for handover to the CDMA QLM signal processing. Similar to OFDMA the frequency translation is performed 104 and the output streams of the CDMA encoded 105 symbols for the np frequency offsets are summed 106 and waveform encoded and the up-sampled output stream of complex baseband signal samples 107 {z(ti)} at the digital sample times ti with digitization index i, is handed over to the DAC and the DAC output analog signal z(t) is SSB upconverted 107 to RF and transmitted as the analog signal v(t) wherein v(t) is the real part of the complex baseband signal z(t) at the RF frequency.
OWDMA quadrature parallel-layered modulation QLM can increase the data rate either using timing offsets or using frequency offsets or using a combination of both, as the communications parameter which is changed between layers to allow separability of the layers and recovery of the layered transmitted data in the receiver. OWDMA QLM with timing offsets is implemented in FIG. 19 in a transmitter and in FIG. 22 in a receiver. OWDMA was developed in patent application Ser. No. 09/826,118. OWDMA generates a uniform bank of orthogonal Wavelet filters with the same spacing and symbol rate as OFDMA and with the advantage that the individual channels remain orthogonal with timing offsets and are less sensitive to frequency offsets.
FIG. 19 is a transmitter block diagram modified to support OWDMA QLM with time offsets to increase the symbol transmission rate from 1/Ts to the QLM rate np/Ts and to increase the transmitter power level to support this increased data rate. Signal processing starts with the stream of user input data words (dk} 111 with k indexed over the words. Frame processor 112 accepts these data words and performs the turbo error correction encoding, error detection cyclic redundant encoding CRC, frame formatting, and passes the outputs to the symbol encoder 113 which encodes the frame data words into data symbols for handover to the OWDMA QLM transmit signal processing. The np time delays 0, ΔTs, 2ΔTs, 3ΔTs, . . . , (np−1)ΔTs wherein ΔTs=Ts/np, are performed 114 and the output streams of the OWDMA waveform encoded 115 symbols for the np time delays are summed 116 and passband waveform encoded and the up-sampled output stream of complex baseband signal samples 117 {z(ti)} at the digital sample times ti with digitization index i, is handed over to the DAC and the DAC output analog signal z(t) is single sideband SSB upconverted 117 to RF and transmitted as the analog signal v(t) wherein v(t) is the real part of the complex baseband signal z(t) at the RF frequency.
Other communications applications include TDMA QLM and FDMA QLM. Frequency hopped FH QLM is a layered QLM modulation with multiple access being provided by the FH on the individual hops. PPM QLM can be layered with QLM similar to QAM when the symbol modulation is replaced by pulse-position-modulation PPM. For GMSK QLM the transmitter is modified by the QLM symbol rate increase.
FIG. 20 is a receiver block diagram modified to support OFDMA QLM from the OFDMA QLM transmitter in FIG. 17. Receive signal processing for QLM demodulation starts with the wavefronts 54 incident at the receiver antenna for the nu users u=1, . . . , nu≦Nc which are combined by addition in the antenna to form the receive Rx signal {circumflex over (v)}(t) at the antenna output 55 where {circumflex over (v)}(t) is an estimate of the transmitted signal v(t) 52 in FIG. 17 that is received with errors in time Δt, frequency Δf, and phase Δθ. This received signal {circumflex over (v)}(t) is amplified and downconverted to baseband by the analog front end 56, synchronized (synch.) in time t and frequency f, waveform removed to detect the received QLM signal at the QLM symbol rate, inphase and quadrature detected (I/Q), and analog-to-digital ADC converted 57. ADC output signal is demultiplexed into np parallel signals 58 which are offset in frequency by 0, −Δk, −2Δk, . . . , −(np−1)Δk wherein Δk=1/np and processed by the FFT's. Outputs are trellis decoded 59 with an algorithm comparable to the algorithm defined in FIG. 9 for QLM PSK. Outputs are further processed 60,61 to recover estimates {circumflex over (d)}k of the transmitted data dk with k indexed over the data words.
FIG. 21 is a receiver block diagram modified to support CDMA QLM from the CDMA QLM transmitter in FIG. 18. Receive signal processing for QLM demodulation starts with the wavefronts 121 incident at the receiver antenna for the nu users u=1, . . . , nu≦Nc which are combined by addition in the antenna to form the receive Rx signal {circumflex over (v)}(t) at the antenna output 122 where {circumflex over (v)}(t) is an estimate of the transmitted signal v(t) 107 in FIG. 18 that is received with errors in time Δt, frequency Δf, and phase Δθ. This received signal {circumflex over (v)}(t) is amplified and downconverted to baseband by the analog front end 123, synchronized (synch.) in time t and frequency f, waveform removed to detect the received QLM signal at the QLM symbol rate, inphase and quadratue detected (I/Q), and analog-to-digital ADC converted 124. ADC output signal is demultiplexed into np parallel signals 125 which are offset in frequency by 0, Δk, 2Δk, . . . , (np−1)Δk and processed by the CDMA decoders. Outputs are trellis decoded 126 with an algorithm comparable to the algorithm defined in FIG. 9 for QLM PSK. Outputs are further processed 127,128 to recover estimates of the transmitted data dk wherein k is indexed over the data words.
FIG. 22 is the receiver block diagram modified to support OWDMA QLM from the OWDMA transmitter in FIG. 19. Receive signal processing for QLM demodulation starts with the wavefronts 131 incident at the receiver antenna for the nu users u=1, nu≦Nc which are combined by addition in the antenna to form the receive Rx signal {circumflex over (v)}(t) at the antenna output 132 where {circumflex over (v)}(t) is an estimate of the transmitted signal v(t) 117 in FIG. 19 that is received with errors in time Δt, frequency Δf, and phase Δθ. This received signal {circumflex over (v)}(t) is amplified and downconverted to baseband by the analog front end 133, synchronized (synch.) in time t and frequency f, waveform removed to detect the received QLM signal at the QLM symbol rate, inphase and quadrature detected (I/Q) and analog-to-digital ADC converted 134. ADC output signal is demultiplexed into np parallel signals 135 which are offset in time by 0, ΔTs, 2ΔTs , . . . , (np−1)ΔTs and processed by the OWDMA decoders. Outputs are trellis decoded 136 with an algorithm comparable to the algorithm defined in FIG. 9 for QLM PSK. Outputs are further processed 137,138 to recover estimates {circumflex over (d)}k of the transmitted data dk wherein k is indexed over the data words.
Consider the QLM modulation and demodulation algorithms and implementation for GMSK. QLM increases the data rate by transmitting np>1 layers of data encoded Gaussian frequency pulses that are time synchronized for transmission at Ts/np, 2Ts/np, . . . , (np−1)Ts/np offsets respectively for layers 2,3, . . . , (np−1) relative to the ground or 1st layer of GMSK. This means the bit-rate increases from 1/Ts to np/Ts and the bit or symbol time remains the same at Ts. The trellis algorithm in FIG. 9 is combined with the Viterbi algorithm, with suitable modifications to model the architecture of the GMSK demodulator.
This patent covers the plurality of everything related to QLM generation, QLM demodulation, and data recovery of QLM and to the corresponding bounds on QLM to all applications of QLM inclusive of theory, teaching, examples, practice, and of implementations for related technologies. The representative transition metric and trellis algorithms for QLM demodulation are examples to illustrate the methodology and validate the performance and are representative of all QLM demodulation algorithms including maximum likelihood ML, maximum a posteriori MAP, maximum a priori, finite field techniques, direct and iterative estimation techniques, trellis symbol and iterativw trellis symbol and with/without simplifications, trellis bit and iterative trellis bit and with/without simplifications and with/without bit error correction coding, and all other related algorithms whose principal function is to recover estimates of the transmitted symbols for QLM parallel layered modulation as well as data recovery related to QLM and the QLM bounds.
Preferred embodiments in the previous description of modulation and demodulation algorithms and implementations for QLM for the known modulations and demodulations and for all future modulations and demodulations, are provided to enable any person skilled in the art to make or use the present invention. The various modifications to these embodiments will be readily apparent to those skilled in the art and the generic principles defined herein may be applied to other embodiments without the use of the inventive faculty. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the wider scope consistent with the principles and novel features disclosed herein. Additional applications for QLM signal processing and bound include the plurality of information theorectic applications with examples being radar, imaging, and media processing.

## Claims

1. A method for implementation of Quadrature Parallel-Layered Modulation (QLM) in a communications transmitter for communications over the same frequency bandwidth of a carrier frequency using time offset as a differentiating parameter, said method comprising the steps:
generating a communications signal over a frequency bandwidth at the data symbol rate np/Ts wherein
1) each data symbol is encoded with information and has the same waveform
2) the Nyquist rate for the data symbol transmission is equal to 1/Ts,
3) the Nyquist rate is equal to the bandwidth 1/Ts of the data symbol waveform and is the data symbol transmission rate 1/Ts which is sufficient to transmit all of the information in each data symbol,
4) np is the increase in the Nyquist data rate supported by QLM,
5) this increase in Nyquist data rate can be viewed as increasing to np the number of parallel communications channels supported by QLM at the data symbol rate 1/Ts,
6) timing offset ΔTs equal to the data symbol spacing ΔTs=Ts/np is the differentiating parameter when viewing this increase in data symbol rate as parallel communications channels which are independent since the QLM demodulation algorithm recovers the data symbols and data symbol encoded information at the QLM data symbol rate np/Ts,
7) each of these parallel channels of communications has a unique timing offset which can be identified as the channel 1 data symbols with no timing offset, channel 2 data symbols with ΔTs offset, channel 3 data symbols with 2ΔTs offset, and continuing to channel np data symbols with (np−1)ΔTs offset,
8) which means one can transmit np parallel layers of communications channels over the same frequency bandwidth and recover the information in a receiver with a QLM demodulation algorithm,

up-converting the QLM signal to a radio frequency RF, power amplifying,
transmitting the RF QLM signal using the communications transmitter, and
receiving the transmitted RF QLM signal in a communications receiver, amplifying, down-converting, and QLM demodulating the received QLM signal following by decoding to recover the data symbol information.

2. A method for implementation of orthogonal frequency division multiple access (OFDMA) QLM for communications using frequency offset as a differentiating parameter, said method comprising the steps:
generating a first communications signal over a frequency bandwidth 1/Ts at a carrier frequency for a first set of N channels by modulating a first stream of N data symbols at a data symbol rate 1/Ts with an N-point inverse fast fourier transform (FFT−1) waveform over a FFT−1 block length NTs to generate N orthogonal frequency harmonics modulated with the respective data symbols and which modulated harmonics are the N channels for communications,
generating a second communications signal over the same block length over the same frequency bandwidth at the same carrier frequency for a second set of N channels by modulating a second stream of N data symbols at a data symbol rate 1/Ts with the same FFT−1 waveform with a frequency offset Δk equal to Δk=1/np wherein “np” is the number of QLM sets of channels in said frequency bandwidth and FFT−1 harmonics are e^j2π(k+Δk)n/N for normalized frequencies k=0,1, . . . N−1 corresponding to channels 0,1, . . . , N−1 wherein “j”=√(−1), “n=pi”, and “n” is a time index,
for any additional sets of channels, continuing generation of communication signals over the same block length over the same frequency bandwidth at the same carrier frequency by modulating additional streams of data symbols with the same waveform at the same data symbol rate as the first and second streams of data symbols with frequency offsets increasing in each communication signal in increments of Δk=1/np until the np signals are generated for np QLM sets of channels,
repeating this generation of the QLM signal for the next FFT−1 block length NTs and continuing for subsequent block lengths,
transmitting and receiving said communications signals over a QLM communications link consisting of the np QLM sets of channels,
recovering data symbols of the communications signals in a receiver using a demodulation algorithm, and
combining said algorithm with error correction decoding to recover the transmitted information whereby frequency offset has been used as a differentiating parameter to enable QLM parallel sets of channels for communications over the same frequency bandwidth at the same carrier frequency with a data symbol rate independent of the Nyquist rate, to be demodulated.

3. The method in claim 2 for implementation of orthogonal frequency division multiple access (OFDMA) QLM in a communications transmitter and a communications receiver for communications using frequency offset as a differentiating parameter, said method further comprising:
constructing QLM parallel channels or parallel groups of channels of communications for a QLM communications link over a frequency bandwidth of a carrier frequency with a data symbol rate independent of the Nyquist rate,
using one or more data symbol modulations for the QLM communications channels,
using one or more differentiating parameters to enable the channel signals of the QLM link to be demodulated,
implementing said demodulation using a trellis algorithm or maximum likelihood algorithm or another demodulation algorithm combined with error correction decoding algorithms,
wherein said QLM demodulated signal in a communications receiver has been generated in a communications transmitter, up-converted to a radio frequency RF, power amplified, and transmitted as a RF QLM signal in a communications transmitter, and
received in said communications receiver, amplified, down-converted, and QLM demodulated followed by decoding to recover the data symbol information.

4. A method for implementation of QLM demodulation for communications over the same frequency bandwidth of a carrier frequency using time and/or frequency and/or other offsets as the differentiating parameters and using trellis symbol demodulation, said method comprising the steps:
receiving QLM data symbols indexed on k=1,2, . . . , n for n data symbols,
evaluating correlation coefficients for received QLM data symbols,
establishing trellis states and trellis paths for each data symbol whereby
a) there are ns^(2nc−2) trellis states wherein “ns” is the number of states of each data symbol, and “nc” is the number of one-sided correlation coefficients for symmetrical correlation functions,
b) there are ns^(2nc−1) trellis paths from trellis state Sk−1 for data symbol k−1 to a new trellis state Sk for data symbol k,
c) index jxi=0,1,2, . . . , ns^(2nc−1)−1 is a trellis path index from Sk−1 to Sk using ns-ary index symbols jxi reading from left to right wherein “j” is an index for a new data symbol, “i” is an index for a last data symbol and “x” is a set of ns-ary index data symbols between “j” and “i”,
d) index jx is over ns^(2nc−2) trellis states Sk(jx),
e) index xi is over ns^(2nc−2) trellis states Sk−1(xi),
f) creating a D row by ns^(2nc−2) column memory “M” for storing trellis path decisions wherein D is a multiple of nc,

initializing the trellis algorithm for k=0
implementing the trellis algorithm for each step k starting with k=1 by
1) evaluating hypothesized values {circumflex over (X)}k(jxi) of received QLM correlated data symbols for all paths jxi,
2) measuring a received QLM data symbol Yk for data symbol k,
3) evaluating a logarithm state transition decisioning metric R(jxi) which is a function of {circumflex over (X)}k(jxi) and Yk for symbol k for all possible paths jxi from Sk−1(xi) to Sk(jx),
4) finding a best path metric αk(jx) and corresponding path jxi from Sk−1(xi) to Sk(jx) by using a logarithm decisioning equation αk(jx)=max{αk−1(xi)+Rk(jxi)} which finds xi that maximizes “max” the sum “αk−1(xi)+Rk(jxi)” for a given jx,
5) using said αk(jx) and corresponding jxi to define a data symbol estimate {circumflex over (Z)}k for Sk(jx),
6) for k<D continuing to fill memory M from the top down by replacing column xi with column jx after moving the row elements of column xi down by one symbol and placing {circumflex over (Z)}k in the vacant first row, for all jx,
7) for k≧D continuing to replenish memory M from the top down by replacing column xi with column jx after moving the row elements of column xi down by one symbol and placing {circumflex over (Z)}k in the vacant first row, for all jx,
8) for k≧D selecting the last symbol {circumflex over (Z)}k−D in column jx in the deleted bottom row corresponding to the maximium value of αk(jx) over all jx, as the best estimate of data symbol k−D,
9) for k>n continuing step 8 without replenishing memory M to complete the estimates of the n data symbols,
10) performing error correction decoding of these estimated data symbols,

wherein said QLM demodulated signal in a communications receiver has been generated in a communications transmitter, up-converted to a radio frequency RF, power amplified, and transmitted as a RF QLM signal in a communications transmitter, and
received in said communications receiver, amplified, down-converted, and QLM demodulated as described in this claim followed by decoding to recover the data symbol information.

5. The method in claim 4 for implementation of QLM demodulation in a communications receiver for communications over the same frequency bandwidth of a carrier frequency using time and/or frequency and/or other offsets as the differentiating parameters and using trellis symbol iterative demodulation, said method further comprising the steps:
modifying said trellis symbol algorithm to iteratively
include the correlation sidelobes by
1) implementing said trellis algorithm over the mainlobe correlation coefficients for the received correlated data symbols,
2) using data symbol estimates from step 1 to evaluate a contribution {circumflex over (X)}k|1 of the sidelobes enabling the hypothesized values {circumflex over (X)}k(jxi) of received QLM correlated data symbols for all paths jxi to be evaluated as the sum {circumflex over (X)}k(jxi)={circumflex over (X)}k|0(jxi)+{circumflex over (X)}k|1 wherein {circumflex over (X)}k|0(jxi) is the hypothesized mainlobe contribution for all jxi,
3) repeating step 1 using a expression for {circumflex over (X)}k(jxi),
4) continuing said iteration as required for convergence to a stable solution,
5) completing the trellis algorithm with the error correction decoding in said step 10,

wherein said QLM demodulated signal in a communications receiver has been generated in a communications transmitter, up-converted to a radio frequency RF, power amplified, and transmitted as a RF QLM signal in a communications transmitter, and
received in said communications receiver, amplified, down-converted, and QLM demodulated as described in this claim followed by decoding to recover the data symbol information.

6. The method in claim 4 for implementation of QLM demodulation in a communications receiver for communications over the same frequency bandwidth of a carrier frequency using time and/or frequency and/or other offsets as the differentiating parameters and using trellis bit demodulation, said method further comprising the steps:
using said trellis symbol algorithm to implement a trellis bit algorithm by
1) implementing said trellis symbol algorithm with data symbols reduced to a first bit b0 for each of the received correlated data symbols in a first pass,
2) implementing error correction decoding and re-encoding of the estimated first bits from step 1 to correct the decisioning errors if necessary, in the first pass,
3) repeating step 1 using two-bit data symbol words b0b1 in a second pass wherein bit b0 is the estimate from the first pass and the second bit b1 is estimated by the trellis algorithm,
4) for additional bits in the data symbol words, repeat error correction decoding and re-encoding in step 2 for the second pass and implement step 3 in a third pass to estimate b0b1b2 using the previous estimates of b0b1 from the second pass,
5) repeating step 3 for each additional bit in the data symbol words,
6) continuing with these passes until the final bit pass to estimate the data symbols,

performing error correction decoding of these estimated data symbols, wherein said QLM demodulated signal in a communications receiver has been generated in a communications transmitter, up-converted to a radio frequency RF, power amplified, and transmitted as a RF QLM signal in a communications transmitter, and
received in said communications receiver, amplified, down-converted, and QLM demodulated as described in this claim followed by decoding to recover the data symbol information.

7. The method in claim 4 for implementation of QLM demodulation in a communications receiver for communications over the same frequency bandwidth of a carrier frequency using time and/or frequency and/or other offsets as the differentiating parameters and using trellis bit iterative demodulation, said method further comprising the steps:
using said trellis symbol algorithm to implement said iterative trellis bit algorithm by
1) implementing a trellis symbol algorithm with the symbols reduced to the first bit b0 for each of the correlated data symbols in a first pass,
2) using bit estimates from step 1 to evaluate a contribution {circumflex over (X)}k|1 of the sidelobes enabling hypothesized values {circumflex over (X)}k(jxi) of received QLM correlated data bits for all paths jxi to be evaluated as a sum {circumflex over (X)}k(jxi)={circumflex over (X)}k|0(jxi)+{circumflex over (X)}k|1 wherein {circumflex over (X)}k|0(jxi) is a hypothesized mainlobe contribution for all jxi,
3) repeating step 1 using this expression for {circumflex over (X)}k(jxi),
4) continuing this iteration as required for convergence to a stable solution,
5) implementing error correction decoding and re-encoding of the first bits to correct the decisioning error if necessary,
6) repeating steps 1-4 using two-bit data symbol words b0b1 in a second pass wherein bit b0 is estimated from the first pass and the second bit b1 is estimated by the iterative trellis algorithm,
7) for additional bits in the data symbol words, repeat error correction decoding and re-encoding in step 5 for the second pass and implement step 6 in a third pass to estimate b0b1b2 using the previous estimates of b0b1 from the second pass,
8) repeating step 6 for each additional bit in the data symbols,
9) continuing with these passes until the final bit pass to estimate the data symbols, and
10) performing error correction decoding of these estimated data symbols,

wherein said QLM demodulated signal in a communications receiver has been generated in a communications transmitter, up-converted to a radio frequency RF, power amplified, and transmitted as a RF QLM signal in a communications transmitter, and
received in said communications receiver, amplified, down-converted, and QLM demodulated as described in this claim followed by decoding to recover the data symbol information.

8. The method in claim 4 or claim 5 or claim 6 or claim 7 for implementation of QLM in a communications transmitter and a communications receiver for communications over the same frequency bandwidth of a carrier frequency using time and/or frequency and/or other offsets as the differentiating parameters and using a demodulation method implemented with methods for reducing computational complexity, said methods for reducing computational complexity further comprising:
reducing the number of trellis states jx and transition paths jxi in the trellis algorithm by eliminating trellis states and trellis paths which have relatively poor values of the path metric αk(jx) used to select a new data symbol estimate,
reducing the number of trellis states by deleting lower correlation values of the sidelobes and mainlobe,
modifying an iterative trellis algorithm to calculate the forward trellis performance using the forward half of the mainlobe and followed by a backward trellis algorithm using the other half of the mainlobe,
modifying said iterative trellis algorithm to incorporate said techniques to eliminate trellis state and trellis paths with relatively poor performance metrics,
using sequential demodulation techniques, partial symbol and bit integration over ΔTs intervals and Δk intervals, and other demodulation techniques as potential candidates for QLM demodulation,
wherein said QLM demodulated signal in a communications receiver has been generated in a communications transmitter as disclosed in claims 1 and 2, up-converted to a radio frequency RF, power amplified, and transmitted as a RF QLM signal in a communications transmitter, and
received in said communications receiver, amplified, down-converted, and QLM demodulated as described in this claim followed by decoding to recover the data symbol information.