Abstract: This invention introduces a new architecture for quadrature layered modulation (QLM) communications which is faster C/W=npb than the Shannon rate C/W=b by using a data symbol rate npW faster than the Nyquist rate W over a frequency band W where np?1 is the data symbol rate increase and b is the data symbol information bits, by scaling the signal to compensate for the data symbol inter-symbol interference loss, by using a Shannon bound Eb/No and SNR data symbol metrics, and by using QLM demodulation algorithms. This architecture provides the same performance as the other QLM architectures operating the communications as a layering of Shannon links over W. This new architecture enables existing communications links to exceed the Shannon rate by operating the transmitter at a faster data symbol rate over W, using the QLM metrics, and by implementing QLM demodulation in the receiver as described in this specification.

Abstract: This invention introduces a scaling correction £ to the Quadrature Layered Modulation (QLM) scaling np of the communications metrics Eb/No and SNR. QLM layers np communications links over the same frequency and/or path assignment and scales the metrics to the QLM values £npEb/No and £np2SNR in order to maintain the same bit error rate (BER) for all np. For np=1 there is no scaling correction £=1. For np>2 the np scaling must be supplemented by a scaling correction £. Identifying £ as a separate parameter whose behavior can be characterized enables one to improve the design and implementation of QLM communications. This introduction of £ enables the bound on QLM data rate performance to become a nearly achievable limit on performance in that one can come arbitrarily close to this bound but can never achieve this bound with each of the np QLM layers obeying the Shannon bound.

Abstract: This invention discloses a method for communications faster than the Nyquist rate (FTN) and faster than the Shannon rate which method is Quadrature Layered Modulation (QLM). QLM properties include scaling the data symbol pulses to maintain the same error rate performance for all rates. QLM alternatively considers the increase in the data symbol rate to be a layering of additional communications over the same link. The Shannon bound is a limit on the capacity of a communication link when transmitting data symbols at the Nyquist rate. QLM observes one can communicate at FTN to transmit more information than the Shannon rate since the Nyquist rate captures the information in a frequency band and does not constraint the information. These properties describe QLM and a separate math proof-of-concept is disclosed. Implementation and performance data demonstrate QLM can support communications data rates which are at least double the Shannon rate.

Abstract: This invention discloses a new Co-State Maximum A-Posterior (MAP) trellis algorithm for implementing Quadrature Layered Modulation (QLM) demodulation over multiple layered channels. This MAP trellis algorithm has been demonstrated to provide performance which is at least as good as the current Maximum Likelihood (ML) trellis algorithm and to support a considerable reduction in the number of trellis paths to reduce the computational complexity. Computational complexity prevents ML trellis demodulation of higher order data symbol metrics over multiple layered channels since there is no viable means to support fewer trellis paths. MAP algorithms for reduction of trellis paths are disclosed for data symbol waveforms representative of OFDM, SC-OFDM, satellite, media, wire, and optical communications.

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.

Abstract: This invention provides a method for increasing the data rates supported by WiFi, WiMax, LTE communications using OFDM and SC-OFDM data symbol waveforms, by using quadrature layered modulation QLM which layers communications channels with a differentiating parameter for each layer that enables a demodulation algorithm to recover the data symbols in each layer, and supports higher data symbol rates then allowed by the Nyquist rate. A maximum likelihood (ML) QLM demodulation algorithm supports data rates to 4.75×57=271 Mbps compared to the current OFDM WiFi standard 57 Mbps with similar increases for WiMax, LTE. Multi-scale (MS) coding can be implemented to spread each data symbol over the OFDM band and over the 4 ?s data packet to optimize BER performance. Computationally efficient signal processing for transmit and receive for OFDM and SC-OFDM are disclosed and Matlab direct error count Monte Carlo bit error rate simulations are evaluated to predict performance.

Abstract: The invention provides a method for implementing demodulation of quadrature layered modulation (QLM) communications using maximum likelihood (ML) demodulation algorithms which limit the demodulation loss. QLM layers communications channels over the same bsndwidth and with a differentiating parameter for each layer which enables a demodulation algorithm to recover the data symbols in each layer. QLM supports higher data rates than allowed by the Shannon bound. QLM demodulation algorithms are trellis symbol algorithms, trellis bit algorithms, ML algorithms, and other equivalent algorithms. Trellis algorithms rapidly increase in complexity with the number of layers of communications and with the order of the modulation. ML algorithms are less complex but have demodulation losses which rapidly increase with the number of data symbols. ML demodulation architectures disclosed in this invention limit these losses and are suitable to implement QLM for higher order modulations and for more layers of communications.

Abstract: A method for implementation of error correction decoding of quadrature layered modulation QLM communications. A bound on communications capacity derived using ideal QLM is approximated with QLM communications links which support data rates independent of the Shannon bound. Trellis symbol and bit demodulation algorithms recover QLM data symbols and bit algorithms offer computational efficiency at a cost of decisioning errors. Correlated bit decisioning error correction decoding and re-encoding can be implemented in a bit demodulation algorithm. Trellis demodulation and trellis decoding algorithms support parallel implementations, and concatenated implementations wherein the error correction decoding is implemented after the QLM demodulation. Concatenated implementation supports turbo decoding, MAP decoding, convolutional decoding, and block decoding by using the decisioning metrics available from QLM demodulation in place of generating the decisioning metrics directly from the detected symbol measurements.

Abstract: A method for constructing architectures for multiple input transmit and multiple output receive (MIMO) systems with generalized orthogonal space-time codes (C0) and generalizations (H0) of the transmission matrix (H) that enable the MIMO equation to be written Y=H0?C0?X+No which factors out the input signal symbol vector X and allows a direct maximum-likelihood calculation of the estimate {circumflex over (X)} of X, and where Y is the received symbol vector and No is the received noise vector.

Abstract: A new communications architecture combines orthogonal frequency division multiple access OFDMA and orthogonal Wavelet division multiple access OWDMA with multi-scale code division multiple access MS-CDMA. The new multi-resolution complex Wavelet application for OWDMA is a Wavelet generalization of OFDMA and forms multi-scale orthogonal channelization filter banks of individual or packet bursts of Wavelets. The new MS-CDMA spreads the users over the OFDMA/OWDMA channels over a wide frequency band and simultaneously spreads the users within each channel such that the resulting spectrum is equivalent to the current wideband CDMA spectrum and the architecture keeps the symbol rates equal to the individual channel frequency spacing for ease of synchronization and equalization to counter multipath. Variable transmit power control is supported for the different MS-CDMA groups of channels.

Abstract: Method for reducing the chip rate of Code Division Multiple Access (CDMA) codes uniformly spread over a frequency bandwidth by converting these codes to 2-scale codes which perform uniform spreading within the subbands of a filter bank over the bandwidth, and over the subbands, and with controllable subband power levels. This is a 2-scale code example of Multi-Scale Code Division Multiple Access (MS-CDMA) and assigns algebraic fields of indices for the first scale “0” which spread within each subband and algebraic fields of indices for the second scale “1” which spread over the subbands. These algebraic fields are scaled and combined to form the algebraic fields of code and chip indices for the 2-scale code. These 2-scale codes perform a Wavelet dilation type of operation to stretch the CDMA chips while maintaining the spreading over the full frequency band.

Abstract: A new bound on communications capacity, a modulation QLM to derive this bound, and QLM to support communications with performance close to this bound. The QLM modulation and demodulation algorithms offer a method for communications links to support a substantially higher data rate than allowed by the Shannon bound for wired, wireless, optical, and the plurality of communications links. The invention compares QLM modulation performance with phase-shift-keying PSK and quadrature amplitude modulation QAM, describes how it can be used with PSK and QAM, and with gaussian minimum shift keying GMSK, orthogonal frequency division multiple access OFDMA, code division multiple access CDMA, and compares QLM modulation performance with the Shannon bound and the new bound derived in this invention. Additional applications for QLM signal processing and bound include the plurality of information theorectic applications with examples being radar, imaging, and processing.

Abstract: A method for designing Wavelets for communications and radar which combines requirements for Wavelets and finite impulse response FIR filters including no excess bandwidth, linear performance metrics for passband, stopband, quadrature mirror filter QMF properties, intersymbol interference, and adjacent channel interference, polystatic filter design requirements, and non-linear metrics for bandwidth efficient modulation BEM and synthetic aperture radar SAR. Demonstrated linear design methodology finds the best design coordinates to minimize the weighted sum of the contributing least-squares LS error metrics for the respective performance requirements. Design coordinates are mapped into the optimum FIR symbol time response.

Abstract: A method and system using the fast encoding and decoding of hybrid Walsh CDMA and generalized hybrid Walsh CDMA codes for simultaneous transmission of multiple data rate users with the different data rate groups of users separated in the sequency domain of these complex CDMA channelization codes. Sequency is the average rate of phase angle rotations of the code vectors and for hybrid Walsh codes sequency is in a 1-to-1 correspondence with frequency for the discrete Fourier transform codes. Hybrid Walsh codes are derived from lexicographic permutations of the real Walsh and can take values {1, j, ?1, ?j}. Generalized hybrid Walsh codes are orthogonal and quasi-orthogonal complex codes derived from tensor (Kronecker) product construction, direct product construction, and functional combining of the plurality of codes including the hybrid Walsh and discrete Fourier transform codes.

Abstract: New and improved a-posteriori decoding probabilities, decisioning metrics, and implementation algorithms for turbo and convolutional decoding to replace the probabilities and decisioning metrics currently used in the maximum likelihood ML and maximum a-posteriori MAP algorithms. A-posteriori probabilities p(x}y) replace the current ML probabilities p(y}x) wherein y is the received symbol and x is the transmitted data and the MAP a-posteriori probability p(s?,s|y) replaces the current MAP joint probability p(s?,s,y) wherein s?,s are the trellis decoding states at k?1, k and y is the observed data set y(k),k=1, 2, . . . , N. This yields a-posteriori probabilities and decisioning metrics to improve decisioning and bit error rate BER performance and to provide a new mathematical decoding framework. Complexity is the same as current implementations.

Abstract: The invention provides a method and system for the generation of Hybrid Walsh orthogonal codes for CDMA spreading and channelization encoding and fast decoding. Current art uses real Walsh orthogonal codes for CDMA spreading and orthogonal channelization. Hybrid Walsh codes are complex Walsh codes that have a isomorphic one-to-one correspondence with the discrete Fourier transform (DFT) codes and are derived by separate permutations of real Walsh codes for the real and for the imaginary components. Hybrid Walsh codes are the best approximation to the DFT within the constraints of a unity norm, 4-phases on real and imaginary axes, orthogonality, and therefore are a preferred choice for a complex Walsh code. The invention discloses a method for the Hybrid Walsh encoder to be generalized by combining with DFT, quasi-orthogonal PN codes, and other codes using a tensor product construction, direct sum construction, and functional combining.