USRE45230E1 - Wireless communication system having linear encoder - Google Patents

Wireless communication system having linear encoder Download PDF

Info

Publication number
USRE45230E1
USRE45230E1 US13/858,734 US201313858734A USRE45230E US RE45230 E1 USRE45230 E1 US RE45230E1 US 201313858734 A US201313858734 A US 201313858734A US RE45230 E USRE45230 E US RE45230E
Authority
US
United States
Prior art keywords
matrix
symbols
stream
produce
constellation
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active, expires
Application number
US13/858,734
Inventor
Georgios B. Giannakis
Yan Xin
Zhengdao Wang
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
University of Minnesota
Original Assignee
University of Minnesota
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Family has litigation
First worldwide family litigation filed litigation Critical https://patents.darts-ip.com/?family=38648301&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=USRE45230(E1) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by University of Minnesota filed Critical University of Minnesota
Priority to US13/858,734 priority Critical patent/USRE45230E1/en
Assigned to NATIONAL SCIENCE FOUNDATION reassignment NATIONAL SCIENCE FOUNDATION CONFIRMATORY LICENSE (SEE DOCUMENT FOR DETAILS). Assignors: UNIVERSITY OF MINNESOTA
Assigned to REGENTS OF THE UNIVERSITY OF MINNESOTA reassignment REGENTS OF THE UNIVERSITY OF MINNESOTA ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: XIN, YAN, WANG, ZHENGDAO, GIANNAKIS, GEORGIOS B.
Application granted granted Critical
Publication of USRE45230E1 publication Critical patent/USRE45230E1/en
Assigned to NATIONAL SCIENCE FOUNDATION reassignment NATIONAL SCIENCE FOUNDATION CONFIRMATORY LICENSE (SEE DOCUMENT FOR DETAILS). Assignors: UNIVERSITY OF MINNESOTA
Assigned to REGENTS OF THE UNIVERSITY OF MINNESTOA reassignment REGENTS OF THE UNIVERSITY OF MINNESTOA ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: ZHOU, SHENGLI
Active legal-status Critical Current
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00Modulated-carrier systems
    • H04L27/26Systems using multi-frequency codes
    • H04L27/2601Multicarrier modulation systems
    • H04L27/2602Signal structure
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/004Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041Arrangements at the transmitter end
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/02Arrangements for detecting or preventing errors in the information received by diversity reception
    • H04L1/04Arrangements for detecting or preventing errors in the information received by diversity reception using frequency diversity
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L2025/0335Arrangements for removing intersymbol interference characterised by the type of transmission
    • H04L2025/03375Passband transmission
    • H04L2025/03414Multicarrier
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L2025/03433Arrangements for removing intersymbol interference characterised by equaliser structure
    • H04L2025/03439Fixed structures
    • H04L2025/03445Time domain
    • H04L2025/03471Tapped delay lines
    • H04L2025/03484Tapped delay lines time-recursive
    • H04L2025/0349Tapped delay lines time-recursive as a feedback filter
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/0001Arrangements for dividing the transmission path
    • H04L5/0003Two-dimensional division
    • H04L5/0005Time-frequency
    • H04L5/0007Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • H04L5/0044Arrangements for allocating sub-channels of the transmission path allocation of payload

Definitions

  • the invention relates to communication systems and, more particularly, transmitters and receivers for use in wireless communication systems.
  • a channel that couples a transmitter to a receiver is often time-varying due to relative transmitter-receiver motion and multipath propagation. Such a time-variation is commonly referred to as fading, and may severely impair system performance.
  • ISI intersymbol interference
  • IFFT Inverse Fast Fourier Transform
  • OFDM Orthogonal Frequency Division Multiplexing
  • a cyclic prefix (CP) of length greater than or equal to the channel order is inserted per block at the transmitter and discarded at the receiver.
  • the CP also converts linear convolution into cyclic convolution and thus facilitates diagonalization of an associated channel matrix (Z. Wang and G. B. Giannakis, “Wireless multicarrier communications: where Fourier meets Shannon,” IEEE Signal Processing Magazine, vol. 47, no. 3, pp. 29-48, May 2000, herein incorporated by reference).
  • OFDM transfers the multipath diversity to the frequency domain in the form of (usually correlated) fading frequency response.
  • Each OFDM subchannel has its gain being expressed as a linear combination of the dispersive channel taps.
  • Error-control codes are usually invoked before the IFFT processing to deal with the frequency-selective fading. These include convolutional codes, Trellis Coded Modulation (TCM) or coset codes, Turbo-codes, and block codes (e.g., Reed-Solomon or BCH).
  • TCM Trellis Coded Modulation
  • Turbo-codes e.g., Reed-Solomon or BCH.
  • block codes e.g., Reed-Solomon or BCH.
  • Such coded OFDM schemes often incur high complexity and/or large decoding delay (Y. H. Jeong, K. N. Oh, and J. H. Park, “Performance evaluation of trellis-coded OFDM for digital audio broadcasting,” in Proc. of the IEEE Region 10 Conf, 1999, vol. 1, pp. 569-572, herein incorporated by reference).
  • Some of these schemes also require Channel State Information (CSI) at the transmitter (A. Ruiz, J. M.
  • CSI Channel
  • Cioffi, and S. Kasturia “Discrete multiple tone modulation with coset coding for the spectrally shaped channel,” IEEE Transactions on Communications, vol. 40, no. 6, pp. 1012-1029, June 1992, herein incorporated by reference; H. R. Sadjadpour, “Application of Turbo codes for discrete multi-tone modulation schemes,” in Proc. of Intl. Conf. on Com., Vancouver, Canada, 1999, vol. 2, pp. 1022-1027, herein incorporated by reference), which may be unrealistic or too costly to acquire in wireless applications where the channel is rapidly changing.
  • each IFFT-processed block can be zero padded (ZP) by at least as many zeros as the channel order (B. Muquet, Z. Wang, G. B. Giannakis, M. de Courville, and P. Duhamel, “Cyclic prefixed or zero padded multicarrier transmissions?” IEEE Transactions on Communications, August 2000 (to appear), herein incorporated by reference; Z. Wang and G. B. Giannakis, “Wireless multicarrier communications: where Fourier meets Shannon,” IEEE Signal Processing Magazine, vol. 47, no. 3, pp. 29-48, May 2000, herein incorporated by reference).
  • the CF block code described herein can also be viewed as a form of real-number or analog codes (W. Henkel, Zur Decodierung algebraischer Blockcodes über precisen Alphabeten, Ph.D. thesis, VDI Fort suits-Berichte, Erasmus 10, Nr. 109, VDI-Verlag, Düsseldorf, 1989, herein incorporated by reference; T. G. Marshall Jr., “Coding of real-number sequences for error correction: A digital signal processing problem,” IEEE Journal on Selected Areas in Communications, vol. 2, no. 2, pp. 381-392, March 1984 herein incorporated by reference; J. K. Wolf, “Redundancy, the discrete Fourier transform, and impulse noise cancellation,” IEEE Transactions on Communications, vol. 31, no. 3, pp. 458-461, March 1983, herein incorporated by reference).
  • Linear Encoder (LE),” 0 and the corresponding encoding process is called “linear encoding,” also abbreviated as LE when no confusions arise.
  • the resulting CF coded OFDM will be called LE-OFDM.
  • the linear encoder is designed so that maximum diversity order can be guaranteed without an essential decrease in transmission rate.
  • the described LE can be designed to guarantee maximum diversity order irrespective of the information symbol constellation with minimum redundancy.
  • the described LE codes are maximum distance separable (MDS) in the real or complex field, which generalizes the well-known MDS concept for Galois field (GF) codes (F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977, herein incorporated by reference).
  • MDS maximum distance separable
  • GF Galois field
  • a wireless communication device comprises an encoder that linearly encodes a data stream to produce an encoded data stream, and a modulator to produce an output waveform in accordance with the encoded data stream for transmission through a wireless channel.
  • a wireless communication device comprises a demodulator that receives a waveform carrying a linearly encoded transmission and produces a demodulated data stream, and a decoder that applies decodes the demodulated data and produce estimated data.
  • a method comprises linearly encoded a data stream with to produce an encoded data stream, and outputting a waveform in accordance with the data stream for transmission through a wireless channel.
  • a computer-readable medium comprises instructions to cause a programmable processor to linearly encode a data stream with to produce an encoded data stream, and output a waveform in accordance with the data stream for transmission through a wireless channel.
  • FIG. 1 is a block diagram illustrating an exemplary wireless communication system in which a transmitter and receiver implement linear precoding techniques.
  • FIGS. 2A , 2 B illustrate uncoded and GF-coded BPSK signals.
  • FIG. 3 illustrates an example format of a transmission block for CP-only transmissions by the transmitter of FIG. 1 .
  • FIG. 4 illustrates an example format of a transmission block for ZP-only transmissions by the transmitter of FIG. 1 .
  • FIG. 5 illustrates sphere decoding applied in one embodiment of the receiver of FIG. 1 .
  • FIG. 6 illustrates an example portion of the receiver of FIG. 1 .
  • FIG. 7 is factor graph representing an example linear encoding process.
  • FIGS. 8-10 are graphs that illustrate exemplary results of simulations of the described techniques.
  • FIG. 1 is a block diagram illustrating a telecommunication system 2 in which transmitter 4 communicates data to receiver 6 through wireless channel 8 .
  • Transmitter 4 transmits data to receiver 6 using one of a number of conventional multi-carrier transmission formats including Orthogonal Frequency Division Multiplexing (OFDM).
  • OFDM has been adopted by many standards including digital audio and video broadcasting (DAB, DVB) in Europe and high-speed digital subscriber lines (DSL) in the United States.
  • OFDM has also been proposed for local area mobile wireless broadband standards including IEEE802.11a, MMAC and HIPERLAN/2. [ETSI, “Broadband Radio Access Networks (BRAN); HIPERLAN Type 2 technical specification Part 1—physical layer,” DTS/BRAN030003-1, October 1999].
  • system 2 represents an LE-OFDM system having N subchannels.
  • the techniques described herein robustify multi-carrier wireless transmissions, e.g., OFDM, against random frequency-selective fading by introducing memory into the transmission with complex field (CF) encoding across the subcarriers.
  • transmitter 4 utilizes different linear combinations of the information symbols on the subcarriers.
  • the techniques described herein may be applied to uplink and/or downlink transmissions, i.e., transmissions from a base station to a mobile device and vice versa.
  • transmitters 4 and receivers 6 may be any device configured to communicate using a multi-user wireless transmission including a cellular distribution station, a hub for a wireless local area network, a cellular phone, a laptop or handheld computing device, a personal digital assistant (PDA), and the like.
  • a cellular distribution station a hub for a wireless local area network
  • a cellular phone a laptop or handheld computing device
  • PDA personal digital assistant
  • transmitter 4 includes linear encoder 10 and an OFDM modulator 12 .
  • AWGN additive white Gaussian noise
  • the set ⁇ is always finite. But we allow it to be infinite in our performance analysis.
  • the encoder ⁇ considered here does not depend on the OFDM symbol index i. Time-varying encoder may be useful for certain purposes (e.g., power loading), but they will not be pursued here. Hence, from now on, we will drop our OFDM symbol index i for brevity.
  • the matrix ⁇ can be naturally viewed as the generating matrix of a complex field block code.
  • the set is a subset of the C N ⁇ 1 vector space. More specifically, is a subset of the K dimensional subspace spanned by the columns of ⁇ .
  • the codeword set of a GF (n, k) code when viewed as a real/complex vector, in general has a higher dimensionality (n) than does the original uncoded block of symbols (k). Exceptions include the repetition code, for which the codeword set has the same dimensionality as that of the input.
  • the codebook consists of 4 codewords [ ⁇ 1 ⁇ 1 ⁇ 1] T , [1 ⁇ 1 1] T , [ ⁇ 1 1 1] T , [1 1 ⁇ 1] T . (4) These codewords span the R 3 ⁇ 1 (or C 3 ⁇ 1 ) space and therefore the codebook has dimension 3 in the real or complex field, as illustrated in FIG. 2 .
  • a (n, k) binary GF block code is capable of generating 2 k codewords in an n-dimensional space R n ⁇ 1 or C n ⁇ 1 . If we view the transmit signal design problem as packing spheres in the signal space (Shannon's point of view), an (n, k) GF block code followed by constellation mapping packs spheres in an n-dimensional space and thus has the potential to be better (larger sphere radius) than a k-dimensional packing.
  • the 4 codewords have mutual Euclidean distance ⁇ square root over (8/3) ⁇ , larger than the minimum distance ⁇ square root over (2) ⁇ of the uncoded BPSK signal set ( ⁇ 1, ⁇ 1).
  • This increase in minimum Euclidean distance leads to improved system performance in AWGN channels, at least for high signal to noise ratio (SNR).
  • SNR signal to noise ratio
  • the minimum Hamming distance of the codebook dominates high SNR performance in the form of diversity gain (as will become clear later).
  • the diversity gain achieved by the (3, 2) block code in the example is the minimum Hamming distance 2 .
  • CF linear encoding on the other hand, does not increase signal dimension; i.e., we always have dim(U) ⁇ dim(S).
  • CF linear encoding does not yield a packing of dimension higher than K.
  • CF linear codes are not effective for improving performance for AWGN channels. But for fading channels, they may have an advantage over GF codes, because they are capable of producing codewords that have large Hamming distance.
  • the cyclic prefix in this case consists of L zeros, which, together with the L zeros from the encoding process, result in 2L consecutive zeros between two consecutive uncoded information blocks of length K. But only L zeros are needed in order to separate the information blocks. CP is therefore not necessary because the L zeros created by ⁇ already separate successive blocks.
  • ZP-only transmission is essentially a simple single-carrier block scheme.
  • viewing it as a special case of the LE-OFDM design will allow us to apply the results about LE-OFDM and gain insights into its performance. It turns out that this special case is indeed very special: it achieves the best high-SNR performance among the LE-OFDM class.
  • the PEP can be approximated using the Chernoff bound as: P(s ⁇ s′
  • An upper bound to the average PEP can be obtained by averaging (6) with respect to the random channel h to obtain (V. Tarokh, N. Seshadri, and A. R. Calderbank, “Space-time codes for high data rate wireless communication: Performance criterion and code construction,” IEEE Transactions on Information Theory, vol. 44, no. 2, pp. 744-765, March 1998, herein incorporated by reference):
  • the diversity order G d,e determines the slope of the averaged (w.r.t. the random channel) PEP (between s and s′) as a function of the SNR at high SNR (N 0 ⁇ 0).
  • G c,e determines the shift of this PEP curve in SNR relative to a benchmark error rate curve of (1 ⁇ 4N 0 ) ⁇ r e .
  • Diversity order herein to mean the asymptotic slope of the error probability versus SNR curve in a log-log scale.
  • “diversity” refers to “channel diversity,” i.e., roughly the degree of freedom of a given channel.
  • three conditions may be satisfied: i) Transmitter 4 is well-designed so that the information symbols are encoded with sufficient redundancy (enough diversification); ii) Channel 8 is capable of providing enough degrees of freedom; iii) Receiver 4 is well designed so as to sufficiently exploit the redundancy introduced at the transmitter.
  • G d Since the diversity order G d determines how fast the symbol error probability drops as SNR increases, G d is to be optimized first.
  • Theorem 1 (Maximum Achievable Diversity Order): For a transmitted codeword set with minimum Hamming distance ⁇ min , over i.i.d. FIR Rayleigh fading channels of order L, the diversity order is min( ⁇ min , L+1). Thus, the Maximum Achievable Diversity Order (MADO) of LE-OFDM transmissions is L+1 and in order to achieve MADO, we need ⁇ min ⁇ L+1.
  • MADO Maximum Achievable Diversity Order
  • Theorem 1 is intuitively reasonable because the FIR Rayleigh fading channel offers us L+1 independent fading [S. G. Wilson, Digital Modulation and Coding, Prentice-Hall, Inc, 1996, herein incorporated by reference] taps, which is the maximum possible number of independent replicas of the transmitted signal in the serial transmission mode. In order to achieve the MADO, any two codewords in should be different by no less than L+1 entries.
  • the results in Theorem 1 can also be applied to GF-coded/interleaved OFDM systems provided that channel coding or interleaving is applied only within an OFDM symbol and not across successive OFDM symbols.
  • the diversity is again the minimum of the minimum Hamming distance of the code and L+1. To see this, it suffices to view as the codeword set of GF-coded blocks.
  • Theorem 2 (Symbol Detectability MADO): Under the channel conditions of Theorem 1, the maximum diversity order is achieved if and only if symbol detectability is achieved; i.e., ⁇ D H ⁇ c ⁇ 2 ⁇ 0, ⁇ e ⁇ e and ⁇ h ⁇ 0.
  • the result in Theorem 2 is somewhat surprising: it asserts the equivalence of a deterministic property of the code, namely symbol detectability in the absence of noise, with a statistical property, the diversity order. It can be explained though, by realizing that in random channels, the performance is mostly affected by the worst channels, despite their small realization probability. By guaranteeing detectability for any, and therefore the worst, channels, we are essentially improving the ensemble performance.
  • the symbol detectability condition in Theorem 2 should be checked against all pairs s and s′, which is usually not an easy task, especially when the underlying constellations are large and/or when the size K of s is large. But it is possible to identify sufficient conditions on ⁇ that guarantee symbol detectability and that are relatively easy to check.
  • One such condition is provided by the following theorem.
  • Vandermonde encoders in i) satisfy the conditions of Theorem 3. Any K rows of the matrix ⁇ ( ⁇ ) form a square Vandermonde matrix with distinct rows. Such a Vandermonde matrix is known to have a determinant different from 0. Therefore, any K rows of ⁇ ( ⁇ ) are linearly independent, which satisfies the conditions in Theorem 3.
  • ⁇ 1 [ cos ⁇ ( 1 2 ⁇ ⁇ 0 ) cos ⁇ ( 3 2 ⁇ ⁇ 0 ) ⁇ cos ⁇ ( 2 ⁇ ⁇ K - 1 2 ⁇ ⁇ 0 ) cos ⁇ ( 1 2 ⁇ ⁇ 1 ) cos ⁇ ( 3 2 ⁇ ⁇ 1 ) ⁇ cos ⁇ ( 2 ⁇ ⁇ K - 1 2 ⁇ ⁇ 1 ) cos ⁇ ( 3 2 ⁇ ⁇ 1 ) ⁇ cos ⁇ ( 2 ⁇ ⁇ K - 1 ) ⁇ ⁇ ⁇ cos ⁇ ( 1 2 ⁇ ⁇ K - 1 ) cos ⁇ ( 3 2 ⁇ ⁇ K - 1 ) ⁇ cos ⁇ ( 2 ⁇ ⁇ K - 1 2 ⁇ ⁇ K - 1 ) ] ( 11 )
  • z n cos ⁇ ( 1 2 ⁇ ⁇ n ) .
  • Theorem 5 (MADO of Correlated Rayleigh Channels): Let the channel h be zero-mean complex Gaussian with correlation matrix R h . The maximum achievable diversity order equals the rank of R h , which is achieved by any encoder that achieves MADO with i.i.d. Rayleigh channels. If R h is full rank and MADO is achieved, then the coding advantage is different from the coding advantage in the i.i.d. case only by a constant
  • R h [ U 1 U 2 ] ⁇ [ ⁇ 1 0 0 ⁇ 2 ] ⁇ [ U 1 H U 2 H ] . ( 12 ) where U 1 is (L+1) ⁇ r h , U 2 is (L+1) ⁇ (L+1 ⁇ r h ), A 1 is r h ⁇ r h full rank diagonal, and A 2 is an (L+1 ⁇ r h ) ⁇ (L+1 ⁇ r h ) all-zero matrix.
  • a ⁇ e ⁇ 1 1 2 ⁇ U 1 H ⁇ A e ⁇ U 1 ⁇ ⁇ 1 1 2 is an r h ⁇ r h matrix.
  • a ⁇ e ⁇ 1 1 2 ⁇ U 1 H ⁇ B e H ⁇ B e ⁇ U 1 ⁇ ⁇ 1 1 2 is the Gram matrix of
  • Theorem 5 asserts that the rank(R h ) is the MADO for LE-OFDM systems as well as for coded OFDM systems that do not code or interleave across OFDM symbols. Also, MADO-achieving transmissions through i.i.d. channels can achieve the MADO for correlated channels as well.
  • ZP-only transmission is one of the coding advantage maximizers (Z. Wang, X. Ma, and G. B. Giannakis, “OFDM or single-carrier zero-padded block transmissions?” IEEE Transactions on Communications, August 2001 (accepted), herein incorporated by reference; “Optimality of Single-Carrier Zero-Padded Block Transmissions,” in Proc. of Wireless Comm. and Networking Conf., pp. 660-664, 2002, Orlando, Fla., herein incorporated by reference).
  • Theorem 6 (ZP-only: maximum coding advantage): Suppose the entries of s(i) are drawn independently from a finite constellation with minimum distance of d min ( ). Then the maximum coding advantage of an LE-OFDM for i.i.d. Rayleigh fading channels under as1) is G c,max ⁇ L d min 2 ( ). The maximum coding advantage is achieved by ZP-only transmissions with any K.
  • GF MDS codes F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Amsterdam: North Holland, 1977, herein incorporated by reference.
  • Examples of GF MDS codes include single-parity-check coding, repetition coding, generalized RS coding, extended RS coding, doubly extended RS coding, algebraic-geometry codes constructed using an elliptic curve.
  • Reed-Solomon codes are the least restrictive among them in terms of the number of elements in the field, they are constrained on the code length and the alphabet size.
  • Our linear encoders ⁇ operate over the complex field with no restriction on the input symbol alphabet or the coded symbol alphabet.
  • a generator ⁇ for an MDS code is called systematic if it is in the form [I K , P] T where P is a K ⁇ (N ⁇ K) matrix.
  • Theorem 8 (Systematic MDS code): A code generated by [I, P] T is MDS if and only if every square submatrix of P is nonsingular.
  • Any square submatrix of a Cauchy matrix is nonsingular (R. M. Roth and G. Seroussi, “On generator matrices of MDS codes,” IEEE Transactions on Information Theory, vol. 31, no. 6, pp. 826-830, November 1985, herein incorporated by reference).
  • is a finite set, e.g., a finite constellation carved from (possibly sealed and shifted) Z K .
  • This includes BPSK, QPSK, and QAM [X. Giraud, E. Boutillon, and J. C. Belfiore, “Algebraic tools to build modulation schemes for fading channels,” IEEE Transactions on Information Theory, vol. 43, pp. 938-952, May 1997, herein incorporated by reference; Z. Liu; Y. Xin, and G. B. Giannakis, “Unitary precoded OFDM with maximum multipath diversity and coding gains,” in Proc.
  • LE-OFDM requires ML decoding.
  • the minimum-distance detection rule becomes ML and can be formulated as follows:
  • ML decoding of LE transmissions belongs to a general class of lattice decoding problems, as the matrix product D H ⁇ in (2) gives rise to a discrete subgroup (lattice) of the C N space under the vector addition operation.
  • finding the optimum estimate in (16) requires searching over
  • the search radius C is set equal to ⁇ Q H x ⁇ Rs 0 ⁇ and a new search round is started. If no other vector is found inside the radius, then s 0 is the ML solution. Otherwise, if s 1 is found inside the sphere, the search radius is again reduced to ⁇ Q H x ⁇ Rs 1 ⁇ , and so on. If no s 0 is ever found inside the initial sphere of radius C, then C is too small. In this case, either a decoding failure is declared or C is increased.
  • the complexity of the SD is polynomial in K (U. Fincke and M. Pohst, “Improved methods for calculating vectors of short length in a lattice, including a complexity analysis,” Math. Comput., vol. 44, pp. 463-471, April 1985, herein incorporated by reference), which is better than exponential but still too high for practical purposes. Indeed, it is not suitable for codes of block size greater than, say, 16. When the block size is small, the sphere decoder can be considered as an option to achieve the ML performance at manageable complexity.
  • Viterbi decoding can be used at a complexity of (Q L ) per symbol, where Q is the constellation size of the symbols in s (G. D. Jr. Forney, “Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference,” IEEE Transactions on Information Theory, vol. 18, pp. 363-378, May 1972, herein incorporated by reference).
  • Zero-forcing (ZF) and MMSE detectors (equalizers) offer low-complexity alternatives.
  • the ZF and MMSE equalizers based on the input-output relationship (2) can be written as (A. Scaglione, G. B. Giannakis, and S. Barbarossa, “Linear precoding for estimation and equalization of frequency-selective channels,” in Signal Processing Advances in Wireless and Mobile Communications, G. B. Giannakis, Y. Hua, P. Stoica, and L. Tong, Eds. 2001, vol.
  • ( ⁇ ) T denotes pseudo-inverse
  • ⁇ ⁇ 2 is the variance of entries of noise ⁇
  • R s is the autocorrelation matrix of s.
  • the ML detection schemes in general have high complexity, while the linear detectors may have decreased performance.
  • the class of decision-directed detectors lies between these categories, both in terms of complexity and in terms of performance.
  • DFE Decision Feedback Equalizers
  • B is usually chosen to be a strictly upper or lower triangular matrix with zero diagonal entries.
  • the feedback loop is represented as a matrix, the operations happen in a serial fashion: the estimated symbols are fed back serially as their decisions are formed one by one.
  • the matrices W and B can be designed according to ZF or MMSE criteria (N. Al-Dhahir and A. H. Sayed, “The finite-length multi-input multi-output MMSE-DFE,” IEEE Transactions on Signal Processing, vol. 48, no. 10, pp. 2921-2936, October 2000, herein incorporated by reference; A. Stamoulis, G. B. Giannakis, and A.
  • decoding methods include iterative detectors, such as successive interference cancellation with iterative least squares (SIC-ILS) (T. Li and N. D. Sidiropoulos, “Blind digital signal separation using successive interference cancellation iterative least squares,” IEEE Transactions on Signal Processing, vol. 48, no. 11, pp. 3146-3152, November 2000, herein incorporated by reference), and multistage cancellations (S. Verd ⁇ , Multiuser Detection, Cambridge Press, 1998, herein incorporated by reference). These methods are similar to the illustrated DFE in the interference from symbols that are decided in a block is canceled before a decision on the current symbol is made.
  • SP-ILS successive interference cancellation with iterative least squares
  • SIC-ILS least squares is used as the optimization criterion and at each step or iteration, the cost function (least-squares) will decrease or remain the same.
  • the MMSE criterion is often used such that MF is optimum after the interference is removed (supposing that the noise is white).
  • the difference between a multistage cancellation scheme and the block DFE is that the DFE symbol decisions are made serially; and for each undecided symbol, only interference from symbols that have been decided is cancelled; while in multistage cancellation, all symbols are decided simultaneously and then their mutual interferences are removed in a parallel fashion.
  • another embodiment may utilize for LEOFDM equalization an iterative “sum-product” decoding algorithm, which is also used in Turbo decoding (F. R. Kschischang, B. J. Frey, and H-A. Loeliger, “Factor graphs and the sum-product algorithm,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 498-519, February 2001, herein incorporated by reference).
  • the coded system is represented using a factor graph, which describes the interdependence of the encoder input, the encode output, and the noise-corrupted coded symbols.
  • M ⁇ 1 are of smaller size than ⁇ and all of them can even be chosen to be identical.
  • decoding s from the noisy D H ⁇ s is equivalent to decoding M coded sub-vectors of smaller sizes and therefore the overall decoding complexity can be reduced considerably.
  • Such a decomposition is particularly important when a high complexity decoder such as the sphere decoder is to be deployed.
  • FIGS. 8-10 are graphs that illustrate exemplary results of simulations of the described techniques.
  • BPSK constellation is used, and in Test Case 2 and 3, the binary encoded symbols are mapped to ⁇ 1's before OFDM modulation.
  • Test case 1 (Decoding of LE-OFDM): We first test the performance of different decoding algorithms.
  • the channel is i.i.d. Rayleigh and BER's for 200 random channel realizations according to As1) are averaged.
  • FIG. 8 shows the performance of ZF, MMSE, DFE, and sphere decoding (ML) for LE-OFDM.
  • BER of 10 ⁇ 4 DFE performs about 2 dB better than the MMSE detectors, while at the same time it is only less than 1 dB inferior to the sphere decoder, which virtually achieves the ML decoding performance.
  • Test case 3 Comparing LE-OFDM with convolutionally coded OFDM:
  • ETSI “Broadband Radio Access Networks (BRAN), herein incorporated by reference; HIPERLAN Type 2 technical specification Part 1—physical layer,” DTS/BRAN030003-1, October 1999, herein incorporated by reference
  • the rate 1 ⁇ 2 mother code has its generator in octal form as (133, 171) and there are 64 states in its trellis.
  • Every 3rd bit from the first branch and every second bit from the second branch of the mother code are punctured to obtain the rate 3 ⁇ 4 code, which results in a code whose weight enumerating function is 8W 5 +31W 6 +160W 7 + . . . . So the free distance is 5, which means that the achieved diversity is 5, less than the diversity order 6 achieved by LE-OFDM.
  • ⁇ 0 is a 24 ⁇ 18 encoder obtained by taking the first 18 columns of a 24 ⁇ 24 DCT matrix.
  • LE-OFDM performs about 2 dB better than convolutionally coded OFDM. From the ML performance curves in FIG. 10 , LE-OFDM seems to achieve a larger coding advantage than the punctured convolutional code we used.
  • the performance of LE-OFDM is better than coded OFDM for SNR values less than 12 dB.
  • the complexity of ML decoding for LE-OFDM is quite high in the order of 1,000 flops per symbol. But the ZF and MMSE decoders have comparable or even lower complexity than the Viterbi decoder for the convolutional code.
  • LE-OFDM The complexity of LE-OFDM can be dramatically reduced using the parallel encoding method with square encoders (Z. Liu, Y. Xin, and G. B. Giannakis, “Linear Constellation Precoding for OFDM with Maximum Multipath Diversity and Coding Gains,” Proceedings of 35th Asilomar Conference on Signals, Systems & Computers, Pacific Grove, Calif., Nov. 4-7, 2001, pp. 1445-1449, herein incorporated by reference). It is also possible to combine CF coding with conventional GF coding, in which case only small square encoders of size 2 ⁇ 2 or 4 ⁇ 4 are necessary to achieve near optimum performance (Z. Wang, S. Zhou, and G. B.
  • the described techniques can be embodied in a variety of receivers and transmitters including base stations, cell phones, laptop computers, handheld computing devices, personal digital assistants (PDA's), and the like.
  • the devices may include a digital signal processor (DSP), field programmable gate array (FPGA), application specific integrated circuit (ASIC) or similar hardware, firmware and/or software for implementing the techniques.
  • DSP digital signal processor
  • FPGA field programmable gate array
  • ASIC application specific integrated circuit
  • a computer readable medium may store computer readable instructions, i.e., program code, that can be executed by a processor or DSP to carry out one of more of the techniques described above.
  • the computer readable medium may comprise random access memory (RAM), read-only memory (ROM), non-volatile random access memory (NVRAM), electrically erasable programmable read-only memory (EEPROM), flash memory, or the like.
  • RAM random access memory
  • ROM read-only memory
  • NVRAM non-volatile random access memory
  • EEPROM electrically erasable programmable read-only memory
  • flash memory or the like.
  • the computer readable medium may comprise computer readable instructions that when executed in a wireless communication device, cause the wireless communication device to carry out one or more of the techniques described herein.

Abstract

In general, linear complex-field encoding techniques are proposed. For example, transmitter of a wireless communication system includes an encoder and a modulator. The encoder linearly encodes a data stream to produce an encoded data stream. The modulator to produce an output waveform in accordance with the encoded data stream for transmission through a wireless channel. The modulator generates the output waveform as a multicarrier waveform having a set of subcarriers, e.g., an Orthogonal Frequency Division Multiplexing (OFDM) waveform. The encoder linearly encodes the data stream so that the subcarriers carry different linear combinations of information symbols of the data stream.

Description

This application claims priority from U.S. Provisional Application Ser. No. 60/374,886, filed Apr. 22, 2002, U.S. Provisional Application Ser. No. 60/374,935, filed Apr. 22, 2002, U.S. Provisional Application Ser. No. 60/374,934, filed Apr. 22, 2002, U.S. Provisional Application Ser. No. 60/374,981, filed Apr. 22, 2002, U.S. Provisional Application Ser. No. 60/374,933, filed Apr. 22, 2002, the entire contents of which are incorporated herein by reference.
STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT
This invention was made with Government government support under Contract No. ECS-9979443, awarded by the National Science Foundation, and Contract No. DAAG55-98-1-0336 (University of Virginia Subcontract No. 5-25127) awarded by the U.S. Army. The Government may have government has certain rights in this invention.
TECHNICAL FIELD
The invention relates to communication systems and, more particularly, transmitters and receivers for use in wireless communication systems.
BACKGROUND
In wireless mobile communications, a channel that couples a transmitter to a receiver is often time-varying due to relative transmitter-receiver motion and multipath propagation. Such a time-variation is commonly referred to as fading, and may severely impair system performance. When a data rate for the system is high in relation to channel bandwidth, multipath propagation may become frequency-selective and cause intersymbol interference (ISI). By implementing Inverse Fast Fourier Transform (IFFT) at the transmitter and FFT at the receiver, Orthogonal Frequency Division Multiplexing (OFDM) converts an ISI channel into a set of parallel ISI-free subchannels with gains equal to the channel's frequency response values on the FFT grid. Each subchannel can be easily equalized by a single-tap equalizer using scalar division.
To avoid inter-block interference (IBI) between successive IFFT processed blocks, a cyclic prefix (CP) of length greater than or equal to the channel order is inserted per block at the transmitter and discarded at the receiver. In addition to suppressing IBI, the CP also converts linear convolution into cyclic convolution and thus facilitates diagonalization of an associated channel matrix (Z. Wang and G. B. Giannakis, “Wireless multicarrier communications: where Fourier meets Shannon,” IEEE Signal Processing Magazine, vol. 47, no. 3, pp. 29-48, May 2000, herein incorporated by reference).
Instead of having multipath diversity in the form of (superimposed) delayed and scaled replicas of the transmitted symbols as in the case of serial transmission, OFDM transfers the multipath diversity to the frequency domain in the form of (usually correlated) fading frequency response. Each OFDM subchannel has its gain being expressed as a linear combination of the dispersive channel taps. When the channel has nulls (deep fades) close to or on the FFT grid, reliable detection of the symbols carried by these faded subcarriers becomes difficult if not impossible.
Error-control codes are usually invoked before the IFFT processing to deal with the frequency-selective fading. These include convolutional codes, Trellis Coded Modulation (TCM) or coset codes, Turbo-codes, and block codes (e.g., Reed-Solomon or BCH). Such coded OFDM schemes often incur high complexity and/or large decoding delay (Y. H. Jeong, K. N. Oh, and J. H. Park, “Performance evaluation of trellis-coded OFDM for digital audio broadcasting,” in Proc. of the IEEE Region 10 Conf, 1999, vol. 1, pp. 569-572, herein incorporated by reference). Some of these schemes also require Channel State Information (CSI) at the transmitter (A. Ruiz, J. M. Cioffi, and S. Kasturia, “Discrete multiple tone modulation with coset coding for the spectrally shaped channel,” IEEE Transactions on Communications, vol. 40, no. 6, pp. 1012-1029, June 1992, herein incorporated by reference; H. R. Sadjadpour, “Application of Turbo codes for discrete multi-tone modulation schemes,” in Proc. of Intl. Conf. on Com., Vancouver, Canada, 1999, vol. 2, pp. 1022-1027, herein incorporated by reference), which may be unrealistic or too costly to acquire in wireless applications where the channel is rapidly changing. Another approach to guaranteeing symbol detectability over ISI channels is to modify the OFDM setup: instead of introducing the CP, each IFFT-processed block can be zero padded (ZP) by at least as many zeros as the channel order (B. Muquet, Z. Wang, G. B. Giannakis, M. de Courville, and P. Duhamel, “Cyclic prefixed or zero padded multicarrier transmissions?” IEEE Transactions on Communications, August 2000 (to appear), herein incorporated by reference; Z. Wang and G. B. Giannakis, “Wireless multicarrier communications: where Fourier meets Shannon,” IEEE Signal Processing Magazine, vol. 47, no. 3, pp. 29-48, May 2000, herein incorporated by reference).
SUMMARY
In general, techniques are described for robustifying multi-carrier wireless transmissions, e.g., OFDM, against random frequency-selective fading by introducing memory into the transmission with complex field (CF) encoding across the subcarriers. Specifically, instead of sending a different uncoded symbol per subcarrier, the techniques utilize different linear combinations of the information symbols on the subcarriers. These techniques generalize signal space diversity concepts to allow for redundant encoding (J. Boutros and E. Viterbo, “Signal space diversity: A power and bandwidth efficient diversity technique for the Rayleigh fading channel,” IEEE Transactions on Information Theory, vol. 44, pp. 1453-1467, July 1998, herein incorporated by reference) concepts to allow for redundant encoding. The CF block code described herein can also be viewed as a form of real-number or analog codes (W. Henkel, Zur Decodierung algebraischer Blockcodes über komplexen Alphabeten, Ph.D. thesis, VDI Fortschritt-Berichte, Reihe 10, Nr. 109, VDI-Verlag, Düsseldorf, 1989, herein incorporated by reference; T. G. Marshall Jr., “Coding of real-number sequences for error correction: A digital signal processing problem,” IEEE Journal on Selected Areas in Communications, vol. 2, no. 2, pp. 381-392, March 1984 herein incorporated by reference; J. K. Wolf, “Redundancy, the discrete Fourier transform, and impulse noise cancellation,” IEEE Transactions on Communications, vol. 31, no. 3, pp. 458-461, March 1983, herein incorporated by reference).
The encoder described herein is referred to as a “Linear Encoder (LE),”0 and the corresponding encoding process is called “linear encoding,” also abbreviated as LE when no confusions arise. The resulting CF coded OFDM will be called LE-OFDM. In one embodiment, the linear encoder is designed so that maximum diversity order can be guaranteed without an essential decrease in transmission rate.
By performing pairwise error probability analysis, we upper bound the diversity order of OFDM transmissions over random frequency-selective fading channels. The diversity order is directly related to a Hamming distance between the coded symbols. Moreover, the described LE can be designed to guarantee maximum diversity order irrespective of the information symbol constellation with minimum redundancy. In addition, the described LE codes are maximum distance separable (MDS) in the real or complex field, which generalizes the well-known MDS concept for Galois field (GF) codes (F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977, herein incorporated by reference). Two classes of LE codes are described that can achieve MDS and guarantee maximum diversity order: the Vandermonde class, which generalizes the Reed-Solomon codes to the real/complex field, and the Cosine class, which does not have a GF counterpart.
Several possible decoding options have been described, including ML, ZF, MMSE, DFE, and iterative detectors. Decision directed detectors may be used to strike a trade-off between complexity and performance.
In one embodiment, a wireless communication device comprises an encoder that linearly encodes a data stream to produce an encoded data stream, and a modulator to produce an output waveform in accordance with the encoded data stream for transmission through a wireless channel.
In another embodiment, a wireless communication device comprises a demodulator that receives a waveform carrying a linearly encoded transmission and produces a demodulated data stream, and a decoder that applies decodes the demodulated data and produce estimated data.
In another embodiment, a method comprises linearly encoded a data stream with to produce an encoded data stream, and outputting a waveform in accordance with the data stream for transmission through a wireless channel.
In another embodiment, a computer-readable medium comprises instructions to cause a programmable processor to linearly encode a data stream with to produce an encoded data stream, and output a waveform in accordance with the data stream for transmission through a wireless channel.
The details of one or more embodiments of the invention are set forth in the accompanying drawings and the description below. Other features, objects, and advantages of the invention will be apparent from the description and drawings, and from the claims.
BRIEF DESCRIPTION OF DRAWINGS
FIG. 1 is a block diagram illustrating an exemplary wireless communication system in which a transmitter and receiver implement linear precoding techniques.
FIGS. 2A, 2B illustrate uncoded and GF-coded BPSK signals.
FIG. 3 illustrates an example format of a transmission block for CP-only transmissions by the transmitter of FIG. 1.
FIG. 4 illustrates an example format of a transmission block for ZP-only transmissions by the transmitter of FIG. 1.
FIG. 5 illustrates sphere decoding applied in one embodiment of the receiver of FIG. 1.
FIG. 6 illustrates an example portion of the receiver of FIG. 1.
FIG. 7 is factor graph representing an example linear encoding process.
FIGS. 8-10 are graphs that illustrate exemplary results of simulations of the described techniques.
DETAILED DESCRIPTION
FIG. 1 is a block diagram illustrating a telecommunication system 2 in which transmitter 4 communicates data to receiver 6 through wireless channel 8. Transmitter 4 transmits data to receiver 6 using one of a number of conventional multi-carrier transmission formats including Orthogonal Frequency Division Multiplexing (OFDM). OFDM has been adopted by many standards including digital audio and video broadcasting (DAB, DVB) in Europe and high-speed digital subscriber lines (DSL) in the United States. OFDM has also been proposed for local area mobile wireless broadband standards including IEEE802.11a, MMAC and HIPERLAN/2. [ETSI, “Broadband Radio Access Networks (BRAN); HIPERLAN Type 2 technical specification Part 1—physical layer,” DTS/BRAN030003-1, October 1999]. In one embodiment, system 2 represents an LE-OFDM system having N subchannels.
In general, the techniques described herein robustify multi-carrier wireless transmissions, e.g., OFDM, against random frequency-selective fading by introducing memory into the transmission with complex field (CF) encoding across the subcarriers. In particular, transmitter 4 utilizes different linear combinations of the information symbols on the subcarriers. The techniques described herein may be applied to uplink and/or downlink transmissions, i.e., transmissions from a base station to a mobile device and vice versa. Consequently, transmitters 4 and receivers 6 may be any device configured to communicate using a multi-user wireless transmission including a cellular distribution station, a hub for a wireless local area network, a cellular phone, a laptop or handheld computing device, a personal digital assistant (PDA), and the like.
In the illustrated embodiment, transmitter 4 includes linear encoder 10 and an OFDM modulator 12. Receiver 6 includes OFDM demodulator 14 and equalizer 16. Due to CP-insertion at transmitter 44 and CP-removal at receiver 6, the dispersive channel 8 is represented as an N×N circulant matrix {tilde over (H)}, with [{tilde over (H)}]i,j=h((i−j)mod N), where h(·) denotes the impulse response (Z. Wang and G. B. Giannakis, “Wireless multicarrier communications: where Fourier meets Shannon,” IEEE Signal Processing Magazine, vol. 47, no. 3, pp. 29-48, May 2000, herein incorporated by reference) of channel 8:
H = [ h ( 0 ) 0 0 h ( L ) h ( 1 ) h ( 0 ) 0 h ( L ) h ( L ) 0 0 0 h ( L ) 0 0 0 h ( 0 ) 0 0 0 h ( L ) h ( 0 ) ] ( 1 )
We assume the channel to be random FIR, consisting of no more than L+1 taps. The blocks within the dotted box represent a conventional uncoded OFDM system.
Let F denote the N×N FFT matrix with entries [F]n,k=(1/√{square root over (N)})exp(−j2πnk/N). Performing IFFT (postmultiplication with the matrix FH) at the transmitter and FFT (premultiplication with the matrix F) at the receiver diagonalizes the circulant matrix {tilde over (H)}. So, we obtain the parallel ISI-free model for the ith OFDM symbol as (see FIG. 1): xi=DHμii, where
D H := diag [ H ( j 0 ) · H ( j 2 π 1 N ) , , H ( j 2 π N - 1 N ) ] = F H _ F ,
with H(jω) denoting the channel frequency response at ω; and ηi=Fηi standing for the FFT-processed additive white Gaussian noise (AWGN).
In order to exploit the frequency-domain diversity in OFDM, our LE-OFDM design first linearly encodes (i.e., maps) the K≦N symbols of the ith block, siεδ, where δ is the set of all possible vectors that si may belong to (e.g., the BPSK set {±1}K×1), by an N×K matrix ΘεCN×K and then multiplexes the coded symbols ui=ΘsiεCN×1 using conventional OFDM. In practice, the set δ is always finite. But we allow it to be infinite in our performance analysis. The encoder Θ considered here does not depend on the OFDM symbol index i. Time-varying encoder may be useful for certain purposes (e.g., power loading), but they will not be pursued here. Hence, from now on, we will drop our OFDM symbol index i for brevity.
Notice that the matrix-vector multiplication used in defining u=Θs takes place in the complex field, rather than a Galois field. The matrix Θ can be naturally viewed as the generating matrix of a complex field block code. The codebook is defined as
Figure USRE045230-20141104-P00001
:={Θs|sεδ}. By encoding a length-K vector to a length-N vector, some redundancy is introduced that we quantify by the rate of the code defined to be r=K/N, reminiscent of the GF block code rate definition. The set
Figure USRE045230-20141104-P00001
is a subset of the CN×1 vector space. More specifically,
Figure USRE045230-20141104-P00001
is a subset of the K dimensional subspace spanned by the columns of Θ. When δ=ZK×1, the set
Figure USRE045230-20141104-P00001
forms a lattice (J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices, and Groups, Springer-Verlag, 3rd edition, December 1998, herein incorporated by reference).
Combining the encoder with the diagonalized channel model, the ith received block after CP removal and FFT processing can be written as:
x=F{tilde over (x)}=F({tilde over (H)}FHΘs+ñ)=DHΘs+η.  (2)
We want to design Θ so that a large diversity order can be guaranteed irrespective of the constellation that the entries of si are drawn from, with a small amount of introduced redundancy.
We can conceptually view Θ together with the OFDM modulation FH as a combined N×K encoder {tilde over (Θ)}:=FHΘ, which in a sense blends the single-carrier and multicarrier notions. Indeed, by selecting Θ, hence {tilde over (Θ)}, the system in FIG. 1 can describe various single and multicarrier systems, some of them are provided shortly as special cases of our LE-OFDM. The received vector {tilde over (x)} is related to the information symbol vector s through the matrix product {tilde over (H)}Θ.
We define the Hamming distance δ(u, u′) between two vectors u and u′ as the number of non-zero entries in the vector uc=u−u′ and the minimum Hamming distance of the set
Figure USRE045230-20141104-P00001
as δmin (
Figure USRE045230-20141104-P00001
):=min{δ(u, u′)|u, uε
Figure USRE045230-20141104-P00001
}. When there is no confusion, we will simply use δmin for brevity. The minimum Euclidean distance between vectors in
Figure USRE045230-20141104-P00001
is denoted as dmin(
Figure USRE045230-20141104-P00001
) or simply dmin.
Because such encoding operates in the complex field, it does not increase the dimensionality of the signal space. This is to the contrasted to the GF encoding: the codeword set of a GF (n, k) code, when viewed as a real/complex vector, in general has a higher dimensionality (n) than does the original uncoded block of symbols (k). Exceptions include the repetition code, for which the codeword set has the same dimensionality as that of the input.
EXAMPLE 1
Consider the binary (3, 2) block code generated by the matrix
[ 1 0 1 0 1 1 ] T ( 3 )
followed by BPSK constellation mapping (e.g., 0→−1 and 1→1). The codebook consists of 4 codewords
[−1 −1 −1]T, [1 −1 1]T, [−1 1 1]T, [1 1 −1]T.  (4)
These codewords span the R3×1 (or C3×1) space and therefore the codebook has dimension 3 in the real or complex field, as illustrated in FIG. 2.
In general, a (n, k) binary GF block code is capable of generating 2k codewords in an n-dimensional space Rn×1 or Cn×1. If we view the transmit signal design problem as packing spheres in the signal space (Shannon's point of view), an (n, k) GF block code followed by constellation mapping packs spheres in an n-dimensional space and thus has the potential to be better (larger sphere radius) than a k-dimensional packing. In our example above, if we normalize the codewords by a factor √{square root over (2/3)} so that the energy per bit Eb is one, the 4 codewords have mutual Euclidean distance √{square root over (8/3)}, larger than the minimum distance √{square root over (2)} of the uncoded BPSK signal set (±1,±1). This increase in minimum Euclidean distance leads to improved system performance in AWGN channels, at least for high signal to noise ratio (SNR). For fading channels, the minimum Hamming distance of the codebook dominates high SNR performance in the form of diversity gain (as will become clear later). The diversity gain achieved by the (3, 2) block code in the example is the minimum Hamming distance 2.
CF linear encoding on the other hand, does not increase signal dimension; i.e., we always have dim(U)≦dim(S). When Θ has full column rank K, dim(U)=dim(S), in which case the codewords span a K-dimensional subspace of the N-dimensional vector space CK×1. In terms of sphere packing, CF linear encoding does not yield a packing of dimension higher than K.
We have the following assertion about the minimum Euclidean distance.
Proposition 1 Suppose tr(ΘΘH)=K. If the entries of sεδ are drawn independently from a constellation
Figure USRE045230-20141104-P00002
of minimum Euclidean distance of dmin (
Figure USRE045230-20141104-P00002
) then the codewords in u:={Θs|sεδ} have minimum Euclidean distance no more than dmin(
Figure USRE045230-20141104-P00002
).
Proof: Under the power constraint tr(ΘΘH)=K, at least one column of Θ will have norm no more than 1. Without loss of generality, suppose the first column has norm no more than 1. Consider sα=(α, 0, . . . , 0)T and sβ=(β, 0, . . . , 0)T, where α and β are two symbols from the constellation that are separated by dmin. The coded vectors uα=Θsα and uβ=Θsβ are then separated by a distance no more than dmin.
Due to Proposition 1, CF linear codes are not effective for improving performance for AWGN channels. But for fading channels, they may have an advantage over GF codes, because they are capable of producing codewords that have large Hamming distance.
EXAMPLE 2
The encoder
Θ = 4 15 [ 1 1 1 0.5 - 0.5 0.5 ] T , ( 5 )
operating on BPSK signal set δ={±1}2, produces 4 codewords of minimum Euclidean distance √{square root over (4/5)} and minimum Hamming distance 3. Compared with the GF code in Example 1, this real code has smaller Euclidean distance but larger Hamming distance. In addition, the CF coding scheme described herein differs from the GF block coding in that the entries of the LE output vector u usually belong to a larger, although still finite, alphabet set than do the entries of the input vector s (W. Henkel, Zur Decodierung algebraischer Blockcodes über komplexen Alphabeten, Ph.D. thesis, VDI Fortschritt-Berichte, Reihe 10, Nr. 109, VDI-Verlag, Düsseldorf, 1989, herein incorporated by reference).
Before exploring optimal designs of Θ, let us first look at some special cases of the LE-OFDM system.
By setting K=N and Θ=IN, we obtain the conventional uncoded OFDM model. In such a case, the one-tap linear equalizer matrix Γ=DH −1 yields ŝ=Γx=s+DH −1η, where the inverse exists when the channel has no nulls on the FFT grid. Under the assumption that ñ (hence η) is AWGN, such an equalizer followed by a minimum distance quantizer is optimum in the maximum-likelihood (ML) sense for a given channel when CSI has been acquired at the receiver. But when the channel has nulls on (or close to) the FFT grid ω−2πn/N, n=0, . . . , N−1, the matrix DH will be ill-conditioned and serious noise-amplification will emerge if we try to invert DH (the noise variance can become unbounded). Although events of channel nulls being close to the FFT grid have relatively low probability, their occurrence is known to have dominant impact on the average system performance especially at high SNR. Improving the performance of an uncoded transmission thus relies on robustifying the system against the occurrence of such low-probability but catastrophic events. If CSI is available at the transmitter, power and bit loading can be used and channel nulls can be avoided, such as in discrete multi-tone (DMT) systems (A. Ruiz, J. M. Cioffi, and S. Kasturia, “Discrete multiple tone modulation with coset coding for the spectrally shaped channel,” IEEE Transactions on Communications, vol. 40, no. 6, pp. 1012-1029, June 1992, herein incorporated by reference).
If we choose K=N and Θ=F, then since FHF=IN, the IFFT FH reverses the encoding and the resulting system is a single-carrier block transmission with CP insertion (c.f., FIG. 3): {tilde over (x)}={tilde over (H)}s+{tilde over (η)}. The FFT at the receiver is no longer necessary (A. Czylwik, “OFDM and related methods for broadband mobile radio channels,” in International Zurich Seminar on Broadband Communications, 1998, pp. 91-98, herein incorporated by reference; Z. Wang and G. B. Giannakis, “Wireless multicarrier communications: where Fourier meets Shannon,” IEEE Signal Processing Magazine, vol. 47, no. 3, pp. 29-48, May 2000, herein incorporated by reference).
Let K=N−L. We choose Θ to be an N×K truncated FFT matrix (the first K columns of F); i.e., [Θ]n,k=(1/√{square root over (N)}) exp(−j2πnk/N). It can be easily verified that FHΘ=[IK, 0K×L]T:=Tzp, where 0K×L denotes a K×L all-zero matrix, and the subscript “zp” stands for zero-padding (ZP). The matrix Tzp simply pads zeros at the tail of s and the zero-padded block ũ=Tzps is transmitted. Notice that H:={tilde over (H)}FHΘ={tilde over (H)}Tzp is an N×K Toeplitz convolution matrix (the first K columns of {tilde over (H)}), which is always full rank. The symbols s can thus always be recovered from the received signal {tilde over (x)}=Hs+ñ (perfectly in the absence of noise) and no catastrophic channels exist in this case (Z. Wang and G. B. Giannakis, “Wireless multicarrier communications: where Fourier meets Shannon,” IEEE Signal Processing Magazine, vol. 47, no. 3, pp. 29-48, May 2000, herein incorporated by reference). The cyclic prefix in this case consists of L zeros, which, together with the L zeros from the encoding process, result in 2L consecutive zeros between two consecutive uncoded information blocks of length K. But only L zeros are needed in order to separate the information blocks. CP is therefore not necessary because the L zeros created by Θ already separate successive blocks.
ZP-only transmission is essentially a simple single-carrier block scheme. However, viewing it as a special case of the LE-OFDM design will allow us to apply the results about LE-OFDM and gain insights into its performance. It turns out that this special case is indeed very special: it achieves the best high-SNR performance among the LE-OFDM class.
To design linear encoder 10 with the goal of improving performance over uncoded OFDM, we utilize pair-wise error probability (PEP) analysis technique (V. Tarokh, N. Seshadri, and A. R. Calderbank, “Space-time codes for high data rate wireless communication: Performance criterion and code construction,” IEEE Transactions on Information Theory, vol. 44, no. 2, pp. 744-765, March 1998, herein incorporated by reference). For simplicity, we will first assume that
  • As 1) The channel h:=[h(0), h(1), . . . , h(L)]T has independent and identically distributed (i.i.d.) zero-mean complex Gaussian taps (Rayleigh fading). The corresponding correlation matrix of h is Rh:=E[hhH]=αL 2IL+1, where the constant αL:=1/(L+1).
Later on, we will relax this assumption to allow for correlated fading with possibly rank deficient autocorrelation matrix Rh.
We suppose ML detection with perfect CSI at the receiver and consider the probability P(s→s′|h), s, s′εδ that a vector s is transmitted but is erroneously decoded as s′≠s. We define the set of all possible error vectors δe:={e:=s−s′|s.s′εδ, s≠s′}.
The PEP can be approximated using the Chernoff bound as:
P(s→s′|h)≦exp(−d2(y,y′)/4N0),  (6)
where N0/2 is the noise variance per dimension, y:=DHΘs, y′:=DHΘs′, and d(y,y′)=∥y−y′∥ is the Euclidean distance between y and y′.
Let us consider the N×(L+1) matrix V with entries [V]n,t=exp(−j2πnl/N), and use it to perform the N-point discrete Fourier transform Vh of h. Note that DH=diag(Vh); i.e., the diagonal entries of DH are those in vector Vh. Using the definitions e:=s−s′εδ|e, ue:=Θe, and De:=diag(ue), we can write y−y′=DHue=diag(Vh)ue. Furthermore, we can express the squared Euclidean distance d2(y,y′)=∥DHue2=∥DeVh∥2 as
d2(y,y′)=hHVHDe HDeVh:=hHAeh.  (7)
An upper bound to the average PEP can be obtained by averaging (6) with respect to the random channel h to obtain (V. Tarokh, N. Seshadri, and A. R. Calderbank, “Space-time codes for high data rate wireless communication: Performance criterion and code construction,” IEEE Transactions on Information Theory, vol. 44, no. 2, pp. 744-765, March 1998, herein incorporated by reference):
P ( s s ) l = 0 L 1 1 + α L λ e , l / ( 4 N 0 ) , ( 8 )
where λe,0, λe,1, . . . , λe,L are the non-increasing eigen-values of the matrix Ae=VHDe HDeV.
If re is the rank of Ae, then λe,1≠0 if and only if 1ε[0,re−1]. Since 1+αLλe,1/(4N0)>λe,1/(4N0), it follows from (8) that
P ( s s ) ( 1 4 N 0 ) - r e ( l = 0 r e - 1 α L λ e , l ) - 1 . ( 9 )
We call re the diversity order, denoted as Gd,e, and (IIt=0 r e 31 1 αLλe,1)1/r e the coding advantage, denoted as Gc,e, for the symbol error vector e (V. Tarokh, N. Seshadri, and A. R. Calderbank, “Space-time codes for high data rate wireless communication: Performance criterion and code construction,” IEEE Transactions on Information Theory, vol. 44, no. 2, pp. 744-765, March 1998, herein incorporated by reference). The diversity order Gd,e determines the slope of the averaged (w.r.t. the random channel) PEP (between s and s′) as a function of the SNR at high SNR (N0→0). Correspondingly, Gc,e determines the shift of this PEP curve in SNR relative to a benchmark error rate curve of (¼N0)−r e . When re=L+1, Ae is full rank, the product of eigen-values becomes the determinant of Ae and therefore the coding advantage is given by αL[det(Ae)]1/(L+1).
Since both Gd,e and Gd,c depend on the choice of e, we define the diversity order and coding advantages for our LE-OFDM system, respectively, as:
G d := min e ?? e G d , e = min e ?? e rank ( A e ) , and G c = min e ?? e G c , e . ( 10 )
We refer to diversity order herein to mean the asymptotic slope of the error probability versus SNR curve in a log-log scale. Often, “diversity” refers to “channel diversity,” i.e., roughly the degree of freedom of a given channel. To attain a certain diversity order (slope) on the error probability versus SNR curve, three conditions may be satisfied: i) Transmitter 4 is well-designed so that the information symbols are encoded with sufficient redundancy (enough diversification); ii) Channel 8 is capable of providing enough degrees of freedom; iii) Receiver 4 is well designed so as to sufficiently exploit the redundancy introduced at the transmitter.
Since the diversity order Gd determines how fast the symbol error probability drops as SNR increases, Gd is to be optimized first.
We have the following theorem.
Theorem 1 (Maximum Achievable Diversity Order): For a transmitted codeword set
Figure USRE045230-20141104-P00001
with minimum Hamming distance δmin, over i.i.d. FIR Rayleigh fading channels of order L, the diversity order is min(δmin, L+1). Thus, the Maximum Achievable Diversity Order (MADO) of LE-OFDM transmissions is L+1 and in order to achieve MADO, we need δmin≧L+1.
Proof: Since matrix Ae=VHDe HDeV in (7) is the Gram matrix1 of DeV, the rank re of Ae is the same as the rank of DeV, which is min(δ(u, u′),L+1)≦L+1. Therefore, the diversity order of the system is
G d = min e ?? e rank ( A c ) = min e ?? e min [ δ ( u , u ) , L + 1 ] = min ( δ min , L + 1 ) L + 1 ,
and the equality is achieved when δmin≧L+1.
Theorem 1 is intuitively reasonable because the FIR Rayleigh fading channel offers us L+1 independent fading [S. G. Wilson, Digital Modulation and Coding, Prentice-Hall, Inc, 1996, herein incorporated by reference] taps, which is the maximum possible number of independent replicas of the transmitted signal in the serial transmission mode. In order to achieve the MADO, any two codewords in
Figure USRE045230-20141104-P00001
should be different by no less than L+1 entries.
The results in Theorem 1 can also be applied to GF-coded/interleaved OFDM systems provided that channel coding or interleaving is applied only within an OFDM symbol and not across successive OFDM symbols. The diversity is again the minimum of the minimum Hamming distance of the code and L+1. To see this, it suffices to view
Figure USRE045230-20141104-P00001
as the codeword set of GF-coded blocks.
To achieve MADO, we need Ae to be full rank and thus positive definite for any eεδe. This is true if and only if hHAeh>0 for any h≠0εCL+1. Equation (7) shows that this is equivalent to d2(y, y′)=∥DHΘe∥2≠0, ∀eεδe, and ∀h≠0. The latter means that any two different transmitted vectors should result in different received vectors in the absence of noise, irrespective of the channel; in such cases, we call the symbols detectable or recoverable. The conditions for achieving MADO and channel-irrespective symbol detectability are summarized in the following theorem:
Theorem 2 (Symbol Detectability
Figure USRE045230-20141104-P00003
MADO): Under the channel conditions of Theorem 1, the maximum diversity order is achieved if and only if symbol detectability is achieved; i.e., ∥DHΘc∥2≠0, ∀eεδe and ∀h≠0.
The result in Theorem 2 is somewhat surprising: it asserts the equivalence of a deterministic property of the code, namely symbol detectability in the absence of noise, with a statistical property, the diversity order. It can be explained though, by realizing that in random channels, the performance is mostly affected by the worst channels, despite their small realization probability. By guaranteeing detectability for any, and therefore the worst, channels, we are essentially improving the ensemble performance.
The symbol detectability condition in Theorem 2 should be checked against all pairs s and s′, which is usually not an easy task, especially when the underlying constellations are large and/or when the size K of s is large. But it is possible to identify sufficient conditions on Θ that guarantee symbol detectability and that are relatively easy to check. One such condition is provided by the following theorem.
Theorem 3 (Sufficient Condition for MADO): For i.i.d. FIR Rayleigh fading channels of order L, MADO is achieved when rank(DHΘ)=K, ∀h≠0, which is equivalent to the following condition: Any N−L rows of Θ span the C1×K space. The latter in turn implies that N−L≧K.
Proof: First of all, since Θ is of size N×K, it can not have rank greater than K. If MADO is not achieved, there exists at least one channel h and eεδe such that DHΘe=0 by Theorem 2, which means that rank(DHΘ)<K. So, MADO is achieved when DHΘ=K. Secondly, since the diagonal entries of DH represent frequency response of the channel h evaluated at the FFT frequencies, there can be at most L zeros on the diagonal of DH. In order that rank(DHΘ)=K, ∀h, it suffices to have any N−L rows of Θ span the C1×K space. On the other hand, when there is a set of N−L rows of Θ that are linearly dependent, we can find a channel that has zeros at frequencies corresponding to the remaining L rows. Such a channel will make rank(DHΘ)<K. This completes the proof.
The natural question that arises at this point is whether there exist LE matrices Θ that satisfy the conditions of Theorem 3. The following theorem constructively shows two classes of encoders that satisfy Theorem 3 and thus achieve MADO.
Theorem 4 (MADO-achieving encoders):
i) Vandermonde Encoders: Choose N points ρnεC, n=0, 1, . . . , N−1, such that ρm≠ρn, ∀n≠n. Let ρ:=[ρ0, ρ1, . . . , ρN-1]T. Then the Vandermonde encoder Θ(ρ)εCN×K defined by [Θ(ρ)]n,kn k satisfies Theorem 3 and thus achieves MADO.
ii) Cosine Encoders: Choose N points φ0, φ1, . . . , φN-1εR, such that φm≠(2k+1)π and φm±φn≠2kπ, ∀m≠n, ∀kεZ. Let φ:=[φ0, φ1, . . . , φN-1]T. Then the real cosine encoder Θ(φ)εRN×K defined by
[ Θ ( ϕ ) ] n , k = cos ( k + 1 2 ) ϕ n
satisfies Theorem 3 and thus achieves MADO.
Proof: We first prove that Vandermonde encoders in i) satisfy the conditions of Theorem 3. Any K rows of the matrix Θ(ρ) form a square Vandermonde matrix with distinct rows. Such a Vandermonde matrix is known to have a determinant different from 0. Therefore, any K rows of Θ(ρ) are linearly independent, which satisfies the conditions in Theorem 3.
To prove Part ii) of the theorem, we show that any K rows of the encoding matrix form a non-singular square matrix. Without loss of generality, we consider the matrix formed by the first K rows:
Θ 1 := [ cos ( 1 2 ϕ 0 ) cos ( 3 2 ϕ 0 ) cos ( 2 K - 1 2 ϕ 0 ) cos ( 1 2 ϕ 1 ) cos ( 3 2 ϕ 1 ) cos ( 2 K - 1 2 ϕ 1 ) cos ( 1 2 ϕ K - 1 ) cos ( 3 2 ϕ K - 1 ) cos ( 2 K - 1 2 ϕ K - 1 ) ] ( 11 )
Let us evaluate the determinant det(Θ1). Define
z n := cos ( 1 2 ϕ n ) .
Using Chebyshev polynomials of the first kind
T 1 ( x ) := cos ( l cos - 1 x ) = i = 0 [ 1 / 2 ] ( l 2 i ) x l - 2 i ( x 2 - 1 ) i ,
each entry
cos ( 2 m + 1 2 ϕ n )
of Θ1 is a polynomial T2m+1(zn) of order 2m+1 of some
z n = cos ( 1 2 ϕ n ) .
The determinant det(Θ1) is therefore a polynomial in z0, . . . , zK-1 of order Σn=1 K(2n−1)=K2. It is easy to see that when zn=0, or when zm=±zn, m≠n, Θ1 has an all-zero row, or, two rows that are either the same or the negative of each other. Therefore, zn, zm−zn, and zm+zn are all factors of det(Θ1). So, g(z0, z1, . . . , zK-1):=IInznIIm>n(zm 2−zn 2) is also a factor of det(Θ1). But g(z0, z1, . . . , zK-1) is of order K+K(K−1)=K2, which means that it is different from det (Θ1) by at most a constant. Using the leading coefficient 4 2l-1 of T1(x), we obtain the constant as II n=1 K22n-l-1=2K(K-1); that is, det(Θ1)=2K(K-1)g(z0, z1, . . . , zK-1).
Since φm≠(2k+1)π and φm±φn≠2kπ, ∀m≠n, ∀kεZ, none of zn, zm−zn, and zm+zn can be zero. Therefore, det(Θ1)≠0 and Θ1 is non-singular. A similar argument can be applied to any K rows of the matrix, and the proof is complete.
Notice that up to now we have been assuming that the channel consists of i.i.d. zero-mean complex Gaussian taps. Such a model is well suited for studying average system performance in wireless fading channels, but is rather restrictive since the taps may be correlated. For correlated channels, we have the following result.
Theorem 5 (MADO of Correlated Rayleigh Channels): Let the channel h be zero-mean complex Gaussian with correlation matrix Rh. The maximum achievable diversity order equals the rank of Rh, which is achieved by any encoder that achieves MADO with i.i.d. Rayleigh channels. If Rh is full rank and MADO is achieved, then the coding advantage is different from the coding advantage in the i.i.d. case only by a constant
det 1 L + 1 ( R h ) / α L .
Proof: Let rh:=rank(Rh) and the eigen-value decomposition of Rh be
R h = [ U 1 U 2 ] [ Λ 1 0 0 Λ 2 ] [ U 1 H U 2 H ] . ( 12 )
where U1 is (L+1)×rh, U2 is (L+1)×(L+1−rh), A1 is rh×rh full rank diagonal, and A2 is an (L+1−rh)×(L+1−rh) all-zero matrix. Define
h ~ 1 : = Λ 1 - 1 2 U 1 H h , h ~ 2 = U 2 H ,
and {tilde over (h)}:=[{tilde over (h)}1 T{tilde over (h)}2 T]T, where
Λ 1 - 1 2
is defined by
Λ 1 - 1 2 Λ 1 - 1 2 = Λ 1 - 1 .
Since h2 has an autocorrelation matrix R{tilde over (h)} 2 =U2 HRhU2=A2, all the entries of {tilde over (h)}2 are zero almost surely. We can therefore write
h = [ U 1 Λ 1 1 2 U 2 ] h ~ = U 1 Λ 1 1 2 h 1 . ( 13 )
Since
R h ~ 1 = Λ 1 - 1 2 U 1 h R h U 1 Λ 1 - 1 2 = I r h .
the entries of {tilde over (h)}1, which are jointly Gaussian, are i.i.d.
Substituting (13) in (7), we obtain
d 2 ( y , y ) = h H A e h = h ~ 1 H Λ 1 1 2 U 1 H A e U 1 Λ 1 1 2 h ~ 1 = h ~ 1 H A ~ e h ~ 1 , ( 14 )
where
A ~ e = Λ 1 1 2 U 1 H A e U 1 Λ 1 1 2
is an rh×rh matrix.
Following the same derivation as in (7)-(10), with Ae replaced by Ãe and h replaced by {tilde over (h)}1, we can obtain the diversity order and coding advantage for error event e as
G d , e = rank ( A ~ e ) = r ~ e r h and G c , e = ( l = 0 r ~ e - 1 λ ~ e , l ) 1 / r ~ e , ( 15 )
where {tilde over (λ)}e,l, l=1, . . . , rh, are the eigen-values of Ãe.
Where Θ is designed such that MADO is achieved with i.i.d. channels, Ae is full rank for any eεδe. Then Ae is positive definite Hermitian symmetric, which means that there exists an (L+1)×(L+1) matrix Be such that Ae=Be HBe. It follows that
A ~ e = Λ 1 1 2 U 1 H B e H B e U 1 Λ 1 1 2
is the Gram matrix of
B e U 1 Λ 1 1 2 ,
and thus Ae has rank equal to
rank ( B e U 1 Λ 1 1 2 ) = rank ( U 1 Λ 1 1 2 ) = r h ,
the MADO for this correlated channel.
When the MADO rh is achieved, the coding advantage in (15) for e becomes Gc,e=det(Ãe)1/r h. If in addition, Rh has full rank rh=L+1, then det(Ãe)1/r k=det(Ae)1/(L+1) det(Rh)1/(L+1), which means that in the full-rank correlated channel case, the full-diversity coding advantage is different from the coding advantage in the i.i.d. case only by a constant det(Rh)1/(L+1)L.
Theorem 5 asserts that the rank(Rh) is the MADO for LE-OFDM systems as well as for coded OFDM systems that do not code or interleave across OFDM symbols. Also, MADO-achieving transmissions through i.i.d. channels can achieve the MADO for correlated channels as well.
Coding advantage Gc is another parameter that needs to be optimized among the MADO-achieving encoders. Since for MADO-achieving encoders, coding advantage is given by Gc=mine≠0Gc,eL mine≠0det(Ae), we need to maximize the minimum determinant of Ae over all possible error sequences e, among the MADO-achieving encoders.
The following theorem asserts that ZP-only transmission is one of the coding advantage maximizers (Z. Wang, X. Ma, and G. B. Giannakis, “OFDM or single-carrier zero-padded block transmissions?” IEEE Transactions on Communications, August 2001 (accepted), herein incorporated by reference; “Optimality of Single-Carrier Zero-Padded Block Transmissions,” in Proc. of Wireless Comm. and Networking Conf., pp. 660-664, 2002, Orlando, Fla., herein incorporated by reference).
Theorem 6 (ZP-only: maximum coding advantage): Suppose the entries of s(i) are drawn independently from a finite constellation
Figure USRE045230-20141104-P00002
with minimum distance of dmin(
Figure USRE045230-20141104-P00002
). Then the maximum coding advantage of an LE-OFDM for i.i.d. Rayleigh fading channels under as1) is Gc,max−αLdmin 2(
Figure USRE045230-20141104-P00002
). The maximum coding advantage is achieved by ZP-only transmissions with any K.
In order to achieve high rate, we have adopted K=N−L and found two special classes of encoders that can achieve MADO in Theorem 4. The Vandermonde encoders are reminiscent of the parity check matrix of BCH codes, Reed-Solomon (RS) codes, and Goppa codes (V. D. Goppa, Geometry and Codes, Kluwer Academic Publishers, 1988, herein incorporated by reference). It turns out that the MADO-achieving encoders and these codes are closely related.
Let us now take δ=CK×1. We call the codeword set
Figure USRE045230-20141104-P00001
that is generated by Θ of size N×K Maximum Distance Separable (MDS) if δmin(
Figure USRE045230-20141104-P00001
)=N−K+1. The fact that N−K+1 is the maximum possible minimum Hamming distance of
Figure USRE045230-20141104-P00001
is due to the Singleton bound R. C. Singleton, “Maximum distance q-nary codes,” IEEE Transactions on Information Theory, vol. 10, pp. 116-118, 1960, herein incorporated by reference). Although the Singleton bound was originally proposed and mostly known for Galois field codes, its proof can be easily generalized to real/complex field as well (R. Knopp and P. A. Humblet, “On coding for block fading channels,” IEEE Transactions on Information Theory, vol. 46, no. 1, pp. 189-205, January 2000, herein incorporated by reference). In our case, it asserts that δmin≦N−K+1 when δ=CK×1.
Notice that the assumption δ=CK×T is usually not true in practice, because the entries of s are usually chosen from a finite-alphabet set, e.g., QPSK or QAM. But such an assumption greatly simplifies the system design task: once we can guarantee δmin=N−K+1 for δ=CK×1, we can choose any constellation from other considerations without worrying about the diversity performance. However, for a finite constellation, i.e., when δ has finite cardinality, the result on δmin can be improved. In fact, it can be shown that even with a square and unitary K×K matrix Θ, it is possible to have δmin=K (Y. Xin, Z. Wang, and G. B. Giannakis, “Space-time diversity systems based on unitary constellation-rotating precoders,” in Proc. of Intl. Conf. on ASSP, Salt Lake City, Utah, May 7-11, 2001, vol. 4, pp. 2429-2432, herein incorporated by reference).
To satisfy the condition in Theorem 2 with the highest rate for a given N, we need K=N−L, and δmin=L+1=N−K+1. In other words, to achieve constellation-irrespective full-diversity with highest rate, we need the code to be MDS. According to our Theorem 4, such MDS encoders always exist for any N and K<N.
In the GF, there also exist MDS codes (F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Amsterdam: North Holland, 1977, herein incorporated by reference). Examples of GF MDS codes include single-parity-check coding, repetition coding, generalized RS coding, extended RS coding, doubly extended RS coding, algebraic-geometry codes constructed using an elliptic curve.
When a GF MDS code exists, we may use it to replace our CF linear code, and achieve the same (maximum) diversity order at the same rate. But such GF codes do not always exist for a given field and N, K. For F2, only trivial MDS codes exist (F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977, herein incorporated by reference). This means that it is impossible to construct, for example, binary (and thus simply decodeable) MDS codes that have δmin≧2, except for the repetition code. One other restriction of the GF MDS code is on the input and output alphabet. Although Reed-Solomon codes are the least restrictive among them in terms of the number of elements in the field, they are constrained on the code length and the alphabet size. Our linear encoders Θ, on the other hand, operate over the complex field with no restriction on the input symbol alphabet or the coded symbol alphabet.
We obtain analogous results on our complex field MDS codes for achieving MADO to known results for GF MDS codes (F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977, herein incorporated by reference).
Theorem 7 (Dual MDS code): For an MDS code generated by ΘεCN×K, the code generated by the matrix Θ1 is also MDS, where Θ is an N×(N−K) matrix such that Θ TΘ=0.
A generator Θ for an MDS code is called systematic if it is in the form [IK, P]T where P is a K×(N−K) matrix.
Theorem 8 (Systematic MDS code): A code generated by [I, P]T is MDS if and only if every square submatrix of P is nonsingular.
To construct systematic MDS codes using Theorem 8, the following two results can be useful (F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977, p. 323, herein incorporated by reference):
i) Every square submatrix of a Vandermonde matrix with real, positive entries is nonsingular.
ii) A K×(N−K) matrix P is called a Cauchy matrix if its (i, j)th element [P]ij=1/(xi+yi) for some elements x1, x2, . . . , xK, y1, y2, . . . , yN-K, such that the xi's are distinct, the yj's are distinct, and xi+yj≠0 for all i, j. Any square submatrix of a Cauchy matrix is nonsingular (R. M. Roth and G. Seroussi, “On generator matrices of MDS codes,” IEEE Transactions on Information Theory, vol. 31, no. 6, pp. 826-830, November 1985, herein incorporated by reference).
Next, we discuss decoding options for our CF code. For this purpose, we restrict our attention to the case that δ is a finite set, e.g., a finite constellation carved from (possibly sealed and shifted) ZK. This includes BPSK, QPSK, and QAM [X. Giraud, E. Boutillon, and J. C. Belfiore, “Algebraic tools to build modulation schemes for fading channels,” IEEE Transactions on Information Theory, vol. 43, pp. 938-952, May 1997, herein incorporated by reference; Z. Liu; Y. Xin, and G. B. Giannakis, “Unitary precoded OFDM with maximum multipath diversity and coding gains,” in Proc. of the Asilomar Conf., Pacific Grove, Calif., November 2001, herein incorporated by reference; and Y. Xin, Z. Wang, and G. B. Giannakis, “Space-time constellation-rotating codes maximizing diversity and coding gains,” in Proc. of GLOBECOM, San Antonio, Tex., November 2001, pp. 455-459, herein incorporated by reference] as special cases. Since the task of the receiver involves both channel equalization and decoding of the CF linear code, we will consider the combined task jointly and will use the words decoding, detection, and equalization interchangeably.
Maximum Likelihood Detection
To achieve MADO, LE-OFDM requires ML decoding. For the input output relationship in (2) and under the AWGN assumption, the minimum-distance detection rule becomes ML and can be formulated as follows:
s ^ = arg min s § x - D H Θs . ( 16 )
ML decoding of LE transmissions belongs to a general class of lattice decoding problems, as the matrix product DHΘ in (2) gives rise to a discrete subgroup (lattice) of the CN space under the vector addition operation. In its most general form, finding the optimum estimate in (16) requires searching over |δ| vectors. For large block sizes and/or large constellations, it is practically impossible to perform exhaustive search since the complexity depends exponentially on the number of symbols in the block.
A relatively less complex ML search is possible with the sphere decoding (SD) algorithm (c.f., FIG. 5), which only searches coded vectors that are within a sphere centered at the received symbol x (c.f., (2)) (E. Viterbo and J. Boutros, “A universal lattice code decoder for fading channels,” IEEE Transactions on Information Theory, vol. 45, no. 5, pp. 1639-1642, 1999, herein incorporated by reference). Denote the QR decomposition of DHΘ as DHΘ=QR, where Q has size N×K and satisfies QHQ=IK×K, and R is an upper triangular K×K matrix. The problem in (16) then converts to the following equivalent problem
s ^ = argmin s § Q x - Rs , ( 17 )
SD starts its search by looking only at vectors s such that
∥QHx−Rs∥<C,  (18)
where C is the search radius, a decoding parameter. Since R is upper triangular, in order to satisfy the inequality in (18), the last entry of s must satisfy |[R]K,K[s]K|<C, which reduces the search space if C is small. For one possible value of the last entry, possible candidates of the last-but-one entry are found and one candidate is taken. The process continues until a vector of s0 is found that satisfies (18). Then the search radius C is set equal to ∥QHx−Rs0∥ and a new search round is started. If no other vector is found inside the radius, then s0 is the ML solution. Otherwise, if s1 is found inside the sphere, the search radius is again reduced to ∥QHx−Rs1∥, and so on. If no s0 is ever found inside the initial sphere of radius C, then C is too small. In this case, either a decoding failure is declared or C is increased.
The complexity of the SD is polynomial in K (U. Fincke and M. Pohst, “Improved methods for calculating vectors of short length in a lattice, including a complexity analysis,” Math. Comput., vol. 44, pp. 463-471, April 1985, herein incorporated by reference), which is better than exponential but still too high for practical purposes. Indeed, it is not suitable for codes of block size greater than, say, 16. When the block size is small, the sphere decoder can be considered as an option to achieve the ML performance at manageable complexity.
In the special case of ZP-only transmissions, the received vector is given by {tilde over (x)}=Hs+ñ. Thanks to the zero-padding, the full convolution of the transmitted block s with the FIR channel is preserved and the channel is represented as the banded Toeplitz matrix H. In such a case, Viterbi decoding can be used at a complexity of
Figure USRE045230-20141104-P00004
(QL) per symbol, where Q is the constellation size of the symbols in s (G. D. Jr. Forney, “Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference,” IEEE Transactions on Information Theory, vol. 18, pp. 363-378, May 1972, herein incorporated by reference).
Low-Complexity Linear Detection
Zero-forcing (ZF) and MMSE detectors (equalizers) offer low-complexity alternatives. The ZF and MMSE equalizers based on the input-output relationship (2) can be written as (A. Scaglione, G. B. Giannakis, and S. Barbarossa, “Linear precoding for estimation and equalization of frequency-selective channels,” in Signal Processing Advances in Wireless and Mobile Communications, G. B. Giannakis, Y. Hua, P. Stoica, and L. Tong, Eds. 2001, vol. I, Chapter 9, Prentice-Hall, Inc., herein incorporated by reference):
Gzf=(DHΘ)T and Gmmse=RsΘHDH Hη 2IN+DHΘRsΘHDH H)−1,
respectively, where (·)T denotes pseudo-inverse, ση 2 is the variance of entries of noise η, and Rs is the autocorrelation matrix of s. Given the ZF and MMSE equalizers, they each require
Figure USRE045230-20141104-P00004
(N×K) operations per K symbols. So per symbol, they require only
Figure USRE045230-20141104-P00004
(N) operations. To obtain the ZF or MMSE equalizers, inversion of a N×N matrix is involved, which has complexity
Figure USRE045230-20141104-P00004
(N3). However, the equalizers only needs to be recomputed when the channel changes.
Decision-Directed Detection
The ML detection schemes in general have high complexity, while the linear detectors may have decreased performance. The class of decision-directed detectors lies between these categories, both in terms of complexity and in terms of performance.
Decision-directed detectors capitalize on the finite alphabet property that is almost always available in practice. In the equalization scenario, they are more commonly known as Decision Feedback Equalizers (DFE). In a single-user block formulation, the DFE has a structure as shown in FIG. 6, where the feed-forward filter is represented as a matrix W and the feedback filter is presented as B (A. Stamoulis, G. B. Giannakis, and A. Scaglione, “Block FIR decision-feedback equalizers for filterbank precoded transmissions with blind channel estimation capabilities,” IEEE Transactions on Communications, vol. 49, pp. 69-83, January 2001, herein incorporated by reference). Since we can only feed back decisions in a casual fashion, B is usually chosen to be a strictly upper or lower triangular matrix with zero diagonal entries. Although the feedback loop is represented as a matrix, the operations happen in a serial fashion: the estimated symbols are fed back serially as their decisions are formed one by one. The matrices W and B can be designed according to ZF or MMSE criteria (N. Al-Dhahir and A. H. Sayed, “The finite-length multi-input multi-output MMSE-DFE,” IEEE Transactions on Signal Processing, vol. 48, no. 10, pp. 2921-2936, October 2000, herein incorporated by reference; A. Stamoulis, G. B. Giannakis, and A. Scaglione, “Block FIR decision-feedback equalizers for filterbank precoded transmissions with blind channel estimation capabilities,” IEEE Transactions on Communications, vol. 49, pp. 69-83, January 2001, herein incorporated by reference). When B is chosen to be triangular and the MSE between the block estimate before the decision device is minimized, the feed-forward and feedback filtering matrices can be found from the following equations (N. Al-Dhahir and A. H. Sayed, “The finite-length multi-input multi-output MMSE-DFE,” IEEE Transactions on Signal Processing, vol. 48, no. 10, pp. 2921-2936, October 2000, herein incorporated by reference; A. Stamoulis, G. B. Giannakis, and A. Scaglione, “Block FIR decision-feedback equalizers for filterbank precoded transmissions with blind channel estimation capabilities,” IEEE Transactions on Communications, vol. 49, pp. 69-83, January 2001, herein incorporated by reference):
Rs −1HDH HRη −1DHΘ=UHΛU,  (19)
W=URsΘHDH H(Rη+DHΘRsΘHDH H)−1, B=U−I,  (20)
where the R's denote autocorrelation matrices, (19) was obtained using Cholesky decomposition, and U is an upper triangular matrix with unit diagonal entries. Since the feed-forward and feedback filtering entails only matrix-vector multiplications, the complexity of such decision directed schemes is comparable to that of linear detectors. Because decision directed schemes capitalize on the finite-alphabet property of the information symbols, the performance is usually (much) better than linear detectors.
As an example, we list in the following table the approximate number of flops needed for different decoding schemes when K=14, L=2, N=16, and BPSK modulation is deployed; i.e., δ={±1}K.
TABLE 1
Decoding Scheme order of Flops/symbol
Exhaustive ML >2K = 214 = 16.384
Sphere Decoding ≈800 (empirical)
ZF/MMSE ≈N = 16
Decision-Directed ≈N = 16
Viterbi for ZP-only 2L = 22 = 4
Iterative Detectors
Other possible decoding methods include iterative detectors, such as successive interference cancellation with iterative least squares (SIC-ILS) (T. Li and N. D. Sidiropoulos, “Blind digital signal separation using successive interference cancellation iterative least squares,” IEEE Transactions on Signal Processing, vol. 48, no. 11, pp. 3146-3152, November 2000, herein incorporated by reference), and multistage cancellations (S. Verdú, Multiuser Detection, Cambridge Press, 1998, herein incorporated by reference). These methods are similar to the illustrated DFE in the interference from symbols that are decided in a block is canceled before a decision on the current symbol is made. In SIC-ILS, least squares is used as the optimization criterion and at each step or iteration, the cost function (least-squares) will decrease or remain the same. In multistage cancellation, the MMSE criterion is often used such that MF is optimum after the interference is removed (supposing that the noise is white). The difference between a multistage cancellation scheme and the block DFE is that the DFE symbol decisions are made serially; and for each undecided symbol, only interference from symbols that have been decided is cancelled; while in multistage cancellation, all symbols are decided simultaneously and then their mutual interferences are removed in a parallel fashion.
As illustrated in FIG. 7, another embodiment may utilize for LEOFDM equalization an iterative “sum-product” decoding algorithm, which is also used in Turbo decoding (F. R. Kschischang, B. J. Frey, and H-A. Loeliger, “Factor graphs and the sum-product algorithm,” IEEE Transactions on Information Theory, vol. 47, no. 2, pp. 498-519, February 2001, herein incorporated by reference). In particular, the coded system is represented using a factor graph, which describes the interdependence of the encoder input, the encode output, and the noise-corrupted coded symbols.
As a simple example, suppose the encoder takes a block of 3 symbols s:=[s0, s1, s2]T as input and linearly encodes them by a 4×3 matrix Θ to produce the coded symbols u:=[u0, u1, u2, u3]. After passing through the channel (OFDM modulation/demodulation), we obtain the channel output xi=H(ej2πi/4)ui, i=0, 1, 2, 3. The factor graph for such a coded system is shown in FIG. 7, where the LE is represented by linear constraints between the LE input symbols s and the LE output symbols u.
Parallel Encoding for Low Complexity Decoding
When the number of carriers N is very large (e.g., 1,024), it is desirable to keep the decoding complexity manageable. To achieve this we can split the encoder into several smaller encoders. Specifically, we can choose Θ=PΘ′, where P is a permutation matrix that interleaves the subcarriers, and Θ′ is a block diagonal matrix: Θ′=diag(Θ0, Θ1, . . . , ΘM-1). This is a essentially a form of coding for interleaved OFDM, except that the coding is done in complex domain here. The matrices Θm, m=0, . . . , M−1 are of smaller size than Θ and all of them can even be chosen to be identical. With such designed Θ, decoding s from the noisy DHΘs is equivalent to decoding M coded sub-vectors of smaller sizes and therefore the overall decoding complexity can be reduced considerably. Such a decomposition is particularly important when a high complexity decoder such as the sphere decoder is to be deployed.
The price paid for low decoding complexity is a decrease in transmission rate. When such parallel encoding is used, we should make sure that each of the Θm matrices can guarantee full diversity, which requires Θm to have L redundant rows. The overall Θ will then have ML redundant rows, which corresponds to an M-fold increase of the redundancy of a full single encoder of size N×K. If a fixed constellation is used for entries in s, then square Θm's can be used, which does not lead to loss of efficiency (Z. Liu, Y. Xin, and G. B. Giannakis, “Linear Constellation Precoding for OFDM with Maximum Multipath Diversity and Coding Gains,” Proceedings of 35th Asilomar Conference on Signals, Systems & Computers, Pacific Grove, Calif., Nov. 4-7, 2001, pp. 1445-1449, herein incorporated by reference).
FIGS. 8-10 are graphs that illustrate exemplary results of simulations of the described techniques. In the illustrated results, we compare the proposed wireless communication techniques with existing coded OFDM systems that deploy existing GF block codes and convolutional codes. In all cases, BPSK constellation is used, and in Test Case 2 and 3, the binary encoded symbols are mapped to ±1's before OFDM modulation.
Test case 1 (Decoding of LE-OFDM): We first test the performance of different decoding algorithms. The LE-OFDM system has parameters K=14, N=16, L=2. The channel is i.i.d. Rayleigh and BER's for 200 random channel realizations according to As1) are averaged. FIG. 8 shows the performance of ZF, MMSE, DFE, and sphere decoding (ML) for LE-OFDM. We notice that at BER of 10−4 DFE performs about 2 dB better than the MMSE detectors, while at the same time it is only less than 1 dB inferior to the sphere decoder, which virtually achieves the ML decoding performance. The complexity of ZF, MMSE, DFE is all about N=16 flops per symbol, which is much less than the sphere decoding algorithm, which empirically needs about 800 flops per symbol in this case.
Test case 2 (Comparing LE-OFDM with BCH-coded OFDM): For demonstration and verification purposes, we first compare LE-OFDM with coded OFDM that relies on GF block coding. The channel is modeled as FIR with 5 i.i.d. Rayleigh distributed taps. In FIG. 9, we illustrate Bit Error Rate (BER) performance of CF coded OFDM with Vandermonde code of Theorem 4, and that of binary BCH-coded OFDM. The system parameters are K=26, N=31. The generating polynomial of the BCH code is g(D)=1+D2+D5. Since we can view this BCH as a rate 1 convolutional code with the same generator and with termination after 26 information symbols (i.e., the code ends at the all-zero state), we can use the Viterbi algorithm [J. Hagenauer, and P. Hoeher, “A Viterbi Algorithm with Soft-Decision Outputs and Its Applications,” in Proc. Of the IEEE 1989 Global Communications Conference, Dallas, Tex., pp. 1680-1686, November 1989, herein incorporated by reference] for soft-decision ML BCH decoding. For LE-OFDM, since the transmission is essentially a ZP-only single-carrier scheme, the Viterbi algorithm is also applicable for ML decoding.
Since the binary (26, 31) BCH code has minimum Hamming distance 3, it possesses a diversity order of 3, which is only half of the maximum possible (L+1=6) that LE-OFDM achieves with the same spectral efficiency. This explains the difference in their performance. We can see that when the optimum ML decoder is adopted by both receivers. LE-OFDM outperforms coded OFDM with BCH coding considerably. The slopes of the corresponding BER curves also confirm our theoretical results.
Test case 3 (Comparing LE-OFDM with convolutionally coded OFDM): In this test, we compare (see FIG. 10) our LE-OFDM system with convolutionally coded OFDM (with a rate ½ code punctured to rate ¾ followed by interleaving) that is deployed by the HiperLAN2 standard (ETSI, “Broadband Radio Access Networks (BRAN), herein incorporated by reference; HIPERLAN Type 2 technical specification Part 1—physical layer,” DTS/BRAN030003-1, October 1999, herein incorporated by reference) over the channels used in Test Case 2. The rate ½ mother code has its generator in octal form as (133, 171) and there are 64 states in its trellis. Every 3rd bit from the first branch and every second bit from the second branch of the mother code are punctured to obtain the rate ¾ code, which results in a code whose weight enumerating function is 8W5+31W6+160W7+ . . . . So the free distance is 5, which means that the achieved diversity is 5, less than the diversity order 6 achieved by LE-OFDM.
The parameters are K=36, N=48. We use two parallel truncated DCT encoders; that is, Θ=I2×2{circle around (x)}Θ0, where {circle around (x)} denotes Kronecker product, and Θ0 is a 24×18 encoder obtained by taking the first 18 columns of a 24×24 DCT matrix. With ML decoding, LE-OFDM performs about 2 dB better than convolutionally coded OFDM. From the ML performance curves in FIG. 10, LE-OFDM seems to achieve a larger coding advantage than the punctured convolutional code we used.
Surprisingly, even with linear MMSE equalization, the performance of LE-OFDM is better than coded OFDM for SNR values less than 12 dB. The complexity of ML decoding for LE-OFDM is quite high in the order of 1,000 flops per symbol. But the ZF and MMSE decoders have comparable or even lower complexity than the Viterbi decoder for the convolutional code.
The complexity of LE-OFDM can be dramatically reduced using the parallel encoding method with square encoders (Z. Liu, Y. Xin, and G. B. Giannakis, “Linear Constellation Precoding for OFDM with Maximum Multipath Diversity and Coding Gains,” Proceedings of 35th Asilomar Conference on Signals, Systems & Computers, Pacific Grove, Calif., Nov. 4-7, 2001, pp. 1445-1449, herein incorporated by reference). It is also possible to combine CF coding with conventional GF coding, in which case only small square encoders of size 2×2 or 4×4 are necessary to achieve near optimum performance (Z. Wang, S. Zhou, and G. B. Giannakis, “Joint coded-precoded OFDM with low-complexity turbo-decoding,” in Proc. of the European Wireless Conf., Florence, Italy, Feb. 25-28, 2002, pp. 648-654, herein incorporated by reference).
Various embodiments of the invention have been described. The described techniques can be embodied in a variety of receivers and transmitters including base stations, cell phones, laptop computers, handheld computing devices, personal digital assistants (PDA's), and the like. The devices may include a digital signal processor (DSP), field programmable gate array (FPGA), application specific integrated circuit (ASIC) or similar hardware, firmware and/or software for implementing the techniques. If implemented in software, a computer readable medium may store computer readable instructions, i.e., program code, that can be executed by a processor or DSP to carry out one of more of the techniques described above. For example, the computer readable medium may comprise random access memory (RAM), read-only memory (ROM), non-volatile random access memory (NVRAM), electrically erasable programmable read-only memory (EEPROM), flash memory, or the like. The computer readable medium may comprise computer readable instructions that when executed in a wireless communication device, cause the wireless communication device to carry out one or more of the techniques described herein. These and other embodiments are within the scope of the following claims.

Claims (77)

The invention claimed is:
1. A wireless communication device comprising:
a first encoder that encodes a data stream based on an error-control code to produce encoded symbols;
an interleaver that interleaves the encoded symbols to produce interleaved symbols;
a constellation mapper that maps the interleaved symbols to produce a stream of information bearing symbols selected from a constellation having a finite alphabet;
ana second encoder that applies a linear transformation to athe stream of information bearing symbols selected from athe constellation having athe finite alphabet to produce a stream of precoded symbols that are complex numbers and that are not restricted by the constellation of the information bearing symbols; and
a modulator to produce an output waveform in accordance with the stream of precoded symbols for transmission through a wireless channel.
2. The wireless communication device of claim 1, wherein the modulator generates the output waveform as a multicarrier waveform having a set of subcarriers, and the second encoder encodes the stream of information bearing symbols so that the subcarriers carry different linear combinations of the information symbols.
3. The wireless communication device of claim 1, wherein the second encoder applies the linear transformation by applying a unitary matrix to the information bearing symbols.
4. A wireless communication device comprising:
a first encoder that encodes a data stream based on an error-control code to produce encoded symbols;
an interleaver that interleaves the encoded symbols to produce interleaved symbols;
a constellation mapper that maps the interleaved symbols to produce blocks of K information bearing symbols selected from a constellation having a finite alphabet;
ana second encoder that applies a matrix to linearly transform the blocks of K information bearing symbols selected from athe constellation having athe finite alphabet to produce blocks of N precoded symbols that are complex numbers and that are not restricted to the constellation of the information bearing symbols; and
a modulator that generates a multicarrier waveform having a set of subcarriers, where N is the number of subcarriers of the multi-carrier multicarrier waveform and K is less than or equal to N.
5. The wireless communication device of claim 4, wherein the linear second encoder has a code rate r=K/N.
6. The wireless communication device of claim 4, wherein the linear second encoder applies a matrix of size N×K to the blocks of K information bearing symbols to produce the blocks of N precoded symbols.
7. A wireless communication device, comprising:
an encoder that applies a matrix to linearly transform blocks of K information bearing symbols selected from a constellation having a finite alphabet to produce blocks of N precoded symbols that are complex numbers and that are not restricted by the constellation of the information bearing symbols; and
a modulator that generates a multicarrier waveform having a set of subcarriers for transmission over a wireless channel, wherein N is the number of subcarriers and K is less than or equal to N, and wherein the size of the matrix is selected as a function of an order L of the wireless channel, and the number K of symbols per block is selected as a function of the channel order L.
8. The wireless communication device of claim 7, wherein K is selected so that K≧N−L.
9. The wireless communication device of claim 7, wherein K is selected so that K=N−L.
10. The wireless communication device of claim 6 7, wherein the linear encoder applies the matrix to perform a vector multiplication on the blocks of K information bearing symbols to produce the blocks of N precoded symbols, and applies each block of N precoded symbols across the N subcarriers.
11. The wireless communication device of claim 1, wherein the wireless communication device comprises one of a base station and a mobile device.
12. A wireless communication device comprising:
an encoder that applies a plurality of M matrices to linearly transform a stream of information bearing symbols selected from a constellation having a finite alphabet to produce a stream of precoded symbols that are complex numbers and that are not restricted by the constellation of the information bearing symbols; and
a modulator to produce that produces an output waveform in accordance with the stream of precoded symbols for transmission through a wireless channel, where the matrices are identical and collectively have M*L redundant rows, where L represents an order of the wireless channel.
13. A wireless communication device comprising:
a demodulator that receives a waveform carrying a encoded transmission and that produces a demodulated data stream, the encoded transmission including an encoded data stream, wherein the encoded data stream was produced by performing error-control coding on an input stream to produce coded symbols, interleaving the coded symbols to produce interleaved symbols, mapping the interleaved symbols to produce a stream of information bearing symbols selected from a constellation having a finite alphabet, and applying a linear transformation to a the stream of information bearing symbols selected from a the constellation having a the finite alphabet to produce a stream of precoded symbols that are complex numbers and that are not restricted by the constellation of the information bearing symbols; and
a decoder that decodes the demodulated data stream to produce estimated data.
14. The wireless communication device of claim 13, wherein the decoder applies one of maximum-likelihood detection, zero-force (ZF) detection, minimum mean squared error (MMSE) detection, decision-directed detection, iterative detection, to decode the demodulated data stream.
15. The wireless communication device of claim 13, wherein the wireless communication device comprises one of a base station and a mobile device.
16. A method comprising:
performing error-control coding on an input stream to produce coded symbols;
interleaving the coded symbols to produce interleaved symbols;
mapping the interleaved symbols to produce a stream of information bearing symbols selected from a constellation having a finite alphabet;
applying a linear transformation to a the stream of information bearing symbols selected from a the constellation having a the finite alphabet to produce a stream of precoded symbols that are complex numbers and that are not restricted by the constellation of the information bearing symbols; and
outputting a waveform in accordance with the stream of precoded symbols for transmission through a wireless channel.
17. The method of claim 16, wherein outputting the waveform comprises:
outputting the output waveform as a multicarrier waveform having a set of subcarriers; and
encoding the stream of information bearing symbols so that the subcarriers carry different linear combinations of information symbols.
18. The method of claim 16, wherein applying the linear transformation to the stream of information bearing symbols comprises applying a unitary matrix to the stream of information bearing symbols.
19. A method comprising:
performing error-control coding on an input stream to produce coded symbols;
interleaving the coded symbols to produce interleaved symbols;
mapping the interleaved symbols to produce blocks of K information bearing symbols selected from a constellation having a finite alphabet;
applying a matrix to linearly transform the blocks of K information bearing symbols that are selected from a the constellation having a the finite alphabet to produce blocks of N precoded symbols that are complex numbers and that are not restricted by the constellation of the information bearing symbols, and
outputting a multicarrier waveform having a set of subcarriers in accordance with the stream of blocks of N precoded symbols for transmission through a wireless channel, where N is the number of subcarriers, and K is less than or equal to N.
20. The method of claim 19, wherein applying the linear transformation matrix comprises applying the linear transformation a matrix of size N×K to the blocks of K information bearing symbols to produce blocks of N precoded symbols at a code rate r=K/N.
21. The method of claim 19, wherein applying the linear transformation matrix comprises applying a unitary matrix of size N×K to the blocks of K information bearing symbols, wherein K is equal to N.
22. The method of claim 19, further comprising selecting the number of symbols per block K as a function of an order of the channel.
23. The method of claim 19, further comprising selecting the number of symbols per block K so that K≧N−L, wherein L represents an order of the channel.
24. The method of claim 19, further comprising selecting the number of symbols per block K so that K=N−L, where L represents an order of the channel.
25. The method of claim 19, wherein applying the linear transformation matrix comprises applying a matrix to perform a vector multiplication on the blocks of K information bearing symbols to produce the blocks of N precoded symbols.
26. A method comprising:
applying a plurality of M matrices to linearly transform a stream of information bearing symbols selected from a constellation having a finite alphabet, wherein the M matrices linearly transform the stream of information bearing symbols to produce a stream of precoded symbols that are complex numbers and that are not restricted by the constellation of the information bearing symbols; and
outputting a waveform in accordance with the stream of precoded symbols for transmission through a wireless channel, where the matrices are identical and have M*L redundant rows and, where L represents an order of the channel.
27. A non-transitory computer-readable medium comprising instructions to cause a programmable processor to:
perform error-control coding on an input stream to produce coded symbols;
interleave the coded symbols to produce interleaved symbols;
map the interleaved symbols to produce a stream of information bearing symbols selected from a constellation having a finite alphabet;
apply a linear transformation to a stream of information bearing symbols selected from a the constellation having a the finite alphabet to produce a stream of precoded symbols that are complex numbers and are not restricted by the constellation of the information bearing symbols; and
output waveform in accordance with the stream of precoded symbols for transmission through a wireless channel.
28. The non-transitory computer-readable medium of claim 27, further comprising instructions to cause the programmable processor to:
output the output waveform as a multicarrier waveform having a set of subcarriers; and
encode the stream of information bearing symbols so that the subcarriers carry different linear combinations of information symbols.
29. The wireless communication device of claim 1, wherein the output waveform comprises multiple output waveforms for transmission on multiple antennas, respectively.
30. The wireless communication device of claim 29, wherein the linear transformation is based on multiple matrices comprising a first matrix and a second matrix, wherein the first matrix is based on a fast Fourier transform (FFT) matrix, and wherein the second matrix is based on a diagonal matrix to phase-rotate each entry of a symbol vector.
31. The wireless communication device of claim 30, wherein the number of the antennas is represented by Nt, wherein the first matrix is based on an Nt-point inverse version of the FFT matrix, wherein the linear transformation is based on:
Θ = F N t T diag ( 1 , α , , α N t - 1 ) , α := j 2 π / P
wherein FN t T represents the first matrix, and wherein
diag(1, α, . . . , αN t −1)
represents the second matrix, wherein P is an integer.
32. The wireless communication device of claim 29, wherein the number of the antennas is represented by Nt, and wherein the linear transformation is based on a Vandermonde matrix of size Nt×Nt.
33. The wireless communication device of claim 29, wherein the number of the antennas is represented by Nt, wherein the linear transformation is based on multiple matrices comprising a first matrix and a second matrix,
wherein the first matrix is a matrix of size Nt×Nt, wherein each entry of the first matrix is based on a power of ej2π/N t , each entry of a column of the first matrix being equal to one, and
wherein the second matrix is a diagonal matrix of size Nt×Nt having diagonal entries that are based respectively on different powers of ej2π/P including the zeroth power, wherein P is an integer.
34. The wireless communication device of claim 33, wherein the multiple matrices include a third matrix, wherein the third matrix is a matrix of size Nt×Nt.
35. The wireless communication device of claim 1, wherein the output waveform comprises an orthogonal frequency division multiplexing (OFDM) waveform.
36. The method of claim 16, wherein interleaving the coded symbols to produce the interleaved symbols comprises writing the coded symbols into a matrix row-wise, and reading the encoded symbols from the matrix column-wise.
37. The method of claim 16, wherein performing the error-control coding on the input stream comprises applying at least one of a turbo code and a convolutional code, wherein the constellation having the finite alphabet is a quadrature amplitude modulation (QAM) constellation, and wherein mapping the interleaved symbols comprises selecting symbols from the QAM constellation as the information bearing symbols.
38. The method of claim 16, wherein applying the linear transformation comprises applying the linear transformation to the stream of information bearing symbols to produce the stream of precoded symbols such that the stream of precoded symbols differs, at least in part, from the stream of information bearing symbols, wherein the stream of precoded symbols includes complex numbers.
39. The method of claim 16, wherein outputting the waveform comprises outputting multiple waveforms via multiple antennas, respectively.
40. The method of claim 39, wherein the linear transformation is based on multiple matrices comprising a first matrix and a second matrix, wherein the first matrix is based on a fast Fourier transform (FFT) matrix, and wherein the second matrix is based on a diagonal matrix to phase-rotate each entry of a symbol vector.
41. The method of claim 40, wherein the number of the antennas is represented by Nt, wherein the first matrix is based on an Nt-point inverse version of the FFT matrix, wherein the linear transformation is based on:
Θ = F N t T diag ( 1 , α , , α N t - 1 ) , α := j 2 π / P
wherein FN t T represents the first matrix, and wherein
diag(1, α, . . . , αN t −1)
represents the second matrix, wherein P is an integer.
42. The method of claim 39, wherein the number of the antennas is represented by Nt, and wherein the linear transformation is based on a Vandermonde matrix of size Nt×Nt.
43. The method of claim 39, wherein the number of the antennas is represented by Nt, wherein the linear transformation is based on multiple matrices comprising a first matrix and a second matrix,
wherein the first matrix is a matrix of size Nt×Nt, wherein each entry of the first matrix is based on a power of ej2π/N t , each entry of a column of the first matrix being equal to one, and
wherein the second matrix is a diagonal matrix of size Nt×Nt having diagonal entries that are based respectively on different powers of ej2π/P including the zeroth power, wherein P is an integer.
44. The method of claim 43, wherein the multiple matrices include a third matrix, wherein the third matrix is a matrix of size Nt×Nt.
45. The method of claim 16, wherein outputting the waveform comprises outputting an orthogonal frequency division multiplexing (OFDM) waveform.
46. The method of claim 18, wherein applying the unitary matrix comprises applying a unitary matrix of size M×M in which all entries have equal norm of 1/√{square root over (M)}, where M is an integer greater than one.
47. The method of claim 19, wherein outputting the multicarrier waveform comprises outputting multiple waveforms via multiple antennas, respectively.
48. The method of claim 19, wherein outputting the multicarrier waveform comprises outputting an orthogonal frequency division multiplexing (OFDM) waveform.
49. A method comprising:
applying a linear transformation to a stream of information bearing symbols selected from a constellation having a finite alphabet to produce a stream of precoded symbols that are complex numbers and that are not restricted by the constellation of the information bearing symbols; and
outputting a waveform in accordance with the stream of precoded symbols for transmission through a wireless channel,
wherein the method further comprises:
performing error-control coding on an input data stream to produce coded bits;
interleaving the coded bits to produce interleaved bits;
mapping groups of the interleaved bits to produce the stream of information bearing symbols selected from the constellation having the finite alphabet, wherein a size of the constellation is larger than two, and wherein interleaving the coded bits comprises separating the coded bits so that neighboring coded bits are mapped to different information bearing symbols.
50. The method of claim 49, wherein interleaving the coded bits to produce the interleaved bits comprises writing the coded bits into a matrix row-wise, and reading the coded bits from the matrix column-wise.
51. The method of claim 49, wherein interleaving the coded bits to produce the interleaved bits comprises positioning the coded bits to be mapped to different blocks of information bearing symbols.
52. The method of claim 49, wherein performing the error-control coding on the input stream comprises applying a turbo code.
53. The method of claim 49, wherein performing the error-control coding on the input stream comprises applying a convolutional code.
54. The method of claim 49, wherein the constellation having the finite alphabet is based on quadrature amplitude modulation (QAM).
55. The method of claim 49, wherein the constellation having the finite alphabet is based on quadrature phase shift keying (QPSK).
56. The method of claim 49, wherein applying the linear transformation comprises applying a unitary matrix of size M×M in which all entries have equal norm of 1/√{square root over (M)}, where M is an integer greater than one.
57. The method of claim 49, wherein outputting the waveform comprises outputting multiple waveforms via multiple antennas, respectively.
58. The method of claim 49, wherein outputting the waveform comprises outputting an orthogonal frequency division multiplexing (OFDM) waveform.
59. A wireless communication device comprising:
an encoder that applies a linear transformation to a stream of information bearing symbols selected from a constellation having a finite alphabet to produce a stream of precoded symbols that are complex numbers and that are not restricted by the constellation of the information bearing symbols;
a modulator that produces an output waveform in accordance with the stream of precoded symbols for transmission through a wireless channel; and
circuitry configured to (i) perform error-control coding on an input stream to produce coded bits, (ii) interleave the coded bits to produce blocks of interleaved bits, and (iii) map the blocks of interleaved bits to produce the stream of information bearing symbols selected from the constellation having the finite alphabet.
60. The wireless communication device of claim 59, wherein a size of the constellation is larger than two, and wherein the circuitry is configured to separate the coded bits so that neighboring coded bits are mapped to different information bearing symbols.
61. The wireless communication device of claim 59, wherein the wireless communication device comprises one of a base station and a mobile device.
62. The wireless communication device of claim 59, wherein the output waveform comprises multiple output waveforms for transmission on multiple antennas, respectively.
63. The wireless communication device of claim 59, wherein the output waveform comprises an orthogonal frequency division multiplexing (OFDM) waveform.
64. A method comprising:
applying a linear transformation to a stream of information bearing symbols selected from a constellation having a finite alphabet to produce a stream of precoded symbols that are complex numbers and that are not restricted by the constellation of the information bearing symbols; and
outputting, via multiple antennas, waveforms in accordance with the stream of precoded symbols for transmission through a wireless channel,
wherein the linear transformation is based on multiple matrices comprising a first matrix and a second matrix, wherein the first matrix is based on a fast Fourier transform (FFT) matrix, and wherein the second matrix is based on a diagonal matrix to phase-rotate each entry of a symbol vector.
65. The method of claim 64, wherein the number of the antennas is represented by Nt, and wherein the first matrix is based on an Nt-point inverse version of the FFT matrix.
66. The method of claim 65, wherein the linear transformation is based on:
Θ = F N t T diag ( 1 , α , , α N t - 1 ) , α := j 2 π / P
wherein FN t T represents the first matrix, and wherein
diag(1, α, . . . , αN t −1)
represents the second matrix, wherein P is an integer.
67. The method of claim 64, wherein the method further comprises:
performing error-control coding on an input data stream to produce coded bits;
interleaving the coded bits to produce interleaved bits;
mapping groups of the interleaved bits to produce the stream of information bearing symbols selected from the constellation having the finite alphabet, wherein a size of the constellation is larger than two, and wherein interleaving the coded bits comprises separating the coded bits so that neighboring coded bits are mapped to different information bearing symbols.
68. A device comprising:
an encoder that applies a linear transformation to a stream of information bearing symbols selected from a constellation having a finite alphabet to produce a stream of precoded symbols that are complex numbers and that are not restricted by the constellation of the information bearing symbols; and
a modulator that produces output waveforms in accordance with the stream of precoded symbols for transmission through a wireless channel via multiple antennas,
wherein the linear transformation is based on multiple matrices comprising a first matrix and a second matrix, wherein the first matrix is based on a fast Fourier transform (FFT) matrix, and wherein the second matrix is based on a diagonal matrix to phase-rotate each entry of a symbol vector.
69. The device of claim 68, wherein the number of the antennas is represented by Nt, and wherein the first matrix is based on an Nt-point inverse version of the FFT matrix.
70. The device of claim 68, wherein the linear transformation is based on:
Θ = F N t T diag ( 1 , α , , α N t - 1 ) , α := j 2 π / P
wherein FN t T represents the first matrix, and wherein
diag(1, α, . . . , αN t −1)
represents the second matrix, wherein P is an integer.
71. The device of claim 68, further comprising:
circuitry configured to (i) perform error-control coding on an input stream to produce coded bits, (ii) interleave the coded bits to produce blocks of interleaved bits, and (iii) map the blocks of interleaved bits to produce the stream of information bearing symbols selected from the constellation having the finite alphabet.
72. The device of claim 68, wherein the output waveforms comprises orthogonal frequency division multiplexing (OFDM) waveforms.
73. The wireless communication device of claim 29, wherein the linear transformation is based on a Fourier transform.
74. The wireless communication device of claim 34, wherein the third matrix is a unitary matrix.
75. The method of claim 39, wherein the linear transformation is based on a Fourier transform.
76. The method of claim 44, wherein the third matrix is a unitary matrix.
77. The wireless communication device of claim 13, wherein the linear transformation is based on a Fourier transform.
US13/858,734 2002-04-22 2013-04-08 Wireless communication system having linear encoder Active 2025-09-26 USRE45230E1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US13/858,734 USRE45230E1 (en) 2002-04-22 2013-04-08 Wireless communication system having linear encoder

Applications Claiming Priority (7)

Application Number Priority Date Filing Date Title
US37488602P 2002-04-22 2002-04-22
US37493302P 2002-04-22 2002-04-22
US37493402P 2002-04-22 2002-04-22
US37493502P 2002-04-22 2002-04-22
US37498102P 2002-04-22 2002-04-22
US10/420,353 US7292647B1 (en) 2002-04-22 2003-04-21 Wireless communication system having linear encoder
US13/858,734 USRE45230E1 (en) 2002-04-22 2013-04-08 Wireless communication system having linear encoder

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US10/420,353 Reissue US7292647B1 (en) 2002-04-22 2003-04-21 Wireless communication system having linear encoder

Publications (1)

Publication Number Publication Date
USRE45230E1 true USRE45230E1 (en) 2014-11-04

Family

ID=38648301

Family Applications (2)

Application Number Title Priority Date Filing Date
US10/420,353 Ceased US7292647B1 (en) 2002-04-22 2003-04-21 Wireless communication system having linear encoder
US13/858,734 Active 2025-09-26 USRE45230E1 (en) 2002-04-22 2013-04-08 Wireless communication system having linear encoder

Family Applications Before (1)

Application Number Title Priority Date Filing Date
US10/420,353 Ceased US7292647B1 (en) 2002-04-22 2003-04-21 Wireless communication system having linear encoder

Country Status (1)

Country Link
US (2) US7292647B1 (en)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140115417A1 (en) * 2012-10-19 2014-04-24 Eutelsat Sa Encoding method for quasi-periodic fading channel
US20140369434A1 (en) * 2013-06-17 2014-12-18 Futurewei Technologies, Inc. System and Method for Designing and Using Multidimensional Constellations
US20160006586A1 (en) * 2013-02-12 2016-01-07 Nokia Solutions And Networks Oy Zero insertion for isi free ofdm reception
US9608846B2 (en) * 2015-01-30 2017-03-28 Huawei Technologies Co., Ltd. Apparatus and method for transmitting data with conditional zero padding
US10356788B2 (en) 2015-10-30 2019-07-16 Huawei Technologies Co., Ltd. System and method for high-rate sparse code multiple access in downlink
US10523383B2 (en) 2014-08-15 2019-12-31 Huawei Technologies Co., Ltd. System and method for generating waveforms and utilization thereof
US10700800B2 (en) 2003-05-21 2020-06-30 Regents Of The University Of Minnesota Estimating frequency-offsets and multi-antenna channels in MIMO OFDM systems

Families Citing this family (52)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7408978B2 (en) * 2002-09-09 2008-08-05 Interdigital Technology Corporation Extended algorithm data estimator
AU2003253162A1 (en) * 2002-09-30 2004-04-19 Koninklijke Philips Electronics N.V. Transmission system
US20060203923A1 (en) * 2003-01-10 2006-09-14 Elena Costa Method and communications system device for the code-modulated transmission of information
JP4419957B2 (en) * 2003-06-19 2010-02-24 ソニー株式会社 WIRELESS COMMUNICATION SYSTEM, RECEIVING APPARATUS AND RECEIVING METHOD FOR Performing Multicarrier Transmission
US7969857B2 (en) * 2003-08-07 2011-06-28 Nortel Networks Limited OFDM system and method employing OFDM symbols with known or information-containing prefixes
FR2859328B1 (en) * 2003-08-29 2005-11-25 France Telecom METHOD AND APPARATUS FOR ITERATIVE EQUALIZATION AND DECODING FOR HIGH-SPEED COMMUNICATIONS ON MULTI-ANTENNA CHANNELS IN TRANSMISSION AND RECEPTION
US8908496B2 (en) * 2003-09-09 2014-12-09 Qualcomm Incorporated Incremental redundancy transmission in a MIMO communication system
KR100913874B1 (en) * 2003-10-27 2009-08-26 삼성전자주식회사 Ici cancellation method in ofdm system
WO2005109679A1 (en) * 2004-05-07 2005-11-17 Samsung Electronics Co., Ltd. Apparatus and method for encoding/decoding space time block code in a mobile communication system using multiple input multiple output scheme
WO2005114858A1 (en) * 2004-05-21 2005-12-01 Koninklijke Philips Electronics, N.V. A transmitter and receiver for ultra-wideband ofdm signals employing a low-complexity cdma layer for bandwidth expansion
US20050281349A1 (en) * 2004-06-21 2005-12-22 Brodcom Corporation Multiple streams using STBC with higher data rates and diversity gain within a wireless local area network
US7561631B2 (en) * 2004-08-25 2009-07-14 Broadcom Corporation Multiple streams using partial STBC with SDM within a wireless local area network
WO2006039799A1 (en) * 2004-10-13 2006-04-20 The Governors Of The University Of Alberta Systems and methods for ofdm transmission and reception
US7542411B1 (en) * 2004-12-03 2009-06-02 Entropic Communications Inc. Echo profile probe
TWI252641B (en) * 2004-12-17 2006-04-01 Realtek Semiconductor Corp Searching method for maximum likelihood (ML) detection
US7418649B2 (en) * 2005-03-15 2008-08-26 Microsoft Corporation Efficient implementation of reed-solomon erasure resilient codes in high-rate applications
WO2006118433A1 (en) * 2005-05-04 2006-11-09 Samsung Electronics Co., Ltd. Adaptive data multiplexing method in ofdma system and transmission/reception apparatus thereof
US7668230B2 (en) * 2005-06-03 2010-02-23 Adc Dsl Systems, Inc. Non-intrusive digital subscriber line transmit adjustment method
US7894818B2 (en) * 2005-06-15 2011-02-22 Samsung Electronics Co., Ltd. Apparatus and method for multiplexing broadcast and unicast traffic in a multi-carrier wireless network
FR2894416B1 (en) * 2005-12-05 2008-02-29 Commissariat Energie Atomique METHOD AND DEVICE FOR SELECTING THE SPREAD PARAMETERS OF A CDMA OFDM SYSTEM
KR100788890B1 (en) * 2005-12-07 2007-12-27 한국전자통신연구원 Transmitting Apparatus for transmitting in the multicarrier system using multiple antennas and Receiving Apparatus in the same system
FR2901434B1 (en) * 2006-05-17 2008-07-11 Comsis Soc Par Actions Simplif METHOD FOR DECODING 2X2 SPATIO-TEMPORAL CODES, ESPECIALLY OF THE GOLDEN CODE TYPE
TWM314385U (en) * 2006-10-23 2007-06-21 Genesys Logic Inc Apparatus for inspecting and correcting encoding random error of BCH
US7634233B2 (en) * 2006-11-27 2009-12-15 Chung Shan Institute Of Science And Technology Transmission system with interference avoidance capability and method thereof
KR101445388B1 (en) * 2007-09-03 2014-09-26 엘지전자 주식회사 Method of Transmitting Data using Repetition Coding
USRE47602E1 (en) 2007-09-03 2019-09-10 Lg Electronics Inc. Method of transmitting data using repetition coding
USRE46039E1 (en) * 2007-09-03 2016-06-21 Lg Electronics Inc. Method of transmitting data using repetition coding
US8320510B2 (en) * 2008-09-17 2012-11-27 Qualcomm Incorporated MMSE MIMO decoder using QR decomposition
KR101738173B1 (en) * 2008-09-28 2017-05-19 라모트 앳 텔-아비브 유니버시티 리미티드 Method and system for adaptive coding in flash memories
US8671327B2 (en) 2008-09-28 2014-03-11 Sandisk Technologies Inc. Method and system for adaptive coding in flash memories
EP2228955B1 (en) * 2009-03-13 2017-02-22 OCT Circuit Technologies International Limited System and method for OFDM reception in the presense of Doppler effect based on time domain windowing
US8340211B2 (en) * 2009-06-23 2012-12-25 Samsung Electronics Co., Ltd. Methods and apparatus to encode bandwidth request message
CN102687475B (en) * 2009-10-13 2015-08-05 骁阳网络有限公司 For method and the optic network parts of deal with data in optic network parts
US8295335B2 (en) * 2009-12-31 2012-10-23 Intel Corporation Techniques to control uplink power
US8325850B2 (en) * 2010-01-25 2012-12-04 Futurewei Technologies, Inc. System and method for digital communications with unbalanced codebooks
US8479075B2 (en) * 2010-09-03 2013-07-02 Futurewei Technologies, Inc. System and method for preserving neighborhoods in codes
KR20120056510A (en) * 2010-11-25 2012-06-04 삼성전자주식회사 Method and apparatus for transmitting and receiving signal in a radio communication system
US20140105315A1 (en) * 2012-10-12 2014-04-17 The Governors Of The University Of Alberta Frequency time block modulation for mitigating doubly-selective fading
US9071362B1 (en) * 2012-10-19 2015-06-30 Ciena Corporation Noise-tolerant optical modulation
US9356649B2 (en) * 2012-12-14 2016-05-31 Huawei Technologies Co., Ltd. System and method for low density spreading modulation detection
EP2919232A1 (en) * 2014-03-14 2015-09-16 Fraunhofer-Gesellschaft zur Förderung der angewandten Forschung e.V. Encoder, decoder and method for encoding and decoding
US10291452B2 (en) * 2015-04-02 2019-05-14 Lg Electronics Inc. Method for processing in-band multiplexing using FCP-OFDM scheme, and device therefor
CN108713312B (en) * 2016-03-11 2021-09-28 奥兰治 Method and apparatus for transmitting data corresponding to a service
US9848342B1 (en) * 2016-07-20 2017-12-19 Ccip, Llc Excursion compensation in multipath communication systems having performance requirements parameters
US10206232B2 (en) 2016-09-29 2019-02-12 At&T Intellectual Property I, L.P. Initial access and radio resource management for integrated access and backhaul (IAB) wireless networks
US10644924B2 (en) * 2016-09-29 2020-05-05 At&T Intellectual Property I, L.P. Facilitating a two-stage downlink control channel in a wireless communication system
US10171214B2 (en) 2016-09-29 2019-01-01 At&T Intellectual Property I, L.P. Channel state information framework design for 5G multiple input multiple output transmissions
US10602507B2 (en) 2016-09-29 2020-03-24 At&T Intellectual Property I, L.P. Facilitating uplink communication waveform selection
US10158555B2 (en) 2016-09-29 2018-12-18 At&T Intellectual Property I, L.P. Facilitation of route optimization for a 5G network or other next generation network
US10355813B2 (en) 2017-02-14 2019-07-16 At&T Intellectual Property I, L.P. Link adaptation on downlink control channel in a wireless communications system
EP3537678B1 (en) * 2018-03-08 2022-05-04 Institut Mines Telecom - IMT Atlantique - Bretagne - Pays de la Loire Pseudo-guard intervals insertion in an fbmc transmitter
KR102067938B1 (en) * 2019-01-14 2020-01-17 박천수 Zero-Force Equalized Vector Synthesis Absolute Encoder Method and its apparatus

Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6188717B1 (en) 1996-11-19 2001-02-13 Deutsche Forschungsanstalt Fur Luft-Und Raumfahrt E.V. Method of simultaneous radio transmission of digital data between a plurality of subscriber stations and a base station
US6351499B1 (en) 1999-12-15 2002-02-26 Iospan Wireless, Inc. Method and wireless systems using multiple antennas and adaptive control for maximizing a communication parameter
US6442214B1 (en) 2000-05-19 2002-08-27 Iospan Wireless, Inc. Diversity transmitter based on linear transform processing of transmitted information
US6452981B1 (en) 1996-08-29 2002-09-17 Cisco Systems, Inc Spatio-temporal processing for interference handling
US20020163892A1 (en) 1999-07-16 2002-11-07 Babak Hassibi Cayley-encodation of unitary matrices for differential communication
US20020167962A1 (en) 2000-10-27 2002-11-14 Sharp Laboratories Of America, Inc. Outer code for CSMA systems using an OFDM physical layer in contention-free mode
US6614861B1 (en) 1999-04-16 2003-09-02 Nokia Networks Oy Method and apparatus for higher dimensional modulation
US20040146014A1 (en) 1998-09-18 2004-07-29 Hughes Electronics Corporation Method and constructions for space-time codes for PSK constellations for spatial diversity in multiple-element antenna systems
US6865237B1 (en) 2000-02-22 2005-03-08 Nokia Mobile Phones Limited Method and system for digital signal transmission
US6891897B1 (en) 1999-07-23 2005-05-10 Nortel Networks Limited Space-time coding and channel estimation scheme, arrangement and method
US6898248B1 (en) 1999-07-12 2005-05-24 Hughes Electronics Corporation System employing threaded space-time architecture for transporting symbols and receivers for multi-user detection and decoding of symbols
US6956815B2 (en) 2001-08-16 2005-10-18 Proxim Corporation Method and apparatus using pseudo-inverses of linear transformations in multi-carrier modulation receivers and transceivers

Patent Citations (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6452981B1 (en) 1996-08-29 2002-09-17 Cisco Systems, Inc Spatio-temporal processing for interference handling
US6188717B1 (en) 1996-11-19 2001-02-13 Deutsche Forschungsanstalt Fur Luft-Und Raumfahrt E.V. Method of simultaneous radio transmission of digital data between a plurality of subscriber stations and a base station
US20040146014A1 (en) 1998-09-18 2004-07-29 Hughes Electronics Corporation Method and constructions for space-time codes for PSK constellations for spatial diversity in multiple-element antenna systems
US6614861B1 (en) 1999-04-16 2003-09-02 Nokia Networks Oy Method and apparatus for higher dimensional modulation
US6898248B1 (en) 1999-07-12 2005-05-24 Hughes Electronics Corporation System employing threaded space-time architecture for transporting symbols and receivers for multi-user detection and decoding of symbols
US20020163892A1 (en) 1999-07-16 2002-11-07 Babak Hassibi Cayley-encodation of unitary matrices for differential communication
US6891897B1 (en) 1999-07-23 2005-05-10 Nortel Networks Limited Space-time coding and channel estimation scheme, arrangement and method
US6351499B1 (en) 1999-12-15 2002-02-26 Iospan Wireless, Inc. Method and wireless systems using multiple antennas and adaptive control for maximizing a communication parameter
US6865237B1 (en) 2000-02-22 2005-03-08 Nokia Mobile Phones Limited Method and system for digital signal transmission
US6442214B1 (en) 2000-05-19 2002-08-27 Iospan Wireless, Inc. Diversity transmitter based on linear transform processing of transmitted information
US20020167962A1 (en) 2000-10-27 2002-11-14 Sharp Laboratories Of America, Inc. Outer code for CSMA systems using an OFDM physical layer in contention-free mode
US6956815B2 (en) 2001-08-16 2005-10-18 Proxim Corporation Method and apparatus using pseudo-inverses of linear transformations in multi-carrier modulation receivers and transceivers

Non-Patent Citations (196)

* Cited by examiner, † Cited by third party
Title
3GPP-TSG-RAN-WG4; UTRA (BS) TDD; Radio Transmission and Reception. Eur. Telecommun. Standards Inst. (ETSI), Sophia Antipolis, France. [Online]. 1999, Available: http://www.etsi.org/umts, 25 pages.
A. Aggarwal, S. Savage, and T. Anderson, "Understanding the Performance of TCP Pacing," in Proc. Of IEEE Infocom 00, Tel-Aviv, Israel, Mar. 2000.
A. Duel-Hallen, S. Hu, and H. Hallen, "Long-Range Prediction of Fading Signals," IEEE Signal Processing Magazine, pp. 62-75, May 2000.
A. Hiroike, F. Adachi, and N. Nakajima, "Combined Effect of Phase Sweeping Transmitter Diversity and Channel Coding," IEEE Trans. On Vehicular Technology, pp. 170-176, May 1992.
A. Narula, M.D. Trott, and G.W. Wornell, "Performance Limits of Coded Diversity Methods for Transmitter Antenna Arrays," IEEE Transactions on Information Theory, vol. 45, No. 7, pp. 2418-2433, Nov. 1999.
A. Narula, M.J. Lopez, M.D. Trott, and G.W. Wornell, "Efficient Use of Side Information in Multiple-Antenna Data Transmission over Fading Channels," IEEE Journal on Selected Areas in Communications, vol. 16, No. 8, pp. 1423-1436, Oct. 1998.
A. Ruiz, J.M. Cioffi, and S. Kasturia, "Discrete Multiple Tone Modulation with Coset Coding for the Spectrally-Shaped Channel," IEEE Transactions on Communications, vol. 40, No. 6, pp. 1012-1029, Jun. 1992.
A. Stamoulis, G.B. Giannakis, and A. Scaglione, "Block FIR Decision-Feedback Equalizers for Filterbank Precoded Transmissions with Blind Channel Estimation Capabilitites," IEEE Transactions On Communications, vol. 49, No. 1, pp. 69-83, Jan. 2001.
A. Wiineben, "A New Bandwidth Efficient Transmit Antenna Modulation Diversity Scheme for Linear Digital Modulation," Proc. of IEEE International Conference on Comm., vol. 3, pp. 1630-1634, Geneva, Switzerland, May 23-26, 1993.
A.F. Naguib, "On The Matched Filter Bound of Tranmit Diversity Techniques," IEEE International Conference on Communications, vol. 2, pp. 596-603, Helsinki, Finland, Jun. 11-14, 2001.
A.J. Viterbi, "An Intuitive Justification and a Simplified Implementation of the MAP Decoder for Convolutional Codes," IEEE Journal on Selected Areas in Communications, vol. 16, No. 2, pp. 260-264, Feb. 1998.
A.M. Sayeed and B. Aazhang, "Joint Multipath-Doppler Diversity in Mobile Wireless Communications," IEEE Transactions On Communications, vol. 47, No. 1, pp. 123-132, Jan. 1999.
Alamouti, "A Simple Transmit Diversity Scheme for Wireless Communications", IEEE 1. Select Areas Comm, Oct. 1998, 16:1451-1458.
B. Hassibi and B.M. Hochwald, "High-Rate Codes that are Linear in Space and Time," IEEE Trans. On Information Theory, pp. 1-56, revised Apr. 2001; URL: http://mars.bell-labs.com/cm/ms/what/mars/index.html.
B. Le Floch, M. Alard, and C. Berrou, "Coded Orthogonal Frequency Division Multiplex," Proceedings of the IEEE, vol. 83, No. 6, pp. 982-996, Jun. 1995.
B. Lu and X. Wang, "Space-Time Code Design in OFDM Systems," Proc. Of Global Telecommunications Conference, San Francisco, CA, vol. 2, pp. 1000-1004, Nov. 27-Dec. 1, 2000.
B. Muquet, M. de Courville, G.B. Giannakis, Z. Wang, and P. Duhamel, "Reduced Complexity Equalizers For Zero-Padded OFDM Transmission".
Bahl et al., "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans on Inform. Theory, Mar. 1974, 20:284-287.
Belfiore et al., "Optimal Linear Labeling for the Minimization of both Source and Channel Distortion," in Proc. Int. Symp. Infot. Theory, Sorrento, Italy, Jun. 25-30, 2000, 1 page.
Benedetto and Biglieri, "Principles of digital transmission with wireless applications," Kluwer Academic/ Plenum Publishers, 1999, 11 pages (Table of Contents).
Blake et al., "Algebraic-geometry codes," IEEE Trans Inform Theory, Oct. 1998, 44:2596-2618.
Boutros et al., "Good lattice constellations for both Rayleigh fading and Gaussian channel," IEEE Trans. Inform. Theory, Mar. 1996, 42:502-518.
C. Berrou, A. Glavieux, and P. Thitimajsima, "Near Shannon Limit Error-Correcting Coding and Decoding: Turbo Codes (1)," in Proc. Of Intl. Conf. On Com., Geneva, Switzerland, May 1993, pp. 1064-1070.
C. Tepedelenlioglu and G.B. Giannakis, "Transmitter Redundancy for Blind Estimation and Equalization of Time- Frequency-Selective Channels," IEEE Transactions On Signal Processing, vol. 48, No. 7, pp. 2029-2043, Jul. 2000.
Chen and Womell, "Analog error-correcting codes based on chaotic dynamical systems," IEEE Trans. Commun., Jul. 1998, 46:881-890.
Conway and Sloane, Sphere Packings, Lattices, and Groups, 3rd. edition., New York: Springer-Verlag, 1998, 13 pages (Table of Contents).
Czylwik, "OFDM and related methods for broadband mobile radio channels;" in Proc. Int. Zurich Seminar on Broadband Communications, Zilrich, Switzerland, 1998, pp. 91-98.
D. Agrawal, V. Tarokh, A. Naguib, and N. Seshadri, "Space-Time Coded OFDM for High Data-Rate Wireless Communication Over Wideband Channels," Proc. Of Vehicular Technology Conf., pp. 2232-2236, Ottawa, Ont, Canada, May 18-21, 1998.
D. Dardari and V. Tralli, "High-Speed Indoor Wireless Communications at 60 GHz with Coded OFDM," IEEE Transactions on Communications, vol. 47, No. 11, pp. 1709-1721, Nov. 1999.
D. Gore, S. Sandhu, and A. Paulraj, "Delay Diversity Code for Frequency Selective Channels," Electronics Letters, vol. 37, No. 20, pp. 1230-1231, Sep. 27, 2001.
D.K. Borah and B. Hart, "Receiver Structures for Time-Varying Frequency-Selective Fading Channels," IEEE Journal of Selected Areas in Communications, vol. 17, No. 11, pp. 1863-1875, Nov. 1999.
D.-S. Shiu, G.J. Foschini, M.J. Gans, and J.M. Kahn, "Fading Correlation and Its Effect on the Capacity of Multielement Antenna Systems," IEEE Transactions on Communications, vol. 48, No. 3, pp. 502-513, Mar. 2000.
Damen et al., "A construction of space-time code based on number theory," IEEE Trans. on Infor. Theory, Mar. 2002, pp. 753-760.
Damen et al., "Lattice codes decoder of space-time codes," IEEE Common. Lett., May 2000, 4:161-163.
Damen et al., "Transmit diversity using Rotated Constellations with Hadamard Transform", Proc. Adaptive Systems for SF, Com., and Control Conj., Oct. 2000, Lake Louise, Alberta, Canada, 6 pages.
Daneshrad et al., "Clustered OFDM transmitter implementation," in Proc. IEEE Int. Symp. Personal, Indoor and Mobile Radio Communications, Oct. 1996, Taipei, Taiwan, 3:1064-1068.
Divsalar and Simon, "The design of trellis-coded MPSK for fading channels: performance criteria," IEEE Trans. Commun., Sep. 1988, 36:1004-1021.
E. Biglieri, J. Proakis, and S. Shamai, "Fading Channels: Information-Theoretic and Communications Aspects," IEEE Trans. On Information Theory, vol. 44, No. 6, pp. 2619-2692, Oct. 1998.
E. Lindskog and A. Paulraj, "A Transmit Diversity Scheme for Channels with Intersymbol Interference," Proceedings Of International Conference On Comm., vol. 1, pp. 307-311, Jun. 2000.
E. Visotsky and U. Madhow, "Space-Time Transmit Precoding With Imperfect Feedback," IEEE Transactions on Information Theory, vol. 47, No. 6, pp. 2632-2639, Sep. 2001.
E. Viterbo, and J. Boutros, "A Universal Lattice Code Decoder for Fading Channels," IEEE Transactions on Information Theory, vol. 45, no. pp. 1639-1642, Jul. 1999.
ETSI Normalization Committee, "Channel models for HIPERLAN/2 in different indoor scenarios," ETSI, document 3ERI085B, ETSI, Sophia-Antipolis, Valbonne, France, 1998, 8 pages.
ETSI TS 101 475 V1.2.2 (Feb. 2001) Technical Specification, Broadband Radio Access Networks (BRAN); HIPER-LAN Type 2; Physical (PHY) Layer, 2001, 41 pages.
F.W. Vook and T.A. Thomas, "Transmit Diversity Schemes for Broadband Mobile Communication Systems," Proc. Of Vehicular Tech. Conf., vol. 6, pp. 2523-2529, Boston MA, Sep. 24-28, 2000.
Fincke and Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," ACM SIGSAM Bull., 1981, 15:37-44.
Forney, "Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference," IEEE Trans. Inform. Theory, 1972, IT-18:363-378.
Foschini, "Layered Space-time Architecture for Wireless Communication in a Flat Fading Environment when Using Multi-Element Antennas", Bell Labs. Tech., 1996, 1:41-50.
G. Jongren and M. Skoglund, "Utilizing Quantized Feedback Information in Orthogonal Space-Time Block Coding," in Proceedings IEEE Global Telecommunications Conference, Nov. 27, 2000.
G. Jongren, M. Skoglund, and B. Ottersten, "Combining Transmit Antenna Weights and Orthogonal Space-Time Block Codes by Utilizing Side Information," In Proceedings of the 33rd Asilomar Conference on Signals, Systems and Computers, Oct. 23, 1999.
G. Jongren, M. Skoglund, and B. Ottersten, "Combining Transmit Beamforming and Orthogonal Space-Time Block Codes by Utilizing Side Information," IEEE Sensor Array and Multichannel Signal Processing Workshop, Mar. 14, 2000.
G. Kaplan and S. Shamai, "Achievable Performance Over the Correlated Rician Channel," IEEE Transaction on Communications, vol. 42, No. 11, pp. 2967-2978, Nov. 1994.
G. Leus, S. Zhou, and G.B. Giannakis, "Multi-User Speading Codes Retaining Orthagonality through Unknown Time- and Frequency-Selective Fading," Proc. Of GLOBECOM, vol. 1, pp. 259-263, San Antonio, TX, Nov. 25-29, 2001.
G.B. Giannakis and C. Tepedelenlioglu, "Basic Expansion Models and Diversity Techniques for Blind Identification and Equalization of Time-Varying Channels," Proceedings of the IEEE, vol. 86, No. 10,pp. 1969-1986, Oct. 1998.
G.B. Giannakis and S. Zhou, "Optimal Transmit-Diversity Precoders for Random Fading Channels," in Proc. of Globecom Conf., vol. 3, San Francisco, CA, Nov. 27-Dec. 1, 2000.
G.B. Giannakis, X. Ma, G. Leau, and S. Zhou, "Space-Time-Doppler Coding Over Time-Selective Fading Channels With Maximum Diversity And Coding Gains," Proc. Of Intl. Conf. On ASSP, Orlando, FL, May 13-17, 2002, pp. III-2217-III-2220.
G.C. Clark, Jr. et al., Error-Correction Coding for Digital Communications, Plenum Press, pp. 9, 10, 420.
G.J. Foschini and M.J. Gans, "On Limits of Wireless Communications in a Fading Environment When Using Multiple Antennas," Wireless Personal Communications, vol. 6, No. 3, pp. 311-335, Mar. 1998.
Gamal and Hammons, "A new approach to layered space-time coding and signal processing," IEEE Trans. On Infor. Theory, Sep. 2001, pp. 2321-2334.
Ganesan and Stoica, "Space--time diversity," in Signal Processing Advances in Wireless and Mobile Communications, Giannakis et al., Eds., 2000, Englewood Cliffs, NJ: Prentice-Hall vol. 2, chapter 2, 31 pages.
Giannakis et al., "AMOUR generalized multicarrier transceivers for blind CDMA regardless of multipath," IEEE Trans. Commun., Dec. 2000, 48: 2064-2076.
Giannakis, "Filterbanks for blind channel identification and equalization,"IEEE Signal Processing Lett., Jun. 1997, 4:184-187.
Göeckel and Ananthaswamy, "On the design of multidimensional signal sets for OFDM systems," IEEE Trans. Commun., Mar. 2002, 50:442-452.
Golden et al., "Detection algorithm and Initial Laboratory Results Using V-BLAST Space-Time Communication architecture," Elec. Lett., vol. 35, Jan. 1999, 3 pages.
H. Bolcskei and A.J. Paulraj, "Space-Frequency Coded Broadband OFDM Systems," in Proc. of Wireless Communications and Networking Conference, vol. 1, pp. 1-6, Chicago, IL., Sep. 23-28, 2000.
H. Bolcskei and A.J. Paulraj, "Space-Frequency Codes for Broadband Fading Channels," in Proc. of IEEE Int. Symposium on Information Theory, pp. 219, Washington D.C., Jun. 24-29, 2001.
H. Wang, J. Belzile, and C.L. Despins, "64-QAM OFDM With TCM Coding and Waveform Shaping in a Time-Selective Rician Facing Channel," in Proc. Of Int'l Zurich Seminar on Broadband Comm., Berdun, Que., Canada, 2000, pp. 257-261.
H.R. Sadjadpour, "Application of Turbo Codes for Discrete Multi-Tone Modulation Schemes," in Proc. Of Intl. Conf. On Com., Vancouver, Canada, 1999, vol. 2, pp. 1022-1027.
Hassibi and Vikalo, "On the expected complexity of sphere decoding," in Proc. 35th Asilomar Conf. Signals, Systems, and Computers, Oct. 29-Nov. 1, 2001, Pacific Grove, CA, 7 pages.
Helard and Le Floch, "Trellis-coded orthogonal frequency-division multiplexing for digital video transmission," in Proc. Global Telecommunications Conf., Dec. 1991, Phoenix, AZ, 2:785-791.
Henkel, "Analog codes for peak-to-average ratio reduction," in Proc. 3mlTG Conf. Source and Channel Coding, Munich, Germany, Jan. 2000, 5 pages.
Henkel, "Multiple error correction with analog codes," in Proc. AAECC-6 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1988, 357:239-249.
Hero and Marzetta, "Cutoff rate and signal design for the quasi-static Rayleigh fading space-time channel," IEEE Trans. Inform. Theory, Sep. 2001, 47:2400-2416.
Hochwald and Brink, "Achieving near-capacity on a multiple- antenna channel," IEEE Trans. Commun., Mar. 2003, 51:389-399.
Horn and Johnson, Topics in Matrix Analysis, New York: Cambridge University Press, 1991, 4 pages (Table of Contents).
J. Boutos and E. Viterbo, "Signal Space Diversity: A Power-and Bandwidth-Efficient Diversity Technique for the Rayleigh Fading Channel," IEEE Transactions on Information Theory, vol. 44, No. 4, pp. 1453-1467, Jul. 1998.
J. Hagenauer, and P. Hoeher, "A Viterbi Algorithm with Soft-Decision Outputs and Its Applications," in Proc. Of the IEEE 1989 Global Communications Conference, Dallas, Texas, pp. 1680-1686, Nov. 1989.
J. Mahdavi and S. Floyd, "TCP-Friendly Unicast Rate-Based Flow Control," Jan. 1997, http://www.psc.edu/networking/papers/tcp—friendly.html.
J. Vogt, K. Koora, A. Finger, and G. Fettweis, "Comparison of Different Turbo Decoder Realizations For IMT-2000," in Global Telecommunications Conference—GLOBECOM'99, Rio de Janeiro, Brazil, 1999, vol. 5, pp. 2704-2708.
J.K. Cavers, "Optimized Use Of Diversity Modes In Transmitter Diversity Systems," in Proc. of the Vehicular Technology Conf., vol. 3, Amsterdam, The Netherlands, 1999, pp. 1768-1773.
Jafarkhani, "A quasi-orthogonal space-time block code," IEEE Trans. Commun., 2001, 49:1-4.
Jeong and Park, "Performance evaluation of trellis-coded OFDM for digital audio broadcasting," in Proc. of the IEEE Region 10 Conf, 1999, 1:569-572.
K.R. Narayanan et al., "Low Complexity Turbo Equalization with Binary Precoding," 5 pages, IEEE, 2000.
Kaiser and Fazel, "A flexible spread spectrum multicarrier multiple- access system for multimedia applications," in Proc. 8th IEEE Int. Symp. PIMRC, 1997, 1:100-104.
Knopp and Humblet, "On coding for block fading channels;" IEEE Trans. Inform. Theory, Jan. 2000, 46:189-205.
Koffman and V. Roman, "Broadband wireless access solutions based on OFDM access in IEEE802.16," IEEE Commun. Mag., Apr. 2002, pp. 96-103.
Kschischang et al., "Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, 2001, 47:498-519.
L. Rizzo, IP Dummynet, pp. 1-9, http://info.iet.unipi.it/luigi/ip—dummynet/.
L. Sylla, P. Fortier, and H.T. Huynh, "Performance of COFDM Using Turbo Codes," in Proc. Of IEEE Canadian Conference on Electrical and Computer Engineering, Edmonton, Alta, Canada, May 9-12, 1999.
Li and Sidiropoulos, "Blind Digital Signal Separation Using Successive Inference Cancellation Iterative Least' Squares," IEEE Trans. on Signal Processing, Nov. 2000, 48:3146-3152.
Liu and Giannakis, "Space-time block-coded multiple access through frequency-selective fading channels," IEEE Trans. Commun., Jun. 2001, 49:1033-1044.
Liu and Giannakis, "Space-time coding and Kalman filtering for diversity transmissions through time-selective fading channels," IEEE Trans Commun., Feb. 2002, 50: 183-186.
Liu and Giannakis, "Unitary constellation precoding for OFDM with maximum muitipath diversity and coding gains," in Proc. of 35th Asilomar Conf., Nov. 2001, Pacific Grove, CA, 7 pages.
Liu et al., "Space-time coding for broadband wireless communications," in Wireless Communications and Mobile Computing, 2001, New York: Wiley, 1:33-53.
M. Martone, "Wavelet-Based Separating Kernels for Sequence Estimation with Unknown Rapidly Time-Varying Channels," IEEE Communications Letters, vol. 3, No. 3, pp. 78-80, Mar. 1999.
M. Mathis, J. Semke, J. Mahdavi, and T. Ott, "The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm," Computer Communication Review, Vo. 27, No. 3, Jul. 1997, pp. 1-16.
M. Rouanne and D.J. Costello, Jr., "An Algorithm for Computing the Distance Spectrum of Trellis Codes," IEEE Journal on Selected Areas in Communications, vols. 7, No. 6, pp. 929-940, Aug. 1989.
M.F. Pop and N.C. Beaulieu, "Limitations of Sum-of-Sinusoids Fading Channel Simulators," IEEE Transactions On Communications, vol. 49, No. 4, pp. 699-708, Apr. 2001.
M.K. Tsatsanis and G.B. Giannakis, "Modelling and Equalization of Rapidly Fading Channels," International Journal of Adaptive Control and Signal Processing, vol. 10, pp. 159-176, 1996.
Ma and Giannakis, "Complex field coded MIMO systems: performance, rate, and tradeoffs," Wireless Comm. and Mobile Computing, Nov./Dec. 2002, 2:693-717.
Ma and Giannakis, "Full-Rate Full-Diversity Space-Time Complex-Field Codes for Frequency- or Time-Selective Fading Channels," Proc. of 36th Asilomar Conf. on Signals, Systems, and Computers, Nov. 2002, Pacific Grove, CA, pp. 1714-1718.
Ma and Giannakis, "Layered space-time complex field coding: full-diversity with full-rate, and tradeoffs,"Proc. of the 2nd Sensor Array and Multichannel SP Workshop, Aug. 2002, Rosslyn, VA, 442-446.
MacWilliams and Sloane, The Theory of Error-Correcting Codes, Amsterdam, The Netherlands: Holland, 1977, 7 pages (Table of Contents).
Marshall, "Coding of real-number sequences for error correction: A digital signal processing problem," IEEE J. Select. Areas Commun., Mar. 1984, 2:381-392.
Marzetta and Hochwald, "Capacity of a mobile multiple antenna communications link in Rayleigh lat fading," IEEE Trans. Inform. Theory, Oct. 1999, 45:139-157.
Mollin, Algebraic Number Theory, London, U.K.: Chapman and Hall, 1999. 5 pages (Table of Contents).
Muquet et al., "Cyclic prefixing or zero padding for Wireless multicarrier transmissions?," IEEE Transactions on Communications, 2002, 50(12):2136-2148.
Murnaghan, Lectures on Applied Mathematics: The Unitary and Rotation Groups,Washington, DC: Spartan Books, 1962, vol. III, 3 pages (Table of Contents).
N. Al-Dhahir and A.H. Sayed, "The Finite-Length Multi-Input Multi-Output MMSE-DFE," IEEE Trans. On Signal Processing, vol. 48, No. 10, pp. 1-38, Oct. 2000.
N. Al-Dhahir, "Single-Carrier Frequency-Domain Equalization for Space-Time Block-Coded Transmission over Frequency-Selective Fading Channels," IEEE Communications Letters, vol. 5, No. 7, pp. 304-306, Jul. 2001.
O. Rose, "Statistical Properties of MPEG Video Traffic and Their Impact on Traffic Modeling in ATM Network," TR-101, Institute of Computer Science, University of Wurzburg, Germany, Feb. 1995, pp. 1-25.
Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications High-speed Physical Layer in the 5 GHz Band, IEEE Std 802.11a-1999, 1999, 91 pages.
Proakis, Digital Communications, 3rd ed. New York, NY: McGraw-Hill, 1995, 10 pages (Table of Contents).
Proakis, Digital Communications, 4th ed. New York: McGraw-Hill, 2000, 9 pages (Table of Contents).
Q. Yan and R.S. Blum, "Robust Space-Time Block Coding for Rapid Fading Channels," IEEE Global Telecommunications Conference, vol. 1, pp. 460-464, San Antonio, TX, Nov. 25-29, 2001.
R. Hoshyar, S.H. Jamali, and A.R.S. Bahai, "Turbo Coding Performance in OFDM Packet Transmission," in Proc. IEEE VTC, Tockyo, Japan, 2000, vol. 2, pp. 805-810.
R. Rajaie, H. Yu, M. Handely, and D. Estrin, "Multimedia Proxy Caching Mechanism for Quality Adaptive Streaming Applications in the Internet," Technical report 99-709, Computer Science Department, USC.
R. Rajaie, M. Handely, and D. Estrin, "Quality Adaptation for Congestion Controlled Video Playback over the Internet," in Proc. of SIGCOMM'99, pp. 1-16.
Rainish, "Diversity Transform for Fading Channels", IEEE Trans. on Comm., Dec. 1996, pp. 1653-1661.
Rappaport, Wireless Communications: Principle and Practice, Englewood Cliffs, NJ: Prentice-Hall, 1996, 10 pages (Table of Contents).
Roth and Seroussi, "On generator matrices of MDS codes," IEEE Trans. Inform. Theory, Nov. 1985, vol. IT-31: 826-830.
S. Barbarossa and F. Cerquetti, "Simple Space-Time Coded SS-CDMA Systems Capable of Perfect MUI/ISI Elimination," IEEE Communications Letters, vol. 5, No. 12, pp. 471-473, Dec. 2001.
S. Benedetto, G. Montorsi, D. Divsalar, and F. Pollara, "A Soft-Input Soft-Output Maximum A Posterior (MAP) Module to Decode Parallel and Serial Concatenated Codes," TDA Progress Report, vol. 42-127, No. 15, 1996, downloadable from http://tmo.jpl.nasa.gov/tmo/progress—report/index.html.
S. Bhashyam, A.M. Sayeed, and B. Aazhang, "Time-Selective Signaling and Reception for Communication over Multipath Fading Channels," IEEE Trans. On Communications, vol. 48, No. 1, pp. 1-34, Jan. 2000.
S. Floyd, M. Handley, J. Padhye, and J. Widmer, "Equation-Based Congestion Control for Unicast Applications," in Proc. Of SIGCOMM'00.
S. Ohno and G.B. Giannakis, "Optimal Training and Redundant Precoding for Block Transmission With Application to Wireless OFDM," IEEE Transaction on Communications, vol. 50, No. 12, pp. 2113-2123, Dec. 2002.
S. Sen, J. Rexford, and D. Towsley, "Proxy Prefix Caching for Multimedia Streams," in Proc. of IEEE INFOCOM'99.
S. Zhou and G.B. Giannakis, "Optimal Transmitter Eigen-Beamforming and Space-Time Block Coding Based on Channel Correlations," IEEE Trans. Signal processing, vol. 50, No. 10, pp. 553-557, Oct. 2002.
S. Zhou and G.B. Giannakis, "Space-Timecoding With Maximum Diversity Gains Over Frequency-Selective Fading Channels," IEEE Signal Processing Letters, vol. 8, No. 10, pp. 369-272, Oct. 2001.
S. Zhou, B. Muquet, and G.B. Giannakis, "Subspace-Based (Semi-) Blind Channel Estimation for Block Precoded Space-Time OFDM," IEEE Transactions on Signal Processing, vol. 50, No. 5, pp. 1215-1228, May 2002.
S. Zhou, G.B. Giannakis, and C. Le Martret "Chip-Interleaved Block-Spread Code Division Multiple Access," IEEE Transactions On Communications, vol. 50, No. 2, pp. 235-248, Feb. 2002.
S. Zhou, Z. Wang, N. Bapat, G.B. Giannakis, "Turbo Decoding of Error Control Coded and Unitary Precoded OFDM", pp. 1237-1241, University of Minnesota.
S.A. Jafar, S. Vishwanath, and A. Goldsmith, "Channel Capacity and Beamforming for Multiple Transmit and Receive Antennas with Covariance Feedback," in Proc. of International Conference on Communications, vol. 7, Helsinki, Finland, Jun. 2001.
S.L. Ariyavistakul, "Turbo Space-Time Processing to Improve Wireless Channel Capacity," IEEE Trans. On Communications, vol. 48, No. 8, pp. 1347-1359, Aug. 2000.
Sandhu and Paulraj, "Space-time block codes: a capacity perspective," IEEE Commun. Lett., Dec. 2000, 4:384-386.
Sari and G. Karam, "Orthogonal frequency-division multiple access and its application to CATV network," Eur. Trans. Telecommun., Nov./Dec. 1998, 9: 507-516.
Saulnier and Medley, "Performance of a spread-spectrum OFDM system in a dispersive fading channel with interference," in Proc. MILCOM Conf., 1998, pp. 679-683.
Scaglione et al., "Filterbank Transceivers Optimizing Information Rate in Block Transmissions over Dispersive Channels", IEEE Trans. On Info. Theory, Apr. 1999, 45(3): 1019-1032.
Scaglione et al., "Linear precoding for estimation and equalization of frequency-selective channels," in Signal Processing Advances in Wireless and Mobile Communications, ed. Giannakis et al., Upper Saddle River, NJ: Prentice Hall, 2001, vol. 1, Chapter 9, 49 pages.
Seroussi and R. M. Roth, "On MDS extensions of generalized Reed Solomon codes;" IEEE Trans. Inform. Theory, May 1986, IT-32: 349-354.
Shiu, "Iterative Decoding for Layered Space-Time Codes", International Conf. On Communications, Jun. 2000, New Orleans, U.S.A., pp. 297-301.
Sidiropoulos et al., "Blind PARAFAC receivers for DS-CDMA Systems," IEEE Trans, Signal Processing, Mar. 2000, 48 (3):810-823.
Simon and Alouini, Digital Communications over Generalized Fading Channels: A Unified Approach to Performance Analysis, New York: Wiley, 2000, 9 pages (Table of Content).
Singleton, "Maximum distance q-nary codes," IEEE Trans. Inform. Theory, Apr. 1960, vol. IT-IO:116-118.
Smimov, Linear Algebra and Group Theory, New York, NY: McGraw-Hill, 1962, 6 pages (Table of Contents).
Steingrimsson et al., "Soft quasi-maximum-likelihood detection for multiple-antenna channels," Proc. Int. Conf. Communications, May 2003, Anchorage, AK, 4: 2330-2334.
Tarokh et al., "Combined array processing and space-time coding," IEEE Trans. on Infor. Theory, May 1999, pp. 1121-1128.
Tarokh, N. Seshadri and A. R. Calderbank, "Space.-Time Codes for High Data Rate Wireless Communication: Performance Criterion and Code Construction," IEEE Transactions on Information Theory, 1998, 44(2):744-765.
V. Tarokh, H. Jafarkhani, and A.R. Calderbank, "Space-Time Block Codes from Orthogonal Designs," IEEE Transactions on Information Theory, vol. 45, No. 5, pp. 1456-1467, Jul. 1999.
V.M. DaSilva and E. S. Sousa, "Fading-Resistant Modulation Using Several Transmitter Antennas," IEEE Transactions on Communications, vol. 45, No. 10, pp. 1236-1244, Oct. 1997.
van de Beek et al., "On channel estimation in OFDM systems," in Proc. Vehicular Technology Conf., Chicago, IL, Jul. 1995, 5 pages.
van der Geer, "Codes and elliptic curves," in Effective Methods in Algebraic Geometry, T. Mora and C. Traverso, Basel, Switzerland, Biridtcuser, 1991, 12 pages.
Verou, Multi-user Detection., Cambridge, U.K.: Cambridge University Press, 1998, 13 pages (Table of Contents).
Vitthaladevuni and Alouini, "BER computation of generalized QAM constellation," in Proc. GLOBECOM, San Antonio, TX, Nov. 2001, pp. 632-636.
W.W. Peterson et al., Error-Correcting Codes, Second Edition, MIT Press 1972, pp. 125, 129-131, 556.
W.-Y. Kuo and M.P. Fitz, "Design and Analysis of Transmitter Diversity Using Intentional Frequency Offset for Wireless Communications," IEEE Trans. On Vehicular Technology, vol. 46, No. 4, pp. 871-881, Nov. 1997.
Wang and Despins, "64-QAM OFDM With TCM Coding and Waveform Shaping In A Time-Selective Rician Facing Channel," in Proc. of Int'l Zurich Seminar on Broadband Comm., Berdun, Que., Canada, 2000, pp. 257-261.
Wang and G. B. Giannakis, "Outage Mutual information of Space-Time MIMO Channels," IEEE Trans. Infor. Theory, 2004, 50(4):657-662.
Wang et al, "Optimality of single-carrier zero-padded block transmissions," in Proc. Wireless Comm. and Networking Conf., 2002, Orlando, FL, pp. 660-664.
Washington, Introduction to Cyclotomic Fields, Graduate Texts in Math.83, Second edition, Springer-Verlag, 1997, 6 pages (Table of Contents).
Wei and Schlegel, "Synchronization requirements for multiuser OFDM on satellite mobile and two-path Rayleigh fading channels," IEEE Trans. Commun., Feb.-Apr. 1995, 43:887-895.
Wesel and Shi, "Trellis codes for periodic erasures," IEEE Trans. Commun., vol. 48, Jun. 2000, pp. 938-947.
Wolf, "Redundancy, the discrete Fourier transfonn, and impulse noise cancellation," IEEE Trans. Commun., Mar. 1983, COM-31:458-461.
Wolniansky et al., "V-BLAST: An architecture for realizing very high data rates over the rich-scattering wireless channel," Proc. of URSI International Symposium Signals, Systems, and Electronics, Italy, Sep. 1998, 6 pages.
X. Giraud, E. Boutillon, and J.C. Belfiore, "Algebraic Tools to Build Modulation Schemes for Fading Channels," IEEE Transactions on Information Theory, vol. 43, pp. 938-952, May 1997.
X. Ma and G.B. Giannakis, "Maximum-Diversity Transmissions Over Doubly Selective Wireless Channels," IEEE Transactions On Information Theory, vol. 49, No. 7, pp. 1832-1840, Jul. 2003.
X. Ma and G.B. Giannakis, "Maximum-Diversity Transmissions over Time-Selective Wireless Channels," Proc. of Wireless Communications and Networking Conf., Orlando, FL, Mar. 17-21, 2002, pp. 497-501.
X. Ma and G.B. Giannakis, "Space-Time Coding for Doubly-Selective Channels," Proc. Of Intl. Conf. On Circuits and Systems, Scottsdale, AZ, May 25-29, 2002, pp. III-647-III-650.
X. Ma, C. Tepedelenlioglu, G.B. Giannakis, and S. Barbarossa, "Non-Data-Aided Carrier Offset Estimators for OFDM With Null Subcarriers: Identifiability, Algorithms, and Performance," IEEE Journal on Selected Areas in Communications, vol. 19, No. 12, pp. 2504-2515, Dec. 2001.
X. Wang and H.V. Poor, "Iterative (Turbo) Soft Interface Cancellation and Decoding for Coded CDMA," IEEE Transactions on Communications, vol. 47, No. 7, pp. 1046-1061, Jul. 1999.
Xia and Xie, "A new coding scheme for ISI channels: Modulated codes," in Proc. Int. Conf. Communications, vol. 2, Vancouver, BC, Canada, 1999, pp. 828-832.
Xia et al., "Bandwidth- and Power-Efficient Multi-Carrier Multiple Access," IEEE Transactions on Communications, Nov. 2003, 51(11): 1828-1837.
Xin and Giannakis, "High-rate layered space-time transmissions based on constellation-rotation," in Proc. Wireless Communications and Networking Conf., Orlando, FL, Mar. 2002, pp. 471-476.
Xin and Giannakis, "High-Rate Space-Time Layered OFDM," IEEE Comm. Letters, May 2002, pp. 187-189.
Xin and Giannakis, "Space-Time Diversity Systems based on Linear Constellation Precoding," IEEE Transactions on Wireless Communications, Mar. 2003, 2(2):294-309.
Xin and Giannakis, "Space-Time Diversity Systems based on Unitary Constellation-Rotating Precoders," Proc. of Intl. Conf. on ASSP, May 2001, 4:2429-2432.
Xin et al., "Linear Unitary Precoders for Maximum Diversity Gains with Multiple Transmit and Receive Antennas," Proc. of 34th ASILOMAR Conf. on Signals, Systems, and Computers, published before the date of filing, pp. 1553-1557.
Y. Li, "Simplified Channel Estimation for OFDM Systems With Multiple Transmit Antennas," IEEE Transactions On Wireless Communications, vol. 1, No. 1, pp. 67-75, Jan. 2002.
Y. Liu, M. P. Fitz, and O. Y. Takeshita, "Space-Time Codes Performance Criteria and Design for Frequency Selective Fading Channels," Proc. Of International Conference on Comm., Helsinki, Finland, Jun. 11-15, 2001.
Y. Wang, Z.-L. Zhang, D. Du, and D. Su, "A Network-Conscious Approach to End-to-End Video Delivery Over Wide Area Networks Using Proxy Servers," in Proceedings of IEEE INFOCOM'98.
Y. Xin, Z. Wang, and G.B. Giannakis, "Space-Time Constellation-Rotating Codes Maximizing Diversity and Coding Gains," Proc. Of GLOBECOM, vol. 1, pp. 455-459 San Antonio, TX, Nov. 25-27, 2001.
Yan and Blum, "Optimum space-time convolutional coes," in Proc. IEEE Wireless Communications and Networking Conf., vol. 3, Chicago, IL, Sep. 2000, pp. 1351-1355.
Yee and Fettweis, "Multicarrier CDMA in indoor wireless radio networks," in Proc. IEEE PIMRC, Sep. 1993, pp. 109-113.
Z. Liu, Y. Xin, and G.B. Giannakis, "Linear Constellation Precoding for OFDMW With Maximum Multipath Diversity and Coding Gains," IEEE Transactions On Communications, vol. 51, No. 3, pp. 416-427, Mar. 2003.
Z. Liu, Y. Xin, and G.B. Giannakis, "Space-Time-Frequency Block Coded OFDM with Subcarrier Grouping and Constellation Precoding," Proc. Of Intl. Conf. on ASSP, Orlando, FL, May 13-17, 2003, pp. III-2205-III-208.
Z. Liu, Y. Xin, and G.B. Giannakis, "Space-Time-Frequency Coded OFDM Over Frequency-Selective Fading Channels," IEEE Transactions on Signal Processing, vol. 50, No. 10, pp. 2465-2476, Oct. 2002.
Z. Liu, Y. Xin, and G.B. Giannakis, "Space-Time-Frequency Trellis Coding for Frequency-Selective Fading Channels", pp. 145-149, 2002.
Z. Wang and G.B. Giannakis, "Complex-Field Coding for OFDM Over Fading Wireless Channels" IEEE Transactions on Information Theory, vol. 49, No. 3, pp. 707-720, Mar. 2003.
Z. Wang and G.B. Giannakis, "Linearly Precoded or Coded OFDM against Wireless Channel Fades?" in Third IEEE Signal Processing Workshop on Signal Processing Advances in Wireless Communication, Taoyuan, Taiwan, Mar. 20-23, 2001.
Z. Wang and G.B. Giannakis, "Wireless Multicarrier Communications: Where Fourier Meets Shannon," IEEE Signal Processing Magazine, vol. 17, No. 3, pp. 29-48, May 2000.
Z. Wang, S. Zhou, and G.B. Giannakis, "Joint Coding-Precoding with Low Complexity Turbo-Decoding," IEEE Transactions on Wireless Communications, vol. XXX, No. XXX, pp. 1-11, Month 2003; also in Proc. Of the European Wireless Conference, Florence, Italy, Feb. 25-28.
Z.-L. Zhang, S. Nelakuditi, R. Aggarwal, and R. Tsang, "Efficient Selective Frame Discard Algorithms for Stored Video Delivery across Resource Constrained Networks," in Proc. of IEEE INFOCOM'99, pp. 1-26.
Zheng and Tse, "Optimal diversity-multiplexing tradeoff in multi-antenna channels," Proc. of the 39th Allerton Conference on Communication, Control and Computing, Monticello, IL, Oct. 2001, pp. 835-844.
Zhengdao Wang ; Giannakis, G.B.; "Linearly Precoded or Coded OFDM against Wireless Channel Fades?," 2001 IEEE Third Workshop on Signal Processing Advances inWireless Communications, 2001. (SPAWC '01), 2001 , pp. 267-270 (Mar. 20-23, 2001). *
Zhou et al,, "Frequency-hopped generalized MC-CDMA for multipath and interference suppression," in Proc. MILCOM Conf., vol. 2, Los Angeles, CA, Oct. 22-25, 2000, pp. 937-941.
Zou and Wu, "COFDM: an overview," IEEE Trans. Broadcast., Mar. 1995, vol. 41:1-8.
Zur Decodierung algebraischer Blockcodes über komplexen Alphabeten, Ph.D. dissertation, VDI-Verlag, Düsseldorf, Germany, 1989, 12 pages.

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10700800B2 (en) 2003-05-21 2020-06-30 Regents Of The University Of Minnesota Estimating frequency-offsets and multi-antenna channels in MIMO OFDM systems
US11303377B2 (en) 2003-05-21 2022-04-12 Regents Of The University Of Minnesota Estimating frequency-offsets and multi-antenna channels in MIMO OFDM systems
US20140115417A1 (en) * 2012-10-19 2014-04-24 Eutelsat Sa Encoding method for quasi-periodic fading channel
US20160006586A1 (en) * 2013-02-12 2016-01-07 Nokia Solutions And Networks Oy Zero insertion for isi free ofdm reception
US9544171B2 (en) * 2013-02-12 2017-01-10 Nokia Solutions And Networks Oy Zero insertion for ISI free OFDM reception
US20140369434A1 (en) * 2013-06-17 2014-12-18 Futurewei Technologies, Inc. System and Method for Designing and Using Multidimensional Constellations
US9509379B2 (en) * 2013-06-17 2016-11-29 Huawei Technologies Co., Ltd. System and method for designing and using multidimensional constellations
US10320456B2 (en) 2013-06-17 2019-06-11 Huawei Technologies Co., Ltd. System and method for designing and using multidimensional constellations
US10523383B2 (en) 2014-08-15 2019-12-31 Huawei Technologies Co., Ltd. System and method for generating waveforms and utilization thereof
US9608846B2 (en) * 2015-01-30 2017-03-28 Huawei Technologies Co., Ltd. Apparatus and method for transmitting data with conditional zero padding
US10243763B2 (en) 2015-01-30 2019-03-26 Huawei Technologies Co., Ltd. Apparatus and method for transmitting data with conditional zero padding
US10356788B2 (en) 2015-10-30 2019-07-16 Huawei Technologies Co., Ltd. System and method for high-rate sparse code multiple access in downlink

Also Published As

Publication number Publication date
US7292647B1 (en) 2007-11-06
US20070253496A1 (en) 2007-11-01

Similar Documents

Publication Publication Date Title
USRE45230E1 (en) Wireless communication system having linear encoder
Wang et al. Complex-field coding for OFDM over fading wireless channels
Zhou et al. Single-carrier space-time block-coded transmissions over frequency-selective fading channels
US7251768B2 (en) Wireless communication system having error-control coder and linear precoder
EP1393486B1 (en) Space-time coded transmissions within a wireless communication network
Colavolpe et al. SISO detection over linear channels with linear complexity in the number of interferers
Wang et al. A Walsh-Hadamard coded spectral efficient full frequency diversity OFDM system
Han et al. Constellation-rotated vector OFDM and its performance analysis over Rayleigh fading channels
US9660709B1 (en) Systems and methods for calculating log-likelihood ratios in a MIMO detector
US7974358B2 (en) Orthogonal frequency division multiplexing (OFDM) encoding and decoding methods and systems
Haring et al. Coding and signal space diversity for a class of fading and impulsive noise channels
Blakit et al. Performance analysis of QOSTBC-OFDM system based on FEC codes
Wolfgang et al. Iterative MIMO detection for rank-deficient systems
Assimi et al. Phase-precoding without CSI for packet retransmissions over frequency-selective channels
Abderrahmane et al. Diversity Techniques to combat fading in WiMAX
Wakeel Peak-to-Average Ratio Reduction for MIMO and Multi-user OFDM Systems
Alamri et al. A Differential Turbo Detection Aided Sphere Packing Modulaled Space-Time Coding Scheme
McCloud Coded block OFDM for the frequency selective fading channel
Syed et al. LDPC-based space–time coded OFDM systems with channel estimation
Zhang et al. Full diversity blind signal designs for unique identification of frequency selective channels
Krishnan et al. Survey on throughput enhancement techniques for real-time wireless link deployment
Ogundile et al. Iterative channel estimation and symbol level reed-solomon decoding receivers for ofdm systems
Chtourou et al. Efficient doubly-iterative frequency domain turbo-equalization for single-carrier transmission over MIMO ISI channel
Chtourou et al. Low complexity frequency-domain turbo-equalizer for st-bicm over mimo isi channel
Pramanik et al. Performance comparison of orthogonal complex MIMO STBC with ML decoding and soft decision decoding

Legal Events

Date Code Title Description
AS Assignment

Owner name: NATIONAL SCIENCE FOUNDATION, VIRGINIA

Free format text: CONFIRMATORY LICENSE;ASSIGNOR:UNIVERSITY OF MINNESOTA;REEL/FRAME:030984/0935

Effective date: 20130425

AS Assignment

Owner name: REGENTS OF THE UNIVERSITY OF MINNESOTA, MINNESOTA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:GIANNAKIS, GEORGIOS B.;XIN, YAN;WANG, ZHENGDAO;SIGNING DATES FROM 20030902 TO 20130904;REEL/FRAME:032882/0438

AS Assignment

Owner name: NATIONAL SCIENCE FOUNDATION, VIRGINIA

Free format text: CONFIRMATORY LICENSE;ASSIGNOR:UNIVERSITY OF MINNESOTA;REEL/FRAME:034718/0707

Effective date: 20130425

CC Certificate of correction
FPAY Fee payment

Year of fee payment: 8

IPR Aia trial proceeding filed before the patent and appeal board: inter partes review

Free format text: TRIAL NO: IPR2017-01219

Opponent name: ERICSSON INC. AND TELEFONAKTIEBOLAGET LM ERICSSON

Effective date: 20170330

IPR Aia trial proceeding filed before the patent and appeal board: inter partes review

Free format text: TRIAL NO: IPR2017-01214

Opponent name: ERICSSON INC. ANDTELEFONAKTIEBOLAGET LM ERICSSON

Effective date: 20170330

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YR, SMALL ENTITY (ORIGINAL EVENT CODE: M2553); ENTITY STATUS OF PATENT OWNER: SMALL ENTITY

Year of fee payment: 12

AS Assignment

Owner name: REGENTS OF THE UNIVERSITY OF MINNESTOA, MINNESOTA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:ZHOU, SHENGLI;REEL/FRAME:060325/0089

Effective date: 20220615