A mobile communication system is designed with an input circuit coupled to receive a first plurality of signals (rj(i+&tgr;j), i=0−N−1) during a first time (T0-T1) from an external source and coupled to receive a second plurality of signals (rj(i+&tgr;j), i=N−2N−1) during a second time (T1-T2) from the external source. The input circuit receives each of the first and second plurality of signals along respective first and second paths (j). The input circuit produces a first input signal (Rj1) and a second input signal (Rj2) from the respective first and second plurality of signals. A correction circuit is coupled to receive a first estimate signal (&agr;j1), a second estimate signal (&agr;j2) and the first and second input signals. The correction circuit produces a first symbol estimate ({tilde over (S)}1) in response to the first and second estimate signals and the first and second input signals. The correction circuit produces a second symbol estimate ({tilde over (S)}2) in response to the first and second estimate signals and the first and second input signals.
Legal claims defining the scope of protection, as filed with the USPTO.
1. A circuit, comprising: a plurality of encoder circuits, each encoder circuit coupled to receive a respective input signal, each encode circuit arranged to produce a respective encoded output signal at least one encoded output signal including a first symbol, a second symbol, a first transformed symbol corresponding to the first symbol, and a second transformed symbol corresponding to the second symbol; and a plurality of transmit antennas coupled to receive the fit and the second symbols and the first and second transformed symbols.
2. A circuit as in claim 1 , further comprising a multiplex circuit coupled to receive the respective encoded output signal from each of the plurality of encoder circuits, the multiplex circuit selectively producing the first and a second symbols and the first and second transformed symbols.
3. A circuit as in claim 2 , wherein the first and second symbols are applied to a first of the plurality of transmit antennas and wherein the first and second transformed symbols are applied to a second of the plurality of transmit antennas.
4. A circuit as in claim 3 , wherein each transformed symbol includes at least one of a complement and a complex conjugate of a respective symbol.
5. A circuit as in claim 3 , wherein at least one of the symbols applied to the plurality of transmit antennas is modulated by a channel orthogonal code.
6. A circuit as in claim 1 , further comprising a multiplier circuit coupled to receive a code and at least one of said symbols, the multiplier circuit arranged to multiply the code by the at least one of said symbols.
7. A circuit as in claim 6 , wherein the code is a channel orthogonal code.
8. A circuit as in claim 7 , wherein the channel orthogonal code comprises a Walsh code.
9. A circuit as in claim 9 , wherein the code comprises a scrambling code.
10. A circuit as in claim 6 , wherein the code corresponds to only one remote receiver.
11. A circuit as in claim 1 , wherein said respective input signal comprises at least one of a pilot symbol, transmit power control symbol, rate information symbol and data symbol.
12. A circuit as in claim 9 , wherein the scrambling code comprises a pseudo noise code.
13. A circuit as in claim 1 , wherein the first and the second symbols are quadrature phase shift keyed symbols.
14. A method of processing signals comprising the steps of: encoding an input data sequence thereby producing an encoded data sequence; interleaving the encoded data sequence, thereby producing an interleaved data sequence; producing a plurality of symbols, from the interleaved data sequence; applying a first symbol to a first antenna at a first time; apply a second symbol to a second antenna at the first time; applying a third symbol to the first antenna at a second time; and applying a fourth symbol to the second antenna at the second time, wherein each of the first through fourth symbols is different from the others of the first trough fourth symbols, wherein the second symbol is a conjugate of the third symbol and wherein the fourth symbol is a negative of a conjugate of the first symbol.
15. A method as in claim 14 , wherein the input data sequence comprises a sequence of data bits.
16. A method as in claim 15 , wherein the encoded data sequence is greater in number than the sequence of input data bits.
17. A method as in claim 14 , wherein the encoded data sequence is encoded with a convolutional code.
18. A method as in claim 14 , wherein the encoded data sequence is encoded with a turbo code.
19. A method as in claim 14 , wherein the interleaved data sequence comprises data bits of the encoded data sequence having a different order than the encoded data sequence.
20. A method as in claim 14 , wherein each of the plurality of symbols is a quadrature phase shift keyed symbol.
21. A method as in claim 20 , wherein said quadrature phase shift keyed symbol comprises an inphase data bit and a quadrature data bit from the interleaved data sequence.
22. A method as in claim 14 , comprising the step of multiplying each of the plurality of symbols by a channel orthogonalization code.
23. A method of processing signals, comprising the steps of: encoding an input data sequence thereby producing an encoded data sequence; interleaving the encoded data sequence, thereby producing an interleaved data sequence; producing a plurality of symbols, from the interleaved data sequence; applying a first symbol to a first antenna at a first time; applying a second symbol to a second antenna at the first time; applying a third symbol to the first antenna at a second time; and applying a fourth symbol to the second antenna at the second time, wherein each of the first through fourth symbols is different from the others of the first through fourth symbols, wherein the second symbol is a conjugate of the third symbol and wherein the first symbol is a negative of a conjugate of the fourth symbol.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
August 28, 2001
September 10, 2002
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.