Open-loop diversity technique for systems employing four transmitter antennas

US 7,050,510 B2
Filed: 12/29/2000
Issued: 05/23/2006
Est. Priority Date: 12/29/2000
Status: Expired due to Term

First Claim

Patent Images

1. A method for use in a transmitter adapted to employ four transmit elements to transmit a source bit stream, the method comprising the steps of:

dividing said source bit stream into L data substreams, L>

2; and

grouping derivatives of symbols derived from each of said data substreams to form four transmit time sequences, one sequence for each transmit element, said derivatives of said symbols are members of the group consisting of;

a negative of one of said symbols, a negative of a complex conjugate of one of said symbols, one of said symbols, a symbol developed by encoding at least one sample of at least one of said data substreams, and an unencoded sample of at least one of said data substreams;

whereineach of said time sequences spans L symbol periods and includes at least one derivative of at least one symbol from each of said L data substreams; and

at least one of said derivatives of said symbols is a complex conjugate of one of said symbols.

View all claims

4 Assignments

Timeline View

Assignment View

0 Petitions

Accused Products

Abstract

When using four transmit antennas, conventional channel coding is employed for a decoupled space-time coding approach for each of a number, L, of data substreams derived from the overall source bit stream. The symbols of the data substreams, after any encoding, are processed and the resulting derivatives of the encoded data substreams, which includes at least the complex conjugate of one of the encoded symbols, are grouped to form four transmit time sequences each one spanning L symbol periods which form a transmission matrix B. Each row of the matrix corresponds to an antenna, and the elements of each row represent the samples of a temporal sequence that is emitted by the antenna in L symbol periods. When L=4 the matrix B can be arranged as follows:

$T_{1} T_{2} T_{3} {T_{4}}_{}$ $\begin{matrix} Antenna 1 \\ Antenna 2 \\ Antenna 3 \\ Antenna 4 \end{matrix} [\begin{matrix} b_{1} & b_{2}^{*} & b_{3} & b_{4}^{*} \\ b_{2} & - b_{1}^{*} & - b_{4} & b_{3}^{*} \\ b_{3} & b_{4}^{*} & - b_{1} & - b_{2}^{*} \\ b_{4} & - b_{3}^{*} & b_{2} & - b_{1}^{*} \end{matrix}]$
where b₁, b₂, b₃, and b₄are the encoded symbols from the data substreams and * indicates complex conjugate.

61 Citations

View as Search Results

57 Claims

1. A method for use in a transmitter adapted to employ four transmit elements to transmit a source bit stream, the method comprising the steps of:
- dividing said source bit stream into L data substreams, L>
  
  2; and
  
  grouping derivatives of symbols derived from each of said data substreams to form four transmit time sequences, one sequence for each transmit element, said derivatives of said symbols are members of the group consisting of;
  
  a negative of one of said symbols, a negative of a complex conjugate of one of said symbols, one of said symbols, a symbol developed by encoding at least one sample of at least one of said data substreams, and an unencoded sample of at least one of said data substreams;
  
  whereineach of said time sequences spans L symbol periods and includes at least one derivative of at least one symbol from each of said L data substreams; and
  
  at least one of said derivatives of said symbols is a complex conjugate of one of said symbols.
- View Dependent Claims (2, 3, 4, 5, 6, 7)
- - 2. The invention as defined in claim 1 wherein L=4 and said time sequences are arranged according to a matrix, each time sequence being a row of said matrix and being transmitted by a respective one of said transmit elements, said matrix being arranged as one of the matrices of the set of matrices consisting of $[\begin{matrix} b_{1} & b_{2}^{*} & b_{3} & b_{4}^{*} \\ b_{2} & - b_{1}^{*} & - b_{4} & b_{3}^{*} \\ b_{3} & b_{4}^{*} & - b_{1} & - b_{2}^{*} \\ b_{4} & - b_{3}^{*} & b_{2} & - b_{1}^{*} \end{matrix}], [\begin{matrix} b_{1} & b_{2}^{*} & b_{3} & b_{4}^{*} \\ - b_{2} & b_{1}^{*} & b_{4} & - b_{3}^{*} \\ b_{3} & b_{4}^{*} & - b_{1} & - b_{2}^{*} \\ - b_{4} & b_{3}^{*} & - b_{2} & b_{1}^{*} \end{matrix}],$
    - [ b 1 - b 2 b 3 - b 4 b 2 * b 1 * b 4 * b 3 * b 3 b 4 - b 1 - b 2 b 4 * - b 3 * - b 2 * b 1 * ] , and ⁢
      
      [ b 1 b 2 b 3 b 4 b 2 * - b 1 * b 4 * - b 3 * b 3 - b 4 - b 1 b 2 b 4 * b 3 * - b 2 * - b 1 * ] where;
      
      b₁, b₂, b₃, and b₄are said symbol derivatives from data substreams 1, 2, 3 and 4, respectively, and* indicates complex conjugate.
  - 3. The invention as defined in claim 1 wherein at least one of said groups of derivatives of said symbols includes derivatives of symbols from more than one of said data substreams.
  - 4. The invention as defined in claim 1 further comprising the step of repeating said dividing and grouping steps.
  - 5. The invention as defined in claim 1 wherein each row of said matrix represents what is transmitted by a respective one of said transmit elements.
  - 6. The invention as defined in claim 1 wherein at least one of said transmit elements is an antenna.
  - 7. The invention as defined in claim 1 wherein L=4 and said time sequences are spread and arranged according to a matrix, each spread time sequence being a row of said matrix and being transmitted by a respective one of said transmit elements, said matrix being arranged as follows:
    - $[\begin{matrix} b_{1} {\overline{c}}_{1} & b_{2}^{*} {\overline{c}}_{2} & b_{3} {\overline{c}}_{3} & b_{4}^{*} {\overline{c}}_{4} \\ b_{2} {\overline{c}}_{1} & - b_{1}^{*} {\overline{c}}_{2} & - b_{4} {\overline{c}}_{3} & b_{3}^{*} {\overline{c}}_{4} \\ b_{3} {\overline{c}}_{1} & b_{4}^{*} {\overline{c}}_{2} & - b_{1} {\overline{c}}_{3} & - b_{2}^{*} {\overline{c}}_{4} \\ b_{4} {\overline{c}}_{1} & - b_{3}^{*} {\overline{c}}_{2} & b_{2} {\overline{c}}_{3} & - b_{1}^{*} {\overline{c}}_{4} \end{matrix}]$ where;
      
      b₁, b₂, b₃, and b₄are said symbol derivatives from data substreams 1, 2, 3, and 4, respectively;
      
      * indicates complex conjugate; and
      
      {overscore (c)}_l, l=1 . . . , L are each horizontal vectors of a spreading code, each of said horizontal vectors spans 1 symbol period and contains N chips, where N is the spreading gain.

8. A transmitter adapted for use with four transmit elements to transmit a source bit stream, comprising:
- means for dividing said source bit stream into L data substreams, L>
  
  2;
  
  means grouping derivatives of symbols derived from each of said data substreams to form four transmit time sequences, said derivatives of said symbols are members of the group consisting of;
  
  a negative of one of said symbols, a negative of a complex conjugate of one of said symbols, one of said symbols, a symbol developed by encoding at least one sample of at least one of said data substreams, and an unencoded sample of at least one of said data substreams; and
  
  means for grouping said time sequences into a matrix, each time sequence being a row of said matrix;
  
  whereineach of said time sequences spans L symbol periods, and includes at least one derivative of at least one symbol from each of said L data substreams; and
  
  at least one of said derivatives of said symbols is a complex conjugate of one of said symbols.
- View Dependent Claims (9, 10, 11, 12, 13)
- - 9. The invention as defined in claim 8 further comprising L means for encoding each of said data substreams prior to symbols of said data substreams being grouped by said means for grouping, so that said encoded data substreams are grouped by said means for grouping.
  - 10. The invention as defined in claim 8 wherein L=4 and said time sequences are arranged according to a matrix, each time sequence being a row of said matrix and being transmitted by a respective one of said transmit elements, said matrix being arranged as one of the matrices of the set of matrices consisting of $[\begin{matrix} b_{1} & b_{2}^{*} & b_{3} & b_{4}^{*} \\ b_{2} & - b_{1}^{*} & - b_{4} & b_{3}^{*} \\ b_{3} & b_{4}^{*} & - b_{1} & - b_{2}^{*} \\ b_{4} & - b_{3}^{*} & b_{2} & - b_{1}^{*} \end{matrix}], [\begin{matrix} b_{1} & b_{2}^{*} & b_{3} & b_{4}^{*} \\ - b_{2} & b_{1}^{*} & b_{4} & - b_{3}^{*} \\ b_{3} & b_{4}^{*} & - b_{1} & - b_{2}^{*} \\ - b_{4} & b_{3}^{*} & - b_{2} & b_{1}^{*} \end{matrix}],$
    - [ b 1 - b 2 b 3 - b 4 b 2 * b 1 * b 4 * b 3 * b 3 b 4 - b 1 - b 2 b 4 * - b 3 * - b 2 * b 1 * ] , and ⁢
      
      [ b 1 b 2 b 3 b 4 b 2 * - b 1 * b 4 * - b 3 * b 3 - b 4 - b 1 b 2 b 4 * b 3 * - b 2 * - b 1 * ] where;
      
      b₁, b₂, b₃, and b₄are said symbol derivatives from data substreams 1, 2, 3, and 4, respectively, and* indicates complex conjugate.
  - 11. The invention as defined in claim 8 wherein L=4 and said time sequences are spread and arranged according to a matrix, each spread time sequence being a row of said matrix and being transmitted by a respective one of said transmit elements, said matrix being arranged as follows:
    - $[\begin{matrix} b_{1} {\overline{c}}_{1} & b_{2}^{*} {\overline{c}}_{2} & b_{3} {\overline{c}}_{3} & b_{4}^{*} {\overline{c}}_{4} \\ b_{2} {\overline{c}}_{1} & - b_{1}^{*} {\overline{c}}_{2} & - b_{4} {\overline{c}}_{3} & b_{3}^{*} {\overline{c}}_{4} \\ b_{3} {\overline{c}}_{1} & b_{4}^{*} {\overline{c}}_{2} & - b_{1} {\overline{c}}_{3} & - b_{2}^{*} {\overline{c}}_{4} \\ b_{4} {\overline{c}}_{1} & - b_{3}^{*} {\overline{c}}_{2} & b_{2} {\overline{c}}_{3} & - b_{1}^{*} {\overline{c}}_{4} \end{matrix}]$ where;
      
      b₁, b₂, b₃, and b₄are said symbol derivatives from data substreams 1, 2, 3, and 4, respectively;
      
      * indicates complex conjugate; and
      
      {overscore (c)}_l, l=1 . . . , L are each horizontal vectors of a spreading code, each of said horizontal vectors spans 1 symbol period and contains N chips, where N is the spreading gain.
  - 12. The invention as defined in claim 8 wherein each row of said matrix represents what is transmitted by a respective one of said transmit elements.
  - 13. The invention as defined in claim 8 wherein at least one of said transmit elements is an antenna.

14. A transmitter for use with four transmit elements for transmitting a source bit stream, comprising:
- a demultiplexer that divides said source bit stream into L data substreams, L>
  
  2; and
  
  a space time multiplexer that groups derivatives of symbols derived from of each of said data sub streams to form four transmit time sequences, each of said time sequences;
  
  whereinsaid derivatives of said symbols are one of the group consisting of;
  
  a negative of one of said symbols, a negative of a complex conjugate of one of said symbols, one of said symbols, a symbol developed by encoding at least one sample of at least one of said data substreams, and an unencoded sample of at least one of said data substreams;
  
  each of said time sequences spans L symbol periods, at least one of said derivatives of said symbols is a complex conjugate of one of said symbols; and
  
  said time sequences groups are arranged as a matrix, in which each time sequence is a row of said matrix.
- View Dependent Claims (15, 16, 17, 18, 19, 20, 21)
- - 15. The invention as defined in claim 14 further comprising a plurality of radio frequency, each of which converts a respective one of said time sequences groups which it receives as an input from baseband to a radio frequency modulated signal.
  - 16. The invention as defined in claim 14 further comprising at least one encoder interposed between said demultiplexer and said space time multiplexer.
  - 17. The invention as defined in claim 14 wherein said space time multiplexer applies a spreading code to said symbols.
  - 18. The invention as defined in claim 14 wherein each row of said matrix represents what is transmitted by a respective one of said transmit elements.
  - 19. The invention as defined in claim 14 wherein at least one of said transmit elements is an antenna.
  - 20. The invention as defined in claim 14 wherein L=4 and said time sequences are arranged according to a matrix, each time sequence being a row of said matrix and being transmitted by a respective one of said transmit elements, said matrix being arranged as one of the matrices of the set of matrices consisting of $[\begin{matrix} b_{1} & b_{2}^{*} & b_{3} & b_{4}^{*} \\ b_{2} & - b_{1}^{*} & - b_{4} & b_{3}^{*} \\ b_{3} & b_{4}^{*} & - b_{1} & - b_{2}^{*} \\ b_{4} & - b_{3}^{*} & b_{2} & - b_{1}^{*} \end{matrix}], [\begin{matrix} b_{1} & b_{2}^{*} & b_{3} & b_{4}^{*} \\ - b_{2} & b_{1}^{*} & b_{4} & - b_{3}^{*} \\ b_{3} & b_{4}^{*} & - b_{1} & - b_{2}^{*} \\ - b_{4} & b_{3}^{*} & - b_{2} & b_{1}^{*} \end{matrix}],$
    - [ b 1 - b 2 b 3 - b 4 b 2 * b 1 * b 4 * b 3 * b 3 b 4 - b 1 - b 2 b 4 * - b 3 * - b 2 * b 1 * ] , and ⁢
      
      [ b 1 b 2 b 3 b 4 b 2 * - b 1 * b 4 * - b 3 * b 3 - b 4 - b 1 b 2 b 4 * b 3 * - b 2 * - b 1 * ] where;
      
      b₁, b₂, b₃, and b₄are said symbol derivatives from data substreams 1, 2, 3, and 4, respectively, and* indicates complex conjugate.
  - 21. The invention as defined in claim 14 wherein L=4 and said time sequences are spread and arranged according to a matrix, each spread time sequence being a row of said matrix and being transmitted by a respective one of said transmit elements, said matrix being arranged as follows:
    - $[\begin{matrix} b_{1} {\overline{c}}_{1} & b_{2}^{*} {\overline{c}}_{2} & b_{3} {\overline{c}}_{3} & b_{4}^{*} {\overline{c}}_{4} \\ b_{2} {\overline{c}}_{1} & - b_{1}^{*} {\overline{c}}_{2} & - b_{4} {\overline{c}}_{3} & b_{3}^{*} {\overline{c}}_{4} \\ b_{3} {\overline{c}}_{1} & b_{4}^{*} {\overline{c}}_{2} & - b_{1} {\overline{c}}_{3} & - b_{2}^{*} {\overline{c}}_{4} \\ b_{4} {\overline{c}}_{1} & - b_{3}^{*} {\overline{c}}_{2} & b_{2} {\overline{c}}_{3} & - b_{1}^{*} {\overline{c}}_{4} \end{matrix}]$ where;
      
      b₁, b₂, b₃, and b₄are said symbol derivatives from data substreams 1, 2, 3, and 4, respectively;
      
      * indicates complex conjugate; and
      
      {overscore (c)}_l, l=1 . . . , L are each horizontal vectors of a spreading code, each of said horizontal vectors spans 1 symbol period and contains N chips, where N is the spreading gain.

22. A transmitter adapted for use with four transmit elements to transmit a source bit stream, comprising:
- a demultiplexer that divides said source bit stream into L data substreams, L>
  
  2;
  
  L encoders, each of said encoders receiving and encoding one of said data substreams to produce encoded symbols;
  
  a space time multiplexer that groups derivatives of said encoded symbols derived from each of said data substreams to form four transmit time sequences;
  
  whereinsaid derivatives of said symbols are members of the group consisting of;
  
  a negative of one of said symbols, a negative of a complex conjugate of one of said symbols, one of said symbols, a symbol developed by encoding at least one sample of at least one of said data substreams, and an unencoded sample of at least one of said data substreams;
  
  each of said time sequences respectively spans L symbol periods and includes at least one derivative of at least one symbol from each of said L data substreams, at least one of said derivatives of said symbols being a complex conjugate of one of said symbols; and
  
  said time sequences groups are arranged as a matrix, in which each time sequence is a row of said matrix.
- View Dependent Claims (23, 24, 25, 26, 27)
- - 23. The invention as defined in claim 22 wherein L=4 and said time sequences are arranged according to a matrix, each time sequence being a row of said matrix and being transmitted by a respective one of said transmit elements, said matrix being arranged as follows:
    - $[\begin{matrix} b_{1} & b_{2}^{*} & b_{3} & b_{4}^{*} \\ b_{2} & - b_{1}^{*} & - b_{4} & b_{3}^{*} \\ b_{3} & b_{4}^{*} & - b_{1} & - b_{2}^{*} \\ b_{4} & - b_{3}^{*} & b_{2} & - b_{1}^{*} \end{matrix}]$ where;
      
      b₁, b₂, b₃, and b₄are said symbol derivatives from data substreams 1, 2, 3, and 4, respectively, and* indicates complex conjugate.
  - 24. The invention as defined in claim 22 further comprising a plurality of radio frequency, each of which converts a respective one of said time sequences groups which it receives as an input from baseband to a radio frequency modulated signal.
  - 25. The invention as defined in claim 22 wherein said space time multiplexer applies a spreading code to said symbols.
  - 26. The invention as defined in claim 22 wherein each row of said matrix represents what is transmitted by a respective one of said transmit elements.
  - 27. The invention as defined in claim 22 wherein at least one of said transmit elements is an antenna.

28. A method for use in processing received signals that were transmitted via four transmit elements of a transmitter, said transmitter being adapted to transmit a source bit stream by dividing said source bit stream into L data substreams, L>
- 2 and grouping derivatives of symbols derived from each of said data substreams to form four transmit time sequences, one sequence for each transmit element, said derivatives of said symbols are members of the group consisting of;
  
  a negative of one of said symbols, a negative of a complex conjugate of one of said symbols, one of said symbols, a symbol developed by encoding at least one sample of at least one of said data substreams, an unencoded sample of at least one of said data substreams;
  
  each of said time sequences spanning L symbol periods and including at least one derivative of at least one symbol from each of said L data substreams, at least one of said derivatives of said symbols being a complex conjugate of one of said symbols, said method comprising the step of;
  
  developing, from a received signal including versions of said time sequences which have been combined by the channel between said transmit elements and said receiver, reconstructed versions of said symbols derived from each of said data substreams.
- View Dependent Claims (29, 30, 31, 32, 33, 34, 35, 36, 37, 38)
- - 29. The invention as defined in claim 28 wherein said developing step further comprises the step of developing reconstructed versions of said groups of derivatives of said symbols.
  - 30. The invention as defined in claim 28 further comprising the step of developing reconstructed versions of said L data substreams from said reconstructed versions of said symbols.
  - 31. The invention as defined in claim 28 further comprising the step of multiplexing reconstructed versions of said L data substreams to form a data version of said source bit stream.
  - 32. The invention as defined in claim 28 further comprising the step of developing reconstructed versions of said L data substreams from said reconstructed versions of said symbols by decoding said reconstructed versions of said symbols to produce samples of said reconstructed versions of said L data substreams.
  - 33. The invention as defined in claim 28 wherein said developing step further comprises the step of despreading said received versions of said time sequences.
  - 34. The invention as defined in claim 28 wherein said developing step further comprises the step of subsampling said received versions of said time sequences.
  - 35. The invention as defined in claim 28 wherein said developing step further comprises the step of match filtering derivatives of said received versions of said time sequences.
  - 36. The invention as defined in claim 28 wherein said developing step further comprises the step of decorrelating said received versions of said time sequences.
  - 37. The invention as defined in claim 28 wherein said developing step further comprises performing minimum mean squared error processing.
  - 38. The invention as defined in claim 28 further comprising the steps of:
    - developing, from a second received signal including versions of said time sequences which have been combined by the channel between said transmit elements and said receiver, second reconstructed versions of said symbols derived from each of said data substreams; and
      
      combining said reconstructed versions and said second reconstructed versions to produce final versions of said symbols.

39. Apparatus for use in processing received signals that were transmitted via four transmit elements of a transmitter, said transmitter being adapted to transmit a source bit stream by dividing said source bit stream into L data substreams, L>
- 2 and grouping derivatives of symbols derived from each of said data substreams to form four transmit time sequences, one sequence for each transmit element, each of said time sequences spanning L symbol periods, at least one of said derivatives of said symbols being a complex conjugate of one of said symbols, said apparatus comprising;
  
  a matrix multiplier for supplying as an output matched filtered signals which are versions of preprocessed signals derived from a received signal which includes versions of said time sequences which have been combined by the channel between said transmit elements and said receiver; and
  
  a baseband signal processing unit receiving said matched filtered signals as an input and developing therefrom reconstructed versions of said symbols derived from each of said data substreams.
- View Dependent Claims (40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57)
- - 40. The invention as defined in claim 39 wherein said receiver is a minimum mean square error receiver.
  - 41. The invention as defined in claim 39 wherein said matrix multiplier multiplies from the left an L by 1 vertical vector d formed by versions of said preprocessed signals derived from said received signal by a matrix H^†
    - to produce a new L by 1 vertical vector f so that f=H^†d where †
      
      denotes complex conjugate.
  - 42. The invention as defined in claim 41 wherein L−
    - 4, and H is the following matrix $[\begin{matrix} h_{1} & h_{2} & h_{3} & h_{4} \\ - h_{2}^{*} & h_{1}^{*} & - h_{4}^{*} & h_{3}^{*} \\ - h_{3} & h_{4} & h_{1} & - h_{2} \\ - h_{4}^{*} & - h_{3}^{*} & h_{2}^{*} & h_{1}^{*} \end{matrix}]$ where h_iis the complex channel coefficient from the i^thtransmit element to said receiver and all channels are flat faded channels.
  - 43. The invention as defined in claim 41 wherein at least one element of said vertical vector d is formed by versions of said preprocessed signals derived from said received signal that has had the complex conjugate of at least one element thereof substituted for said element.
  - 44. The invention as defined in claim 39 wherein said baseband signal processing unit multiplies a specified matrix W from the left by a vertical vector f made up of said matched filtered outputs supplied by said matrix multiplier to produce a new L by 1 vertical vector r, so that r−
    - Wf.
  - 45. The invention as defined in claim 44 wherein matrix W=K⁻
    - 1, where K=H^†H.
  - 46. The invention as defined in claim 45 wherein L=4 and said matrix multiplication is performed in two portions, the first portion using the first and third element of vertical vector f and the second portion using the fourth and second element of vertical vector f, specifically in that order and in which a 2×
    - 2 matrix employed for the multiplication from the left for both portions is developed by deriving 2×
      
      2 matrix K′
      
      through deleting the second and fourth rows and columns of 4×
      
      4 matrix K where K=H^†H and 2×
      
      2 matrix W′
      
      =K′
      
      ^−
      
      1.
  - 47. The invention as defined in claim 44 wherein matrix W=K^†
    - (K K†
      
      +λ
      
      K)^−
      
      1, where λ
      
      is a real scalar.
  - 48. The invention as defined in claim 47 wherein λ
    - is equal to σ
      
      _n²/σ
      
      _h²where σ
      
      _n²is the channel noise variance and σ
      
      _h²is the variance of each symbol b_i, where i=1 . . . L.
  - 49. The invention as defined in claim 47 wherein L=4 and said matrix multiplication is performed in two portions, the first portion using the first and third element of vertical vector f and the second portion using the fourth and second element of vertical vector f, specifically in that order and in which a 2×
    - 2 matrix employed for the multiplication from the left for both portions is developed by deriving 2×
      
      2 matrix K′
      
      through deleting the second and fourth rows and columns of 4×
      
      4 matrix K where K=H^†H and 2×
      
      2 matrix W′
      
      =K′
      
      ^†(K′
      
      K′
      
      ^†+λ
      
      K′
      
      )^−
      
      1.
  - 50. The invention as defined in claim 39 further comprising L despreaders for developing said versions of said preprocessed signals from said received signal.
  - 51. The invention as defined in claim 39 further comprising a demultiplexer for developing said versions of said preprocessed signals from said received signal.
  - 52. The invention as defined in claim 39 further comprising a selective conjugator for developing said versions of said preprocessed signals derived from said received signal by conjugating at least one element of despread versions of said preprocessed signals derived from said received signal.
  - 53. The invention as defined in claim 39 further comprising a selective conjugator for developing said versions of said preprocessed signals derived from said received signal by conjugating at least one element of subsampled versions of said preprocessed signals derived from said received signal.
  - 54. The invention as defined in claim 39 further comprising L decoders, each of said decoders receiving as an input reconstructed versions of said symbols derived from a respective one of said data substreams and developing therefrom a reconstructed version of said one of said data substreams.
  - 55. The invention as defined in claim 39 further comprising L decoders, each of said decoders receiving as an input reconstructed versions of said symbols derived from a respective one of said data substreams and developing therefrom a reconstructed version of said one of said data substreams.
  - 56. The invention as defined in claim 55 further comprising a multiplexer which receives each reconstructed version of said data substreams from said decoders and develops therefrom a reconstructed version of said source bit stream.
  - 57. The invention as defined in claim 39 further comprising:
    - a second matrix multiplier for supplying as an output second matched filtered signals which are second versions of preprocessed signals derived from a second received signal which includes versions of said time sequences which have been combined by a second channel between said transmit elements and said receiver; and
      
      a second baseband signal processing unit receiving said second matched filtered signals as an input and developing therefrom second reconstructed versions of said symbols derived from each of said data substreams; and
      
      a combiner for combining said reconstructed versions of said symbols and said second reconstructed versions of said symbols.

Specification

Resources

Litigation Campaign Assessment

Current Assignee
Alcatel-Lucent USA, Inc. (Nokia Corporation)
Original Assignee
Lucent Technologies, Inc. (Nokia Corporation)
Inventors
Foschini, Gerard J, Papadias, Constantinos B.
Primary Examiner(s)
Bocure, Tesfaldet

Application Number

US09/752,637
Publication Number

US 20020118770A1
Time in Patent Office

1,971 Days
Field of Search

375/267, 375/299, 375/347, 375/295, 375/316, 375/130, 375/141, 375/144, 375/143, 375/146, 375/340, 375/262, 375/341, 375/152, 375/147, 375/148, 455/101, 455/39, 455/132, 455/137, 370/208, 370/335, 370/342, 370/441, 370/203
US Class Current

375/299
CPC Class Codes

H04L 1/0065   Serial concatenated codes

H04L 1/0066   Parallel concatenated codes

H04L 1/0618   Space-time coding

Open-loop diversity technique for systems employing four transmitter antennas

First Claim

4 Assignments

0 Petitions

Accused Products

Abstract

61 Citations

57 Claims

Specification

Solutions

Use Cases

Quick Links

Open-loop diversity technique for systems employing four transmitter antennas

First Claim

4 Assignments

Subscription Required

Subscription Required

0 Petitions

Subscription Required

Accused Products

Subscription Required

Abstract

61 Citations

57 Claims

Specification

Subscription Required

Solutions

Use Cases

Quick Links