EP0951091B1 - Wireless communications system having a space-time architecture employing multi-element antennas at both the transmitter and receiver - Google Patents
Wireless communications system having a space-time architecture employing multi-element antennas at both the transmitter and receiver Download PDFInfo
- Publication number
- EP0951091B1 EP0951091B1 EP99302692A EP99302692A EP0951091B1 EP 0951091 B1 EP0951091 B1 EP 0951091B1 EP 99302692 A EP99302692 A EP 99302692A EP 99302692 A EP99302692 A EP 99302692A EP 0951091 B1 EP0951091 B1 EP 0951091B1
- Authority
- EP
- European Patent Office
- Prior art keywords
- transmitter
- vector
- antennas
- receiver
- signal
- 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.)
- Expired - Lifetime
Links
Images
Classifications
-
- H—ELECTRICITY
- H01—ELECTRIC ELEMENTS
- H01Q—ANTENNAS, i.e. RADIO AERIALS
- H01Q3/00—Arrangements for changing or varying the orientation or the shape of the directional pattern of the waves radiated from an antenna or antenna system
- H01Q3/26—Arrangements for changing or varying the orientation or the shape of the directional pattern of the waves radiated from an antenna or antenna system varying the relative phase or relative amplitude of energisation between two or more active radiating elements; varying the distribution of energy across a radiating aperture
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/204—Multiple access
-
- H—ELECTRICITY
- H01—ELECTRIC ELEMENTS
- H01Q—ANTENNAS, i.e. RADIO AERIALS
- H01Q3/00—Arrangements for changing or varying the orientation or the shape of the directional pattern of the waves radiated from an antenna or antenna system
- H01Q3/26—Arrangements for changing or varying the orientation or the shape of the directional pattern of the waves radiated from an antenna or antenna system varying the relative phase or relative amplitude of energisation between two or more active radiating elements; varying the distribution of energy across a radiating aperture
- H01Q3/2605—Array of radiating elements provided with a feedback control over the element weights, e.g. adaptive arrays
- H01Q3/2611—Means for null steering; Adaptive interference nulling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/02—Arrangements for detecting or preventing errors in the information received by diversity reception
- H04L1/06—Arrangements for detecting or preventing errors in the information received by diversity reception using space diversity
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/02—Arrangements for detecting or preventing errors in the information received by diversity reception
- H04L1/06—Arrangements for detecting or preventing errors in the information received by diversity reception using space diversity
- H04L1/0618—Space-time coding
Definitions
- the invention relates to a wireless communications system employing Multi-Element Antennas (MEAs) at both the transmitter and receiver.
- MEAs Multi-Element Antennas
- the transmission capacity (ultimate bit rate) of a digital wireless communications system is based on a number of different parameters including (a) total radiated power at the transmitter, (b) the number of antenna elements at the transmitter and receiver, bandwidth, (c) noise power at the receiver, (d) characteristics of the propagation environment, etc.
- the bit rate could be very large, e.g., 36 bits per second per Hz with a reasonable Signal to Noise Ratio (SNR) of 18 dB.
- SNR Signal to Noise Ratio
- EP-A-0 817 401 discloses decomposing an n-dimensional system into n-one dimensional systems of equal capacity when the transfer (H matrix) characteristics of the wireless channel are unknown to the transmitter. More specifically, signal components received during respective periods of time over a plurality of antennas associated with a wireless receiver are formed into respective space and time relationships in which space is associated with respective transmitter antenna elements are preprocessed, in turn, such that a collection of signal components having the same space/time relationship form a signal vector so that particular decoded signal contributions may be subtracted from the signal vector while particular undecoded contributions may be nulled out of the signal vector. The resulting vector is then supplied to a decoder for decoding to detect a primitive data stream.
- EP-A-0 905 920 discloses a multiple antenna system that creates virtual sub-channels from an actual communications channel by using propagation information characterizing the actual communications channel at first and second units.
- the first unit For transmissions from the first unit to the second unit, the first unit sends a virtual transmitted signal over at least a subset of the virtual sub-channels using at least a portion of the propagation information.
- the second unit retrieves a corresponding virtual received signal from the same set of virtual sub-channels using at least another portion of said propagation information.
- a wireless communications system that transmits at a substantial bit rate may be achieved, in accordance with an aspect of the invention, by decomposing an m-dimensional system into m-one dimensional systems (of possibly a different capacity) when the transfer (H matrix) characteristics of the wireless channel are unknown to the transmitter. More specifically and in accordance with the principles of the invention, a burst of signal vectors is formed from different data symbols and then transmitted by a transmitter via a Multi-Element Antenna Array. The transmitted vector symbols are received as signal vectors by a plurality of different antennas associated with a wireless receiver.
- the symbol components of the transmitted vector symbol have an (arbitrary) order and the receiver determines the best reordering of these transmitted components and then processes the received vector to determine the reordered transmitted symbol components.
- Such processing starts with the lowest (e.g., first) level of the reordered components, and for each such level, cancels out interfering contributions from lower levels, if any, and nulls out interfering contributions from higher levels, if any.
- Such receiver processing includes, in accordance with one embodiment of the invention, compensating the weaker of the received transmitted signal components by first removing the interference from the stronger of the received transmitted components, and then processing the result to form the bit decisions.
- the transmitter and receiver are spaced very far apart, for example, 100 ⁇ . Also, the volume of such transmit and receive spaces is sufficient to accommodate one or more signal decorrelations. Also, locations of the transmitter and receiver may be reversed and several antennas would still be available at the receiver to receive substantially spatially decorrelated electromagnetic field samples originating from electromagnetic waves launched by the transmitter. This randomly faded matrix channel characteristic is assumed not to be known to the transmitter but may be "learned" by the receiver using certain channel measurements. Such training may be done by, for example, using m applications of standard n-fold receive diversity, one such application per transmit antenna.
- burst mode communications in which temporal changes in the channel are assumed to be negligible over the duration of a burst of data, and in which the characteristics (i.e., transmission environment) of the channel may change from burst to burst. Because of this, the channel bit rate that may be achieved is treated as a random variable.
- a key system parameter is the spatial average Signal-to-Noise Ratio (SNR), p, as would be measured using a "probe" antenna element at the transmitter end and at the receiver end of the transmission volumes.
- SNR Signal-to-Noise Ratio
- p is independent of the number of transmit antennas.
- the transmitted signal is designated as s(t) and the total power is constrained to P o (defined below) regardless of the value of m (the dimension of s(t)).
- P o defined below
- m the dimension of s(t)
- the noise signal at the receiver is designated as v(t), and is a complex n-D (Dimensional) Additive White Gaussian Noise (AWGN) process with statistically independent components of identical power N (one component for each of the n receiver antennas).
- AWGN Additive White Gaussian Noise
- the received signal is designated as r(t), and, at a particular point in time, a received n-D signal includes one complex component per receive antenna.
- the transmitter radiates power P o and the resulting (spatial) average power at the output of any of the receiving antennas is noted by P.
- the spatial average SNR, p, at each receiver antenna is considered to be equal to P/N and independent of m in the Rayleigh propagation case.
- the duration of a burst of data is ⁇ vector symbols and is assumed to be equal to the number of intervals ('ticks") of a discrete time clock that occurs in such a burst.
- a so-called matrix channel impulse response, g(t), has m columns and n rows.
- realizations of a form of H for an ideal Rayleigh propagation environment may be modeled so that the m x n matrix entries are the result of independent identically distributed complex Gaussian variables of unit variance.
- FIG. 1 A broad block diagram illustrating a generalized version of a communication system that processes the received vector signal described by equation 2 is shown FIG. 1.
- source 50 supplies a m-dimensional signal to transmitter processor 100 which then transmits over selected ones of the antennas 110-1 through 110-k a m-dimensional symbol generated as a result of using m instances of a particular modulation technique, e.g., Quadrature Amplitude Modulation (QAM), in which each symbol component corresponds to a group of sequential bits.
- a particular modulation technique e.g., Quadrature Amplitude Modulation (QAM)
- QAM Quadrature Amplitude Modulation
- the selection of m transmit antennas may be arbitrary. However, the selection could turn out to be inferior.
- transmitter processor 100 is arranged to systematically (or randomly) change the selection of antennas to avoid being “stuck” with an inferior selection for any appreciable amount of time.
- a so-called feedback channel from receiver 200 to transmitter 100 is provided.
- the selection of transmitter antennas is then somewhat optimized based on information provided by receiver 200 to transmitter 100 via the feedback channel (represented in FIG. 1 by the dashed line.)
- Transmitter processor 100 may be arranged to initially match the sequential order in which symbols are generated with the order of antennas 110-1 through 110-k, in which the first of such symbols is transmitted over antenna 110-1, the second symbol is then transmitted over antenna 110-2, and so on.
- transmitter processor 100 may change the selection or use a subset of the transmit antennas 110-l, all in accordance with an aspect of the invention. For example, as a result of such feedback, if the transmitter "learns" that the environment of the channel over which antennas 110-k-1 and 110-k transmit, then processor 100 may use just a subset of the antennas, e.g., 110-1 through 110-k-2, and select those antenna that may possibly result in the best reception at receiver 200 as reported via the feedback channel.)
- m different QAM signals may be considered to be statistically independent, but are otherwise identical modulations (although different modulations are allowable).
- each of the QAM modulated components of a received vector will also be referred to herein as a substream.
- q(t) may be defined as follows: q t ⁇ ⁇ ⁇ ⁇ ⁇ ⁇ P o / P ⁇ m 1 ⁇ 2 ⁇ s t
- the received vector, r(t) is used to estimate the m QAM components of the vector q(t), in which n components of the signal vector, r(t), are received by each of the receiver 200 antennas 120-1 through 120-n, respectively.
- the processing of the received signal to detect the transmitted symbols is the problem that receiver 200 needs to solve in accordance with the principles of the invention.
- the detected symbols are then mapped to respective bit sequence
- Receiver 200 more particularly includes, inter alia, a bank of conventional RF receiver sections (not shown) which respectively interface with antennas 120-1 through 120-n. It also includes detection processor 201, which is made up of preprocessor (also just processor) 60 and symbol processor 65, and multiplexer 70. Preprocessor 60 receives the signals as respective signal vectors from the n antennas 120-1 through 120-n, and preprocesses each received signal vector to eliminate interference between the signal components forming that vector.
- detection processor 201 which is made up of preprocessor (also just processor) 60 and symbol processor 65, and multiplexer 70.
- Preprocessor 60 receives the signals as respective signal vectors from the n antennas 120-1 through 120-n, and preprocesses each received signal vector to eliminate interference between the signal components forming that vector.
- Such processing includes (a) subtracting interference stemming from previously detected transmitted symbols from the vector being processed, (b) nulling out of the vector being processed interference from other transmitted symbols that have not yet been processed and detected, and (c) using the stronger elements of the received signal to compensate for the weaker elements, all in accordance with the principles of the invention and as will be discussed below in detail. (Such processes are illustrated in FIG. 4 as procedures 401 through 407.) In accordance with an aspect of the invention, such compensation is achieved by determining the best reordering of the transmitted components for their detection and then processing the received vector to determine the reordered transmitted symbol components.
- the reordering of the transmit components may be achieved by, for example, placing at the bottom of the vertical stack (level (1)) the detection process which will estimate the transmitted signal component that offers the largest SNR, then placing next in the vertical stack (level (2)) the detection process that will estimate the transmitted signal component having the next largest SNR of the remaining m-1 transmitted components and so on, as will be explained below in detail. (It can be appreciated from the foregoing that an alternative stacking arrangement could be readily used).
- a received vector has n complex components respectively received by antennas 120-1 through 120-n.
- Processor 60 further processes the preprocessed signal vectors to detect the m constituent data substreams.
- Symbol processor 65 processes the symbols to determine the data substreams (also herein "bit decisions") respectively corresponding to the symbols.
- Symbol processor 65 then stores the "decision bits" in memory 61 so that the decision bits may be used to cancel interference in further processing of the received signal vector.
- multiplexer 70 multiplexes the bits from the various substreams to form an estimate of the original data stream outputted by source 50 (FIG. 1).
- receiver 200 receives a transmission burst of ⁇ m-dimensional transmit vectors as impaired by the environment of channel 125 plus additive noise.
- Each transmitted vector is received by n receiver antennas, e.g., 12 dimensional transmit vectors received via 16 antennas.
- the decision statistics are to be stacked from the bottom up - i.e., as levels (1), (2), ... (m) as shown in FIG. 3, in which the vector at the first (bottom) level offers the largest SNR for the first of the transmitted components that will be detected.
- receiver 200 has composed the first i-1 decision statistic vectors d [.] s for the levels up to the level designated "next" in FIG. 3 and that the i-1 decisions that are based on the decision statistics for (1), (2), (i-1) are free of errors.
- Such decisions may be used to cancel interference stemming from the components of q that have been already determined.
- q (j) , j 1, 2, ... m, denotes the reordered components of q corresponding to levels (1), (2) . hence (m).
- processor 60 cancels (subtracts) from vector r the vector [q (1) ⁇ h (1) + q (2) ⁇ h (2) +...+ q h (7) ] as a result of having already determined/detected the latter vector.
- Processor 60 then "nulls" out of the vector being processed (e.g., the level 8 vector), the interference from transmitted signal components that have not yet been detected, i.e., the interference stemming from the transmission of q (9) through q (12) , as shown in FIG. 3.
- u [i] may be projected orthogonal to the m-i dimensional space spanned by h (i+1), h (i+2) , ... h (m) .
- the result of that projection is noted herein as v [i] .
- the "interference nulling step"* in a sense “frees” the detection process for q (i) of interference stemming from the simultaneous transmission of q (i+1) , q (i+2), ... q (m) .
- the direction and magnitude of the spatial-matched-filter vector d [i] is considered next.
- q (i) multiplies each component of v [i] so that the vector v [i] is similar to the situation of receiving an [n-(i-1)]-fold diversity interference-free signal in vector AWGN.
- the decision statistic for q (i) is the scalar product ⁇ v [i] , d [i] >, in which the noise power of the scalar product is proportional to ⁇ d [i] ⁇ 2 .
- a standard result about optimum receive diversity may be used to represent the optimized signal to noise ratio, SNR (i) .
- the resulting decision statistic also has the signal power that is proportional to ⁇ d [i] ⁇ 2 .
- v [i] it is thus convenient to define v [i] to denote the vector v [i] in the hypothetical situation where space 125, FIG. 1, is free of additive noise.
- the SNR (i) of that medium is optimized when d [i] is any multiple of the value v [i] , as would follow by applying the well-known Cauchy-Schwarz inequality to the signal power term in the numerator in an expression for SNR.
- the best of all of the opportunities for spatial filtering is when the vector used in a scalar product to collapse v [i] to a scalar decision statistic is in the direction of v [i] :
- the reason for this is that when the collapsing vector is proportional to v [i] , the Cauchy-Schwarz upper bound on SNR is achieved with equality.
- ⁇ v [i] ⁇ 2 appears multiplicatively in both numerator and the denominator of the optimum SNR, therefore, the optimum SNR is invariant with respect to the ⁇ v [i] ⁇ .
- d [i] has the direction of v [i]
- scale of d [i] is simply set in accordance with the (arbitrary) scale factor used for the decision regions employed in the final stage of QAM detection. (Note that the processes of canceling, nulling and compensating is shown graphically in FIG. 4, as mentioned above.) . In the asymptote of high SNR the incremental advantage of not nulling, but instead maximizing the signal to noise plus self-interference is negligible.
- Processor 60 upon receiving a burst of signal vectors stores the signal vectors in memory 61.
- the burst may contain information which receiver 200 may use to "learn" the transmission characteristics of the transmission environment 125 (FIG. 1).
- Such conventional learning (or training) information may be positioned at, for example, either the beginning (preamble) or mid point (midamble) of a burst of signal vectors, as is well-known.
- processor 60 After storing the received training vectors in memory, processor 60 then determines the stacking order in which the transmitted data symbols should be detected as a function of their respective SNRs. This is done to minimize the probability of making a detection error in the processing of a burst of received vectors.
- the determination includes forming spatially-matched-filter vectors by iteratively determining the order in which the transmitted symbols in a vector symbol are detected from a received vector. Note that the goal of such re-ordering is to maximize the minimum signal-to-noise ratio of the detection process.
- Processor 60 stacks the m decision statistics for the m components in accordance with the following criterion: maximize minimum SNR i , 1 ⁇ i ⁇ m
- This criterion corresponds to minimizing the probability of a burst error is that in a high SNR situation (i.e., high p situation) the probability that a burst contains at least one error could be dominated by the q (i) that has the least SNR (i) (as will be shown below in connection with equations (10) and (11).
- Processor builds the stack using a so-called "myopic" optimization procedure, which turns out to be the global optimization procedure expressed by equation (8) -- meaning that processor 60 starts at the bottom level of the stack and proceeds iteratively up to the m-th level, always choosing the next decision statistic among the options that maximizes the SNR for that level.
- myopic optimization processor 60 need only consider ⁇ m 2 /2 options in filling the totality of all m stack levels as opposed to a thorough evaluation of m! stacking options.
- processor 60 may subtract the complex number corresponding to the constellation point from the decision statistic. This process provides processor 60 with the value of the noise that was included in the i-th decision statistic. This noise is correlated with corresponding additive noises of decision statistics further up the stack. Consequently, each additive noise term in subsequent decision statistics can be adjusted by subtracting off the conditional expectation of that noise conditioned on all the contributions of the assumed known additive noises of decision statistics lower in the stack.
- FIG. 6 An expanded view of block 502 is shown in FIG. 6.
- processor 60 has already stored the channel matrix in memory 61.
- processor 60 has already stacked in the preferred order i-1 the matching vector candidates and that processor 60 is now forming the remaining (m - (i - 1)) candidate vectors to determine which one of those candidates will be inserted at the ith level of the stack.
- processor 60 forms a generic linear combination of the i-1 vectors positioned at the lower levels in the stack (and which have already been ordered in the stack), containing interferers.
- Processor 60 subtracts (block 603) that combination from the generic noise-free vector read (block 602) from memory 61, thereby leaving a representation of the vector for the transmitted signal components that have not yet been detected.
- Processor 60 then (block 608) initializes a variable j to a value of one to ensure that it will process all of the vector signals.
- processor 60 For each vector candidate, e.g., the ith candidate vector, processor 60 (block 605) projects that vector orthogonally away from the (m- (i-1)) vector signals that interfere with the ith candidate vector to eliminate those interferers from the decision process. The resulting vector should be a vector that is free of interference from the other ones of the received vector signals.
- Processor 60 then (block 607) measures the norm (corresponding to the square of the length of the vector with respect to an origin in which each of the n components equals zero) to determine the value for that norm. The value of the norm is proportional to the SNR for that decision statistic.
- Processor 60 determines whether the SNR is the best (largest) SNR for all of the candidates processed thus far. If it is, then processor 60 stores (block 609) the spatially-matched-filter vector having that SNR and its associated norm in the ith level of the stack and then proceeds to block 608 to continue the processing of the remaining candidates. If it is not, then processor 60 goes directly to block 608. After storing the selected signal vector candidate and its norm in memory, processor 60 then checks to see if it is done. If not, processor 60 increments j and proceeds to block 605, otherwise, it proceeds to block 503, FIG. 5.
- processor 60 operating under control of the foregoing program places, for detection, the transmitted signal components in an optimum order based on their respective SNRs. As discussed above, processor 60 then uses each of the stacked spatially-matched-filter vectors to determine a bit combination/decision that a processed symbol most likely represents. As mentioned above, the procedure for determining a symbol is illustrated in FIG. 4, and a discussion of that procedure is repeated, but in the context of FIGs. 7 and 8.
- processor 60 begins such processing by entering the program of FIG. 7 at block 700.
- processor 60 initializes (block 701) a variable i to a value of 1 and uses i to point to a respective level in the stack.
- processor 60 is processing the ith level in the stack.
- Processor 60 processes the vector signal (as shown for procedures 401, 402 and 403, FIG. 4) positioned at the ith level in the stack to determine the symbol q (i) most likely represented by the signal vector.
- Processor 60 stores the bit decisions corresponding to q (i) in memory 61, and then checks (block 703) the value of i to see if it has completed m successive processings of the received vector signal r. If so, then processor 60 exits the program. Otherwise, processor 60 (block 705) increments i to point to the next succeeding level in the stack and proceeds to block 702 to process the received signal vector in a manner corresponding to that level.
- processor 60 reads from memory 61 the received n-dimensional vector signal r(t), and then reads (block 802) from memory 61 those signal vector components that have already been processed/detected in accordance with block 702, i.e., those components below the ith level in the stack. Then, in the manner discussed above, processor 60 cancels the i-1 retrieved signal vectors, q (1) ⁇ h (1) , q (2) ⁇ h (2) , ..., q (i-1 ) ⁇ h (i-1) , out of r and then proceeds to block 803 with a signal vector substantially devoid of interference from those i-1 vectors.
- Processor 60 then projects the resulting vector away from the interferers that have not yet been detected. That is, processor 60 reads from memory the spatial match vector d [i] determined at block 504 for the ith level of the stack. Processor 60 (cooperating with processor 65) then takes the scalar product of the spatial match vector and the result generated at block 803 to generate a complex number.
- Processor 65 (805) then determines which one of a conventional multipoint signal constellation, e.g., a sixteen point signal constellation (as shown for constellation 404, FIG. 4), is closest to the complex number. An example of such a point is shown in FIG. 4 in which point 405 representing the complex number is closest to the constellation point of quadrant 406.
- Processor 65 (block 806) then stores the data bit decisions represented by the identified constellation point in memory and then returns control to processor 60. Processor 60 then proceeds to block 703 to process the next level in the stack.
- multiplexer 70 multiplexes the bit decisions to an output terminal.
- transmitter 100 and receiver 200 may have antenna arrays of up to 16 antennas.
- 95% of the transmission bursts are free of errors (i.e., at most a 5% outage), and an ideal Rayleigh propagation environment for space 125.
- each burst contains, besides training vectors, 100 vector symbols.
- the Shannon capacity is 79.1 bps/Hz. (Note that "Shannon capacity" is a well-known term in the art.)
- the number of transmit antennas, m, and the number of points in each of the planar constellations, K may be optimized to maximize the number of bps/Hz.
- Number of substreams K m
- Equation (10) For example, for an 8 point constellation we used a square with four equilateral triangles attached to the four sides and pointing outward. The vertices of the square, along with the four triangle vertices that oppose each of the four sides of the square, made up the constellation.
- Equation (10) The equation for the probability of at least one error in a block with K vector symbols is shown below as equation (10). Evaluation of this probability requires that the SNR (i) for 1 ⁇ i ⁇ m. Monte-Carlo generated H realizations may be used to get samples of the m SNRs.
- Prob Erroneous Block ⁇ ⁇ ⁇ ⁇ i 1 m P b SNR i
- the system can support a 32 point planar constellation of 5 bps/Hz.
- the system can support 16 point constellations of 4 bps/Hz.
- nulling and cancellation but not ordering it may be desirable to use only a subset of the inventive features. For example, it may be desirable to use just nulling but not cancellation and reordering, or else nulling and cancellation but not ordering.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Radio Transmission System (AREA)
- Variable-Direction Aerials And Aerial Arrays (AREA)
- Digital Transmission Methods That Use Modulated Carrier Waves (AREA)
- Mobile Radio Communication Systems (AREA)
Description
- The invention relates to a wireless communications system employing Multi-Element Antennas (MEAs) at both the transmitter and receiver.
- The transmission capacity (ultimate bit rate) of a digital wireless communications system is based on a number of different parameters including (a) total radiated power at the transmitter, (b) the number of antenna elements at the transmitter and receiver, bandwidth, (c) noise power at the receiver, (d) characteristics of the propagation environment, etc. For a wireless transmission system employing an appreciable number of antennas at both the transmitter and receiver and operating in a so-called Rayleigh fading environment even without coding, the bit rate could be very large, e.g., 36 bits per second per Hz with a reasonable Signal to Noise Ratio (SNR) of 18 dB. Heretofore, it was difficult for a communications system to exchange data at a fraction of such a rate. The main reason for this is that the prior art did not appreciate the problems that had to be solved in order to build a large bit rate system.
-
EP-A-0 817 401 discloses decomposing an n-dimensional system into n-one dimensional systems of equal capacity when the transfer (H matrix) characteristics of the wireless channel are unknown to the transmitter. More specifically, signal components received during respective periods of time over a plurality of antennas associated with a wireless receiver are formed into respective space and time relationships in which space is associated with respective transmitter antenna elements are preprocessed, in turn, such that a collection of signal components having the same space/time relationship form a signal vector so that particular decoded signal contributions may be subtracted from the signal vector while particular undecoded contributions may be nulled out of the signal vector. The resulting vector is then supplied to a decoder for decoding to detect a primitive data stream. -
EP-A-0 905 920 discloses a multiple antenna system that creates virtual sub-channels from an actual communications channel by using propagation information characterizing the actual communications channel at first and second units. For transmissions from the first unit to the second unit, the first unit sends a virtual transmitted signal over at least a subset of the virtual sub-channels using at least a portion of the propagation information. The second unit retrieves a corresponding virtual received signal from the same set of virtual sub-channels using at least another portion of said propagation information. - We have recognized that a wireless communications system that transmits at a substantial bit rate may be achieved, in accordance with an aspect of the invention, by decomposing an m-dimensional system into m-one dimensional systems (of possibly a different capacity) when the transfer (H matrix) characteristics of the wireless channel are unknown to the transmitter. More specifically and in accordance with the principles of the invention, a burst of signal vectors is formed from different data symbols and then transmitted by a transmitter via a Multi-Element Antenna Array. The transmitted vector symbols are received as signal vectors by a plurality of different antennas associated with a wireless receiver. The symbol components of the transmitted vector symbol have an (arbitrary) order and the receiver determines the best reordering of these transmitted components and then processes the received vector to determine the reordered transmitted symbol components. Such processing starts with the lowest (e.g., first) level of the reordered components, and for each such level, cancels out interfering contributions from lower levels, if any, and nulls out interfering contributions from higher levels, if any.
- Such receiver processing includes, in accordance with one embodiment of the invention, compensating the weaker of the received transmitted signal components by first removing the interference from the stronger of the received transmitted components, and then processing the result to form the bit decisions.
- These and other aspects of the invention may be appreciated from the following detailed description, accompanying drawings and claims.
- In the drawings:
- FIG. 1 illustrates in block diagram form a wireless transmitter and receiver embodying the principles of the invention;
- FIG. 2 illustrates a more detailed block diagram of the wireless receiver of FIG. 1;
- FIG. 3 illustrates the reordered transmit components and corresponding decision statistics for one of the n-dimensional complex signal vectors of a received burst of κ vectors;
- FIG. 4. illustrates graphically the way in which such processing is achieved to eliminate interfering signals from a signal vector being processed by the receiver of FIG. 2;
- FIGs. 5 and 6 illustrate in flow chart form the program which implements such reordering in the
processor 60 of FIG. 2; and - FIGs. 7 and 8 illustrate in flow chart form the processor program which processes each received vector signal to determine the corresponding transmit symbols.
- The following illustrative embodiment of the invention is described in the context of a point-to-point communication architecture employing a transmitter having an array of k antenna elements and a receiver having an array of n antenna elements, where, in an illustrative embodiment of the invention, k ≤ n and both values are > 1. For example, for transmissions at 1.9 GHz, k≤ 16 and n = 16. Moreover, as will be seen below, the bit rate/bandwidth, in terms of the number of bits/cycle, that may be achieved using the inventive architecture is indeed large.
- For the sake of clarity, the detailed description assumes the following conditions. Specifically, assume that the transmitter and receiver, FIG. 1, are spaced very far apart, for example, 100λ. Also, the volume of such transmit and receive spaces is sufficient to accommodate one or more signal decorrelations. Also, locations of the transmitter and receiver may be reversed and several antennas would still be available at the receiver to receive substantially spatially decorrelated electromagnetic field samples originating from electromagnetic waves launched by the transmitter. This randomly faded matrix channel characteristic is assumed not to be known to the transmitter but may be "learned" by the receiver using certain channel measurements. Such training may be done by, for example, using m applications of standard n-fold receive diversity, one such application per transmit antenna. One example of this procedure is disclosed in the article entitled "Signal Acquisition and Tracking with Adaptive Arrays in the Digital Mobile Radio System IS-54 with Flat Fading", by J. H. Winters and published in the IEEE Transactions on Vehicular Technology, November 1993.
- The following description is also discussed in the context of burst mode communications, in which temporal changes in the channel are assumed to be negligible over the duration of a burst of data, and in which the characteristics (i.e., transmission environment) of the channel may change from burst to burst. Because of this, the channel bit rate that may be achieved is treated as a random variable. Along with (m, n), a key system parameter is the spatial average Signal-to-Noise Ratio (SNR), p, as would be measured using a "probe" antenna element at the transmitter end and at the receiver end of the transmission volumes. The total radiated power is considered to be constrained so that if m, for example, is increased, there is proportionately less power per transmit antenna. (Note, that in a Rayleigh propagation environment, p is independent of the number of transmit antennas).
- As mentioned above, the transmission environment of a channel is assumed to be random, and time is assumed to be discrete. Also assume the following notation:
- The transmitted signal is designated as s(t) and the total power is constrained to Po (defined below) regardless of the value of m (the dimension of s(t)). For the sake of simplicity, the following discussion assumes that the bandwidth is sufficiently narrow so that the response of the channel may be considered to be flat over the channel frequency band.
- The noise signal at the receiver is designated as v(t), and is a complex n-D (Dimensional) Additive White Gaussian Noise (AWGN) process with statistically independent components of identical power N (one component for each of the n receiver antennas).
- The received signal is designated as r(t), and, at a particular point in time, a received n-D signal includes one complex component per receive antenna. In the case where there is only one transmit antenna, then the transmitter radiates power Po and the resulting (spatial) average power at the output of any of the receiving antennas is noted by P.
- The spatial average SNR, p, at each receiver antenna is considered to be equal to P/N and independent of m in the Rayleigh propagation case.
- The duration of a burst of data is κ vector symbols and is assumed to be equal to the number of intervals ('ticks") of a discrete time clock that occurs in such a burst.
- A so-called matrix channel impulse response, g(t), has m columns and n rows. G(f) is used for the Fourier transform of g(t). To be consistent with the narrowband assumption, this matrix/transform is considered to be constant over the band of interest, in which notation G indicates that frequency dependence is suppressed. Thus, except for g(0), g(t) is the zero matrix. As will be seen, it may be convenient to represent the response of the matrix channel in a normalized form, h(t). Also, related to G, and for a matrix H, the equation P½.G = Po ½·H defines the relationship between G and H, which provide g(t) = (P o/P) ½·h(t).
- Further, realizations of a form of H for an ideal Rayleigh propagation environment may be modeled so that the m x n matrix entries are the result of independent identically distributed complex Gaussian variables of unit variance.
- With the foregoing in mind, and using * to designate convolution, the basic vector equation describing the channel environment affecting a transmitted signal may be represented as follows:
The two vectors added on the right hand side of equation (1) are complex n-D(dimensional) vectors (i.e., 2n real dimensions). For the above narrowband assumption,equation 1 may be simplified by replacing the convolution using a matrix-vector product as follows: - A broad block diagram illustrating a generalized version of a communication system that processes the received vector signal described by
equation 2 is shown FIG. 1. In particular,source 50 supplies a m-dimensional signal totransmitter processor 100 which then transmits over selected ones of the antennas 110-1 through 110-k a m-dimensional symbol generated as a result of using m instances of a particular modulation technique, e.g., Quadrature Amplitude Modulation (QAM), in which each symbol component corresponds to a group of sequential bits. In an illustrative embodiment of the invention, the selection of m transmit antennas may be arbitrary. However, the selection could turn out to be inferior. Rather than being "stuck" with such a selection,transmitter processor 100 is arranged to systematically (or randomly) change the selection of antennas to avoid being "stuck" with an inferior selection for any appreciable amount of time. (It is noted that in one embodiment of the instant invention, a so-called feedback channel fromreceiver 200 totransmitter 100 is provided. The selection of transmitter antennas is then somewhat optimized based on information provided byreceiver 200 totransmitter 100 via the feedback channel (represented in FIG. 1 by the dashed line.)Transmitter processor 100, more particularly, may be arranged to initially match the sequential order in which symbols are generated with the order of antennas 110-1 through 110-k, in which the first of such symbols is transmitted over antenna 110-1, the second symbol is then transmitted over antenna 110-2, and so on. If that selection turns out to be inferior based on the receiver feedback information, thentransmitter processor 100 may change the selection or use a subset of the transmit antennas 110-l, all in accordance with an aspect of the invention. For example, as a result of such feedback, if the transmitter "learns" that the environment of the channel over which antennas 110-k-1 and 110-k transmit, thenprocessor 100 may use just a subset of the antennas, e.g., 110-1 through 110-k-2, and select those antenna that may possibly result in the best reception atreceiver 200 as reported via the feedback channel.) - For the system of FIG. 1, m different QAM signals may be considered to be statistically independent, but are otherwise identical modulations (although different modulations are allowable). (Note that each of the QAM modulated components of a received vector will also be referred to herein as a substream.) Also for expositional convenience, q(t) may be defined as follows:
Using equation (3), equation (2) may then be expressed simply as
The received vector, r(t), is used to estimate the m QAM components of the vector q(t), in which n components of the signal vector, r(t), are received by each of thereceiver 200 antennas 120-1 through 120-n, respectively. The processing of the received signal to detect the transmitted symbols is the problem thatreceiver 200 needs to solve in accordance with the principles of the invention. The detected symbols are then mapped to respective bit sequences to reconstitute the original bit stream. - Note, that for the sake of clarity and convenience, the following discussion relating to the processing of a received vector suppresses the argument (t). Thus, for example, r(t) will be referred to simply as r, q(t) as q, etc.
-
Receiver 200, FIG. 2, more particularly includes, inter alia, a bank of conventional RF receiver sections (not shown) which respectively interface with antennas 120-1 through 120-n. It also includesdetection processor 201, which is made up of preprocessor (also just processor) 60 andsymbol processor 65, andmultiplexer 70.Preprocessor 60 receives the signals as respective signal vectors from the n antennas 120-1 through 120-n, and preprocesses each received signal vector to eliminate interference between the signal components forming that vector. Such processing includes (a) subtracting interference stemming from previously detected transmitted symbols from the vector being processed, (b) nulling out of the vector being processed interference from other transmitted symbols that have not yet been processed and detected, and (c) using the stronger elements of the received signal to compensate for the weaker elements, all in accordance with the principles of the invention and as will be discussed below in detail. (Such processes are illustrated in FIG. 4 asprocedures 401 through 407.) In accordance with an aspect of the invention, such compensation is achieved by determining the best reordering of the transmitted components for their detection and then processing the received vector to determine the reordered transmitted symbol components. - The reordering of the transmit components may be achieved by, for example, placing at the bottom of the vertical stack (level (1)) the detection process which will estimate the transmitted signal component that offers the largest SNR, then placing next in the vertical stack (level (2)) the detection process that will estimate the transmitted signal component having the next largest SNR of the remaining m-1 transmitted components and so on, as will be explained below in detail. (It can be appreciated from the foregoing that an alternative stacking arrangement could be readily used).
- A received vector has n complex components respectively received by antennas 120-1 through 120-n.
Processor 60 further processes the preprocessed signal vectors to detect the m constituent data substreams.Symbol processor 65 processes the symbols to determine the data substreams (also herein "bit decisions") respectively corresponding to the symbols.Symbol processor 65 then stores the "decision bits" inmemory 61 so that the decision bits may be used to cancel interference in further processing of the received signal vector. When all of the bits in a transmitted vector have been detected, then multiplexer 70 multiplexes the bits from the various substreams to form an estimate of the original data stream outputted by source 50 (FIG. 1). - For the following assume that
receiver 200 receives a transmission burst of κ m-dimensional transmit vectors as impaired by the environment ofchannel 125 plus additive noise. (Note that the following discussion is given in the context of processing just one of the received vectors. It is to be understood of course that such processing/dectection equally pertains to each of the received vectors.) Each transmitted vector is received by n receiver antennas, e.g., 12 dimensional transmit vectors received via 16 antennas. Also consider that the decision statistics are to be stacked from the bottom up - i.e., as levels (1), (2), ... (m) as shown in FIG. 3, in which the vector at the first (bottom) level offers the largest SNR for the first of the transmitted components that will be detected. For such an iteration of the vector signals, assume thatreceiver 200 has composed the first i-1 decision statistic vectors d[.]s for the levels up to the level designated "next" in FIG. 3 and that the i-1 decisions that are based on the decision statistics for (1), (2), (i-1) are free of errors. Such decisions may be used to cancel interference stemming from the components of q that have been already determined. Note that q(j), j = 1, 2, ..... m, denotes the reordered components of q corresponding to levels (1), (2) ....... (m). Also note that for the following discussion, it is useful to express h in terms of its m n-D columns so that (in discussing the formation of the decision statistic for detecting q(i)) h = [h1 h2 ... hm] -
-
-
- Thus, in the processing of the same received vector r that is designated "next" in FIG. 3 (i.e., stack level 8),
processor 60 cancels (subtracts) from vector r the vector [q(1) ·h(1) + q(2) ·h(2) +...+ q h(7)] as a result of having already determined/detected the latter vector.Processor 60 then "nulls" out of the vector being processed (e.g., thelevel 8 vector), the interference from transmitted signal components that have not yet been detected, i.e., the interference stemming from the transmission of q(9) through q(12), as shown in FIG. 3. - For those components (i+1) (i+2), ...... (m) of q that have not yet been determined/detected, u[i] may be projected orthogonal to the m-i dimensional space spanned by h(i+1), h(i+2), ... h(m). The result of that projection is noted herein as v[i]. The "interference nulling step"*, in a sense "frees" the detection process for q(i) of interference stemming from the simultaneous transmission of q(i+1), q(i+2), ... q(m).
The direction and magnitude of the spatial-matched-filter vector d[i] is considered next. Note that q(i) multiplies each component of v[i] so that the vector v[i] is similar to the situation of receiving an [n-(i-1)]-fold diversity interference-free signal in vector AWGN. Explicitly, the decision statistic for q(i) is the scalar product < v[i], d[i] >, in which the noise power of the scalar product is proportional to ∥d[i]∥2. A standard result about optimum receive diversity may be used to represent the optimized signal to noise ratio, SNR(i). The resulting decision statistic also has the signal power that is proportional to ∥d[i]∥2. It is thus convenient to define v [i] to denote the vector v[i] in the hypothetical situation wherespace 125, FIG. 1, is free of additive noise. The SNR(i) of that medium is optimized when d[i] is any multiple of the value v [i], as would follow by applying the well-known Cauchy-Schwarz inequality to the signal power term in the numerator in an expression for SNR. Indeed, the best of all of the opportunities for spatial filtering, is when the vector used in a scalar product to collapse v[i] to a scalar decision statistic is in the direction of v [i]: The reason for this is that when the collapsing vector is proportional to v [i], the Cauchy-Schwarz upper bound on SNR is achieved with equality. Note that ∥v [i]∥2appears multiplicatively in both numerator and the denominator of the optimum SNR, therefore, the optimum SNR is invariant with respect to the ∥v [i]∥. While d[i] has the direction of v [i] the scale of d[i] is simply set in accordance with the (arbitrary) scale factor used for the decision regions employed in the final stage of QAM detection. (Note that the processes of canceling, nulling and compensating is shown graphically in FIG. 4, as mentioned above.)
. In the asymptote of high SNR the incremental advantage of not nulling, but instead maximizing the signal to noise plus self-interference is negligible. -
Processor 60 upon receiving a burst of signal vectors stores the signal vectors inmemory 61. As is done conventionally, the burst may contain information whichreceiver 200 may use to "learn" the transmission characteristics of the transmission environment 125 (FIG. 1). Such conventional learning (or training) information may be positioned at, for example, either the beginning (preamble) or mid point (midamble) of a burst of signal vectors, as is well-known. - After storing the received training vectors in memory,
processor 60 then determines the stacking order in which the transmitted data symbols should be detected as a function of their respective SNRs. This is done to minimize the probability of making a detection error in the processing of a burst of received vectors. The determination includes forming spatially-matched-filter vectors by iteratively determining the order in which the transmitted symbols in a vector symbol are detected from a received vector. Note that the goal of such re-ordering is to maximize the minimum signal-to-noise ratio of the detection process.Processor 60, more specifically, stacks the m decision statistics for the m components in accordance with the following criterion:
The reason that this criterion corresponds to minimizing the probability of a burst error is that in a high SNR situation (i.e., high p situation) the probability that a burst contains at least one error could be dominated by the q(i) that has the least SNR(i) (as will be shown below in connection with equations (10) and (11). - Processor builds the stack using a so-called "myopic" optimization procedure, which turns out to be the global optimization procedure expressed by equation (8) -- meaning that
processor 60 starts at the bottom level of the stack and proceeds iteratively up to the m-th level, always choosing the next decision statistic among the options that maximizes the SNR for that level. With myopic optimization,processor 60 need only consider ~m2/2 options in filling the totality of all m stack levels as opposed to a thorough evaluation of m! stacking options. - (As an aside, note that the improved compensation feature may be achieved using an improved iterative solution that is somewhat more computational. Specifically, assume that
processor 60 is proceeding next to the i-th stack level. Once it makes the i-th decision, assume that no error was made. For that case, then,processor 60 may subtract the complex number corresponding to the constellation point from the decision statistic. This process providesprocessor 60 with the value of the noise that was included in the i-th decision statistic. This noise is correlated with corresponding additive noises of decision statistics further up the stack. Consequently, each additive noise term in subsequent decision statistics can be adjusted by subtracting off the conditional expectation of that noise conditioned on all the contributions of the assumed known additive noises of decision statistics lower in the stack.) - The program which implements the above described vertical ordering/layering in the
processor 60 of FIG. 2 is shown in flow chart form in FIGs. 5 and 6. Specifically, FIG. 5 illustrates the way in which the optimum decision statistic vector d[i] for each of m stack levels, I = 1, 2, 3,..... m is determined. When the program is entered atblock 500, following the storage of a received burst of signal vectors and the processing of the training information, the program proceeds to block 501 where it sets a variable i to a value of one and then proceeds to block 502.Processor 60, atblock 502, processes the generic signal vectors to identify the spatial-matched-filter vector having the largest SNR of all of the candidates (as discussed above and as will be further discussed below). Whenprocessor 60 identifies that vector, it then (block 503) scales the vector relative to a respective scaling value.Processor 60 then stores the scaled vector inmemory 61.Processor 60 then exits (blocks 505 and 506) if it determines that it has completed the forming and ordering (stacking) of all of the spatially-matched-filter vectors (i.e., i = m). If it has not completed the forming and ordering process, then processor 60 (blocks 505 and 507) increments i and returns to block 502 to find which of the remaining candidates offers the largest SNR and places that candidate next in the stack. - An expanded view of
block 502 is shown in FIG. 6. In particular, assume thatprocessor 60 has already stored the channel matrix inmemory 61. Also assume thatprocessor 60 has already stacked in the preferred order i-1 the matching vector candidates and thatprocessor 60 is now forming the remaining (m - (i - 1)) candidate vectors to determine which one of those candidates will be inserted at the ith level of the stack. Atblock 601,processor 60 forms a generic linear combination of the i-1 vectors positioned at the lower levels in the stack (and which have already been ordered in the stack), containing interferers.Processor 60 subtracts (block 603) that combination from the generic noise-free vector read (block 602) frommemory 61, thereby leaving a representation of the vector for the transmitted signal components that have not yet been detected.Processor 60 then (block 608) initializes a variable j to a value of one to ensure that it will process all of the vector signals. For each vector candidate, e.g., the ith candidate vector, processor 60 (block 605) projects that vector orthogonally away from the (m- (i-1)) vector signals that interfere with the ith candidate vector to eliminate those interferers from the decision process. The resulting vector should be a vector that is free of interference from the other ones of the received vector signals.Processor 60 then (block 607) measures the norm (corresponding to the square of the length of the vector with respect to an origin in which each of the n components equals zero) to determine the value for that norm. The value of the norm is proportional to the SNR for that decision statistic.Processor 60 then determines whether the SNR is the best (largest) SNR for all of the candidates processed thus far. If it is, thenprocessor 60 stores (block 609) the spatially-matched-filter vector having that SNR and its associated norm in the ith level of the stack and then proceeds to block 608 to continue the processing of the remaining candidates. If it is not, thenprocessor 60 goes directly to block 608. After storing the selected signal vector candidate and its norm in memory,processor 60 then checks to see if it is done. If not,processor 60 increments j and proceeds to block 605, otherwise, it proceeds to block 503, FIG. 5. - Accordingly, then,
processor 60 operating under control of the foregoing program places, for detection, the transmitted signal components in an optimum order based on their respective SNRs. As discussed above,processor 60 then uses each of the stacked spatially-matched-filter vectors to determine a bit combination/decision that a processed symbol most likely represents. As mentioned above, the procedure for determining a symbol is illustrated in FIG. 4, and a discussion of that procedure is repeated, but in the context of FIGs. 7 and 8. - Specifically, the program which implements in processor 60 (and somewhat in processor 65) the above nulling, canceling and matching
steps processor 60 begins such processing by entering the program of FIG. 7 atblock 700. At that point,processor 60, initializes (block 701) a variable i to a value of 1 and uses i to point to a respective level in the stack. For the following discussion, assume thatprocessor 60 is processing the ith level in the stack. Processor 60 (block 702) processes the vector signal (as shown forprocedures Processor 60 stores the bit decisions corresponding to q(i) inmemory 61, and then checks (block 703) the value of i to see if it has completed m successive processings of the received vector signal r. If so, thenprocessor 60 exits the program. Otherwise, processor 60 (block 705) increments i to point to the next succeeding level in the stack and proceeds to block 702 to process the received signal vector in a manner corresponding to that level. - An expanded version of
block 702 is shown in FIG. 8. Specifically, atblock 801processor 60 reads frommemory 61 the received n-dimensional vector signal r(t), and then reads (block 802) frommemory 61 those signal vector components that have already been processed/detected in accordance withblock 702, i.e., those components below the ith level in the stack. Then, in the manner discussed above,processor 60 cancels the i-1 retrieved signal vectors, q(1)·h(1), q(2) ·h(2), ..., q(i-1) ·h(i-1), out of r and then proceeds to block 803 with a signal vector substantially devoid of interference from those i-1 vectors.Processor 60 then projects the resulting vector away from the interferers that have not yet been detected. That is,processor 60 reads from memory the spatial match vector d[i] determined atblock 504 for the ith level of the stack. Processor 60 (cooperating with processor 65) then takes the scalar product of the spatial match vector and the result generated atblock 803 to generate a complex number. - Processor 65 (805) then determines which one of a conventional multipoint signal constellation, e.g., a sixteen point signal constellation (as shown for
constellation 404, FIG. 4), is closest to the complex number. An example of such a point is shown in FIG. 4 in which point 405 representing the complex number is closest to the constellation point ofquadrant 406. Processor 65 (block 806) then stores the data bit decisions represented by the identified constellation point in memory and then returns control toprocessor 60.Processor 60 then proceeds to block 703 to process the next level in the stack. - When the received signal vector has been so processed and all symbols detected, with the corresponding bits decisions stored in memory, then multiplexer 70 multiplexes the bit decisions to an output terminal.
- The advantages of the foregoing may be appreciated by way of an example based on a particular set of parameters, in which, for example; p = 18 dB, and (m,16) with m ≤ 16, and in which
transmitter 100 and receiver 200 (FIG. 1) may have antenna arrays of up to 16 antennas. Also, assume that 95% of the transmission bursts are free of errors (i.e., at most a 5% outage), and an ideal Rayleigh propagation environment forspace 125. Further assume that each burst contains, besides training vectors, 100 vector symbols. For the assumed parameters and 16 x 16 system, the Shannon capacity is 79.1 bps/Hz. (Note that "Shannon capacity" is a well-known term in the art.) - The number of transmit antennas, m, and the number of points in each of the planar constellations, K, may be optimized to maximize the number of bps/Hz. The number of constellation points in m-D (or n-D) complex space may be expressed as follows:
The optimization process involves performing the following procedure to iteratively explore m = 1, 2, 3, ... 16. For each of these cases, as many bits per 2-D constellation may be used, to the point where one more bit would violate the so-called 5% "outage constraint"1.
1 When the number of constellation points was greater than two and not a perfect square we used a regular constellation with good distance properties. For example, for an 8 point constellation we used a square with four equilateral triangles attached to the four sides and pointing outward. The vertices of the square, along with the four triangle vertices that oppose each of the four sides of the square, made up the constellation.
The equation for the probability of at least one error in a block with K vector symbols is shown below as equation (10). Evaluation of this probability requires that the SNR(i) for 1 ≤ i ≤ m. Monte-Carlo generated H realizations may be used to get samples of the m SNRs. For K point QAM constellations the formula in the large ρ realm is
where Pb (.) is the well known function for the probability of bit error of a 2-D constellation as a function of SNR, namely:
where - Using equations (9) and (10), and starting with m = 1 the system of FIG. 1 may support K = 128 point constellations or equivalently 7 bps/Hz. For m = 2 the system can support a 32 point planar constellation of 5 bps/Hz. For m = 7, the system can support 16 point constellations of 4 bps/Hz. For m = 12, the system can support 3 bps/Hz, which is one of the higher dimensional constellations of 812 = 68,719,476,736 points or 36 bps/Hz.
- The foregoing is merely illustrative of the principles of the invention. Those skilled in the art will be able to devise numerous arrangements, which, although not explicitly shown or described herein, nevertheless embody those principles that are within the scope of the invention. For example, instead of maintaining a constant BER and outage probability, the skilled artisan could maintain a constant transmitted power, and express the relative merit of the two approaches in terms of a difference in outage probability as a function of rate. As another example, the skilled artisan could hold the BER and outage probability constant for both systems, and express the relative merit in terms of transmitter power, or, the life of a battery in a portable system.
- In addition, those skilled in the prior art would recognize from the foregoing that the notion of using more transmit antennas than transmit radios at the transmitter and selecting a subset of antennas on which to transmit, could be similarly applied to the receiver. In that case, more receive antennas would be deployed than receive radios and a subset of the receive antennas on which to receive a transmitted vector signal would be selected.
- Those skilled in the relevant art would also recognize from the foregoing that in certain applications of the claimed invention it may be desirable to use only a subset of the inventive features. For example, it may be desirable to use just nulling but not cancellation and reordering, or else nulling and cancellation but not ordering.
Claims (16)
- A communications system comprising a transmitter (100) having k antennas (110) and a receiver (200) having n antennas (120) for receiving signals from said transmitter (100) as n-dimensional received signal vectors, where n ≥ k, each of said received signal vectors comprising a linear combination of symbols from said transmitter (100) and additive noise, said communications system being CHARACTERIZED in that
said transmitter (100) is responsive to receipt of an m-dimensional transmit symbol vector from a source (50), components of said transmit symbol vector comprising Quadrature Amplitude Modulation i.e. QAM symbols, said transmit symbol vector being transmitted over m of the k antennas (110) using a predetermined modulation technique, where k ≥ m > 1, and
wherein said receiver (200) is further CHARACTERIZED by
a detection processor (201) that processes the n-dimensional received signal vector to form an estimate of the m-dimensional transmit symbol vector, the detection processor (201) further comprising
a processor (60) for a) determining a preferred permutation of integers 1, 2, ... m, which define an order in which said m components of said transmit symbol vector are estimated, and in which the preferred permutation is a function of the signal-to-noise ratios of the m components, and b) for then estimating, in the order defined by said preferred permutation, the i-th ordered component of the transmit symbol vector by nulling out from the received signal vector contributions due to transmit symbol vector components i+1, i+2, ... m which have not yet been estimated, and canceling out from the received signal vector contributions due to transmit symbol vector components. 1, 2, ... i-1 which have already been estimated, where i denotes the i-th element of the preferred permutation. - The communications system of claim 1 wherein signals received by said receiver are, at least in part, training signals, and wherein the detection processor (201) is arranged to repeatedly process the received training signals characterizing the signal propagation environment to generate a set of m spatially matched filter vectors, offering the best Signal-to-Noise Ratio (SNR) for detecting the m transmitted symbols.
- The communications system of claim 1 wherein the order for detecting the m transmitted symbols maximizes the minimum of the m signal-to-noise ratios of the detection process.
- The communications system of claim 1 wherein the selection of the transmitter antennas (110) is randomly changed prior to the transmission of a group of transmit vector symbols.
- The communications system of claim 1 further comprising a feedback channel from the receiver to the transmitter and wherein the selection of the transmitter antennas (110) is optimized based on signal propagation environment information that the receiver (200) supplies to the transmitter (100) via the feedback channel.
- The communications system of claim 1 further comprising a feedback channel from the receiver (200) to the transmitter (100) and wherein the transmitter (100) transmits substreams of a demultiplexed stream of symbols supplied by a source (50) over respective ones of a predetermined set of transmit antennas (110) and changes the selection of antennas forming the set of antennas based on signal propagation environment information supplied by the receiver (200) via the feedback channel.
- The communications system of claim 1 further comprising a feedback channel from the receiver (200) to the transmitter (100) and wherein the transmitter (100) transmits a vector symbol over a subset of the k transmitter antennas (110), in which the subset is selected based on signal propagation environment information supplied by the receiver (200) via a feedback channel.
- The communications system of claim 1 wherein the receiver (200) has an arbitrary number of receive antennas (120) greater than n and wherein the n antennas that are used to receive signals from said transmitter (100) as n-dimensional received signal vectors is a subset of the arbitrary number of receive antennas (120).
- The communications system of claim 1 wherein the rate at which symbols may be received accurately at the receiver (200) is proportional to the number of transmit antennas (110) used to transmit the symbols and logarithmic in the level of transmitted power so that the level of power at which symbols may be transmitted at the transmitter (100) may be substantially decreased by increasing the number of transmit antennas (110) by a relatively small number.
- A wireless transmitter for a communications system as claimed in any of the claims 1-9 comprising
a source (50) of a stream of symbols,
a plurality of transmitter antennas (110), and CHARACTERIZED BY
a transmitter processor (100) which demultiplexes the symbol stream into m substreams of symbols and which then transmits each substream of symbols over a selected one of the transmitter antennas (110) using a predetermined modulation technique. - The transmitter of claim 10 wherein said plurality of transmitter antennas (110) is greater than m antennas, where m > 1, and wherein selection of the m transmitter antennas (110) used to transmit the m substreams of symbols is arbitrary.
- The transmitter of claim 10 wherein the selection of the transmitter antennas (110) is randomly changed prior to the transmission of a group of symbols.
- The transmitter of claim 10 further comprising a feedback channel from a receiver of the transmitted symbols to the transmitter and wherein the transmitter transmits a vector symbol over a subset of the plurality of transmitter antennas (110), in which the subset is selected based on signal propagation environment information received from the receiver (200) via the feedback channel.
- A wireless receiver for a communications system as claimed in any of the claims 1-9 comprising
a plurality of receiver antennas (120) for respectively receiving a plurality of n signal components forming a received signal vector, where n > 1, and
CHARACTERIZED BY
a processor (60) that stores a received signal vector in memory (61) with other received signal vectors forming a burst of signal vectors, and
a detection processor (201) which processes the stored received signal vector to determine components of a transmitted signal vector in an order determined as a function of respective signal-to-noise ratios determined for particular decision statistics so that a) interference stemming from transmitted symbol vector components that have been processed are canceled out of a signal vector that is currently being processed, b) interference stemming from transmitted symbol vector components that have not yet been processed is nulled out of the signal vector that is currently being processed by projecting the signal vector orthogonal to a space occupied by the latter interference, and then processing the projected signal vector in accordance with a predetermined demodulation technique to identify the components of the transmitted symbol vector. - The receiver of claim 14 wherein the detection processor (201) includes repeatedly processing data characterizing the transmission environment to generate a set of m spatially matched filter vectors offering the best Signal-to-Noise Ratio (SNR) for detecting the components of the transmitted symbol vector.
- The receiver of claim 14 wherein the order for detecting the components of the transmitted symbol vector is to maximize the minimum signal-to-noise ratio of the detection process.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US60657 | 1998-04-15 | ||
US09/060,657 US6317466B1 (en) | 1998-04-15 | 1998-04-15 | Wireless communications system having a space-time architecture employing multi-element antennas at both the transmitter and receiver |
Publications (3)
Publication Number | Publication Date |
---|---|
EP0951091A2 EP0951091A2 (en) | 1999-10-20 |
EP0951091A3 EP0951091A3 (en) | 2003-06-04 |
EP0951091B1 true EP0951091B1 (en) | 2007-10-10 |
Family
ID=22030957
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP99302692A Expired - Lifetime EP0951091B1 (en) | 1998-04-15 | 1999-04-07 | Wireless communications system having a space-time architecture employing multi-element antennas at both the transmitter and receiver |
Country Status (5)
Country | Link |
---|---|
US (2) | US6317466B1 (en) |
EP (1) | EP0951091B1 (en) |
JP (1) | JP3929639B2 (en) |
KR (1) | KR100607834B1 (en) |
DE (1) | DE69937268T2 (en) |
Families Citing this family (151)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6185258B1 (en) | 1997-09-16 | 2001-02-06 | At&T Wireless Services Inc. | Transmitter diversity technique for wireless communications |
JP3660361B2 (en) * | 1997-10-31 | 2005-06-15 | エイ ティ アンド ティ ワイヤレス サービス インコーポレイテッド | Simple maximum likelihood detection of concatenated spatial codes for wireless devices |
US6188736B1 (en) * | 1997-12-23 | 2001-02-13 | At&T Wireless Svcs. Inc. | Near-optimal low-complexity decoding of space-time codes for fixed wireless applications |
US6459740B1 (en) | 1998-09-17 | 2002-10-01 | At&T Wireless Services, Inc. | Maximum ratio transmission |
US7076228B1 (en) | 1999-11-10 | 2006-07-11 | Rilling Kenneth F | Interference reduction for multiple signals |
US6128330A (en) | 1998-11-24 | 2000-10-03 | Linex Technology, Inc. | Efficient shadow reduction antenna system for spread spectrum |
US6067290A (en) * | 1999-07-30 | 2000-05-23 | Gigabit Wireless, Inc. | Spatial multiplexing in a cellular network |
US6757265B1 (en) * | 1999-07-30 | 2004-06-29 | Iospan Wireless, Inc. | Subscriber unit in a hybrid link incorporating spatial multiplexing |
WO2001010156A1 (en) | 1999-07-30 | 2001-02-08 | Iospan Wireless, Inc. | Spatial multiplexing in a cellular network |
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 |
US6298092B1 (en) | 1999-12-15 | 2001-10-02 | Iospan Wireless, Inc. | Methods of controlling communication parameters of wireless systems |
US6922445B1 (en) | 1999-12-15 | 2005-07-26 | Intel Corporation | Method and system for mode adaptation in wireless communication |
US6804312B1 (en) * | 2000-01-11 | 2004-10-12 | At&T Corp. | Methods and systems for spatial processing |
US6888809B1 (en) * | 2000-01-13 | 2005-05-03 | Lucent Technologies Inc. | Space-time processing for multiple-input, multiple-output, wireless systems |
US7477703B2 (en) * | 2000-02-22 | 2009-01-13 | Nokia Mobile Phones, Limited | Method and radio system for digital signal transmission using complex space-time codes |
US6865237B1 (en) | 2000-02-22 | 2005-03-08 | Nokia Mobile Phones Limited | Method and system for digital signal transmission |
US6542556B1 (en) | 2000-03-31 | 2003-04-01 | Nokia Mobile Phones Ltd. | Space-time code for multiple antenna transmission |
GB2363256B (en) * | 2000-06-07 | 2004-05-12 | Motorola Inc | Adaptive antenna array and method of controlling operation thereof |
US8363744B2 (en) | 2001-06-10 | 2013-01-29 | Aloft Media, Llc | Method and system for robust, secure, and high-efficiency voice and packet transmission over ad-hoc, mesh, and MIMO communication networks |
US6937592B1 (en) * | 2000-09-01 | 2005-08-30 | Intel Corporation | Wireless communications system that supports multiple modes of operation |
US6760882B1 (en) | 2000-09-19 | 2004-07-06 | Intel Corporation | Mode selection for data transmission in wireless communication channels based on statistical parameters |
FI20002845A (en) * | 2000-12-22 | 2002-06-23 | Nokia Corp | Digital signal transmission |
US7006579B2 (en) * | 2000-09-29 | 2006-02-28 | Nokia Corporation | ISI-robust slot formats for non-orthogonal-based space-time block codes |
US6567387B1 (en) * | 2000-11-07 | 2003-05-20 | Intel Corporation | System and method for data transmission from multiple wireless base transceiver stations to a subscriber unit |
US6646615B2 (en) * | 2000-12-08 | 2003-11-11 | Lucent Technologies Inc. | Method and apparatus for wireless communication utilizing electrical and magnetic polarization |
US6850498B2 (en) | 2000-12-22 | 2005-02-01 | Intel Corporation | Method and system for evaluating a wireless link |
US7558310B1 (en) | 2001-01-09 | 2009-07-07 | Urbain Alfred von der Embse | Multi-scale code division frequency/wavelet multiple access |
US7394792B1 (en) | 2002-10-08 | 2008-07-01 | Urbain A. von der Embse | Multi-scale CDMA |
US20020128026A1 (en) * | 2001-01-15 | 2002-09-12 | Derryberry Roy Thomas | System and method for channel prediction for closed loop diversity |
US7116722B2 (en) * | 2001-02-09 | 2006-10-03 | Lucent Technologies Inc. | Wireless communication system using multi-element antenna having a space-time architecture |
DE10114052C1 (en) * | 2001-03-15 | 2002-07-25 | Hertz Inst Heinrich | Radio transmission method within closed space uses simultaneous transmission and reception antenna elements and space-time encoders and decoders |
US20020136287A1 (en) * | 2001-03-20 | 2002-09-26 | Heath Robert W. | Method, system and apparatus for displaying the quality of data transmissions in a wireless communication system |
US6771706B2 (en) | 2001-03-23 | 2004-08-03 | Qualcomm Incorporated | Method and apparatus for utilizing channel state information in a wireless communication system |
US6748024B2 (en) | 2001-03-28 | 2004-06-08 | Nokia Corporation | Non-zero complex weighted space-time code for multiple antenna transmission |
GB0110125D0 (en) | 2001-04-25 | 2001-06-20 | Koninkl Philips Electronics Nv | Radio communication system |
EP1255369A1 (en) | 2001-05-04 | 2002-11-06 | TELEFONAKTIEBOLAGET LM ERICSSON (publ) | Link adaptation for wireless MIMO transmission schemes |
US6785341B2 (en) * | 2001-05-11 | 2004-08-31 | Qualcomm Incorporated | Method and apparatus for processing data in a multiple-input multiple-output (MIMO) communication system utilizing channel state information |
US7047016B2 (en) * | 2001-05-16 | 2006-05-16 | Qualcomm, Incorporated | Method and apparatus for allocating uplink resources in a multiple-input multiple-output (MIMO) communication system |
US7688899B2 (en) * | 2001-05-17 | 2010-03-30 | Qualcomm Incorporated | Method and apparatus for processing data for transmission in a multi-channel communication system using selective channel inversion |
US6865373B2 (en) * | 2001-05-21 | 2005-03-08 | Nortel Networks Limited | Apparatus and method for encoding and decoding data within wireless networks |
US7397826B2 (en) | 2001-06-21 | 2008-07-08 | Koninklijke Philips Electronics N.V. | MIMO transmission system in a radio communications network |
GB0115937D0 (en) * | 2001-06-29 | 2001-08-22 | Koninkl Philips Electronics Nv | Radio communication system |
US7149254B2 (en) * | 2001-09-06 | 2006-12-12 | Intel Corporation | Transmit signal preprocessing based on transmit antennae correlations for multiple antennae systems |
US7269224B2 (en) | 2001-09-17 | 2007-09-11 | Bae Systems Information And Electronic Systems Integration Inc. | Apparatus and methods for providing efficient space-time structures for preambles, pilots and data for multi-input, multi-output communications systems |
US7227905B2 (en) * | 2001-09-18 | 2007-06-05 | Lucent Technologies Inc. | Open-loop diversity technique for systems employing multi-transmitter antennas |
US7269127B2 (en) * | 2001-10-04 | 2007-09-11 | Bae Systems Information And Electronic Systems Integration Inc. | Preamble structures for single-input, single-output (SISO) and multi-input, multi-output (MIMO) communication systems |
US7218906B2 (en) * | 2001-10-04 | 2007-05-15 | Wisconsin Alumni Research Foundation | Layered space time processing in a multiple antenna system |
US20030067890A1 (en) * | 2001-10-10 | 2003-04-10 | Sandesh Goel | System and method for providing automatic re-transmission of wirelessly transmitted information |
US20030125040A1 (en) | 2001-11-06 | 2003-07-03 | Walton Jay R. | Multiple-access multiple-input multiple-output (MIMO) communication system |
US7039136B2 (en) * | 2001-11-19 | 2006-05-02 | Tensorcomm, Inc. | Interference cancellation in a signal |
US7012883B2 (en) * | 2001-11-21 | 2006-03-14 | Qualcomm Incorporated | Rate selection for an OFDM system |
US7336719B2 (en) * | 2001-11-28 | 2008-02-26 | Intel Corporation | System and method for transmit diversity base upon transmission channel delay spread |
AU2002231747A1 (en) | 2002-01-09 | 2003-07-24 | Nokia Corporation | Method and receiver for reception of a composite signal |
EP1337053B1 (en) * | 2002-02-15 | 2004-06-23 | Siemens Aktiengesellschaft | Method and radio communications system for signalling of channel informations |
AU2003219882A1 (en) | 2002-03-01 | 2003-09-16 | Cognio, Inc. | System and method for joint maximal ratio combining |
US6687492B1 (en) | 2002-03-01 | 2004-02-03 | Cognio, Inc. | System and method for antenna diversity using joint maximal ratio combining |
US6862456B2 (en) | 2002-03-01 | 2005-03-01 | Cognio, Inc. | Systems and methods for improving range for multicast wireless communication |
US6785520B2 (en) | 2002-03-01 | 2004-08-31 | Cognio, Inc. | System and method for antenna diversity using equal power joint maximal ratio combining |
US6873651B2 (en) * | 2002-03-01 | 2005-03-29 | Cognio, Inc. | System and method for joint maximal ratio combining using time-domain signal processing |
US6871049B2 (en) | 2002-03-21 | 2005-03-22 | Cognio, Inc. | Improving the efficiency of power amplifiers in devices using transmit beamforming |
US7012978B2 (en) * | 2002-03-26 | 2006-03-14 | Intel Corporation | Robust multiple chain receiver |
FI20020880A0 (en) * | 2002-05-08 | 2002-05-08 | Nokia Corp | Procedure for data communication and data transmission systems |
KR100483387B1 (en) * | 2002-05-08 | 2005-04-14 | 재단법인서울대학교산학협력재단 | Wireless communication system employing multi-element antennas at both the transmitter and receiver and method thereof |
US6862502B2 (en) | 2002-05-15 | 2005-03-01 | General Electric Company | Intelligent communications, command, and control system for a land-based vehicle |
US7327800B2 (en) * | 2002-05-24 | 2008-02-05 | Vecima Networks Inc. | System and method for data detection in wireless communication systems |
GB0212165D0 (en) | 2002-05-27 | 2002-07-03 | Nokia Corp | A wireless system |
EP1367760B1 (en) * | 2002-05-27 | 2009-11-18 | Nokia Corporation | Transmit/receive diversity wireless communication |
US20030235252A1 (en) * | 2002-06-19 | 2003-12-25 | Jose Tellado | Method and system of biasing a timing phase estimate of data segments of a received signal |
US7136437B2 (en) * | 2002-07-17 | 2006-11-14 | Lucent Technologies Inc. | Method and apparatus for receiving digital wireless transmissions using multiple-antenna communication schemes |
US20040017860A1 (en) * | 2002-07-29 | 2004-01-29 | Jung-Tao Liu | Multiple antenna system for varying transmission streams |
EP1983651B1 (en) | 2002-07-30 | 2014-11-05 | IPR Licensing, Inc. | Device for multiple-input multiple output (MIMO) radio communication |
US8179864B2 (en) | 2002-08-06 | 2012-05-15 | Rockstar Bidco Lp | Method of controlling a communications link |
KR100550720B1 (en) * | 2002-08-19 | 2006-02-08 | 엘지전자 주식회사 | signal processing apparatus and method of multi input multi output communication system |
US8194770B2 (en) | 2002-08-27 | 2012-06-05 | Qualcomm Incorporated | Coded MIMO systems with selective channel inversion applied per eigenmode |
US7031669B2 (en) * | 2002-09-10 | 2006-04-18 | Cognio, Inc. | Techniques for correcting for phase and amplitude offsets in a MIMO radio device |
US7349438B2 (en) | 2002-09-17 | 2008-03-25 | Lucent Technologies Inc. | Formatter, method of formatting encoded symbols and wireless communication system employing the same |
US7633923B2 (en) * | 2002-09-30 | 2009-12-15 | Koninklijke Philips Electronics N.V. | Transmission system for transmitting an information signal via a plurality of subchannels from a transmitter to a receiver |
US7889819B2 (en) * | 2002-10-04 | 2011-02-15 | Apurva Mody | Methods and systems for sampling frequency offset detection, correction and control for MIMO OFDM systems |
US7002900B2 (en) | 2002-10-25 | 2006-02-21 | Qualcomm Incorporated | Transmit diversity processing for a multi-antenna communication system |
US8320301B2 (en) | 2002-10-25 | 2012-11-27 | Qualcomm Incorporated | MIMO WLAN system |
US8218609B2 (en) | 2002-10-25 | 2012-07-10 | Qualcomm Incorporated | Closed-loop rate control for a multi-channel communication system |
US7986742B2 (en) | 2002-10-25 | 2011-07-26 | Qualcomm Incorporated | Pilots for MIMO communication system |
US7324429B2 (en) | 2002-10-25 | 2008-01-29 | Qualcomm, Incorporated | Multi-mode terminal in a wireless MIMO system |
US8208364B2 (en) | 2002-10-25 | 2012-06-26 | Qualcomm Incorporated | MIMO system with multiple spatial multiplexing modes |
US8134976B2 (en) | 2002-10-25 | 2012-03-13 | Qualcomm Incorporated | Channel calibration for a time division duplexed communication system |
US8570988B2 (en) | 2002-10-25 | 2013-10-29 | Qualcomm Incorporated | Channel calibration for a time division duplexed communication system |
US8169944B2 (en) | 2002-10-25 | 2012-05-01 | Qualcomm Incorporated | Random access for wireless multiple-access communication systems |
US8170513B2 (en) | 2002-10-25 | 2012-05-01 | Qualcomm Incorporated | Data detection and demodulation for wireless communication systems |
US20040081131A1 (en) | 2002-10-25 | 2004-04-29 | Walton Jay Rod | OFDM communication system with multiple OFDM symbol sizes |
AU2003284444A1 (en) * | 2002-11-26 | 2004-06-18 | Matsushita Electric Industrial Co., Ltd. | Communication method, transmitter apparatus and receiver apparatus |
KR20040046322A (en) * | 2002-11-27 | 2004-06-05 | 엘지전자 주식회사 | Signal Processing Apparatus and Method of Multi Input, Multi Output Mobile Communication System |
US7209522B1 (en) | 2002-12-12 | 2007-04-24 | Marvell International Ltd. | Blast MIMO signal processing method and apparatus |
US20040116146A1 (en) * | 2002-12-13 | 2004-06-17 | Sadowsky John S. | Cellular system with link diversity feedback |
KR100552669B1 (en) | 2002-12-26 | 2006-02-20 | 한국전자통신연구원 | Adaptive Modulation Method for MIMO System using Layered Time-Space detector |
US7386057B2 (en) * | 2003-02-20 | 2008-06-10 | Nec Corporation | Iterative soft interference cancellation and filtering for spectrally efficient high-speed transmission in MIMO systems |
US7327795B2 (en) * | 2003-03-31 | 2008-02-05 | Vecima Networks Inc. | System and method for wireless communication systems |
GB0307471D0 (en) | 2003-04-01 | 2003-05-07 | Qinetiq Ltd | Signal Processing apparatus and method |
US7099678B2 (en) | 2003-04-10 | 2006-08-29 | Ipr Licensing, Inc. | System and method for transmit weight computation for vector beamforming radio communication |
US7688902B1 (en) | 2003-04-16 | 2010-03-30 | Marvell International Ltd. | Joint space-time block decoding and viterbi decoding |
FR2854995B1 (en) * | 2003-05-14 | 2005-07-29 | Nortel Networks Ltd | SPECTRUM DISPLAY MODULATOR AND DEMODULATOR |
US7079870B2 (en) * | 2003-06-09 | 2006-07-18 | Ipr Licensing, Inc. | Compensation techniques for group delay effects in transmit beamforming radio communication |
US7352718B1 (en) | 2003-07-22 | 2008-04-01 | Cisco Technology, Inc. | Spatial division multiple access for wireless networks |
JP2005057497A (en) * | 2003-08-04 | 2005-03-03 | Science Univ Of Tokyo | Radio transmission control method, radio receiving device and radio transmitting device |
US7356089B2 (en) | 2003-09-05 | 2008-04-08 | Nortel Networks Limited | Phase offset spatial multiplexing |
US6917821B2 (en) | 2003-09-23 | 2005-07-12 | Qualcomm, Incorporated | Successive interference cancellation receiver processing with selection diversity |
US7120395B2 (en) | 2003-10-20 | 2006-10-10 | Nortel Networks Limited | MIMO communications |
US9473269B2 (en) | 2003-12-01 | 2016-10-18 | Qualcomm Incorporated | Method and apparatus for providing an efficient control channel structure in a wireless communication system |
US8204149B2 (en) | 2003-12-17 | 2012-06-19 | Qualcomm Incorporated | Spatial spreading in a multi-antenna communication system |
CA2490969C (en) * | 2004-01-02 | 2014-06-17 | Her Majesty In Right Of Canada As Represented By The Minister Of Industry, Through The Communications Research Centre Canada | Method for updating singular value decomposition of a transfer matrix |
US7336746B2 (en) * | 2004-12-09 | 2008-02-26 | Qualcomm Incorporated | Data transmission with spatial spreading in a MIMO communication system |
KR100850990B1 (en) | 2004-01-20 | 2008-08-12 | 엘지전자 주식회사 | Method for transmitting/receiving signal in mimo system |
US7430190B2 (en) * | 2004-01-22 | 2008-09-30 | The Regents Of The University Of California | Systems and methods for resource allocation to multiple antenna arrays for maintaining a constant bit rate (CBR) channel |
SE0400370D0 (en) | 2004-02-13 | 2004-02-13 | Ericsson Telefon Ab L M | Adaptive MIMO architecture |
US20050180312A1 (en) * | 2004-02-18 | 2005-08-18 | Walton J. R. | Transmit diversity and spatial spreading for an OFDM-based multi-antenna communication system |
US8169889B2 (en) | 2004-02-18 | 2012-05-01 | Qualcomm Incorporated | Transmit diversity and spatial spreading for an OFDM-based multi-antenna communication system |
US20050238111A1 (en) * | 2004-04-09 | 2005-10-27 | Wallace Mark S | Spatial processing with steering matrices for pseudo-random transmit steering in a multi-antenna communication system |
US8923785B2 (en) * | 2004-05-07 | 2014-12-30 | Qualcomm Incorporated | Continuous beamforming for a MIMO-OFDM system |
US8285226B2 (en) * | 2004-05-07 | 2012-10-09 | Qualcomm Incorporated | Steering diversity for an OFDM-based multi-antenna communication system |
KR100754660B1 (en) | 2004-06-19 | 2007-09-03 | 삼성전자주식회사 | System and method for allocating adaptive modulation and coding sub-channel in communication system |
US8116262B2 (en) * | 2004-06-22 | 2012-02-14 | Rockstar Bidco Lp | Methods and systems for enabling feedback in wireless communication networks |
US7110463B2 (en) * | 2004-06-30 | 2006-09-19 | Qualcomm, Incorporated | Efficient computation of spatial filter matrices for steering transmit diversity in a MIMO communication system |
US7978649B2 (en) | 2004-07-15 | 2011-07-12 | Qualcomm, Incorporated | Unified MIMO transmission and reception |
FR2873878A1 (en) | 2004-08-02 | 2006-02-03 | Nortel Networks Ltd | Encoded information radio transmission performing method for radio transmitter, involves transmitting sequences on respective physical information channels by utilizing transmission antennae |
US7978778B2 (en) | 2004-09-03 | 2011-07-12 | Qualcomm, Incorporated | Receiver structures for spatial spreading with space-time or space-frequency transmit diversity |
JP4387282B2 (en) * | 2004-10-20 | 2009-12-16 | 株式会社エヌ・ティ・ティ・ドコモ | Signal separation device and signal separation method |
CN100373811C (en) * | 2004-12-10 | 2008-03-05 | 电子科技大学 | Method for signal testing of distributed type multiinput-multioutput system |
CN1805305A (en) * | 2005-01-13 | 2006-07-19 | 松下电器产业株式会社 | Adaptive space-time transmit diversity method and apparatus by means of antenna selection |
US7525988B2 (en) | 2005-01-17 | 2009-04-28 | Broadcom Corporation | Method and system for rate selection algorithm to maximize throughput in closed loop multiple input multiple output (MIMO) wireless local area network (WLAN) system |
RU2408988C2 (en) * | 2005-03-31 | 2011-01-10 | Нтт Досомо, Инк. | Device and method of radio communication |
JP4884722B2 (en) | 2005-03-31 | 2012-02-29 | 株式会社エヌ・ティ・ティ・ドコモ | Wireless communication apparatus and wireless communication method |
US7436901B2 (en) * | 2005-04-19 | 2008-10-14 | Telefonaktiebolaget Lm Ericsson (Publ) | Selection of channel coding and multidimensional interleaving schemes for improved performance |
US20060251421A1 (en) * | 2005-05-09 | 2006-11-09 | Ben Gurion University Of The Negev, Research And Development Authority | Improved free space optical bus |
US7466749B2 (en) | 2005-05-12 | 2008-12-16 | Qualcomm Incorporated | Rate selection with margin sharing |
US8358714B2 (en) | 2005-06-16 | 2013-01-22 | Qualcomm Incorporated | Coding and modulation for multiple data streams in a communication system |
EP1929752A4 (en) * | 2005-09-30 | 2010-04-14 | Mitsubishi Electric Res Lab | Training signals for selecting antennas and beams in mimo wireless lans |
KR100675205B1 (en) | 2006-01-25 | 2007-01-29 | 삼성전기주식회사 | Antenna selection system using multi-input multi-output and antenna selection method thereof |
US8059609B2 (en) * | 2006-03-20 | 2011-11-15 | Qualcomm Incorporated | Resource allocation to support single-user and multi-user MIMO transmission |
US8543070B2 (en) | 2006-04-24 | 2013-09-24 | Qualcomm Incorporated | Reduced complexity beam-steered MIMO OFDM system |
US8290089B2 (en) * | 2006-05-22 | 2012-10-16 | Qualcomm Incorporated | Derivation and feedback of transmit steering matrix |
US7852964B2 (en) * | 2006-06-19 | 2010-12-14 | Mayflower Communications Company, Inc. | Antijam filter system and method for high fidelity high data rate wireless communication |
KR101099881B1 (en) | 2006-09-06 | 2011-12-28 | 고려대학교 산학협력단 | Method and apparatus for antenna selecting based on orthogonalized spatial multiplexing system |
JP4910651B2 (en) * | 2006-11-16 | 2012-04-04 | 株式会社デンソー | Communication integrated radar device, communication integrated radar system |
WO2009058097A1 (en) * | 2007-10-30 | 2009-05-07 | Agency For Science, Technology And Research | Method for determining a signal vector and detection circuit |
KR101055573B1 (en) * | 2009-03-16 | 2011-08-08 | 주식회사 팬택 | Precoding Device in Multi-User, Multi-antenna Radio Transmission System |
US20110142181A1 (en) * | 2009-11-09 | 2011-06-16 | Amir Leshem | Communication system |
US9197288B2 (en) | 2012-03-12 | 2015-11-24 | Intel Corporation | Determining the signal quality of an electrical interconnect |
US10334515B2 (en) | 2017-01-13 | 2019-06-25 | ENK Wireless, Inc. | Conveying information via auxiliary device selection |
US11075740B2 (en) | 2018-05-07 | 2021-07-27 | ENK Wireless, Inc. | Systems/methods of communications using a plurality of cooperative devices |
US10681716B2 (en) | 2018-05-07 | 2020-06-09 | ENK Wireless, Inc. | Systems/methods of providing increased wireless capacity, vehicular safety, electrical power wirelessly, and device control responsive to geographic position |
US10804998B2 (en) | 2018-05-07 | 2020-10-13 | ENK Wireless, Inc. | Systems/methods of providing increased wireless capacity, vehicular safety, electrical power wirelessly, and device control responsive to geographic position |
US11100796B2 (en) | 2018-05-07 | 2021-08-24 | ENK Wireless, Inc. | Systems/methods of improving vehicular safety |
Family Cites Families (25)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPS58202642A (en) * | 1982-05-21 | 1983-11-25 | Nec Corp | Space diversity receiver |
US4710944A (en) * | 1986-10-17 | 1987-12-01 | Rca Corporation | Dual transmit-receive space diversity communication system |
JPH0338932A (en) * | 1989-07-06 | 1991-02-20 | Oki Electric Ind Co Ltd | Space diversity system |
US5151919A (en) * | 1990-12-17 | 1992-09-29 | Ericsson-Ge Mobile Communications Holding Inc. | Cdma subtractive demodulation |
US5345599A (en) * | 1992-02-21 | 1994-09-06 | The Board Of Trustees Of The Leland Stanford Junior University | Increasing capacity in wireless broadcast systems using distributed transmission/directional reception (DTDR) |
US5479448A (en) * | 1992-03-31 | 1995-12-26 | At&T Corp. | Method and apparatus for providing antenna diversity |
US5260968A (en) * | 1992-06-23 | 1993-11-09 | The Regents Of The University Of California | Method and apparatus for multiplexing communications signals through blind adaptive spatial filtering |
JPH0690225A (en) * | 1992-09-09 | 1994-03-29 | Shodenryoku Kosoku Tsushin Kenkyusho:Kk | Diversity radio receiver |
US5289499A (en) * | 1992-12-29 | 1994-02-22 | At&T Bell Laboratories | Diversity for direct-sequence spread spectrum systems |
US5406588A (en) * | 1993-05-28 | 1995-04-11 | Motorola, Inc. | Method and apparatus for mitigating distortion effects in the determination of signal usability |
US5481570A (en) * | 1993-10-20 | 1996-01-02 | At&T Corp. | Block radio and adaptive arrays for wireless systems |
KR950035142A (en) * | 1994-03-10 | 1995-12-30 | 가나미야지 준 | Receiver, Base Station Receiver and Mobile Station Receiver |
US5442625A (en) * | 1994-05-13 | 1995-08-15 | At&T Ipm Corp | Code division multiple access system providing variable data rate access to a user |
JPH08321785A (en) * | 1995-05-24 | 1996-12-03 | Sony Corp | Transmitter, receiver, transmission method, reception method and transmission method |
CA2186793C (en) * | 1995-11-13 | 2000-12-19 | Vijitha Weerackody | Method and apparatus to implement antenna diversity for direct sequence spread spectrum receivers |
US5960039A (en) * | 1996-04-10 | 1999-09-28 | Lucent Technologies Inc. | Methods and apparatus for high data rate transmission in narrowband mobile radio channels |
EP2184864A3 (en) * | 1996-04-26 | 2011-12-14 | AT & T Corp. | Method and apparatus for data transmission using multiple transmit antennas |
JP2751920B2 (en) * | 1996-06-21 | 1998-05-18 | 日本電気株式会社 | Method and apparatus for synchronously acquiring spread spectrum signal |
US6097771A (en) * | 1996-07-01 | 2000-08-01 | Lucent Technologies Inc. | Wireless communications system having a layered space-time architecture employing multi-element antennas |
JPH1028108A (en) * | 1996-07-11 | 1998-01-27 | Nec Corp | Synthetic diversity receiving system |
CA2302289C (en) * | 1996-08-29 | 2005-11-08 | Gregory G. Raleigh | Spatio-temporal processing for communication |
US5831977A (en) * | 1996-09-04 | 1998-11-03 | Ericsson Inc. | Subtractive CDMA system with simultaneous subtraction in code space and direction-of-arrival space |
US5832044A (en) * | 1996-09-27 | 1998-11-03 | Elvino S. Sousa | Transmitter antenna diversity and fading-resistant modulation for wireless communication systems |
US5933421A (en) * | 1997-02-06 | 1999-08-03 | At&T Wireless Services Inc. | Method for frequency division duplex communications |
US6058105A (en) * | 1997-09-26 | 2000-05-02 | Lucent Technologies Inc. | Multiple antenna communication system and method thereof |
-
1998
- 1998-04-15 US US09/060,657 patent/US6317466B1/en not_active Expired - Lifetime
-
1999
- 1999-04-07 EP EP99302692A patent/EP0951091B1/en not_active Expired - Lifetime
- 1999-04-07 DE DE69937268T patent/DE69937268T2/en not_active Expired - Lifetime
- 1999-04-15 JP JP10735699A patent/JP3929639B2/en not_active Expired - Lifetime
- 1999-04-15 KR KR1019990013355A patent/KR100607834B1/en not_active IP Right Cessation
-
2001
- 2001-06-15 US US09/882,120 patent/US6763073B2/en not_active Expired - Lifetime
Also Published As
Publication number | Publication date |
---|---|
JP2000101667A (en) | 2000-04-07 |
KR100607834B1 (en) | 2006-08-04 |
US6317466B1 (en) | 2001-11-13 |
EP0951091A2 (en) | 1999-10-20 |
KR19990083226A (en) | 1999-11-25 |
DE69937268T2 (en) | 2008-07-03 |
EP0951091A3 (en) | 2003-06-04 |
US6763073B2 (en) | 2004-07-13 |
JP3929639B2 (en) | 2007-06-13 |
DE69937268D1 (en) | 2007-11-22 |
US20010050964A1 (en) | 2001-12-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP0951091B1 (en) | Wireless communications system having a space-time architecture employing multi-element antennas at both the transmitter and receiver | |
CN110463147B (en) | Method for decoding symbols and receiver for receiving and decoding symbols | |
US9596013B2 (en) | Method and device for operating a precoded MIMO system | |
US6477161B1 (en) | Downlink beamforming approach for frequency division duplex cellular systems | |
US8594218B2 (en) | Method of transmitting a precoding matrix in a multi-input multi-output (MIMO) system | |
US8095185B2 (en) | Estimation of angular parameters of a signal at an antenna array | |
CA2287759C (en) | Wireless transmission method for antenna arrays using unitary space-time signals | |
EP1724943A1 (en) | Multiple input-multiple output communication system | |
US7885364B2 (en) | Wireless communication system, receiver, demodulation method used for the system and receiver, and program thereof | |
US7505788B1 (en) | Spatial multiplexing with antenna and constellation selection for correlated MIMO fading channels | |
US6327310B1 (en) | Wireless transmission method for antenna arrays, having improved resistance to fading | |
JPH10505912A (en) | High-resolution signal evaluation method for one-dimensional or two-dimensional direction estimation or frequency estimation | |
US20080009321A1 (en) | Method and system for improving performance in a sparse multi-path environment using reconfigurable arrays | |
US20080032654A1 (en) | Diversity Switching | |
US8233557B2 (en) | Method and system for subspace beamforming for near capacity multiple input multiple output (MIMO) performance | |
CN101174871B (en) | Method and device for multi-antenna beam spacing signal processing | |
US8941538B1 (en) | Iterative technique for fast computation of TxBF steering weights | |
Featherstone et al. | A novel method to improve the performance of Capon's minimum variance estimator | |
Rave et al. | The elimination game or: beam selection based on M-ary sequential competition & elimination | |
Wang et al. | Low complexity channel estimation based on DFT for short range communication | |
Aquino et al. | A Review of Direction of Arrival Estimation Techniques in Massive MIMO 5G Wireless Communication Systems | |
CN111181617A (en) | Method for forming transmitting beam | |
Barriac et al. | Characterizing outage capacity for space-time communication over wideband wireless channels | |
KR20080104651A (en) | A method and apparatus of detecting transmitted signals in a receiver of mimo system | |
Kuutela | Beamforming in frequency division duplex cellular networks |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
AK | Designated contracting states |
Kind code of ref document: A2 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE |
|
AX | Request for extension of the european patent |
Free format text: AL;LT;LV;MK;RO;SI |
|
PUAL | Search report despatched |
Free format text: ORIGINAL CODE: 0009013 |
|
AK | Designated contracting states |
Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE |
|
AX | Request for extension of the european patent |
Extension state: AL LT LV MK RO SI |
|
RIC1 | Information provided on ipc code assigned before grant |
Ipc: 7H 04L 1/06 B Ipc: 7H 04B 7/08 B Ipc: 7H 04B 7/06 B Ipc: 7H 04B 7/204 B Ipc: 7H 01Q 3/26 A |
|
17P | Request for examination filed |
Effective date: 20031122 |
|
AKX | Designation fees paid |
Designated state(s): DE FI FR GB IT NL SE |
|
17Q | First examination report despatched |
Effective date: 20041221 |
|
17Q | First examination report despatched |
Effective date: 20041221 |
|
17Q | First examination report despatched |
Effective date: 20041221 |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): DE FI FR GB IT NL SE |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D |
|
REF | Corresponds to: |
Ref document number: 69937268 Country of ref document: DE Date of ref document: 20071122 Kind code of ref document: P |
|
REG | Reference to a national code |
Ref country code: SE Ref legal event code: TRGR |
|
ET | Fr: translation filed | ||
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
26N | No opposition filed |
Effective date: 20080711 |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: 732E Free format text: REGISTERED BETWEEN 20131121 AND 20131127 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: CD Owner name: ALCATEL-LUCENT USA INC. Effective date: 20131122 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: GC Effective date: 20140410 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: RG Effective date: 20141015 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 17 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 18 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R081 Ref document number: 69937268 Country of ref document: DE Owner name: NOKIA TECHNOLOGIES OY, FI Free format text: FORMER OWNER: LUCENT TECHNOLOGIES INC., MURRAY HILL, N.J., US |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 19 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: TP Owner name: NOKIA TECHNOLOGIES OY, FI Effective date: 20170307 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: PLFP Year of fee payment: 20 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20180329 Year of fee payment: 20 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 20180315 Year of fee payment: 20 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: NL Payment date: 20180412 Year of fee payment: 20 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20180327 Year of fee payment: 20 Ref country code: FI Payment date: 20180410 Year of fee payment: 20 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: IT Payment date: 20180420 Year of fee payment: 20 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: SE Payment date: 20180411 Year of fee payment: 20 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R071 Ref document number: 69937268 Country of ref document: DE |
|
REG | Reference to a national code |
Ref country code: NL Ref legal event code: MK Effective date: 20190406 |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: PE20 Expiry date: 20190406 |
|
REG | Reference to a national code |
Ref country code: SE Ref legal event code: EUG |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GB Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION Effective date: 20190406 |