Abstract:
Apparatus and method that employ a technique which improves SINR in a communication system utilizing MIMO antennas are described. Transmitter and receiver components use fixed transmit and receive beamforming matrices and variable transmit and receive beamforming vectors. A method of channel conditioning using an iterative closed loop process is also described.

Description:
CROSS REFERENCE TO RELATED APPLICATION(S) 
       [0001]    This application is a continuation of U.S. patent application Ser. No. 11/167,736, filed Jun. 27, 2005, which claims the benefit of U.S. Provisional Patent Application No. 60/599,542, filed Aug. 6, 2004, which are both incorporated by reference as if fully set forth. 
     
    
     FIELD OF INVENTION 
       [0002]    The present invention relates to wireless communication systems with Multiple-Input Multiple-Output (MIMO) antennas. Specifically, the invention relates to conditioning the spatial channel by using beamforming techniques. 
       BACKGROUND 
       [0003]    Wireless communication systems are well known in the art. Generally, such systems comprise communication stations, which transmit and receive wireless communication signals between each other. Depending upon the type of system, communication stations typically are one of two types of wireless units: one type is the base station (BS), and the other is the wireless transmit/receive unit (WTRU), which may be mobile. 
         [0004]    The term base station (BS) as used herein includes, but is not limited to, a base station, access point, Node B, site controller, or other interfacing device in a wireless environment that provides WTRUs with wireless access to a network with which the access point is associated. 
         [0005]    The term wireless transmit/receive unit (WTRU) as used herein includes, but is not limited to, a user equipment, mobile station, fixed or mobile subscriber unit, pager, or any other type of device capable of operating in a wireless environment. Such WTRUs include personal communication devices, such as phones, video phones, and Internet ready phones that have network connections. In addition, WTRUs include portable personal computing devices, such as PDAs and notebook computers with wireless modems that have similar network capabilities. WTRUs that are portable or can otherwise change location are referred to as mobile units. 
         [0006]    Typically, a network of base stations is provided wherein each base station is capable of conducting concurrent wireless communications with appropriately configured WTRUs, as well as multiple appropriately configured base stations. Some WTRUs may alternatively be configured to conduct wireless communications directly between each other, i.e., without being relayed through a network via a base station. This is commonly called peer-to-peer wireless communications. Where a WTRU is configured to communicate directly with other WTRUs it may itself also be configured as and function as a base station. WTRUs can be configured for use in multiple networks, with both network and peer-to-peer communications capabilities. 
         [0007]    One type of wireless system, called a wireless local area network (WLAN), can be configured to conduct wireless communications with WTRUs equipped with WLAN modems that are also able to conduct peer-to-peer communications with similarly equipped WTRUs. Currently, WLAN modems are being integrated into many traditional communicating and computing devices by manufacturers. For example, cellular phones, personal digital assistants, and laptop computers are being built with one or more WLAN modems. 
         [0008]    Popular WLAN environments with one or more WLAN base stations, typically called access points (APs), are built according to the IEEE 802 family of standards. Access to these networks usually requires user authentication procedures. Protocols for such systems are presently being standardized in the WLAN technology area such as the framework of protocols provided in the IEEE 802 family of standards. 
         [0009]      FIG. 1  illustrates a conventional wireless communication environment in which WTRUs conduct wireless communications via a network station, in this case an AP of a WLAN. The AP is connected with other network infrastructure of the WLAN such as an Access Controller (AC). The AP is shown as conducting communications with five WTRUs. The communications are coordinated and synchronized through the AP. Such a configuration is also called a basic service set (BSS) within WLAN contexts. 
         [0010]    In the wireless cellular context, one current standard in widespread use is known as Global System for Mobile Telecommunications (GSM). This is considered as a so-called Second Generation mobile radio system standard (2G) and was followed by its revision (2.5G). General Packet Radio Service (GPRS) and Enhanced Data for GSM Evolution (EDGE) are examples of 2.5G technologies that offer relatively high speed data service on top of (2G) GSM networks. Each one of these standards sought to improve upon the prior standard with additional features and enhancements. In January 1998, the European Telecommunications Standard Institute—Special Mobile Group (ETSI SMG) agreed on a radio access scheme for Third Generation Radio Systems called Universal Mobile Telecommunications Systems (UMTS). To further implement the UMTS standard, the Third Generation Partnership Project (3GPP) was formed in December 1998. 3GPP continues to work on a common third generational mobile radio standard. In addition to the 3GPP standards, 3GPP2 standards are being developed that use Mobile IP in a Core Network for mobility. 
         [0011]    Much of the development of wireless communication systems has been motivated by the desire to reduce communication errors, improve range and throughput, and minimize costs. Most recent advances have been made possible by exploiting diversity in the time, frequency and code dimensions of communication signals. U.S. Pat. No. 5,614,914, which issued on Mar. 25, 1997 and is assigned to the assignee of the present invention, is an example of utilizing diversity to improve wireless communications. 
         [0012]    Since the mid 1990s, the development of Multiple-Input Multiple-Output (MIMO) systems has led to increases in throughput without increasing transmission power or bandwidth, by exploiting the spatial diversity of the wireless communication channel. Much research effort on MIMO systems has been directed towards finding methods to improve throughput or signal to noise ratio (SNR) with given wireless channel conditions. Prior research has focused on using either space time coding (STC) or so-called water-filling applications over time, frequency, and space. The present invention utilizes a different approach, improving throughput and SNR by conditioning the channel. This approach can be used independently or in combination with other methods. 
         [0013]    The improvement of spatial diversity presents a significant challenge. Increasing spatial diversity in MIMO systems may be exploited to achieve higher throughput for a given transmit power and bandwidth than Single-Input Single-Output (SISO), Single-Input Multiple-Output (SIMO) or Multiple-Input Single-Output (MISO) systems. A common technique for increasing spatial diversity is by physically relocating, moving, and/or adding antennas to the system. However this is not always possible. When it is not possible to add more antennas or adjust their positions, a typical MIMO system&#39;s ability to exploit available spatial diversity in the channel is limited to the channel condition defined by the physical configuration of the transmit and receive antennas. The inventors have recognized that is possible to improve communications in spite of such limitation and have devised the present invention for conditioning the channel. 
       SUMMARY 
       [0014]    The present invention is characterized by method and apparatus for conditioning a MIMO communication channel by adjusting the sensitivity or individual antenna element “weight” of the antenna arrays at the transmitter and/or the receiver. In the transmitter and/or the receiver, the “weight” assigned to each antenna is determined by a “beamforming vector.” The beamforming vector allows the combined multiple antennas in each of the transmitter and the receiver to have a directional or otherwise controllable character. In the transmitter, this allows the transmit power to be directed in a preferred direction, or to be better matched to the characteristics of the channel. In the receiver, this allows the receiver sensitivity to be enhanced in a preferred direction, or enhanced for desired signals, or to be better matched to the characteristics of the channel. A transmit or receive antenna array that is better matched to the channel is one that improves the Signal Interference Noise Ratio (SINR), the Packet Error Rate (PER), or some preferred characteristic of the desired transmitted or received signals, respectively. 
         [0015]    A closed loop process is preferably used to determine and implement a choice transmit (TX) beamforming vector in the transmitter. The process can be based on a characteristic of the signal received at the receiver, such as the SINR or PER, or can be based on movement in the system. The choice TX beamforming vector can be one of a predefined set, or can be calculated in the receiver or in the transmitter using a determined channel matrix. A choice receiver (RX) beamforming vector can optionally also be implemented. The choice RX beamforming vector can be one of a predefined set, or can be calculated in the receiver or in the transmitter using the channel matrix. 
         [0016]    Also, the determination of a choice vector based on a selection of a vector from a predefined set of vectors can be implemented as an initiation set for the selection of a further choice vector calculated using the channel matrix. 
         [0017]    The determination of a choice vector can be repeated based on a selected event, such as a drop in SINR, PER or some preferred characteristic of the desired transmitted signals. As an alternative or in combination with repetition based on a preferred characteristic. The process can be repeated at a preferred rate to respond to changes in a dynamic channel, or at a rate which is adjusted according to the rate of change of the channel. 
         [0018]    Implementing the choice TX and/or RX beamforming vectors of the present invention may be combined with other techniques to improve the power efficiency of transmission, such as water filling, Minimum Mean-Square Error (MMSE), Zero Forcing (ZF) or MAXMIN techniques. It may also be combined with Adaptive Modulation Coding (AMC), whereby the modulation constellation may be adapted to the channel conditions that have been obtained by the channel conditioning method described herein. 
         [0019]    Preferably, a transmitting station is provided configured for use in wireless communication with a multiple-input multiple-output (MIMO) antenna system. A plurality M of transmit (TX) antennas each have an associated signal path. A processor is configured to process a signal for transmission by the plurality of M antennas by applying a selectively determined M-size TX beamforming vector and a unitary matrix across the TX antenna signal paths whereby different weights are applied to the signals directed to each TX antenna for transmission in correlation with the applied TX beamforming vector. A TX beamforming vector selection component associated with said processor is configured to select the TX beamforming vector applied by the processor. 
         [0020]    The TX beamforming vector selection component is preferably associated with a receiving component in order to change the selection of a TX beamforming vector based on information received from a receiving station that is responsive to signals transmitted from said plurality M of transmit (TX) antennas. 
         [0021]    The transmitting station may include a memory for storing a plurality of indexed TX beamforming vectors associated with the TX beamforming vector selection component. The TX beamforming vector selection component is then preferably configured to successively select each indexed TX beamforming vector of a stored predefined vector set for application by the processor in connection with the determination and selection of a choice TX beamforming vector. 
         [0022]    Preferably, a receiving station is provided configured for use in wireless communication with a multiple-input multiple-output (MIMO) antenna system. A plurality N of receive (RX) antennas each have a signal path. The antennas are configured to receive signals from a multi-antenna transmitting station produced by applying a unitary matrix across transmit antenna signal paths. A processor is configured to process the signals received by the N antennas by applying a Hermitian of the unitary matrix and a selected N-size RX beamforming vector, whereby different weights are applied to the signal across the N signal paths in direct correlation with the applied RX beamforming vector. A beamforming vector selection component is associated with the processor and is configured to select the RX beamforming vector applied by the processor. 
         [0023]    Preferably, the receiving station includes a memory for storing a plurality of indexed RX beamforming vectors associated with the RX beamforming vector selection component. The RX beamforming vector selection component is then configured to successively select each indexed RX beamforming vector of a stored predefined vector set for application by the processor in connection with the determination and selection of a choice RX beamforming vector. 
         [0024]    The RX beamforming vector selection component may include a measuring device and a comparator. The measuring device is preferably configured to measure a preferred characteristic of the received signal; the comparator is preferably configured to compare measured values of the preferred characteristic and to select a received signal with a best characteristic whereby the RX beamforming vector that produced the selected signal is selected as the choice RX beamforming vector. 
         [0025]    The receiving station may a component configured to measure a preferred characteristic of received signals and identify a TX beamforming vector that produced each respective measured signal as well as a comparator and a communication component. In such case the comparator is preferably configured to compare measured values of the preferred characteristic and to select a received signal with a best characteristic and the communication component is preferably configured to send information identifying TX beamforming vector that produced the selected signal having the best characteristic to the multi-antenna transmitting station that transmitted the signal. 
         [0026]    The receiving station processor can be configured to calculate a channel matrix based on a received signal. The beamforming vector selection component can then be configured to calculate choice RX and TX beamforming vectors based on the channel matrix, select the choice RX beamforming vector for use by the processor and to send information identifying choice TX beamforming vector to the multi-antenna transmitting station that transmitted the received signal. 
         [0027]    Both transmitting stations and receiving stations constructed to implement the invention can advantageously be to communicate Orthogonal Frequency Division Multiplex signals. 
         [0028]    Other objects and advantages will be apparent to those of ordinary skill in the art based upon the following description of presently preferred embodiments of the invention. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWING(S) 
         [0029]      FIG. 1  is a system overview diagram illustrating conventional wireless communication in a wireless local area network (WLAN). 
           [0030]      FIG. 2  is block diagram illustrating a CDMA transmitter which uses the present invention. 
           [0031]      FIG. 3  is block diagram illustrating a CDMA receiver which uses the present invention. 
           [0032]      FIGS. 4-6  are flow diagrams of channel conditioning processes according to the present invention. 
           [0000]    
         
           
                 
               
                 
                 
                 
               
             
                 
                     
                 
                 
                   TABLE OF ACRONYMS 
                 
                 
                     
                 
               
               
                 
                     
                 
               
            
             
                 
                     
                   AMC 
                   Adaptive Modulation Coding 
                 
                 
                     
                   AP 
                   Access Point 
                 
                 
                     
                   ASIC 
                   Application Specific Integrated Circuit 
                 
                 
                     
                   BS 
                   Base Station 
                 
                 
                     
                   DFT 
                   Discrete Fourier Transform 
                 
                 
                     
                   FFT 
                   Fast Fourier Transform 
                 
                 
                     
                   IFFT 
                   Inverse Fast Fourier Transform 
                 
                 
                     
                   IID 
                   Independent Identically Distributed 
                 
                 
                     
                   MIMO 
                   Multiple Input-Multiple Output 
                 
                 
                     
                   MISO 
                   Multiple Input Single Output 
                 
                 
                     
                   MMSE 
                   Minimum Mean-Square Error 
                 
                 
                     
                   OFDM 
                   Orthogonal Frequency Division Multiplex 
                 
                 
                     
                   PER 
                   Packet Error Rate 
                 
                 
                     
                   QAM 
                   Quadrature Amplitude Modulation 
                 
                 
                     
                   RX 
                   Receive, Receiver 
                 
                 
                     
                   SIMO 
                   Single Input Multiple Output 
                 
                 
                     
                   SINR 
                   Signal Interference Noise Ratio 
                 
                 
                     
                   SISO 
                   Single Input Single Output 
                 
                 
                     
                   SNR 
                   Signal to Noise Ratio 
                 
                 
                     
                   STA 
                   Station 
                 
                 
                     
                   TX 
                   Transmit, Transmitter 
                 
                 
                     
                   WLAN 
                   Wireless Local Area Network 
                 
                 
                     
                   WMAN 
                   Wireless Metropolitan Area Network 
                 
                 
                     
                   ZF 
                   Zero Forcing 
                 
                 
                     
                     
                 
               
            
           
         
       
       
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS 
       [0033]    The communication channel is conditioned through the use and improvement of an orthogonal beam space. The orthogonal beam space is obtained by preconditioning the channel with a unitary matrix, and is modified by using beamforming vectors. The unitary matrix can be a Butler matrix, equivalent to a discrete Fourier transform (DFT). Under certain circumstances a Hadamard transform may replace the Butler matrix. 
         [0034]    Referring to  FIG. 1 , a portion of a conventional communication system  10  is shown in which an access point (AP)  12  provides communication services to a plurality of wireless transmit/receive units (WTRUs)  14 . The AP communicates with a broader network (not shown), thereby providing additional network services to the WTRUs, such as access to the Internet or a telephone network. 
         [0035]    Referring to  FIG. 2 , a code division multiple access (CDMA) transmitter with multiple antennas  20  is shown, in which the present invention is used. A serial binary data stream s in the transmitter is divided into a plurality of parallel streams of data in a serial/parallel processor S/P at  21 , each stream to be transmitted on a different subcarrier. Each of the parallel data streams is modulated at  22  using quadrature amplitude modulation (QAM), and each sub-carrier is modified at  23  according to a transmit beamforming vector. Next, a pilot signal is inserted at  24  into the data stream, and the combined data-pilot signal is processed at  25  using an inverse fast Fourier transform (IFFT). A cyclic prefix is added at  26 . Finally the signal is processed at  27  using a using a unitary matrix, such as a Butler matrix, to produce a number M of orthogonal carriers equal to the number of transmit antennas. Each of the carriers is then transmitted via a separate antenna at  28 . The transmitted signals in the physical environment comprise a beam space (k)  29 . 
         [0036]    Referring to  FIG. 3 , the inverse process is shown, performed at a CDMA receiver with multiple antennas  30 , in which the present invention is used. Transmitted signals are received from the beam space (k)  29  via N separate receive antennas at  32 . A unitary matrix such as the Hermitian of a Butler matrix is applied to the received signals at  33 , and then the cyclic prefix is removed at  34 . A fast Fourier transform is applied to the signals at  35 , and the pilot signal is removed at  36 . Each subcarrier is modified according to a receive beamforming vector at  37 , and the QAM is demapped at  38  to recover the original parallel signals. Finally, the parallel signals are combined in a parallel to serial processor P/S at  39 , whereby the original serial signal s is reconstructed. 
         [0037]    Referring to  FIG. 4 , a process  40  of improving a MIMO communication channel is illustrated, according to a first embodiment of the present invention where a choice vector is selected from a predefined set of vectors. A set of preferred beam patterns are designed for the system. Each beam pattern has a corresponding transmit (TX) beamforming vector that determines the weights applied to each of the transmitter antennas. The set of TX beamforming vectors corresponding to each beam are indexed and stored in a non-volatile memory in the transmitter. In step  42  the transmitter uses the set of indexed TX beamforming vectors to send a signal containing the beam index via each of a set of directional beams, which the receiver receives using a beam pattern which may be omnidirectional. The receiver measures the SINR of each received signal and identifies the beam index of the signal with the best SINR, step  44 , as the manner to select a choice TX vector for implementation. The receiver feeds the beam index of the chosen vector back to the transmitter, step  46 . The transmitter receives the index and reconfigures itself to use the selected choice TX beamforming vector, which is then used for communications. 
         [0038]    The number of TX beamforming vectors in the set can be related to the number of TX antennas used. Alternatively, a preferred number, such as five or six, can be used to provide enhanced performance without undue complexity. 
         [0039]    The first embodiment of choice vector determination can similarly be applied to the determination of a choice RX beamforming vector. For example, the transmitter can use a beam pattern, which may be omnidirectional, to transmit a signal, and the receiver can be configured with a set of RX beamforming vectors stored in a non-volatile memory. In a preferred implementation, the receiver uses each RX beamforming vector in the set to receive the signal, measures the SINR of the signal using each vector, and identifies and implements the vector giving the best SINR as a choice RX vector. The choice RX beamforming vector is then used for communications. The number of RX beamforming vectors in the set can be related to the number of RX antennas used. Alternatively, a preferred number, such as five or six, can be used to provide enhanced performance without undue complexity. 
         [0040]    The first embodiment of choice vector determination can also be implemented as a combination of the selection of both a choice TX beamforming vector and a choice RX beamforming vector. For example, both the transmitter and the receiver can be configured with sets of beamforming vectors stored in respective memories. In a preferred implementation, the receiver uses a beam pattern which may be omnidirectional while the transmitter sweeps through its beam set, the receiver identifies the TX beam index resulting in the best SINR, and feeds it back to the transmitter which implements the associated TX beamforming vector. The transmitter then sends a signal while the receiver sweeps through its beam set, and identifies and implements the RX beamforming vector giving the best SINR. Alternatively, the receiver can sweep through its set of vectors before the transmitter sweeps through its set. The number of TX and RX beamforming vectors in each set can be related to the number of TX and RX antennas used, respectively. Alternatively, a preferred number of each which results in enhanced performance without undue complexity, such as five or six, can be used. 
         [0041]    The determination of a choice vector in accordance with the first embodiment of the present invention can be implemented in a recursive manner for continued conditioning of the channel. In one example, referring to  FIG. 5 , a process  50  of improving and maintaining a MIMO communication channel is illustrated based on utilization of the first embodiment in a repetitive manner. For example, a preferred set of indexed TX beamforming vectors are stored in the transmitter and used to send a signal which the receiver receives using an omnidirectional or other beam pattern, step  52 . The receiver measures the SINR of each received signal and identifies the beam index of the signal with the best SINR, and feeds it back to the transmitter, which implements the associated vector and uses it for communications, step  54 . As an alternative to steps  52  and  54 , a process such as described with respect to the selection of a choice RX beamforming vector or a combination of selection of both choice TX and RX beamforming vectors such as described above may be used. 
         [0042]    Thereafter, the receiver continues to monitor the SINR or other characteristic of the received communication signals. If the SINR or other preferred characteristic drops below a desired threshold, step  56 , the receiver initiates a channel reconditioning process by prompting, step  58 , the transmitter to send another conditioning signal and sweep through its beamforming vectors. The TX beamforming vector resulting in the best received SINR is selected as the choice vector and implemented, step  52 . If the SINR or other characteristic of the received signal changes frequently, the process can be repeated based on changes in the SINR, at a preferred rate or a combination of such triggers. Where alternatives are initially used for steps  52  and  54 , such as when a combination of selection of both choice TX and RX beamforming vectors is implemented for those steps, such alternative steps are preferably triggered for reconditioning. 
         [0043]    According to a second embodiment of the present invention, a preferred TX beamforming vector which may be omnidirectional is used to send a signal, which is received by a receiver using a preferred RX beamforming vector which may be omnidirectional. The receiver calculates a channel matrix using techniques which are known in the prior art. Using the channel matrix, choice TX and/or RX beamforming vectors are determined as described in detail below. The receiver preferably implements the choice RX beamforming vector, and sends to the transmitter the choice TX beamforming vector, which the transmitter implements for further communications. This type of channel conditioning may also optionally be coupled with its own reconditioning process as explained in connection with  FIG. 6 . 
         [0044]    Referring to  FIG. 6 , a process  60  of improving and maintaining a MIMO communication channel is illustrated. A preferred TX beamforming vector is used to send a signal, step  61 , which is received by a receiver using a preferred RX beamforming vector. The preferred TX beamforming vector used to send a signal in step  61  may be determined through implementation of the first embodiment as an initiation process or other desired manner. 
         [0045]    The receiver calculates a channel matrix, step  62 . The receiver then determines choice TX and RX beamforming vectors which vectors are implemented, respectively in the transmitter and receiver, step  64 . Thereafter, the receiver continues to monitor the SINR or other characteristic of the received communication signals. If the SINR or other preferred characteristic drops below a desired threshold, step  66 , the receiver reconditions the channel by recalculating RX and TX beamforming vectors to redefine the choice vectors, the receiver implements the redefined choice RX beamforming vector, and sends to the transmitter the redefined choice TX beamforming vector, which the transmitter implements. If the SINR or other characteristic of the received signal changes frequently, the process can be repeated based on changes in the SINR, at a preferred rate or a combination of such triggers. 
         [0046]    Optionally, as indicated step  68  illustrated in phantom, a new channel matrix can be calculated before determining the new RX and TX beamforming vectors. Optional step  68  can be set up to be triggered when a lower threshold is exceeded in step  66  or if the reconditioning through the repetition of step  64  does not produce a significant improvement to the monitored characteristic. 
         [0047]    A more complete description of the calculation of choice transmit and receive beamforming vectors according to the second embodiment of the present invention is as follows. Consider a MIMO-OFDM system in which the transmitter  20  with M transmit antennas in an array, transmits to the receiver  30  with N receive antennas in an array. Preferably, the distance between antennas for both the transmitter (TX) and receiver (RX) sides is very close, such as one or one half of a wavelength, and the antennas are preferably correlated. In general, a correlated MIMO system degrades the performance and the capacity. 
         [0048]    To avoid performance and capacity degradation, a beam-space (fixed) beamforming matrix, such as butler matrix or DFT beamforming matrix  27 , is implemented on the TX side and its Hermitian  33  is implemented as a beamforming matrix on the RX side. To control the directionality of the beam-space beamforming matrices, beamforming vectors controlling the sub-carrier weights are applied by processing circuitry  23  on the TX side and by processing circuitry  37  on the RX sides in an effort to improve received SINR. 
         [0049]    Instead of generating only one beam direction using element space beamforming, by using beam space beamforming multiple independent beams or channels in beam space can be generated. This diagonalizes the channel matrix in the time domain, as well as the channel matrices for each carrier in the frequency domain, since the Butler matrix or DFT beamforming matrix are unitary matrices. Because of this, the invented system increases the capacity and the performance of the system, and the receiver structure is also made very simple. 
         [0050]    Assume a K sub-carrier OFDM modulation. The signal s k (n), 1≦k≦K, denotes the information symbol transmitted at the kth sub-carrier during the nth OFDM symbol. The signals s k (n) are preferably modeled as zero-mean independent identically distributed (i.i.d.) random variables belonging to a fixed finite signal constellation set with normalized energy, namely, E└|s k (n)| 2 ┘=1, where E denotes the expectation operator. 
         [0051]    At the transmitter, the modulated symbol for each sub-carrier is multiplied by an independent M×1 transmit beamforming vector, b k =[b 1   k  b 2   k  . . . b M   k ] T . Next, an inverse fast Fourier transform (IFFT) is applied to those signals, and a cyclic prefix is added for each antenna. Next, a Butler matrix B or other fixed-beamforming matrix is applied in the time domain. The Butler matrix B is a discrete Fourier transform (DFT) matrix. Then, the signal is transmitted, and passes through a multipath fading channel in space. 
         [0052]    At the receiver, the Hermitian of the Butler or other fixed-beamforming matrix, B H , is applied. Then, the cyclic prefix is removed, and a fast Fourier transform (FFT) applied. Although in the real system the fixed beamforming matrices B and B H  are applied in the time domain, the matrices are common to all sub-carriers, and thus applying the matrices in the time domain is equivalent to applying the matrices for each sub-carrier in the frequency domain. Therefore, in this formulation B and B H  are treated as though they were applied in the frequency domain. Thus, the received signal in each sub-carrier can be represented (dropping the time index for simplicity) as 
         [0000]        y   k   =B   H   k   Bb   k   s   k   +B   H   n   k , 1≦k≦K,  (1) 
         [0000]    where the channel matrix H k  is an M×N matrix, and the channel for each sub-carrier is a flat fading channel. The vector n k  denotes the noise vector of the kth sub-carrier in the frequency domain. Next, apply the RX beamforming vector to this signal. The result is 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         
                           r 
                           k 
                         
                         = 
                           
                          
                         
                           
                             
                               a 
                               _ 
                             
                             k 
                             H 
                           
                            
                           
                             
                               y 
                               _ 
                             
                             k 
                           
                         
                       
                     
                   
                   
                     
                       
                         = 
                           
                          
                         
                           
                             
                               
                                 a 
                                 _ 
                               
                               k 
                               H 
                             
                              
                             
                               B 
                               H 
                             
                              
                             
                               H 
                               k 
                             
                              
                             B 
                              
                             
                               
                                 b 
                                 _ 
                               
                               k 
                             
                              
                             
                               s 
                               k 
                             
                           
                           + 
                           
                             
                               
                                 a 
                                 _ 
                               
                               k 
                               H 
                             
                              
                             
                               B 
                               H 
                             
                              
                             
                               
                                 
                                   n 
                                   _ 
                                 
                                 k 
                               
                               . 
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   2 
                   ) 
                 
               
             
           
         
       
     
         [0053]    Represent the covariance matrix of the system as R n   k . Assume that the channel matrix H k  and the covariance matrix R n   k  are available in both the transmitter side TX and the receiver side RX. The TX and RX beamforming vectors can then be jointly improved to define the choice vectors as follows. 
         [0054]    The problem is to increase the average SINR for each sub-carrier, with fixed beamforming matrices at both the TX and RX sides, and can be stated mathematically as 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         
                           Γ 
                           k 
                         
                         = 
                           
                          
                         
                           
                             E 
                              
                             
                               [ 
                               
                                 
                                    
                                   
                                     
                                       
                                         a 
                                         _ 
                                       
                                       k 
                                       H 
                                     
                                      
                                     
                                       B 
                                       H 
                                     
                                      
                                     
                                       H 
                                       k 
                                     
                                      
                                     B 
                                      
                                     
                                         
                                     
                                      
                                     
                                       
                                         b 
                                         _ 
                                       
                                       k 
                                     
                                      
                                     
                                       s 
                                       k 
                                     
                                   
                                    
                                 
                                 2 
                               
                               ] 
                             
                           
                           
                             E 
                              
                             
                               [ 
                               
                                 
                                    
                                   
                                     
                                       
                                         a 
                                         _ 
                                       
                                       k 
                                       H 
                                     
                                      
                                     
                                       B 
                                       H 
                                     
                                      
                                     
                                       
                                         n 
                                         _ 
                                       
                                       k 
                                     
                                   
                                    
                                 
                                 2 
                               
                               ] 
                             
                           
                         
                       
                     
                   
                   
                     
                       
                         = 
                           
                          
                         
                           
                             
                               
                                  
                                 
                                   
                                     
                                       a 
                                       _ 
                                     
                                     k 
                                     H 
                                   
                                    
                                   
                                     B 
                                     H 
                                   
                                    
                                   
                                     H 
                                     k 
                                   
                                    
                                   B 
                                    
                                   
                                       
                                   
                                    
                                   
                                     
                                       b 
                                       _ 
                                     
                                     k 
                                   
                                 
                                  
                               
                               2 
                             
                             
                               
                                 
                                   a 
                                   _ 
                                 
                                 k 
                                 H 
                               
                                
                               
                                 B 
                                 H 
                               
                                
                               
                                 R 
                                 n 
                                 k 
                               
                                
                               B 
                                
                               
                                   
                               
                                
                               
                                 
                                   a 
                                   _ 
                                 
                                 k 
                               
                             
                           
                           . 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   3 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where Γ k  is the SINR. The optimum RX beamforming vector is given by 
         [0000]        a   k =μ k ( B   H   R   n   k   B ) −1   B   H   H   k   Bb   k ,  (4) 
         [0000]    where μ k  is an arbitrary real constant, and does not affect the value of SINR. μ k  is a kind of a normalization factor used to make a k   H B H H k Bb k =1. With the optimal a k  thus calculated, the SINR Γ k  can then be written as 
         [0000]      Γ k   =b   k   H   B   H   H   k   H ( R   n   k ) −1   H   k   Bb   k .  (5) 
         [0055]    To find the optimum TX beamforming vector b k , define the matrix Ψ k  as 
         [0000]      Ψ k   =H   k   H ( R   n   k ) −1   H   k .  (6) 
         [0000]    Since R n   k  is a Hermitian and is an invertible matrix, Ψ k  can be decomposed as 
         [0000]      Ψ k   =U   k Λ k   U   k   H ,  (7) 
         [0000]    where U k  is an unitary matrix whose columns are the eigenvectors of Ψ k , and Λ k  is a diagonal matrix that contains the corresponding eigenvalues, λ k,m , 1≦m≦M. Then, 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         
                           Γ 
                           k 
                         
                         = 
                           
                          
                         
                           
                             
                               ( 
                               
                                 
                                   U 
                                   k 
                                   H 
                                 
                                  
                                 B 
                                  
                                 
                                     
                                 
                                  
                                 
                                   
                                     b 
                                     _ 
                                   
                                   k 
                                 
                               
                               ) 
                             
                             H 
                           
                            
                           
                             
                               Λ 
                               k 
                             
                              
                             
                               ( 
                               
                                 
                                   U 
                                   k 
                                   H 
                                 
                                  
                                 B 
                                  
                                 
                                     
                                 
                                  
                                 
                                   
                                     b 
                                     _ 
                                   
                                   k 
                                 
                               
                               ) 
                             
                           
                         
                       
                     
                   
                   
                     
                       
                         = 
                           
                          
                         
                           
                             b 
                             k 
                             
                               ′ 
                                
                               
                                   
                               
                                
                               H 
                             
                           
                            
                           
                             Λ 
                             k 
                           
                            
                           
                             
                               b 
                               _ 
                             
                             k 
                             ′ 
                           
                         
                       
                     
                   
                   
                     
                       
                         
                           = 
                             
                            
                           
                             
                               ∑ 
                               
                                 m 
                                 = 
                                 1 
                               
                               M 
                             
                              
                             
                               
                                 λ 
                                 
                                   k 
                                   , 
                                   m 
                                 
                               
                                
                               
                                 
                                    
                                   
                                     b 
                                     
                                       k 
                                       , 
                                       m 
                                     
                                     ′ 
                                   
                                    
                                 
                                 2 
                               
                             
                           
                         
                         , 
                       
                     
                   
                 
               
               
                 
                   ( 
                   8 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where 
         [0000]      b k ′=U k   H Bb k . 
         [0056]    The TX power constraint for each sub-carrier is |b k | 2 =p k  and it becomes, with b k ′, 
         [0000]      | b   k ′| 2 =( U   k   H   Bb   k ) H ( U   k   H   Bb   k )=| b   k | 2   =p   k ,  (9) 
         [0000]    since U k  and B are unitary matrices. To maximize the SINR, the vector b k ′ can be shown to be given by 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         b 
                         _ 
                       
                       k 
                       ′ 
                     
                     = 
                     
                       
                         
                           
                             p 
                             k 
                           
                         
                          
                         
                           [ 
                           
                             
                               
                                 0 
                               
                               
                                 … 
                               
                               
                                 0 
                               
                               
                                 
                                   1 
                                   
                                      
                                     
                                       the 
                                        
                                       
                                           
                                       
                                        
                                       lth 
                                        
                                       
                                           
                                       
                                        
                                       element 
                                     
                                   
                                 
                               
                               
                                 0 
                               
                               
                                 … 
                               
                               
                                 0 
                               
                             
                           
                           ] 
                         
                       
                       T 
                     
                   
                    
                   
                     
 
                   
                    
                   where 
                    
                   
                     
 
                   
                    
                   
                     l 
                     = 
                     
                       
                         
                           arg 
                            
                           
                               
                           
                            
                           max 
                         
                         
                           
                             m 
                             - 
                             1 
                           
                           , 
                           
                               
                           
                            
                           … 
                            
                           
                               
                           
                           , 
                           M 
                         
                       
                        
                       
                         
                           { 
                           
                             λ 
                             
                               k 
                               , 
                               m 
                             
                           
                           } 
                         
                         . 
                       
                     
                   
                 
               
               
                 
                   ( 
                   10 
                   ) 
                 
               
             
           
         
       
     
         [0000]    Then, the optimum TX beamforming vector b k  is given by 
         [0000]        b   k   =B   H   U   k   b   k   ′= √{square root over (p k )}B H   v   k ,  (11) 
         [0000]    where v k  is the eigenvector of the matrix Ψ k  that corresponds to the largest eigenvalue. The SINR then becomes 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       Γ 
                       k 
                     
                     = 
                     
                       
                         
                           
                             ( 
                             
                               
                                 
                                   p 
                                   k 
                                 
                               
                                
                               
                                 B 
                                 H 
                               
                                
                               
                                 
                                   v 
                                   _ 
                                 
                                 k 
                               
                             
                             ) 
                           
                           H 
                         
                          
                         
                           
                             Ψ 
                             k 
                           
                            
                           
                             ( 
                             
                               
                                 
                                   p 
                                   k 
                                 
                               
                                
                               
                                 B 
                                 H 
                               
                                
                               
                                 
                                   v 
                                   _ 
                                 
                                 k 
                               
                             
                             ) 
                           
                         
                       
                        
                       
                         
 
                       
                        
                       
                           
                       
                       = 
                       
                         
                           p 
                           k 
                         
                          
                         
                           λ 
                           
                             k 
                             , 
                             l 
                           
                         
                       
                     
                   
                   , 
                 
               
               
                 
                   ( 
                   12 
                   ) 
                 
               
             
           
         
       
     
         [0000]    since B is a unitary matrix. Here, λ k,l  is the largest eigenvalue of the matrix Ψ k . Therefore, this value is the maximum achievable SINR value with the power constraint |b k | 2 =p k . 
         [0057]    After the channel matrix has been found and the choice transmit and receive beamforming vectors have been determined and implemented, it is possible to further improve the power efficiency of the transmitter by using known power optimization techniques. Such power optimization techniques can include waterfilling, minimum mean-square error (MMSE), zero forcing (ZF) or so-called MAXMIN techniques, which can also be applied to the other embodiments of the invention. An example follows. 
         [0058]    First, using the known channel information, estimate the optimal transmit power within the limit of the total available transmit power, p k , for each sub-carrier. Using the Γ k  and the largest eigenvalue for each sub-carrier, λ k,l , the estimate can be defined as maximizing the equation 
         [0000]    
       
         
           
             
               K 
               
                 
                   ∑ 
                   
                     k 
                     = 
                     1 
                   
                   K 
                 
                  
                 
                   1 
                   
                     Γ 
                     k 
                   
                 
               
             
             = 
             
               K 
               
                 
                   ∑ 
                   
                     k 
                     = 
                     1 
                   
                   K 
                 
                  
                 
                   1 
                   
                     
                       λ 
                       
                         k 
                         , 
                         l 
                       
                     
                      
                     
                       p 
                       k 
                     
                   
                 
               
             
           
         
       
     
         [0059]    subject to 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         ∑ 
                         
                           k 
                           = 
                           1 
                         
                         K 
                       
                        
                       
                         
                            
                           
                             
                               b 
                               _ 
                             
                             k 
                           
                            
                         
                         2 
                       
                     
                     = 
                     
                       
                         
                           ∑ 
                           
                             k 
                             = 
                             1 
                           
                           K 
                         
                          
                         
                           p 
                           k 
                         
                       
                       = 
                       P 
                     
                   
                   , 
                 
               
               
                 
                   ( 
                   13 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where P is the total transmit power and p k  is transmit power for each sub-carrier k. The solution is 
         [0000]    
       
         
           
             
               
                 
                   
                     p 
                     k 
                   
                   = 
                   
                     
                       P 
                       
                         
                           ∑ 
                           
                             k 
                             = 
                             1 
                           
                           K 
                         
                          
                         
                           λ 
                           
                             k 
                             , 
                             l 
                           
                           
                             
                               - 
                               1 
                             
                             / 
                             2 
                           
                         
                       
                     
                      
                     
                       
                         1 
                         
                           
                             λ 
                             
                               
                                 k 
                                 , 
                                 l 
                               
                                
                               
                                   
                               
                             
                           
                         
                       
                       . 
                     
                   
                 
               
               
                 
                   ( 
                   14 
                   ) 
                 
               
             
           
         
       
     
         [0060]    The process of decoding the data symbols will next be described. It is assumed that the system is operating in a frequency-selective Rayleigh fading environment and that the communication channel remains constant during a packet transmission. Suppose that the channel impulse response has L resolved paths and that the correlated channel matrix for the qth path is denoted by G(q). Then, the discrete-time MIMO baseband signal model after B H  can be represented by 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         z 
                         ^ 
                       
                       _ 
                     
                      
                     
                       ( 
                       τ 
                       ) 
                     
                   
                   = 
                   
                     
                       
                         
                           ∑ 
                           
                             q 
                             = 
                             0 
                           
                           Q 
                         
                          
                         
                           
                             B 
                             H 
                           
                            
                           
                             G 
                              
                             
                               ( 
                               q 
                               ) 
                             
                           
                            
                           B 
                            
                           
                             
                               
                                 x 
                                 ^ 
                               
                               _ 
                             
                              
                             
                               ( 
                               
                                 τ 
                                 - 
                                 q 
                               
                               ) 
                             
                           
                         
                       
                       + 
                       
                         
                           B 
                           H 
                         
                          
                         
                           
                             n 
                             _ 
                           
                            
                           
                             ( 
                             τ 
                             ) 
                           
                         
                       
                     
                      
                     
                       
 
                     
                      
                     
                         
                     
                     = 
                     
                       
                         
                           ∑ 
                           
                             q 
                             = 
                             0 
                           
                           Q 
                         
                          
                         
                           
                             B 
                             H 
                           
                            
                           
                             G 
                              
                             
                               ( 
                               q 
                               ) 
                             
                           
                            
                           B 
                            
                           
                             
                               
                                 x 
                                 ^ 
                               
                               _ 
                             
                              
                             
                               ( 
                               
                                 τ 
                                 - 
                                 q 
                               
                               ) 
                             
                           
                         
                       
                       + 
                       
                         
                           
                             v 
                             ^ 
                           
                           _ 
                         
                          
                         
                           ( 
                           τ 
                           ) 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   15 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where {circumflex over (x)}(τ) represents a time domain OFDM symbol after applying each carrier&#39;s TX beamforming vector, and n(τ) represents additive white Gaussian noise at the τ sample, with N independently and identically distributed (i.i.d.) zero-mean complex Gaussian noise with the correlation matrix σ n   2 I N . Since the matrix B is a unitary matrix, the transformed noise v(τ) also has i.i.d. zero-mean complex Gaussian noise with the correlation matrix σ n   2 I N . 
         [0061]    To deal with the frequency selective channel, OFDM is applied, utilizing N e  subcarriers per antenna transmission. To combat Inter-Symbol Interference (ISI), a Cyclic Prefix (CP) of N g  samples is added to the OFDM symbols. When Q≦N g +1, ISI does not occur on a MIMO OFDM symbol basis, and he ath received MIMO OFDM symbol after removal of CP is given as 
         [0000]        z ( a )= Cx ( a )+ v ( a )  (16) 
         [0000]    where C is an effective channel matrix and is a K N×K M block circulant matrix with N×M block matrices. The block circulant matrix can be defined with the first block column and the first block column is defined as 
         [0000]    
       
         
           
             
               
                 
                   
                     C 
                     1 
                   
                   = 
                   
                     [ 
                     
                       
                         
                           
                             
                               B 
                               H 
                             
                              
                             
                               G 
                                
                               
                                 ( 
                                 0 
                                 ) 
                               
                             
                              
                             B 
                           
                         
                       
                       
                         
                           ⋮ 
                         
                       
                       
                         
                           
                             
                               B 
                               H 
                             
                              
                             
                               G 
                                
                               
                                 ( 
                                 
                                   Q 
                                   - 
                                   1 
                                 
                                 ) 
                               
                             
                              
                             B 
                           
                         
                       
                       
                         
                           
                             0 
                             
                               
                                 N 
                                  
                                 
                                   ( 
                                   
                                     K 
                                     - 
                                     Q 
                                   
                                   ) 
                                 
                               
                               × 
                               M 
                             
                           
                         
                       
                     
                     ] 
                   
                 
               
               
                 
                   ( 
                   17 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where 0 N(K−Q)×M  is the N (K−Q)×M all zeros matrix. Let x(i, a) denote the symbol vector transmitted on the kth subcarrier of the ath MIMO OFDM symbol. Then, the transmitted block of samples in the time-domain becomes 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         x 
                         _ 
                       
                       ′ 
                     
                      
                     
                       ( 
                       a 
                       ) 
                     
                   
                   = 
                   
                     
                       
                         ( 
                         
                           
                             F 
                             
                               - 
                               1 
                             
                           
                           ⊗ 
                           
                             I 
                             M 
                           
                         
                         ) 
                       
                        
                       
                         [ 
                         
                           
                             
                               
                                 
                                   
                                     x 
                                     _ 
                                   
                                   0 
                                 
                                  
                                 
                                   ( 
                                   a 
                                   ) 
                                 
                               
                             
                           
                           
                             
                               ⋮ 
                             
                           
                           
                             
                               ⋮ 
                             
                           
                           
                             
                               
                                 
                                   
                                     x 
                                     _ 
                                   
                                   
                                     K 
                                     - 
                                     1 
                                   
                                 
                                  
                                 
                                   ( 
                                   a 
                                   ) 
                                 
                               
                             
                           
                         
                         ] 
                       
                     
                     = 
                     
                       
                         ( 
                         
                           
                             F 
                             
                               - 
                               1 
                             
                           
                           ⊗ 
                           
                             I 
                             M 
                           
                         
                         ) 
                       
                        
                       
                         
                           x 
                           _ 
                         
                          
                         
                           ( 
                           a 
                           ) 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   18 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where           denotes Kronecker product, F is the K×K Fourier matrix and In represents the n×n dimensional identity matrix. By taking FFT (fast Fourier transform) at the receiver, the frequency domain MIMO OFDM baseband signal model can be represented by 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       
                         
                           
                             y 
                             _ 
                           
                            
                           
                             ( 
                             a 
                             ) 
                           
                         
                         = 
                           
                          
                         
                           
                             ( 
                             
                               F 
                               ⊗ 
                               
                                 I 
                                 N 
                               
                             
                             ) 
                           
                            
                           
                             
                               
                                 x 
                                 _ 
                               
                               ′ 
                             
                              
                             
                               ( 
                               a 
                               ) 
                             
                           
                         
                       
                     
                   
                   
                     
                       
                         = 
                           
                          
                         
                           
                             ( 
                             
                               F 
                               ⊗ 
                               
                                 I 
                                 N 
                               
                             
                             ) 
                           
                            
                           
                             ( 
                             
                               
                                 
                                   C 
                                    
                                   
                                     ( 
                                     
                                       
                                         F 
                                         
                                           - 
                                           1 
                                         
                                       
                                       ⊗ 
                                       
                                         I 
                                         M 
                                       
                                     
                                     ) 
                                   
                                 
                                  
                                 
                                   
                                     x 
                                     _ 
                                   
                                    
                                   
                                     ( 
                                     a 
                                     ) 
                                   
                                 
                               
                               + 
                               
                                 
                                   v 
                                   _ 
                                 
                                  
                                 
                                   ( 
                                   a 
                                   ) 
                                 
                               
                             
                             ) 
                           
                         
                       
                     
                   
                   
                     
                       
                         = 
                           
                          
                         
                           
                             
                               H 
                               ^ 
                             
                              
                             
                               
                                 x 
                                 _ 
                               
                                
                               
                                 ( 
                                 a 
                                 ) 
                               
                             
                           
                           + 
                           
                             
                               
                                 n 
                                 _ 
                               
                               f 
                             
                              
                             
                               ( 
                               a 
                               ) 
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   19 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where n f (a) represents the frequency domain noise with i.i.d zero-mean complex Gaussian with (1/2)σ n   2  per dimension and Ĥ is a block diagonal matrix, given by 
         [0000]    
       
         
           
             
               
                 
                   
                     H 
                     ^ 
                   
                   = 
                   
                     [ 
                     
                       
                         
                           
                             
                               H 
                               ^ 
                             
                             0 
                           
                         
                         
                           
                               
                           
                         
                         
                           
                               
                           
                         
                         
                           0 
                         
                       
                       
                         
                           
                               
                           
                         
                         
                           ⋱ 
                         
                         
                           
                               
                           
                         
                         
                           
                               
                           
                         
                       
                       
                         
                           
                               
                           
                         
                         
                           
                               
                           
                         
                         
                           ⋱ 
                         
                         
                           
                               
                           
                         
                       
                       
                         
                           0 
                         
                         
                           
                               
                           
                         
                         
                           
                               
                           
                         
                         
                           
                             
                               H 
                               ^ 
                             
                             
                               K 
                               - 
                               1 
                             
                           
                         
                       
                     
                     ] 
                   
                 
               
               
                 
                   ( 
                   20 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where each diagonal block is given as 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       H 
                       ^ 
                     
                     k 
                   
                   = 
                   
                     
                       ∑ 
                       
                         q 
                         = 
                         0 
                       
                       
                         Q 
                         - 
                         1 
                       
                     
                      
                     
                       
                         B 
                         H 
                       
                        
                       
                         G 
                          
                         
                           ( 
                           q 
                           ) 
                         
                       
                        
                       B 
                        
                       
                           
                       
                        
                       
                         exp 
                          
                         
                           ( 
                           
                             
                               - 
                               j 
                             
                              
                             
                                 
                             
                              
                             2 
                              
                             π 
                              
                             
                                 
                             
                              
                             
                               ql 
                               K 
                             
                           
                           ) 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   21 
                   ) 
                 
               
             
           
         
       
     
         [0000]    from Eq. (1). For subcarrier k, the symbol can be written as 
         [0000]        y   k ( a )= Ĥ   k   x   k ( a )+ n   k   f ( a )  (22) 
         [0062]    This is a flat fading signal model per subcarrier. After applying the RX beamforming vector, the signal becomes 
         [0000]        r   k   =T   k   s   k   +n   k   r .  (23) 
         [0063]    If we use all available beamforming vectors for all eigenvalues, λ k,m , 1≦m≦M, in transmission and reception, namely use beamforming matrices for transmission and reception, the effective channel with TX and RX beamforming, T k , becomes a diagonal matrix. Then, the data detection is easily done by the inverse matrix of this diagonal matrix. However, if the maximal SNR transmission and reception is used as described above, the effective channel, T k , becomes just a scalar. Therefore, the data detection is simply done by a scalar equalizer. Therefore, the invention significantly reduces the complexity of the receiver structure. 
         [0064]    Although the features and elements of the present invention are described in the preferred embodiments in particular combinations, each feature or element can be used alone without the other features and elements of the preferred embodiments or in various combinations with or without other features and elements of the present invention. 
         [0065]    Preferably, the circuitry implementing the various transmitter and receiver processes and functions described above are incorporated in a single processor which may be an integrated circuit, such as an application specific integrated circuit (ASIC), with an interface component for interfacing with a source or consumer of serial data and another interface component for interfacing with multiple antennas. However, the circuitry may also be readily implemented using multiple separate integrated circuits and/or discrete components. 
         [0066]    The foregoing description makes references to specific transmitter and receiver configurations as examples only and not as limitations. Other variations and modifications consistent with the invention will be recognized by those of skill in the art.