Abstract
A method and apparatus for increasing the data rate and providing antenna diversity using multiple transmit antennas is disclosed. A set of bits of a digital signal are used to generate a codeword. Codewords are provided according to a channel code. Delay elements may be provided in antenna output channels, or with suitable code construction delay may be omitted. n signals represent n symbols of a codeword are transmitted with n different transmit antennas. At the receiver MLSE or other decoding is used to decode the noisy received sequence. The parallel transmission and channel coding enables an increase the data rate over previous techniques, and recovery even under fading conditions. The channel coding may be concatenated with error correction codes under appropriate conditions.
Technologies
Product
Use Cases
Services
Claim
1. A method comprising the steps of:
trellis encoding each successive block of k bits of an input signal into n symbols, where n is an integer, and
transmitting said n symbols over n channels, respectively, thereby forming a sequence of symbols transmitted over n antennas, where a quotient of the sequence of symbols transmitted by one of said n antennas with any sequence of symbols transmitted by any of the other n antennas cannot be found that is independent of said input signal.', 'trellis encoding each successive block of k bits of an input signal into n symbols, where n is an integer, and', 'transmitting said n symbols over n channels, respectively, thereby forming a sequence of symbols transmitted over n antennas, where a quotient of the sequence of symbols transmitted by one of said n antennas with any sequence of symbols transmitted by any of the other n antennas cannot be found that is independent of said input signal.
2. The method of claim 1
wherein said step of encoding comprises collecting, within a time interval, k bits of said input signal and developing a collection of symbols c0, c1, . . . cnâx88x921 that corresponds to said k bits, where n corresponds to the number of channels available for transmission of said code sequence, and
wherein said step of transmitting symbols c0, c1, . . . cn-1 simultaneously over channels 0, 1 . . . nâx88x921, respectively.', 'wherein said step of encoding comprises collecting, within a time interval, k bits of said input signal and developing a collection of symbols c0, c1, . . . cnâx88x921 that corresponds to said k bits, where n corresponds to the number of channels available for transmission of said code sequence, and', 'wherein said step of transmitting symbols c0, c1, . . . cn-1 simultaneously over channels 0, 1 . . . nâx88x921, respectively.
3. The method of claim 1 where each of said channels comprises an antenna for wireless communication.
4. The method of claim 1 where said n symbols belong to a PSK constellation.
5. The method of claim 1 further comprising a step of adding channel codes to an applied signal to form said input signal.
6. The method of claim 1 where said n symbols are developed in accordance with a code having a trellis structure.
7. The method of claim 1 where said n symbols are developed in accordance with a selected block code.
8. The method of claim 1 where said n symbols are developed in accordance with a selected multi-level code.
9. The method of claim 1 where said n symbols are developed in accordance with a selected space-time code
10. The method of claim 1 where said n symbols are developed in accordance with a code that also develops variations of said n symbols, and the n symbols and their variations are dispersed in the course of their transmission both in time and among said n antennas, so that all antennas transmit a symbol during each time interval
11. The method of claim 1 where said n symbols are developed in accordance with a selected multi-level space-time code
12. The method of claim 11 where the multi-level space-time code has a trellis structure
13. A method for transmitting information comprising the steps of:
converting M2 groups of k incoming bits into a first sequence of M2 symbols, and a second sequence of M2 symbols where M2 is an integer equal to or greater than 2,
applying said first sequence to a first transmitting antenna, and
applying said second sequence to a second transmitting antenna.', 'converting M2 groups of k incoming bits into a first sequence of M2 symbols, and a second sequence of M2 symbols where M2 is an integer equal to or greater than 2,', 'applying said first sequence to a first transmitting antenna, and', 'applying said second sequence to a second transmitting antenna
14. A method for transmitting information comprising the steps of:
converting successive groups of k incoming bits into L sequences of symbols, where L>1, and
applying each of the sequences of symbols to a different transmitting antenna.', 'converting successive groups of k incoming bits into L sequences of symbols, where L>1, and', 'applying each of the sequences of symbols to a different transmitting antenna
15. The method of claim 14 where the sequences are different from each other, forming a space-time diversity mapping between said incoming bits and said L sequences of symbols
16. A method for transmitting information comprising the steps of:
mapping each of a plurality of k bit groups into K symbols, where K is an integer having a value of 2 or more, in accordance with a mapping where
said k bit groups are viewed as a k-bit number, i,
symbols are taken from a set of 2k sybmols, cj, j=0, 1, . . . 2k-1,
said K symbols of a first group of said groups are set to ci for all values of i, and
said K symbols of other groups of said groups are set to other than ci for most values of i.', 'mapping each of a plurality of k bit groups into K symbols, where K is an integer having a value of 2 or more, in accordance with a mapping where', 'said k bit groups are viewed as a k-bit number, i,', 'symbols are taken from a set of 2k sybmols, cj, j=0, 1, . . . 2k-1,', 'said K symbols of a first group of said groups are set to ci for all values of i, and', 'said K symbols of other groups of said groups are set to other than ci for most values of i.']
Associated Portfolios
Licensor Claim Chart
 Claim Chart |
 Technology |
 Creation Date |
 Download |
|---|---|---|---|
|
Claim charts will soon be available!
|
|||
SUMMARY
ClaimChart-US6889355B1-STO
Patent number:US6889355B1
Claim Chart Type : SEP Claim Chart
Price: 200 €
Note:
The information in blue was extracted from the third parties (Standard Setting Organisation, Espacenet)
The information in grey was provided by the patent holder
The information in purple was extracted from the FrandAvenue
Explicitly disclosed patent:openly and comprehensibly describes all details of the invention in the patent document.
Implicitly disclosed patent:does not explicitly state certain aspects of the invention, but still allows for these to be inferred from the information provided.
Basis patent:The core patent in a family, outlining the fundamental invention from which related patents or applications originate.
Family member:related patents or applications that share a common priority or original filing.