# Patent

## Title
Transmit antenna subset selection for retransmission

## Abstract

A transmit switched antenna system utilizes one of several antennas selection protocols combined with feedback from a receiving device to take advantage of time and space transmission for the same information. A transmit device transmits first information over a first subset of a set of antennas and receives an ACK or NACK from the receiver along with a channel quality indicator. If a NACK is received, the transmitter selects a next antenna subset for transmission, based on the antenna selection protocol utilized. One protocol randomly selects the next subset and does not require the channel quality indicator. Another protocol determines the next antenna subset based on channel quality history, and a third protocol selects the next antenna subset based on expectation of retransmissions for different protocols.

## Background
CROSS-REFERENCE TO RELATED APPLICATION(S)
This application claims the benefit of U.S. provisional application No. 61/181,491, filed May 27, 2009, entitled “Protocol Assisted Transmit Antenna Selection Diversity (PA-TASD),” which application is hereby incorporated by reference in its entirety.


BACKGROUND
1. Technical Field
This application relates to wireless systems and more particular to wireless systems using closed loop transmit diversity.
2. Background Art
In recent years, multiple transmit antenna techniques have been widely studied to improve the capacity of wireless systems. In fact, current Wireless LAN (WLAN) standards (such as the IEEE 802.11n) deploy multiple antennas to transmit at either the base station and/or the client station. This approach increases the capacity of the wireless link and provides significant diversity gain. Streaming applications, such as Voice over Internet Protocol (VoIP) telephony, entertainment audio and video, and conferencing are natural extensions of modern Ethernet's ability to combine real-time and data traffic on a common system, thus lowering costs and providing inter-application service synergies. These real-time applications, however, are less forgiving of late packet delivery, either due to back-off resulting from system loading, or retransmission delays arising from contention, channel imperfection and consequent contention resolution (CR). Although the bounding of latency and jitter consistent with high-quality delivery of multimedia services can be achieved with wired LANs using switched-Ethernet or higher transmission rates, these are harder to apply with wireless Ethernets.
Multiple antenna systems have been broadly adopted in wireless communications to increase system capacity and improve performance. To achieve high spatial efficiency and reliability, transmit/receive diversity techniques have been considered. One such approach is Protocol Assisted Switched Diversity (PASD), which is an error control technique that utilizes Media Access Control (MAC) protocol elements and companion signal processing with multiple antennas and a single radio at the receiver to provide improved Quality of Service (QoS) performance with current IEEE 802.11 radio chipsets. The approach is described in U.S. Publication Number 20030096617, published May 22, 2003.
DISCLOSURE OF INVENTION
In order to improve performance of WLAN and other wireless systems, a transmit switched antenna system is combined with one or more feedback protocol(s) to take advantage of time and space transmission for the same information. The performance may be further improved using space-time coding of transmitted information.
Accordingly, in one embodiment, a method is provided that selects a first subset of antennas from a set of antennas to transmit first information from a transmitting station to a receiving device. The transmitting station transmits the first information over the first subset of antennas and receives one of an acknowledge (ACK) and a no acknowledge (NAK) from the receiving device indicating whether the first information was successfully received. In response to receiving the NAK, the transmitting station selects a second subset of antennas from the set of antennas to retransmit the first information to the receiving device using a history of channel quality indicators received from the receiving device and retransmits the first information to the receiving device over the second subset of antennas.
In another embodiment, a method is provided that includes selecting a first subset of antennas from a set of antennas to transmit first information to a receiving device from a transmitting device. The first subset is two or more antennas. The transmitting station transmits the first information over the first subset of antennas and receives one of an acknowledge (ACK) and a no acknowledge (NAK) from the receiving device indicating whether the first information was successfully received. In response to receiving the NACK, the transmitting station randomly selects a second subset of antennas from the set of antennas to retransmit the first information to the receiving devices, the second subset being two or more antennas, and retransmits the first information to the receiving device over the second subset of antennas.
In another embodiment, a method is provided that includes selecting a first subset of antennas from a set of antennas for transmitting first information from a transmitting device to a receiving device, the first subset being two or more antennas. The transmitting device transmits the first information over the first subset of antennas and receives one of an acknowledge (ACK) and a no acknowledge (NAK) from the receiving device indicating whether the first information was successfully received. In response to receiving the NAK, the transmitting device compares an expectation of a number of transmissions between a first and at least a second policy and selects one of the first and second policies as a better policy, the better policy being evaluated according to which policy has an expected fewer number of transmissions. The transmitting station selects a second subset of the antennas associated with the better policy for retransmission of the first information and retransmits the first information to the receiving device over the second subset of antennas.
In still another embodiment, a transmitting station includes a set of antennas having a plurality of selectable subsets of antennas, each subset including at least two antennas. Control logic randomly selects a first subset of the set of antennas for transmitting first information to a receiving device. The transmitting station receives one of an acknowledge (ACK) and a no acknowledge (NAK) from the receiving device indicating whether the first information was successfully received. The control logic is responsive to receiving the NAK, to randomly select a second subset of the set of antennas from the set of antennas to retransmit the first information to the receiving device.
In still another embodiment of the invention, a transmitting station is provided that includes a set of antennas having a plurality of selectable subsets, each subset including at least two antennas. Control logic selects a first subset of the set of antennas for transmitting first information to a receiving device. The transmitting station is configured to receive one of an acknowledge (ACK) and a no acknowledge (NAK) from the receiving device indicating whether the first information was successfully received. The control logic is responsive to receiving the NAK, to select a second subset of the set of antennas to retransmit the first information to the receiving device using a history of channel quality indicators received from the receiving device.
In still another embodiment, a transmitting station includes a set of antennas having a plurality of selectable subsets, each subset including at least two antennas. Control logic selects a first subset of the set of antennas to transmit first information to a receiving device and the transmitting station is coupled to receive one of an acknowledge (ACK) and a no acknowledge (NAK) from the receiving device indicating whether the first information was successfully received. The control logic is responsive to receiving the NAK to compare an expectation of a number of transmissions between a first and at least a second policy and select one of the first and second policies as a better policy according to which policy has an expected fewer number of transmissions and to select a second subset of the antennas that is associated with the better policy for retransmission of the first information. In an embodiment, the first policy is a best known antenna subset and the second policy is a randomly selected antenna subset.



BRIEF DESCRIPTION OF DRAWINGS
The present invention may be better understood, and its numerous objects, features, and advantages made apparent to those skilled in the art by referencing the accompanying drawings.
FIG. 1 shows a block diagram of a system according to an embodiment of the invention.
FIG. 2 illustrates operation of an exemplary embodiment of a flow diagram of an R-TAS system.
FIG. 3 illustrates an exemplary R-TAS transmission scenario.
FIG. 4 illustrates an exemplary flow diagram for the T-TAS protocol according to an embodiment of the invention.
FIG. 5 illustrates an exemplary T-TAS transmission scenario.
FIG. 6 illustrates an exemplary flow diagram for the MNT-TAS protocol according to an embodiment of the invention.
FIG. 7 illustrates an exemplary MNT-TAS transmission scenario.



The use of the same reference symbols in different drawings indicates similar or identical items.
MODE(S) FOR CARRYING OUT THE INVENTION
Embodiments of the invention discussed herein relate to improving the performance of digital radio signals with reduced complexity to transmitters and receivers, such as those commonly used with handheld communication devices using Multiple/Single Input-Single Output (i.e., MISO, and SISO communication systems) for wireless LAN and other wireless communication applications. An exemplary diversity system according to an embodiment of the invention involves use of a fusion of transmit switched antenna selection diversity with user selectable protocol-based transmission redundancy and space-time coding to improve the performance and capacity of wireless communication systems such as WLAN. In one embodiment disclosed herein, a transmitting station uses two independent transmit chains, with the antennas connected to form the transmit chains via an RF switch. In contrast to conventional switched-diversity operation, the switch is controlled by a feedback processing unit at the transmitter. The feedback processing unit receives messages from the receiver containing feedback information such as signal to noise ratio (SNR) and a channel quality indication. The feedback information itself may contain a current condition of maximal ratio combiner (MRC) and/or SNR comparator output at the receiver's station and is generated from a series of packet transmissions, each displaced in time. Each packet transmission may be encoded using a space-time block coder at the transmitter.
Referring to FIG. 1, illustrated is a block diagram of a system according to an embodiment of the invention. The embodiment shown employs Protocol Assisted Transmit Antenna Selection Diversity (PA-TASD) to achieve performance enhancement by providing a number of transmit antenna(s) N greater than the k number of transmit chains. In this case, the PA-TASD system can be described by (N,k; R,r), where N and k are the total number of antennas in the transmitting station and the number of antennas used at each transmission by the transmitting station, respectively. Similarly, R and r are the total number of antennas in the receiving station and the number of antennas used at each transmission by the receiving station, respectively. FIG. 1 illustrates a (4,2; 1,1) system architecture with Space-Time Block Coding and a maximal ratio combiner (MRC) decoder according to an embodiment of the invention. The notation (4,2; 1,1) indicates that the system has four transmit antennas and selects 2 of 4 for each transmission. The receiver has one receive antenna and uses that one antenna for each transmission. Thus, there are k=2 transmit chains and N=4 transmit antennas.
As shown in FIG. 1, the transmitting station 100 includes a transmit section 101 providing RF encoding functionality, an antenna switch portion 102, and an antenna subsystem 103. Data from a data source is provided to a source encoder 106 that in turn provides data to a space-time coder 108. The space-time coder provides the coded symbols to RF processing block 110 that supplies the RF signal to the antenna switch 102. In the exemplary embodiment shown in FIG. 1, feedback processor 105 provides the control functionality for the antenna switch 102. Software to help provide the control functionality may be stored in memory 106 along with other relevant control related information. The control functionality is typically provided as a combination of hardware and software.
In one particular embodiment, the transmitting station 100 and receiving station 109 first agree upon which TAS protocol to use for the remaining packet transmissions. The transmitting station 100 then transmits packet bursts from the selected antennas, which may increase the SNR or capacity of the receiving station 109. The receiving station 109 is responsible for sending feedback information 120, which may contain ACK/NAK, SNR, and SNR dB improvement or other appropriate channel quality indication (CQI) with respect to the last transmission, as described further herein. While shown separately for clarity, the feedback information from the receiver 109 may be provided from antenna 122 (note the transmit path through antenna 122 is omitted for simplicity). The transmitting station 100 then uses this information to determine whether to switch to another antenna subset in the antenna subsystem 103 and retransmit the same packet or frame again until the transmitting station receives an ACK from the receiving station or the maximum number of retries (if any maximum number is specified) is reached. Note that the term packet or frame or message are used interchangeably herein and are intended to refer to some number of bytes or other quantity of information transmitted as a group for which retry is appropriate according to the particular protocol being implemented.
In one particular embodiment, a transmitter of a mobile unit having more than two decorrelated antennas is enabled to operate with a fusion of transmit switched-antenna selection diversity and protocol-based redundancy using time-spaced transmission bursts, each containing the same message, to improve the uplink performance and capacity of the WLAN base station. These embodiments may include a notification capability that the base station or the mobile unit is capable of PA-TASD operations, including the number of antennas and receivers/transmitters available for operation.
Prior to describing the various Transmit Antenna Selection protocols according to various embodiments of the invention, consider an exemplary system model. Consider a MIMO system with NT:={1, 2, . . . , T} transmit and NR:={1, 2, . . . , R} receive antenna sets in a quasi-static block fading channel. In NT, transmitter T chooses nT (⊂NT, |nT|=t) antennas to transmit a block and likewise receiver R chooses nR (⊂NR, |nR|=r) antennas to receive the block. This antenna selection system is denoted as (T, t; R, r|M) MIMO system, where Mε{m, 0} is the indicator of the existence of receiving memory. For example, in the (4, 2; 1, 1|m) system, T has a total of 4 antennas and selects 2 of 4 for each transmission. R has only one antenna and R has a decoding memory. Channel information is assumed to be perfectly known at the receiver and partially known at the transmitter by feedback information from the receiver.
To send one block, first T selects nT(1) antenna set and sends the block with nT(1). Then, R receives the signal from nR(1) and estimates channel quality γ1 between nT(1) and nR(1). If C(γ1)<CT, where C(γ1 . . . , γl) is an accumulated channel quality function of (γ1, . . . , γl) and CT is the channel quality threshold for decoding signals, then R stores the received signals and transmits a NAK with CQI (=γ1). Otherwise, R transmits an ACK and the system moves to the next block. Unless T receives an ACK, it selects nT(l) for the lth retransmission of the same block and sends it. After receiving lth trial, R estimates γl. If C(γ1, . . . , γl)<CT, T retransmits the same block, otherwise T stops the retransmission and moves onto the next block.
Consider a (T, 2; R, R|m) MIMO system, i.e., choose two transmit antennas in T antennas and use all receive antennas. Also, L is denoted as the total number of retransmissions for a block. Then,

y(l)=H(l)x+w(l)  (1)

for lε[1, L], where y(l)εR×1 is a received signal vector, H(l)εR×2 is a complex channel gain matrix, xε2×1 is a transmitted signal vector and w(l)εR×1 is an independent and identically distributed (i.i.d.) circular symmetric complex Gaussian noise vector. Each element hi,j(l) in H(l) follows CN(0, 1). Also, it can be assumed that wi(l) ̃CN(0,1) and E└|xi|2┘=P/2, where wi(l)εw(l) and xiεx. To minimize decoding complexity, define γl and C(.) as follows:

    
    
        Channel quality of lth trial γl and accumulated channel quality function C(γ1, . . . , γl) are defined as
    
    






  
    
      
        
          
            γ
            l
          
          :=
          
            
              
                P
                2
              
              ⁢
              
                Tr
                ⁡
                
                  (
                  
                    
                      H
                      
                        (
                        l
                        )
                      
                    
                    ⁢
                    
                      H
                      
                        
                          (
                          l
                          )
                        
                        *
                      
                    
                  
                  )
                
              
            
            =
            
              
                P
                2
              
              ⁢
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  2
                
                ⁢
                
                  
                    ∑
                    
                      j
                      =
                      1
                    
                    R
                  
                  ⁢
                  
                    
                      
                      
                        h
                        
                          i
                          ,
                          j
                        
                        
                          (
                          l
                          )
                        
                      
                      
                    
                    2
                  
                
              
            
          
        
        ,
      
    
    
      
        (
        2
        )
      
    
  
  
    
      
        
          C
          ⁡
          
            (
            
              
                γ
                1
              
              ,
              ...
              ⁢
              
                
              
              ,
              
                γ
                l
              
            
            )
          
        
        :=
        
          
            
              ∑
              
                i
                =
                1
              
              l
            
            ⁢
            
              γ
              l
            
          
          =
          
            
              P
              2
            
            ⁢
            
              
                ∑
                
                  k
                  =
                  1
                
                l
              
              ⁢
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  2
                
                ⁢
                
                  
                    ∑
                    
                      j
                      =
                      1
                    
                    R
                  
                  ⁢
                  
                    
                      
                        
                        
                          h
                          
                            i
                            ,
                            j
                          
                          
                            (
                            k
                            )
                          
                        
                        
                      
                      2
                    
                    .
                  
                
              
            
          
        
      
    
    
      
        (
        3
        )
      
    
  




An embodiment of the invention uses an Alamouti Space-Time Block Code (STBC) and a maximal ratio combining (MRC) decoder for the system architecture. With an Alamouti STBC and an MRC decoder, a sufficient statistic for each receiving antenna for each trial is:)

ui(l)=∥hi(l)∥x+wi  (4)

where ui(l) is the sufficient statistic at ith receiving antenna in lth trial and hi(l) is the ith row of H(l). Thus, MRC is applied in the set {ui(l)}:





  
    
      
        
          u
          
            (
            l
            )
          
        
        =
        
        ⁢
        
          
            
              
                (
                
                  
                    ∑
                    
                      i
                      =
                      1
                    
                    R
                  
                  ⁢
                  
                    
                      
                      
                        h
                        i
                        
                          (
                          l
                          )
                        
                      
                      
                    
                    2
                  
                
                )
              
              
                1
                /
                2
              
            
            ⁢
            x
          
          +
          
            w
            ⁢
            
              
            
            ⁢
            
              (
              5
              )
            
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          
            
              
                
                  γ
                  l
                
              
              ·
              
                
                  2
                  P
                
              
            
            ⁢
            x
          
          +
          
            w
            ⁢
            
              
            
            ⁢
            
              (
              6
              )
            
          
        
      
    
  




where u(l) is the output of the MRC decoder in lth trial. Then, the accumulated decision variable Ul is updated from the previous value U(l−1) and current statistics γl by the MRC:





  
    
      
        
          U
          
            (
            l
            )
          
        
        =
        
        ⁢
        
          
            
              
                
                  
                    C
                    ⁡
                    
                      (
                      
                        
                          γ
                          1
                        
                        ,
                        ...
                        ⁢
                        
                          
                        
                        ,
                        
                          γ
                          
                            l
                            -
                            1
                          
                        
                      
                      )
                    
                  
                
                ·
                
                  U
                  
                    (
                    
                      l
                      -
                      1
                    
                    )
                  
                
              
              +
              
                
                  
                    γ
                    l
                  
                
                ·
                
                  u
                  
                    (
                    l
                    )
                  
                
              
            
            
              
                C
                ⁡
                
                  (
                  
                    
                      γ
                      1
                    
                    ,
                    ...
                    ⁢
                    
                      
                    
                    ,
                    
                      γ
                      l
                    
                  
                  )
                
              
            
          
          ⁢
          
            
          
          ⁢
          
            (
            7
            )
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          
            
              
                
                  C
                  ⁡
                  
                    (
                    
                      
                        γ
                        1
                      
                      ,
                      ...
                      ⁢
                      
                        
                      
                      ,
                      
                        γ
                        l
                      
                    
                    )
                  
                
              
              ·
              
                
                  2
                  P
                
              
            
            ⁢
            x
          
          +
          
            w
            .
            
              
            
            ⁢
            
              (
              8
              )
            
          
        
      
    
  




Since the decoding performance is directly related to C(.) in (8), it is sufficient to decide to continue retransmission or stop it and decode from U(l) only with the information C(.).
To select best channels for communication over the wireless link, the best antenna set nT(l) should be selected, and that depends on the switching algorithms that are used for antenna selection. Various embodiments may utilize one or more of the switching approaches described herein. Three possible Transmit Antenna Selection (TAS) protocols are considered for use in selecting transmit antennas. The transmitter and receiver may negotiate as to which, if any, of the TAS protocols will be used.
A first of the possible TAS protocols is the Random Transmit Antennas Selection (R-TAS) protocol. In R-TAS, the transmitter T, also referred to herein as Tx) chooses the next antenna set randomly without using a channel quality indicator (CQI) supplied from the receiving station. Referring again to FIG. 1, in R-TAS, the feedback 120 provided by the receiving station 109 is an ACK or NAK. One aspect of one or more embodiments of the invention is that when enough packets (one or more) have been received successfully to decode the intended transmitted message, the receiving station sends a message to the transmitting station to acknowledge (ACK) correct reception of the message. When unsuccessfully receiving the message, a NAK is sent. The ACK message may be used by the transmitting station to terminate retransmission and move on to the next message.
In R-TAS the transmitter selects the next transmit antenna randomly and transmits the same packet to the receiver until it receives an acknowledgement (ACK) from the receiver or the maximum number of retries allowed is reached (if a maximum number is specified). Some embodiments may not specify a maximum number of retries. Referring again to FIG. 1, the receiving station 109 receives the frame, determines Ci and if the measured channel quality indicator Ci<CT, then the receiver transmits a no acknowledgement (NAK) back to the transmitting station 100. CT is the channel quality threshold for decoding signals and is based on the particular service associated with the transmission. Higher Quality of Service (QoS) requirements may require a higher CT.
FIG. 2 is a simplified flow diagram of operation of an exemplary embodiment of an R-TAS system illustrated in FIG. 1. Assume that FIG. 2 illustrates a start-up condition for communications between the transmitter 100 and the receiver 109. At the beginning of transmitting, e.g., a frame of information, the control logic in the antenna switch 102 randomly selects at 201 a subset of the antennas shown in antenna sub-system 103. The transmitting station transmits the frame at 203 to the receiving station 109 over the randomly selected subset. The receiving station sends an Automatic Repeat reQuest (ARQ) to the transmitting station after receipt of the frame based on comparison of the measured channel quality indicator Ci and the threshold channel quality indicator CT. At 205, the transmitting station receives the ARQ. If the ARQ was an acknowledge (ACK) indicating successful receipt of the frame, the process is complete. However, if the ARQ was a NAK indicating unsuccessful receipt of the frame, then the flow returns to 201 and a random subset of the antennas is again selected and the same frame is transmitted to the receiving station 109. This process repeats until the limit of retries has been reached (if any), or an ACK is received.
FIG. 3 illustrates an exemplary R-TAS transmission scenario. At 301, randomly selected antenna subset 1 at the transmitting station (Tx) transmits a frame of information to the receiving station (Rx). At 302, after unsuccessfully decoding the first transmission, the Rx sends a NAK at 302. At 303, the Tx randomly selects antenna subset 3 and retransmits the frame (second transmission). The second transmission of the frame is successfully received by the Rx who sends the ACK at 304. After other traffic, the Tx randomly selects antenna subset 2 and the first transmission is successfully received by the Rx who responds with an ACK at 306.
At 307, the transmitting station randomly selects antenna subset 4 and transmits a frame of information to the receiving station (Rx). At 308, after unsuccessfully decoding the first transmission, the Rx sends a NAK. At 309, the Tx randomly selects antenna subset 1 and retransmits the frame (second transmission). At 310, after unsuccessfully decoding the first and second transmissions, the Rx sends a NAK. At 311, the Tx randomly selects antenna subset 2 and retransmits the frame (third transmission). At 312, after unsuccessfully decoding the first, second, and third transmissions, the Rx sends a NAK. Finally, at 313, the Tx randomly selects antennas subset 3 and retransmits the frame (fourth transmission). At 314, after successfully decoding the fourth transmission, typically exploiting the history of the other transmissions, the Rx sends an ACK.
Assuming the channel is varying independently between different frames, the R-TAS protocol is a good choice since it has a very low implementation complexity and CQI becomes useless in a time-uncorrelated channel.
A second protocol according to an embodiment of the invention is Threshold-Transmit Antenna Selection (T-TAS). The T-TAS protocol uses a predetermined channel quality threshold level. If any of the transmit antenna subsets achieve a higher channel quality than the threshold channel quality, the transmitter uses that antenna subset for the next retransmission. Otherwise, the transmitter selects the next antenna subset randomly and receives additional channel quality information from feedback information. FIG. 4 illustrates an exemplary flow diagram for the T-TAS protocol. To start, two channel quality thresholds, γT and CT are chosen. CT is the channel quality threshold for decoding signals and may be based on the particular service associated with the transmission. Higher Quality of Service (QoS) requirements may require a higher CT. Both γT and CT thresholds are typically associated with a signal to noise ratio (SNR). Assuming the two channel quality thresholds γT and CT are known, to start, the transmitter selects an antenna subset randomly in 401 and transmits a frame in 403. The receiver receives the frame, measures γi and Ci and if the measured channel quality indicator Ci<CT, then the receiver transmits a NAK and γi. Otherwise, the receiver transmits an ACK and γi if Ci>CT. In 405, the transmitter receives the ARQ/CQI (ACK/NAK and γi). In 407, if an ACK is received by the transmitter, the process ends. Note that FIG. 4 assumes an initial transmission between the transmitter and the receiver. Before describing the process if a NAK is received, some additional details are provided.
The threshold value γT provides an acceptable channel quality threshold level. The transmitter uses γi along with the ACK/NAK supplied by the receiver to decide what antennas to use for the next transmission. The transmitter stores a history of recent γis. Referring again to FIG. 4, if in 407 the transmitter receives a NAK, then the transmitter compares γT to γmax in 409, where γmax is the channel quality of the best known antenna subset of recent γis. γmax=max(γ1, . . . γL). If the answer to 409 is yes (γmax>γT), then the best known subset, associated with γmax, is selected for the next transmission in 411 and the flow returns to 403 to transmit the frame. Note that because γi may be denominated in dB improvement, the best subset of antennas may be determined by evaluating the set (γ1, . . . γL) for the antenna subset with the best transmission, not simply the largest valued γi. Note that in one embodiment, the set of γis runs from 1 to L, where L is the number of retries allowed. If the answer to 409 is NO (γmax<γT), then the transmitter returns to 401 and randomly selects another antenna subset for the next retransmission.
FIG. 5 illustrates an exemplary T-TAS transmission scenario showing the number of times a packet was transmitted. Three different scenarios are shown in FIG. 5 and it can be assumed that the antenna used for the first packet transmitted in each scenario was randomly selected. It depends, of course, on the traffic immediately preceding the transmission. For example, under certain circumstances, the transmitter may initially use the antenna that last successfully transmitted to the receiver to send the next frame. At 501, a first burst is transmitted by antenna subset 1, which is unsuccessfully decoded and results in a NAK/2 (γi=2). Note that γT=5 in the exemplary transmission sequence. The next antenna subset (2) is randomly selected and retransmits the burst at 503. The burst is successfully decoded and results in an ACK.
The second scenario in FIG. 5 is a transmission by antenna subset 2 at 505, which is successfully decoded and results in an ACK. The antenna subset 2 may be randomly selected or may be based on the successful transmission in 503. Obviously, the time between transmission at 503 and 505 may affect the benefits, if any, of using antenna subset 2 again.
The third scenario begins at 507 with a transmission by subset 3. The receiver returns a NAK/3 (γi=3). At 509, randomly selected antenna subset 4 transmits a second burst, which is unsuccessfully decoded and results in a NAK/6. Because γi=6>γT, γMAX is selected, which is antenna subset 4. Antenna subset 4 transmits at 511, resulting in an unsuccessful decode, and the receiver returns a NAK/6. Again, because γi=6>γT, γMAX is selected, which is antenna subset 4. Antenna subset 4 transmits at 513 resulting in a successful decode and an ACK.
Note that the selection of γT may be based on QoS and other factors associated with a particular service being provided. If γT is set too high, that can result in a large number of retransmissions with randomly selected antennas subsets. If γT is set too low, that can result in a large number of retransmissions with a current γMAX. In the T-TAS protocol, the average number of transmissions E[L] is a function of threshold level γT. With high γT, searching for an appropriate transmit antenna subset is difficult, i.e., E[L S] is large where LS is the number of transmissions until finding a proper subset. However, after finding a proper subset, the remaining number of transmissions LT is small. Similarly, if a relatively small γT is taken, then E[LS] decreases, while E[LT] increases. Therefore, one approach is to adjust γT to reduce E[L] for a given channel characteristic.
A third protocol according to an embodiment of the invention is the Minimum Number of Transmissions-Transmit Antenna Selection (MNT-TAS) protocol. The transmitter determines whether to use the best known antenna set for the next transmission or to select a new antenna set by random choice. However, MNT-TAS protocol does not have a predetermined threshold level. Instead, the transmitter evaluates the expectation of the number of remaining transmissions of two policies and takes the better policy. The transmitter determines whether it will use the best known antenna subsets for the next transmission or find a new antenna set by random choice. The transmitter evaluates the expectation of the number of remaining transmissions of two policies and takes the better policy.
In the MNT-TAS protocol, the transmitter compares the expectation of number of transmissions E[L] at each trial between two policies, e.g., one policy using the best known antenna subset and a second policy that tries a new subset. E[L] is a function of current maximum channel quality and remaining amount of channel quality

Clrem:=CT−C(γ1, . . . , γl), E[L]−l:=L(γlmax,Clrem)

is denoted, and





  
    
      
        
          L
          ⁡
          
            (
            
              
                γ
                l
                max
              
              ,
              
                C
                l
                rem
              
            
            )
          
        
        =
        
          min
          ⁢
          
            
              {
              
                
                  ⌈
                  
                    
                      C
                      l
                      
                        r
                        ⁢
                        
                          
                        
                        ⁢
                        em
                      
                    
                    
                      γ
                      l
                      
                        ma
                        ⁢
                        
                          
                        
                        ⁢
                        x
                      
                    
                  
                  ⌉
                
                ,
                
                  
                    
                      E
                      γ
                    
                    ⁡
                    
                      [
                      
                        L
                        ⁡
                        
                          (
                          
                            
                              max
                              ⁢
                              
                                {
                                
                                  
                                    γ
                                    l
                                    max
                                  
                                  ,
                                  γ
                                
                                }
                              
                            
                            ,
                            
                              
                                C
                                l
                                rem
                              
                              -
                              γ
                            
                          
                          )
                        
                      
                      ]
                    
                  
                  +
                  1
                
              
              }
            
            .
          
        
      
    
    
      
        (
        9
        )
      
    
  




If the transmitter decides to use the best known subset with channel quality for γlmax for (l+1)th trial, then it also uses γlmax for all kε[l+2, L]. By induction, it can be shown that if the transmitter decides to use the best known set, then it is optimal to use the set until the end of transmissions. To determine the optimal policy, it is necessary to estimate Eγ[L(.)]. If the probability density function (p.d.f.) of γ is denoted as pγ(γ), then:




  
    
      
        
          
            E
            γ
          
          ⁡
          
            [
            
              L
              ⁡
              
                (
                
                  
                    max
                    ⁢
                    
                      {
                      
                        
                          γ
                          l
                          max
                        
                        ,
                        γ
                      
                      }
                    
                  
                  ,
                  
                    
                      C
                      l
                      rem
                    
                    -
                    γ
                  
                
                )
              
            
            ]
          
        
        =
        
          
            
              ∫
              0
              
                γ
                l
                max
              
            
            ⁢
            
              
                L
                ⁡
                
                  (
                  
                    
                      γ
                      l
                      max
                    
                    ,
                    
                      
                        C
                        l
                        rem
                      
                      -
                      γ
                    
                  
                  )
                
              
              ⁢
              
                
                  p
                  γ
                
                ⁡
                
                  (
                  γ
                  )
                
              
              ⁢
              
                d
                γ
              
            
          
          +
          
            
              ∫
              
                γ
                l
                max
              
              ∞
            
            ⁢
            
              
                L
                ⁡
                
                  (
                  
                    γ
                    ,
                    
                      
                        C
                        l
                        rem
                      
                      -
                      γ
                    
                  
                  )
                
              
              ⁢
              
                
                  p
                  γ
                
                ⁡
                
                  (
                  γ
                  )
                
              
              ⁢
              
                
                  d
                  γ
                
                .
              
            
          
        
      
    
    
      
        (
        10
        )
      
    
  




It is difficult to find a closed form of Eγ[L(.)] because L(.) is defined by a recurrence relation and the relation is expressed in the continuous domain in (10). Instead of the exact expression, the following sub-optimal determine rule can be used:




  
    
      
        
          
            L
            ′
          
          ⁡
          
            (
            
              
                γ
                l
                max
              
              ,
              
                C
                l
                rem
              
            
            )
          
        
        =
        
          {
          
            
              
                
                  1
                  ,
                
              
              
                
                  0
                  <
                  
                    C
                    l
                    rem
                  
                  ≤
                  
                    γ
                    l
                    max
                  
                
              
            
            
              
                
                  
                    min
                    ⁢
                    
                      {
                      
                        
                          
                            L
                            ~
                          
                          ⁡
                          
                            (
                            
                              
                                γ
                                l
                                max
                              
                              ,
                              
                                C
                                l
                                rem
                              
                            
                            )
                          
                        
                        ,
                        
                          
                            
                              E
                              γ
                            
                            ⁡
                            
                              [
                              
                                
                                  L
                                  ~
                                
                                ⁡
                                
                                  (
                                  
                                    
                                      max
                                      ⁢
                                      
                                        {
                                        
                                          
                                            γ
                                            l
                                            max
                                          
                                          ,
                                          γ
                                        
                                        }
                                      
                                    
                                    ,
                                    
                                      
                                        C
                                        l
                                        rem
                                      
                                      -
                                      γ
                                    
                                  
                                  )
                                
                              
                              ]
                            
                          
                          +
                          1
                        
                      
                      }
                    
                  
                  ,
                
              
              
                otherwise
              
            
          
        
      
    
    
      
        (
        11
        )
      
    
  




where {tilde over (L)}(γ,C):=┌C/γ┐. Note that since L≦{tilde over (L)}, L is also less than or equal to L′ from (9) and (11).

FIG. 6 illustrates an exemplary flow diagram for the MNT-TAS protocol. In FIG. 6, L1 is the expectation of the remaining number of transmissions with the best known set. L2 is the expectation of the remaining number of transmission by trying a new set. In 601, a new antenna subset is randomly selected. At 603, a frame is transmitted over the randomly selected subset. The receiver receives the frame, measures γi and Ci and if the measured channel quality indicator Ci<CT, then the receiver transmits a NAK and γi. Otherwise, the receiver transmits an ACK and γi if Ci>CT. In 605, the transmitter receives the ARQ/CQI (ACK/NAK and γi). In 607, if an ACK is received by the transmitter, the process ends.
If a NAK is received in 607, the transmitter evaluates L1, (the expectation of the remaining number of transmissions with the best known subset) and L2, the expectation of the remaining number of transmissions by trying a new subset in 609. If L1>L2 in 611, the transmitter selects the best known set associated with L1 for retransmission of the frame in 613. The process repeats until an ACK is received or the limit (if any) of retransmissions is reached. If the answer is NO in 611, then the flow returns to 601 to randomly select a new antenna subset.
FIG. 7 illustrates an exemplary MNT-TAS transmission scenario. It can be assumed that the antenna used for the first packet transmitted in each scenario was randomly selected. It depends, of course, on the traffic immediately preceding the transmission. At 701, a first burst is transmitted by antenna subset 1, which is unsuccessfully decoded and results in a NAK/2 (γi=2). In this case L1 <L2 so the next antenna subset (2) is randomly selected and retransmits the burst at 603. The burst is successfully decoded and results in an ACK. The second scenario in FIG. 7 is a transmission by antenna subset 2 at 505, which is successfully decoded and results in an ACK. The third scenario begins at 707 with a transmission by subset 3. The receiver returns a NAK/3 (γi=3). In this case, after evaluation, the transmitter determines that L1 >L2, and so the best antenna subset (antenna subset 4) associated with L1 is selected for the next retransmission of the frame in 709. So antenna subset 4 transmits in 709 and a NAK/6 is received. Again, the transmitter determines that L1 >L2, and so the best antenna subset (antenna subset 4) is again selected for the next retransmission of the frame in 711. However, that transmission is also unsuccessfully decoded resulting in a NAK/6. Again the transmitter determines that L1 >L2 and so the best antenna subset (antenna subset 4) is again selected for the next retransmission of the frame in 713, which results in an ACK. Note that the transmission scenario is similar to that shown in FIG. 5 showing T-TAS, but the determination by the feedback processor (see FIG. 1) as to which antenna subset to use is based on different criteria in accordance with the MNT-TAS protocol.
In one MNT-TAS embodiment, if L1>L2, then the subset of antennas associated with the best subset is used for all subsequent retransmissions until an ACK is received. That may be useful when the channel is substantially static.
Having described three protocols, R-TAS, T-TAS and MNT-TAS, Table 1 summarizes the differences between the three protocols from the perspective of implementation complexity, the feedback information required and transmitter requirements.












TABLE 1







Protocol
Complexity
Feedback info
TX needs









R-TAS
low
ARQ
nothing



T-TAS
moderate
ARQ/CQI
threshold level



MNT-TAS
high
ARQ/CQI
distribution of 






Ch quality










Based on simulation results, the MNT-TAS protocol achieves the best performance, while the R-TAS protocol is worst. The T-TAS protocol is between two protocols. This result is intuitively reasonable since the MNT-TAS protocol uses CQI most effectively, while the R-TAS protocol never uses CQI.
Simulation results indicate that an exemplary (4, 2; 1, 1|m) system such as shown in FIG. 1, outperforms other configurations even with those with more than four antennas.
Note that various antenna selection embodiments described herein utilize the feedback processor 105 shown in FIG. 1 to select an antenna subset. The functionality to implement the appropriate antenna subset may be implemented in hardware or software or more typically a combination. Thus, the selection of an antenna subset based on R-TAS, T-TAS, or MNT-TAS, may utilize software running on processor 105. Any such software may be encoded in at least one computer readable medium selected from the set of a disk, tape, or other magnetic, optical, or electronic storage medium.
The description of the invention set forth herein is illustrative, and is not intended to limit the scope of the invention as set forth in the following claims. Variations and modifications of the embodiments disclosed herein, may be made based on the description set forth herein, without departing from the scope and spirit of the invention as set forth in the following claims.

## Claims

1. A method comprising:
selecting a first subset of antennas from a set of antennas for transmitting first information to a receiving device;
transmitting the first information over the first subset of antennas;
receiving one of an acknowledge (ACK) and a no acknowledge (NAK) from the receiving device indicating whether the first information was successfully received;
storing a history of channel quality indicators received from the receiving device in the transmitter;
in response to receiving the NAK, selecting a second subset of antennas from the set of antennas to retransmit the first information to the receiving device using the history of channel quality indicators received from the receiving device by comparing a threshold channel quality indicator to a best channel quality indicator in the history, the best channel quality indicator associated a best subset of the set of antennas; and
if the best channel quality indicator is greater than the threshold channel quality indicator then selecting the best subset of the set of antennas as the second subset of antennas to retransmit the first information and if the best channel quality indicator is less than the threshold channel quality indicator then randomly selecting one of the subset of antennas as the second subset to retransmit the first information; and
retransmitting the first information to the receiving device over the second subset of antennas.

2. The method as recited in claim 1 wherein the channel quality indicators provide respective indications of signal to noise ratio.

3. The method as recited in claim 1 wherein the channel quality indicators provide respective measures of signal to noise ratio improvement in a current transmission over a signal to noise ratio associated with a previous transmission.

4. The method as recited in claim 1 further comprising storing L channel quality indicators in the history, where L is a number of retries required.

5. The method as recited in claim 1 wherein the first subset is randomly selected.

6. The method as recited in claim 1 further comprising negotiating a particular type of transmit antenna selection protocol with the receiving device prior to transmitting the first information over the first subset of antennas.

7. The method as recited in claim 1 further comprising transmitting the first information using a space-time block code.

8. The method as recited in claim 1 wherein the first subset and the second subset are each at least two antennas.

9. A method comprising:
selecting a first subset of antennas from a set of antennas for transmitting first information to a receiving device, the first subset being two or more antennas;
transmitting the first information over the first subset of antennas;
receiving one of an acknowledge (ACK) and a no acknowledge (NAK) from the receiving device indicating whether the first information was successfully received;
in response to receiving the NAK, selecting a second subset of antennas of two or more antennas from the set of antennas to retransmit the first information to the receiving device, the selecting including comparing a threshold channel quality indicator to a best channel quality indicator in a history of channel quality indicators, the best channel quality indicator associated a best subset of the set of antennas;
if the best channel quality indicator is greater than the threshold channel quality indicator, selecting the best subset of the set of antennas as the second subset of antennas;
if the best channel quality indicator is less than the threshold channel quality indicator, randomly selecting the second subset of antennas; and
retransmitting the first information to the receiving device over the second subset of antennas.

10. The method as recited in claim 9 wherein the first subset is randomly selected.

11. The method as recited in claim 9 further comprising negotiating a particular type of transmit antenna selection protocol with the receiving device prior to transmitting the first information over the first subset of antennas.

12. The method as recited in 9 further comprising transmitting the first information using a space-time block code.

13. A method comprising:
selecting a first subset of antennas from a set of antennas for transmitting first information to a receiving device, the first subset being two or more antennas;
transmitting the first information over the first subset of antennas;
receiving one of an acknowledge (ACK) and a no acknowledge (NAK) from the receiving device indicating whether the first information was successfully received;
receiving a channel quality indicator from the receiving device;
in response to receiving the (NAK), comparing an expectation of a number of transmissions between a first and at least a second policy and selecting one of the first and second policies as a better policy, the better policy being evaluated according to which policy has an expectation of a fewer number of transmissions, wherein the expectation is determined as a function of a current maximum channel quality indicator and a remaining amount of channel quality;
selecting a second subset of the antennas associated with the better policy for retransmission of the first information; and
retransmitting the first information to the receiving device over the second subset of antennas.

14. The method as recited in claim 13 wherein the first subset is randomly selected.

15. The method as recited in claim 13 further comprising negotiating a particular type of transmit antenna selection protocol with the receiving device prior to transmitting the first information over the first subset of antennas.

16. The method as recited in claim 13 further comprising transmitting the first information using a space-time block code.

17. The method as recited in claim 13 wherein the first policy is a best known antenna subset and the second policy is a randomly selected subset.

18. The method as recited in claim 17 further comprising
if the best known antenna subset is the better policy, using the best known antenna subset for all subsequent retransmissions for the first information.

19. The method as recited in claim 13 wherein the remaining amount of channel quality is a difference between a channel quality threshold and an accumulated channel quality.

20. A transmitting station comprising:
a set of antennas having a plurality of selectable subsets of antennas, each subset including at least two antennas;
control logic to select a first subset of the set of antennas to transmit first information to a receiving device;
wherein the transmitting station is configured to receive one of an acknowledge (ACK) and a no acknowledge (NAK) from the receiving device indicating whether the first information was successfully received; and
wherein the control logic is, responsive to receiving the NAK, to select a second subset of the set of antennas from the set of antennas to retransmit the first information to the receiving device using a history of channel quality indicators received from the receiving device;
wherein the control logic is configured to determine a best channel quality indicator in the history and to compare a threshold channel quality indicator to the best channel quality indicator, the best channel quality indicator associated with a best subset of the set of antennas;
wherein the control logic is configured, responsive to the NAK and the best channel quality indicator being greater than the threshold channel quality indicator, to select the best subset of the set of antennas as the second subset of antennas to retransmit the first information; and
wherein the control logic is configured, responsive to the NAK and the best channel quality indicator being less than the threshold channel quality indicator to randomly select one of the subset of antennas as the second subset to retransmit the first information.

21. The transmitting station as recited in claim 20 further comprising:
storage locations for storing the history of received channel quality indicators.

22. The transmitting station as recited in claim 21 wherein the storage locations for the channel quality indicators provide storage for up to L channel quality indicators in the history, where L is a maximum number of retransmissions allowed.

23. The transmitting station as recited in claim 20 wherein the transmitting station includes a space-time block coder to transmit the first information using a space-time block code.

24. A transmitting station comprising:
a set of antennas having a plurality of selectable subsets of antennas, each subset including at least two antennas;
control logic to select a first subset of the set of antennas to transmit first information to a receiving device;
wherein the transmitting station is coupled to receive one of an acknowledge (ACK) and a no acknowledge (NAK) from the receiving device indicating whether the first information was successfully received; and
wherein the control logic is, responsive to receiving the NAK, configured to compare an expectation of a number of transmissions between a first and at least a second policy and select one of the first and second policies as a better policy according to which policy has an expectation of a fewer number of transmissions and to select a second subset of the antennas, associated with the better policy for retransmission of the first information, wherein the expectation of the fewer number of transmissions is determined as a function of a current maximum channel quality indicator and a remaining amount of channel quality.

25. The transmitting station as recited in claim 24 wherein the first policy is a best known antenna subset and the second policy is a randomly selected antenna subset.

26. The transmitting station as recited in claim 24 wherein the remaining amount of channel quality is a difference between a channel quality threshold and an accumulated channel quality.