# Patent

## Title
Data detection and demodulation for wireless communication systems

## Abstract

Techniques for detecting and demodulating data transmissions in wireless communication systems are presented. In one aspect, a decision-directed detector detects for data transmissions in a received signal by utilizing received data symbols as well as received pilot symbols. The decision-directed detector may be designed to perform differential detection in the frequency domain or coherent detection in the time domain, and may be used with multi-carrier modulation (e.g., OFDM). In another aspect, an adaptive threshold is used to perform detection of received data transmissions. A threshold may be determined for each data transmission hypothesized to have been received. The threshold may be computed, for example, based on the signal plus noise energy of the hypothesized data transmission.

## Background
CLAIM OF PRIORITY
This application is a divisional application of, and claims the benefit of priority from, U.S. patent application Ser. No. 10/692,833, filed Oct. 23, 2003 and entitled “Data Detection and Demodulation for Wireless Communication Systems”, which claims the benefit of priority from U.S. Provisional Patent Application Ser. No. 60/421,309, filed Oct. 25, 2002 and entitled “MIMO WLAN System” and also claims the benefit of priority from U.S. Provisional Application Ser. No. 60/432,626, filed Dec. 10, 2002 and entitled “Data Detection and Demodulation for Wireless Communication Systems”, all three of which are assigned to the assignee of this application for patent, and all three of which are fully incorporated herein by reference for all purposes.
RELATED APPLICATIONS
This application is further related to U.S. Provisional Patent Application Ser. No. 60/432,440, filed Dec. 10, 2002 and entitled “Random Access for Wireless Multiple-Access Communication Systems”, which assigned to the assignee of this application for patent, and which is fully incorporated by reference for all purposes.


BACKGROUND
1. Field
The present invention relates generally to data communication, and more specifically to techniques for detecting and demodulating data transmissions in wireless communication systems.
2. Background
In a wireless communication system, data to be transmitted is typically processed (e.g., coded and modulated) and then upconverted onto a radio frequency (RF) carrier signal to generate an RF modulated signal that is more suitable for transmission over a wireless channel. The RF modulated signal is then transmitted from a transmitter and may reach a receiver via a number of propagation paths in the wireless channel. The characteristics of the propagation paths typically vary over time due to a number of factors such as, for example, fading, multipath, and external interference. Consequently, the RF modulated signal may experience different channel conditions (e.g., different fading and multipath effects) and may be associated with different complex gains across the operating bandwidth of the system.
To achieve high performance, a pilot (i.e., a reference signal) is often transmitted by the transmitter to assist the receiver in performing a number of functions. The pilot is typically generated based on known symbols and processed in a known manner. The pilot may be used by the receiver for channel estimation, timing and frequency acquisition, coherent demodulation, and so on
It is often desirable or necessary to detect for the presence of data transmissions in a received signal. The detection for data transmissions is normally achieved by processing the pilot for each data transmission hypothesized to have been received. If the energy of the pilot is greater than a particular threshold, then the hypothesized data transmission is further processed (e.g., demodulated and decoded). An error detection code, such as a cyclic redundancy check (CRC), is then typically relied upon to determine whether the data transmission was decoded correctly or in error.
In some wireless communication systems, detection based on the pilot alone is not sufficient. This may be the case, for example, when operating at a low received signal-to-noise ratio (SNR). Moreover, an error detection code may not be available for use to verify the correctness of the received data transmission.
There is therefore a need in the art for techniques to detect and demodulate data transmissions in such wireless communication systems.
SUMMARY
Techniques are provided herein for detecting and demodulating data transmissions in wireless communication systems. In one aspect, a decision-directed detector is provided to detect for data transmissions in a received signal. This detector utilizes received data symbols as well as received pilot symbols to perform the detection and is thus able to provide improved detection performance. The decision-directed detector may be designed to operate in the frequency domain or the time domain. For a system utilizing multi-carrier modulation (e.g., OFDM), the detector may be designed to perform differential detection in the frequency domain or coherent detection in the time domain, both of which are described in detail below.
In another aspect, an adaptive threshold is used to perform detection of received data transmissions. A threshold may be determined for each data transmission hypothesized to have been received. The threshold may be computed, for example, based on the total received signal energy (i.e., signal plus noise plus interference) of the hypothesized data transmission. The use of an adaptive threshold can provide robust detection performance in many operating environments, such as in an unlicensed frequency band where various sources of interference may be present.
Various aspects and embodiments of the invention are described in further detail below. For example, receiver structures for various transmission schemes are also described herein.



BRIEF DESCRIPTION OF THE DRAWINGS
The features, nature, and advantages of the present invention will become more apparent from the detailed description set forth below when taken in conjunction with the drawings in which like reference characters identify correspondingly throughout and wherein:
FIG. 1 shows a wireless communication system;
FIGS. 2A and 2B show exemplary protocol data units (PDUs) for Channels 1 and 2, respectively;
FIG. 3A shows a block diagram of a transmitter unit;
FIG. 3B illustrates an OFDM symbol;
FIG. 4 shows a block diagram of a receiver unit;
FIG. 5 shows a correlation detector;
FIG. 6 shows an embodiment of the correlation detector;
FIG. 7 shows a detector/data demodulator that includes a data demodulator and a decision-directed detector;
FIG. 8A shows an embodiment of the data demodulator;
FIG. 8B shows a decision-directed detector that performs differential detection in the frequency domain;
FIG. 8C shows a decision-directed detector that performs coherent detection in the time domain;
FIG. 9 shows a block diagram of an access point and a user terminal;
FIGS. 10A and 10B show exemplary transmissions on Channels 1 and 2, respectively; and
FIGS. 11A and 11B show the receiver processing for Channels 1 and 2, respectively.



DETAILED DESCRIPTION
The word “exemplary” is used herein to mean “serving as an example, instance, or illustration.” Any embodiment or design described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments or designs.
FIG. 1 shows a wireless communication system 100 that includes a number of access points (APs) 110 that communicate with a number of user terminals (UTs) 120. (For simplicity, only one access point is shown in FIG. 1.) An access point may also be referred to as a base station or some other terminology. Each user terminal may be a fixed or mobile terminal and may also be referred to as an access terminal, a mobile station, a remote station, a user equipment (UE), a wireless device, or some other terminology. Each user terminal may communicate with one or possibly multiple access points on the downlink and/or the uplink at any given moment. The downlink (i.e., forward link) refers to transmission from the access point to the user terminal, and the uplink (i.e., reverse link) refers to transmission from the user terminal to the access point.
The techniques described herein for detecting and demodulating data transmission may be used for various wireless communication systems. For example, these techniques may be used for systems that employ (1) one or multiple antennas for data transmission and one or multiple antennas for data reception, (2) various modulation techniques (e.g., CDMA, OFDM, and so on), and (3) one or multiple frequency bands for the downlink and uplink.
For clarity, the techniques are specifically described below for an exemplary wireless communication system. In this system, a receiver is equipped with multiple (T) antennas for data reception, and a transmitter may be equipped with one or multiple antennas. The system further employs orthogonal frequency division multiplexing (OFDM), which effectively partitions the overall system bandwidth into multiple (N) orthogonal subbands. For OFDM, the data or pilot to be transmitted on each subband is first modulated (i.e., symbol mapped) using a particular modulation scheme. Signal values of zero are provided for subbands not used for data/pilot transmission. For each OFDM symbol period, the modulation symbols and zero signal values for all N subbands are transformed to the time domain using an inverse fast Fourier transform (IFFT) to obtain a transformed symbol that comprises N time-domain samples. To combat inter-symbol interference (ISI), a portion of each transformed symbol is often repeated to form a corresponding OFDM symbol, which is then transmitted over the wireless channel. An OFDM symbol period (or simply, a symbol period) corresponds to the duration of one OFDM symbol, which is the smallest unit of transmission for the system. In one specific design, the system bandwidth is 20 MHz, N=64, the subbands are assigned indices of −32 to +31, the duration of each transformed symbol is 3.2 μsec, the cyclic prefix is 800 nsec, and the duration of each OFDM symbol is 4.0 μsec.
For clarity, two specific transmission schemes and two receiver structures are described below. The first transmission scheme is used for Transport Channel 1 (or simply, Channel 1 or CH1) and has the following characteristics: (1) transmissions on Channel 1 are not time-compensated at the transmitter and arrive at unknown times at the receiver, and (2) each transmission on Channel 1 includes multiple OFDM symbols for data and pilot. The second transmission scheme is used for Transport Channel 2 (or simply, Channel 2 or CH2) and has the following characteristics: (1) transmissions on Channel 2 are time-compensated at the transmitter and arrive time-aligned to slot boundaries at the receiver, and (2) each transmission on Channel 2 includes a single OFDM symbol for both data and pilot. Slow and fast random access channels with similar characteristics as those of Channels 1 and 2 are described in the aforementioned U.S. Patent Application Ser. No. 60/432,440.
FIG. 2A shows an exemplary protocol data unit (PDU) 210 that may be used for Channel 1 (CH1 PDU). CH1 PDU 210 comprises a reference portion 220 that is time division multiplexed (TDM) with a CH1 message portion 230. Reference portion 220 includes P pilot OFDM symbols 222, where P can be any integer one or greater. The pilot OFDM symbols are used to facilitate acquisition and detection of a CH1 transmission as well as to aid in coherent demodulation of the CH1 message portion. CH1 message portion 230 includes D data OFDM symbols 232, where D can be any integer one or greater. The pilot and data OFDM symbols may be generated as described below.
FIG. 2B shows an exemplary PDU 250 that may be used for Channel 2 (CH2 PDU). CH2 PDU 250 comprises a reference portion 260 that is subband multiplexed with a CH2 message portion 270. Reference portion 260 comprises a set of pilot symbols that is transmitted on one set of subbands (shown as shaded subbands in FIG. 2B). CH2 message portion 270 comprises a group of data symbols that is transmitted on another set of subbands. The data symbols are generated by coding, interleaving, and symbol mapping a CH2 message 280. The frequency-domain multiplexed pilot and data symbols are processed to generate time-domain CH2 PDU 250, as described below.
In the embodiment shown in FIG. 2B, the pilot subbands and data subbands are interlaced such that each data subband is flanked on both sides by pilot subbands. The pilot symbols transmitted on the pilot subbands may be used to estimate the channel responses for the data subbands and for coherent demodulation. Other subband multiplexing schemes may also be implemented, and this is within the scope of the invention. For example, each group of Q data subbands may be flanked on both sides by pilot subbands, where Q may be any positive integer.
FIG. 3A shows a block diagram of an embodiment of a transmitter unit 300 that can perform transmit data processing for Channels 1 and 2 described above. Transmitter unit 300, which may be implemented within an access point or a user terminal, includes a transmit (TX) data processor 310, an optional TX spatial processor 330, and one OFDM modulator 340 for each transmit antenna 350.
Within TX data processor 310, a CRC generator 312 receives data for a CH1 or CH2 message and (optionally) generates a CRC value for the message. An encoder 314 then codes the message data and the CRC value (if included) in accordance with a particular coding scheme to provide code bits. An interleaver 316 next interleaves (i.e., reorders) the code bits based on a particular interleaving scheme to provide frequency and possibly time diversity. A symbol mapping unit 318 then maps the interleaved data in accordance with a particular modulation scheme to provide modulation symbols, which are also referred to as data symbols and denoted as s(k).
A multiplexer (MUX) 320 receives and multiplexes the data symbols with pilot symbols in the manner defined for the CH1 or CH2 message being processed. For the embodiment shown in FIG. 2A, a CH1 PDU comprises P pilot OFDM symbols followed by D data OFDM symbols. For a CH1 message, multiplexer 320 provides a set of pilot symbols {p1(k)} for each of the P pilot OFDM symbols, then the data symbols for each of the D data OFDM symbols. For the embodiment shown in FIG. 2B, a CH2 PDU comprises L+1 pilot symbols interlaced with L data symbols. For a CH2 message, multiplexer 320 provides a set of L+1 pilot symbols {p2(k)} multiplexed with a group of L data symbols. In any case, multiplexer 320 provides a stream of multiplexed data and pilot symbols.
Table 1 shows a specific embodiment of two sets of pilot symbols, {p1(k)} and {p2(k)}, for CH1 and CH2 reference portions. In this embodiment, only 52 of the 64 total subbands are used for data and pilot transmission, and the other 12 subbands (with zero entries in Table 1) are not used. In an embodiment, the pilot symbols are QPSK modulation symbols. The 52 pilot symbols for the CH1 reference portion are selected such that a waveform generated based on these pilot symbols has minimum peak-to-average variation. This characteristic allows the pilot OFDM symbol to be transmitted at a higher power level, which can provide improved performance.







TABLE 1







Pilot Symbols for CH1 and CH2










CH1
CH2



Pilot
Pilot


Subband
Symbol
Symbol


Index
p1(k)
p2(k)












−32
0
0


−31
0
0


−30
0
0


−29
0
0


−28
0
0


−27
0
0


−26
−1 − j
−1 + j


−25
−1 + j
−1 + j


−24
−1 + j
data


−23
−1 + j
−1 − j


−22
 1 − j
data


−21
 1 − j
−1 − j


−20
 1 + j
data


−19
−1 − j
−1 − j


−18
−1 + j
data


−17
 1 + j
 1 + j


−16
−1 + j
data


−15
 1 − j
 1 + j


−14
 1 + j
data


−13
 1 − j
 1 + j


−12
 1 − j
data


−11
−1 − j
 1 + j


−10
−1 − j
data


−9
 1 − j
 1 − j


−8
−1 − j
data


−7
 1 + j
−1 + j


−6
−1 + j
data


−5
−1 − j
−1 − j


−4
−1 + j
data


−3
−1 + j
−1 + j


−2
 1 − j
data


−1
−1 + j
−1 + j


0
0
0


1
 1 − j
−1 − j


2
−1 − j
data


3
−1 − j
−1 − j


4
−1 − j
data


5
−1 + j
 1 + j


6
 1 + j
data


7
−1 − j
−1 − j


8
−1 + j
data


9
−1 − j
 1 − j


10
−1 − j
data


11
 1 + j
 1 + j


12
 1 − j
data


13
−1 + j
 1 − j


14
−1 − j
data


15
 1 + j
−1 + j


16
−1 + j
data


17
−1 + j
 1 − j


18
 1 − j
data


19
 1 + j
−1 − j


20
−1 + j
data


21
 1 + j
−1 − j


22
−1 + j
data


23
 1 + j
−1 − j


24
−1 + j
data


25
 1 − j
−1 + j


26
−1 − j
 1 − j


27
0
0


28
0
0


29
0
0


30
0
0


31
0
0









If multiple antennas are available, then an optional TX spatial processor 330 may be used to perform spatial processing on the multiplexed data and pilot symbols. For example, TX spatial processor 330 may perform spatial processing for (1) beam-steering or beam-forming to transmit the symbols on a single spatial channel of a MIMO channel, (2) transmit diversity to transmit the symbols on multiple antennas and subbands to achieve diversity, or (3) spatial multiplexing to transmit the symbols on multiple spatial channels. Spatial processing for all of these transmission modes is described in detail in the aforementioned provisional U.S. Application Serial No. 60/421,309.
TX spatial processor 330 provides one stream of transmit symbols for each antenna. The transmit symbols are simply the multiplexed data and pilot symbols if spatial processing is not performed. Each transmit symbol stream is provided to a respective OFDM modulator 340. Within each OFDM modulator 340, an inverse fast Fourier transform (IFFT) unit 342 converts each sequence of N transmit symbols into a time-domain transformed symbol comprised of N time-domain samples, where N is the total number of subbands. For each transformed symbol, a cyclic prefix generator 344 repeats a portion of the transformed symbol to form a corresponding OFDM symbol comprised of M samples. Cyclic prefix generator 344 provides a stream of OFDM symbols to a transmitter (TMTR) 346, which converts the OFDM symbol stream into one or more analog signals and further amplifies, filters, and frequency upconverts the analog signal(s) to generate an RF modulated signal that is then transmitted from an associated antenna 350.
FIG. 3B illustrates an OFDM symbol, which is composed of two parts: a cyclic prefix and a transformed symbol. In an embodiment, N=64, the cyclic prefix comprises 16 samples, and each OFDM symbol comprises M=80 samples. The cyclic prefix is a copy of the last 16 samples (i.e., a cyclic continuation) of the transformed symbol and is inserted in front of the transformed symbol. The cyclic prefix ensures that the OFDM symbol retains its orthogonal property in the presence of multipath delay spread.
FIG. 10A shows an exemplary transmission on Channel 1. The time line for Channel 1 is divided into CH1 slots, with each CH1 slot having a particular duration (e.g., P+D OFDM symbol periods). In an embodiment, one CH1 PDU may be transmitted on each CH1 slot.
User terminals A and B have locked their timing and frequency to that of the system. This may be achieved by receiving a transmission (e.g., a beacon pilot) that carries or is embedded with timing information. The user terminals then set their timing based on the received timing information. However, the timing of each user terminal may be skewed (or delayed) with respect to the system timing, where the amount of skew typically corresponds to the propagation delay for the transmission containing the timing information. If the user terminals and system both derive their timing from a common time source (e.g., GPS), then there may be no timing skews between these entities.
In FIG. 10A, user terminals A and B (e.g., randomly) select two different CH1 slots (e.g., slots 3 and 1, respectively) to transmit their CH1 PDUs. Because user terminals A and B are associated with different timing skews and different propagation delays, their CH1 PDUs arrive at the access point with different delays (referred to as round trip delays or RTDs) with respect to the access point's CH1 slot boundaries.
FIG. 10B shows an exemplary transmission on Channel 2. The time line for Channel 2 is divided into CH2 slots, with each CH2 slot having a particular duration (e.g., one OFDM symbol period). One CH2 PDU may be transmitted on each CH2 slot.
For FIG. 10B, user terminals A and B have locked their timing to that of the system and further have knowledge of their RTDs, which may be determined by the access point (e.g., during system access) and reported back to the user terminals. The user terminals may thereafter adjust their transmit timing to account for their RTDs such that their CH2 PDUs arrive time-aligned to the selected CH2 slot boundaries at the access point.
In FIG. 10B, user terminals A and B (e.g., randomly) select CH2 slots 3 and 1, respectively, to transmit their CH2 PDUs. Because user terminals A and B time-compensated their transmissions, the CH2 PDUs arrive at the access point approximately aligned to the boundaries of the selected CH2 slots, as shown in FIG. 10B.
FIG. 4 shows a block diagram of an embodiment of a receiver unit 400 that can perform receive data processing for Channels 1 and 2 described above. Receiver unit 400, which may also be implemented within an access point or a user terminal, includes one receiver (RCVR) 410 for each of T receive antennas 408, a detector/data demodulator 420, and a receive (RX) data processor 450.
Each antenna 408 receives the RF modulated signals transmitted by the transmitter unit and provides a received signal to a respective receiver 410. Each receiver 410 conditions (e.g., amplifies, filters, and frequency downconverts) its received signal and digitizes the conditioned signal to provide samples, which are denoted as xi(n).
Detector/data demodulator 420 includes a data demodulator 430 and a detector 440 that receive and process the samples from all receivers 410 to detect and demodulate data transmissions on Channels 1 and 2. The processing by unit 420 is described in further detail below. Unit 420 provides recovered data symbols, denoted as ŝ(k), which are estimates of the transmitted data symbols s(k). Within RX data processor 450, the recovered data symbols are demapped by a symbol demapping unit 452, deinterleaved by a deinterleaver 454, and decoded by a decoder 456 to provide decoded data for CH1 and CH2 messages. If a recovered message includes a CRC value, then a CRC checker 458 checks the message with the CRC value to determine whether it was decoded correctly or in error.
FIG. 11A shows the receiver processing for Channel 1, which is not time-compensated. Referring back to FIG. 10A, even though the transmitter units attempt to transmit on specific CH1 slots, the CH1 transmissions are not time-compensated and the resultant behavior of Channel 1 is similar to that of an unslotted channel. In this case, referring back to FIG. 11A, the receiver unit can use a sliding correlation detector to detect for CH1 transmissions, each of which may be received starting at any sample period.
The correlation detector, which may operate in the time domain, slides through the entire time span in which CH1 PDUs may be received, one sample period at a time. A detection window indicates the time period in which samples for one CH1 PDU are to be processed by the detector. This detection window may be initialized to the start of the first CH1 slot and would then slide forward one sample period at a time. For each sample period, which corresponds to a hypothesis, the correlation detector processes the samples within the detection window to determine a metric for a CH1 PDU hypothesized to have been received starting at that sample period. If the metric exceeds a CH1 threshold, then the CH1 PDU is further decoded to recover the CH1 message. The metric may relate to signal energy or some other parameter. The CH1 threshold may be fixed or adaptive (e.g., dynamically determined based on the samples within the detection window).
FIG. 5 shows a block diagram of a correlation detector 440a, which is one embodiment of detector 440 in FIG. 4. The samples xi(n) for each of the T receive antennas are provided to a respective antenna processor 510. Within each processor 510, a symbol accumulator 520 receives and accumulates the samples for the current hypothesis and provides accumulated samples {tilde over (x)}i(n) to a delay line/buffer 530. For the CH1 PDU shown in FIG. 2A, symbol accumulator 520 performs accumulation of the P pilot OFDM symbols, where the accumulation is performed on a per sample basis, to provide an accumulated pilot OFDM symbol having M samples. Delay line/buffer 530 provides storage for N of the M samples and effectively discards M−N samples for the cyclic prefix. These N samples are for the transformed symbol corresponding to the accumulated pilot OFDM symbol.
A signal detector 540 then determines a metric for the accumulated pilot OFDM symbol. In an embodiment and as described below, the metric relates to the signal energy of the N samples for the accumulated pilot OFDM symbol. However, other metrics may also be used, and this is within the scope of the invention. An adaptive threshold computation unit 550 determines an adaptive threshold value Yi(n) to use to decide whether or not a CH1 transmission was received. A summer 560 sums the threshold values for all T antennas to provide a combined threshold value Ytot(n), which is further scaled with a scaling factor S1 by a multiplier 562 to obtain a final threshold value Y(n). A summer 564 sums the metric values for all T antennas to provide a final metric value E(n), which is then compared against the final threshold value Y(n) by a comparator 570. The detector output would indicate that a CH1 PDU was received if E(n)>Y(n), and that no CH1 PDU was received otherwise.
FIG. 6 shows a block diagram of a correlation detector 440b, which is one embodiment of detector 440a in FIG. 5. The samples xi(n) for each receive antenna are provided to symbol accumulator 520, which is implemented with P−1 delay units 522 and P−1 summers 524. Each delay unit 522 provides one OFDM symbol (i.e., M samples) of delay. The P−1 summers 524 perform accumulation of the P pilot OFDM symbols on a per sample basis, and the last summer provides the samples {tilde over (x)}i(n) for the accumulated pilot OFDM symbol. The samples {tilde over (x)}i(n) may be expressed as:




  
    
      
        
          
            
              
                x
                ~
              
              i
            
            ⁡
            
              (
              n
              )
            
          
          =
          
            
              ∑
              
                j
                =
                0
              
              
                P
                -
                1
              
            
            ⁢
            
              
                x
                i
              
              ⁡
              
                (
                
                  n
                  -
                  jM
                
                )
              
            
          
        
        ,
        
          
            for
            ⁢
            
              
            
            ⁢
            i
          
          ∈
          
            
              {
              
                1
                ⁢
                
                  
                
                ⁢
                ...
                ⁢
                
                  
                
                ⁢
                T
              
              }
            
            .
          
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          1
          )
        
      
    
  




The samples {tilde over (x)}i(n) are provided to delay line/buffer 530, which is implemented with N−1 delay units 532, each of which provides one sample period of delay.

Signal detector 540 performs correlation of the accumulated pilot OFDM symbol with the known pilot OFDM symbol and determines the metric value Ei(n) for the accumulated pilot OFDM symbol. Each of the N samples for the accumulated pilot OFDM symbol is provided to a respective multiplier 542, which also receives a corresponding conjugated pilot sample {tilde over (p)}1*(j), where jε{0 . . . N−1}. To obtain {{tilde over (p)}1*(j)}, the set of pilot symbols {p1(k)} for the pilot subbands and zero signal values for the unused subbands (e.g., as shown in Table 1) are transformed to the time domain using an N-point IFFT to obtain N pilot samples, {tilde over (p)}1(0) through {tilde over (p)}1(N−1), which are then conjugated and provided to N multipliers 542. Each multiplier 542 multiplies its sample {tilde over (x)}i(n−j) with its conjugated pilot sample {tilde over (p)}1*(j) and provides the result to a summer 544. Summer 544 sums the results from all N multipliers 542 and provides the summed result to a unit 546. Unit 546 determines the squared magnitude of the summed result, which is provided as the metric value Ei(n). The metric value for each antenna may be expressed as:




  
    
      
        
          
            
              E
              i
            
            ⁡
            
              (
              n
              )
            
          
          =
          
            
              
              
                
                  ∑
                  
                    j
                    =
                    0
                  
                  
                    N
                    -
                    1
                  
                
                ⁢
                
                  
                    
                      
                        p
                        ~
                      
                      1
                      *
                    
                    ⁡
                    
                      (
                      j
                      )
                    
                  
                  ·
                  
                    
                      
                        x
                        ~
                      
                      i
                    
                    ⁡
                    
                      (
                      
                        n
                        -
                        j
                      
                      )
                    
                  
                
              
              
            
            2
          
        
        ,
        
          
            for
            ⁢
            
              
            
            ⁢
            i
          
          ∈
          
            
              {
              
                1
                ⁢
                
                  
                
                ⁢
                ...
                ⁢
                
                  
                
                ⁢
                T
              
              }
            
            .
          
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          2
          )
        
      
    
  




Summer 564 receives and sums the metric values for all T antennas to provide the final metric value E(n), which may be expressed as:





  
    
      
        
          E
          ⁡
          
            (
            n
            )
          
        
        =
        
          
            ∑
            
              i
              =
              1
            
            T
          
          ⁢
          
            
              
                E
                i
              
              ⁡
              
                (
                n
                )
              
            
            .
          
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          3
          )
        
      
    
  




Threshold computation unit 550 determines an adaptive threshold to use for the detection of CH1 PDU for the current hypothesis. Each of the N samples for the accumulated pilot OFDM symbol is provided to a respective unit 552, which determines the squared magnitude of the sample. A summer 554 then sums the squared magnitudes from all N units 552 to provide the threshold value Yi(n). Summer 560 receives and sums the threshold values for all T antennas to provide the combined threshold value Ytot(n), which may be expressed as:




  
    
      
        
          
            Y
            tot
          
          ⁡
          
            (
            n
            )
          
        
        =
        
          
            ∑
            
              i
              =
              1
            
            T
          
          ⁢
          
            
              ∑
              
                j
                =
                0
              
              
                N
                -
                1
              
            
            ⁢
            
              
                
                  
                  
                    
                      
                        x
                        ~
                      
                      i
                    
                    ⁡
                    
                      (
                      
                        n
                        -
                        j
                      
                      )
                    
                  
                  
                
                2
              
              .
            
          
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          4
          )
        
      
    
  




Multiplier 562 then scales the combined threshold value with the scaling factor S1 to provide the final threshold value, which may be given as Y(n)=S1·Ytot(n).

Comparator 570 compares the final metric value E(n) against the final threshold value Y(n) and provides the detector output D(n), which may be expressed as:




  
    
      
        
          D
          ⁡
          
            (
            n
            )
          
        
        =
        
          {
          
            
              
                
                  “
                  
                    CH
                    ⁢
                    
                      
                    
                    ⁢
                    1
                    ⁢
                    
                      
                    
                    ⁢
                    PDU
                    ⁢
                    
                      
                    
                    ⁢
                    present
                  
                  ”
                
              
              
                
                  
                    
                      if
                      ⁢
                      
                        
                      
                      ⁢
                      
                        E
                        ⁡
                        
                          (
                          n
                          )
                        
                      
                    
                    >
                    
                      Y
                      ⁡
                      
                        (
                        n
                        )
                      
                    
                  
                  ,
                
              
            
            
              
                
                  “
                  
                    CH
                    ⁢
                    
                      
                    
                    ⁢
                    1
                    ⁢
                    
                      
                    
                    ⁢
                    PDU
                    ⁢
                    
                      
                    
                    ⁢
                    not
                    ⁢
                    
                      
                    
                    ⁢
                    present
                  
                  ”
                
              
              
                
                  otherwise
                  .
                
              
            
          
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          5
          )
        
      
    
  




If a CH1 PDU is detected, then the OFDM symbol timing is set at the time instant of the CH1 PDU detection (i.e., at the specific value of n when the CH1 PDU is detected).

The scaling factor S1 is a positive constant selected to provide (1) a particular missed detection probability, which is the probability of not detecting a CH1 PDU that has been transmitted, and (2) a particular false alarm rate, which is the probability of falsely indicating that a CH1 PDU was received when in fact none was transmitted. It is desirable to have the missed detection probability be less than the message error rate (MER), so that the MER is dictated by the received SNR and other parameters and not by the detector. The MER may be specified for Channel 1, for example, to be 1 percent or less. The detector output may be used to determine whether or not to process the received CH1 PDU to recover the transmitted CH1 message. The determination as to whether the CH1 message is decoded correctly or in error may be made based on a CRC value included in the message.
For a given received CH1 PDU, it may be possible for the correlation detector to declare multiple detections. This is because a detection may be declared with noise in one or more OFDM symbols and signal in the other OFDM symbols for the CH1 PDU being detected. For example, when P=2, a first detection may occur with noise in OFDM symbol 1 and signal in OFDM symbol 2, and a second detection with a larger final metric value will occur when the second signal OFDM symbol arrives one OFDM symbol period later. Thus, for P>1, the detector may be operated to continue to detect for the CH1 PDU for an additional P−1 OFDM symbol periods to find the largest final metric value for the PDU. The OFDM symbol timing is then set by the detection with the largest final metric value and the RTD is also computed based on the time associated with this detection.
The detection processing may be performed independently of the message processing, i.e., the detection processing can continue in the normal manner regardless of whether or not CH1 PDUs are detected. Thus, if a CH1 PDU is initially detected at sample period n−j with a final metric value of E(n−j) and another CH1 PDU is later detected at sample period n with a final metric value of E(n), where E(n)>E(n−j) and j is smaller than the size of the detection window, then the current message processing for the CH1 PDU detected at sample period n−j may be halted and the CH1 PDU detected at sample period n may be processed instead.
FIG. 11B shows the receiver processing for Channel 2, which is time-compensated. Referring back to FIG. 10B, the transmitter units transmit on specific CH2 slots and the CH2 transmissions are time-compensated to arrive at the receiver unit at the selected CH2 slot boundaries. In this case, referring back to FIG. 11B, the receiver unit can detect for CH2 transmissions in each CH2 slot (instead of each sample period), and the detection window can move from slot to slot. For each CH2 slot, which corresponds to a hypothesis, the decision-directed detector processes the samples received within the detection window to determine a metric for a CH2 PDU hypothesized to have been received in that slot. If the metric exceeds a CH2 threshold, then the CH2 PDU is deemed to have been received.
FIG. 7 shows a block diagram of an embodiment of a detector/data demodulator 420c, which may also be used for unit 420 in FIG. 4. Detector/data demodulator 420c includes a data demodulator 430c used to perform coherent demodulation and a decision-directed detector 440c used to detect for CH2 PDUs. The samples for each of the T receive antennas are provided to a respective antenna demodulator 710 within data demodulator 430c and to a respective decision-directed detector 750 within detector 440c. 
Each antenna demodulator 710 performs coherent demodulation for one antenna for one received OFDM symbol at a time. For each received OFDM symbol, an FFT unit 712 receives the samples xi(n) for the OFDM symbol, removes the cyclic prefix to obtain the transformed symbol, and performs a fast Fourier transform (FFT) on the transformed symbol to provide N received symbols ri(k), which include received data symbols ri,d(k) and received pilot symbols ri,p(k). A channel estimator 720 then estimates the channel response of the data subbands based on the received pilot symbols ri,p(k). A demodulator 730 performs coherent demodulation of the received data symbols ri,d(k) with the channel estimates to provide recovered data symbols ŝi(k).
A symbol accumulator 740 receives and accumulates the recovered data symbols from demodulators 710a through 710t for the T receive antennas and provides recovered symbols ŝ(k). RX data processor 450 then processes the recovered symbols ŝ(k), as described above for FIG. 4, to provide the decoded data. In an embodiment, the CH2 message does not include a CRC, and the CRC check is not performed by the RX data processor. A TX data processor 310 then processes the decoded data to provide remodulated symbols c(k), which are estimates of the transmitted data symbols s(k). The processing by processor 310 includes encoding, interleaving, and symbol mapping, as described above for FIG. 3A. The processing by RX data processor 450 is often referred to as simply “decoding”, and the processing by TX data processor 310 is often referred to as “re-encoding”.
Each decision-directed detector 750 performs detection for one received OFDM symbol at a time. For each received OFDM symbol, an FFT unit 752 receives the samples xi(n) for the OFDM symbol and performs an FFT on the corresponding transformed symbol to provide N received symbols ri(k). FFT units 712 and 752 are typically implemented with one FFT unit, but are shown as two units in FIG. 7 for clarity.
A signal detector 760 then processes the received pilot and data symbols with their expected symbols to provide a metric Ei′(n) for the OFDM symbol being processed. An adaptive threshold computation unit 770 determines an adaptive threshold value Yi′(n) used to decide whether or not a CH2 PDU was received. A summer 780 sums the threshold values for all T antennas to provide a combined threshold value Ytot′(n), which is further scaled with a scaling factor S2 by a multiplier 782 to obtain a final threshold value Y′(n). A summer 784 sums the metric values for all T antennas to provide the final metric value E′(n), which is then compared against the final threshold value Y′(n) by a comparator 790. The detector output would indicate that a CH2 PDU was received if E′(n)>Y′(n) and that no CH2 PDU was received otherwise.
FIG. 8A shows a block diagram of a data demodulator 430d, which is one embodiment of data demodulator 430c in FIG. 7. The samples xi(n) for each receive antenna are transformed by FFT unit 712 to provide N received symbols ri(k) for each transformed symbol. For the embodiment shown in Table 1, the N received symbols include 28 received pilot symbols for 28 pilot subbands, 24 received data symbols for 24 data subbands, and 12 additional symbols for the 12 unused subbands. For simplicity, the following description is for the embodiment shown in FIG. 2B whereby the N received symbols include L+1 received pilot symbols for L+1 pilot subbands and L received data symbols for L data subbands, where each data subband is flanked on both sides by pilot subbands, and the subband index k for the pilot and data subbands is defined as kεK where K={1 . . . 49}.
Coherent demodulation of each of the L data subbands is performed by first forming an estimate of the channel response for the data subband using the two pilot subbands flanking the data subband. The channel estimate ĥi(k) for the k-th data subband may be obtained by combining the channel estimates for the two flanking pilot subbands, which may be expressed as:




  
    
      
        
          
            
              
                
                  
                    
                      
                        h
                        ^
                      
                      i
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                  =
                  
                    
                      
                        
                          h
                          ^
                        
                        i
                      
                      ⁡
                      
                        (
                        
                          k
                          -
                          1
                        
                        )
                      
                    
                    +
                    
                      
                        
                          h
                          ^
                        
                        i
                      
                      ⁡
                      
                        (
                        
                          k
                          +
                          1
                        
                        )
                      
                    
                  
                
              
            
            
              
                
                  
                    =
                    
                      
                        
                          
                            p
                            2
                            *
                          
                          ⁡
                          
                            (
                            
                              k
                              -
                              1
                            
                            )
                          
                        
                        ⁢
                        
                          
                            r
                            i
                          
                          ⁡
                          
                            (
                            
                              k
                              -
                              1
                            
                            )
                          
                        
                      
                      +
                      
                        
                          
                            p
                            2
                            *
                          
                          ⁡
                          
                            (
                            
                              k
                              +
                              1
                            
                            )
                          
                        
                        ⁢
                        
                          
                            r
                            i
                          
                          ⁡
                          
                            (
                            
                              k
                              +
                              1
                            
                            )
                          
                        
                      
                    
                  
                  ,
                
              
            
          
          ⁢
          
            

          
          ⁢
          
            for
            ⁢
            
              
            
            ⁢
            k
          
          ∈
          
            
              K
              d
            
            ⁢
            
              
            
            ⁢
            and
            ⁢
            
              
            
            ⁢
            i
          
          ∈
          
            {
            
              1
              ⁢
              
                
              
              ⁢
              ...
              ⁢
              
                
              
              ⁢
              T
            
            }
          
        
        ,
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          6
          )
        
      
    
  




where p2*(k) is the conjugate of the pilot symbol transmitted on the k-th subband for Channel 2 and Kd represents the set of data subbands, i.e., Kdε{ 2, 4, . . . 2L}.

The recovered data symbol ŝi(k) for each data subband may then be expressed as:

ŝi*(k)=ĥi*(k)·ri(k), for kεKd and iε{1. . . T}.  Eq (7)

The recovered data symbols for all T receive antennas for each data subband may then be obtained as:




  
    
      
        
          
            
              s
              ^
            
            ⁡
            
              (
              k
              )
            
          
          =
          
            
              ∑
              
                i
                =
                1
              
              T
            
            ⁢
            
              
                
                  s
                  ^
                
                i
              
              ⁡
              
                (
                k
                )
              
            
          
        
        ,
        
          
            for
            ⁢
            
              
            
            ⁢
            k
          
          ∈
          
            
              K
              d
            
            .
          
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          8
          )
        
      
    
  




In FIG. 8A, the channel estimation shown in equation (6) is performed by L+1 multipliers 722 and L summers 724. Each multiplier 722 multiplies the received symbol for a respective pilot subband with the conjugate of the known pilot symbol for that subband to provide the channel estimate for the pilot subband. Each summer 724 then sums the channel estimates for the two pilot subbands flanking the associated data subband to provide the channel estimate for that data subband. The channel estimates for the L data subbands may also be obtained based on interpolation or some other manners, and this is within the scope of the invention.
The coherent demodulation shown in equation (7) is performed by L multipliers 732. Each multiplier 732 multiplies the received symbol ri(k) for a respective data subband with the conjugate of the channel estimate, ĥi*(k), for that subband to provide the recovered data symbol ŝi(k) for the data subband. Sample accumulation for all T receive antennas, as shown in equation (8), is performed by L summers 742. Each summer 742 receives and sums T recovered data symbols ŝi(k) for the T receive antennas for the associated data subband to provide the recovered symbol ŝ(k) for that subband.
As noted above, the subband multiplexing may be such that each group of Q data subbands is flanked on both sides by pilot subbands, where Q may be greater than one. If Q>1, then coherent demodulation may be performed in several manners. In one embodiment, the received pilot symbol for each pilot subband is used as a coherent reference for the two adjacent data subbands, and the received data symbols for these data subbands may be coherently demodulated based on this received pilot symbol. Hard decisions may then be obtained and used to remove the modulation from the just-detected data symbols to obtain improved channel estimates for the next two data subbands. The demodulation process can start from the end data subbands (i.e., next to the pilot subbands) and work towards the middle data subband. Improved channel estimates for the data subbands further away from the pilot subbands may be obtained as each pair of received data symbols is detected. In another embodiment, the received pilot symbols for each pair of pilot subbands are interpolated to obtain the channel estimate for each of the Q data subbands flanked by these pilot subbands.
A CRC value is often used to determine whether a received message was decoded correctly or in error. In certain instances, it may not be desirable to include a CRC value in a message because of the overhead associated with the CRC value and/or some other consideration. In this case, another mechanism is needed to determine whether or not the received message is valid. For the embodiment shown in FIG. 7, data demodulator 430c and RX data processor 450 may be operated to provide a decoded message for each hypothesis, and detector 440c may be operated to provide an indication as to whether or not a message was received for the hypothesis.
FIG. 8B shows a block diagram of a decision-directed detector 440d that performs differential detection in the frequency domain and is one embodiment of detector 440c in FIG. 7. The samples xi(n) for each receive antenna are transformed by FFT unit 752 to provide N received symbols ri(k) for each transformed symbol.
To determine the metric value E′(n) for each transformed symbol, a detection statistic gi(n) is first obtained for each receive antenna by summing over the real part of 2L dot products formed by using adjacent pairs of pilot and data subbands. The detection statistic gi(n) may be expressed as:




  
    
      
        
          
            
              g
              i
            
            ⁡
            
              (
              n
              )
            
          
          =
          
            
              
                ∑
                
                  k
                  =
                  1
                
                
                  2
                  ⁢
                  L
                
              
              ⁢
              
                
                  
                    z
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                  ·
                  
                    
                      z
                      *
                    
                    ⁡
                    
                      (
                      
                        k
                        +
                        1
                      
                      )
                    
                  
                
                ⁢
                
                  
                
                ⁢
                for
                ⁢
                
                  
                
                ⁢
                i
              
            
            ∈
            
              {
              
                1
                ⁢
                
                  
                
                ⁢
                ...
                ⁢
                
                  
                
                ⁢
                T
              
              }
            
          
        
        ,
        
          

        
        ⁢
        where
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          
            9
            ⁢
            a
          
          )
        
      
    
  
  
    
      
        
          
            z
            i
          
          ⁡
          
            (
            k
            )
          
        
        =
        
          {
          
            
              
                
                  
                    
                      r
                      i
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                  ·
                  
                    
                      p
                      2
                      *
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                
              
              
                
                  
                    for
                    ⁢
                    
                      
                    
                    ⁢
                    k
                  
                  ∈
                  
                    {
                    
                      1
                      ,
                      3
                      ,
                      
                        
                          ...
                          ⁢
                          
                            
                          
                          ⁢
                          2
                          ⁢
                          L
                        
                        +
                        1
                      
                    
                    }
                  
                
              
            
            
              
                
                  
                    
                      r
                      i
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                  ·
                  
                    
                      c
                      *
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                
              
              
                
                  
                    for
                    ⁢
                    
                      
                    
                    ⁢
                    k
                  
                  ∈
                  
                    
                      {
                      
                        2
                        ,
                        4
                        ,
                        
                          ...
                          ⁢
                          
                            
                          
                          ⁢
                          2
                          ⁢
                          L
                        
                      
                      }
                    
                    .
                  
                
              
            
          
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          
            9
            ⁢
            b
          
          )
        
      
    
  




The metric value E′(n) for the transformed symbol may then be expressed as:




  
    
      
        
          
            E
            ′
          
          ⁡
          
            (
            n
            )
          
        
        =
        
          
            
              
                
                
                  
                    ∑
                    
                      i
                      =
                      1
                    
                    T
                  
                  ⁢
                  
                    Re
                    ⁢
                    
                      {
                      
                        
                          g
                          i
                        
                        ⁡
                        
                          (
                          n
                          )
                        
                      
                      }
                    
                  
                
                
              
              2
            
            ⁢
            
              
            
            ⁢
            for
            ⁢
            
              
            
            ⁢
            i
          
          ∈
          
            
              {
              
                1
                ⁢
                
                  
                
                ⁢
                ...
                ⁢
                
                  
                
                ⁢
                T
              
              }
            
            .
          
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          
            10
            ⁢
            a
          
          )
        
      
    
  




Alternatively, the metric value E′(n) may be expressed as:





  
    
      
        
          
            E
            ′
          
          ⁡
          
            (
            n
            )
          
        
        =
        
          
            
              ∑
              
                i
                =
                1
              
              T
            
            ⁢
            
              
                
                  
                  
                    Re
                    ⁢
                    
                      {
                      
                        
                          g
                          i
                        
                        ⁡
                        
                          (
                          n
                          )
                        
                      
                      }
                    
                  
                  
                
                2
              
              ⁢
              
                
              
              ⁢
              for
              ⁢
              
                
              
              ⁢
              i
            
          
          ∈
          
            
              {
              
                1
                ⁢
                
                  
                
                ⁢
                ...
                ⁢
                
                  
                
                ⁢
                T
              
              }
            
            .
          
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          
            10
            ⁢
            b
          
          )
        
      
    
  




In FIG. 8B, the computation of the detection statistic gi(n) shown in equation (9) is performed by 2L+1 multipliers 762, 2L multipliers 764, and a summer 766. Each multiplier 762 multiplies the received symbol for an associated pilot or data subband with the conjugate of the known pilot symbol or remodulated symbol for that subband. Each multiplier 764 performs a dot product of the outputs from a pair of multipliers 762 for a pair of adjacent pilot and data subbands. Summer 766 then sums the outputs from L multipliers 764 to provide the detection statistic gi(n). For the embodiment shown in equation (10a), a unit 768 receives gi(n) and provides the real part to summer 784, which sums the real part of gi(n) for all T antennas. The output from summer 784 is then squared by a unit 786 to provide the metric value E′(n). For the embodiment shown in equation (10b), unit 786 may be placed between unit 768 and summer 784.
Adaptive threshold computation unit 770 determines the adaptive threshold Y′(n) to use for each received transformed symbol. Each of the 2L+1 received symbols ri(k) for the pilot and data subbands is provided to a respective unit 772, which determines the squared magnitude of the symbol. A summer 774 then sums the squared magnitude from all 2L+1 units 772 to provide the threshold value Y′(n). Summer 780 receives and sums the threshold values for all T antennas to provide the combined threshold value Y′tot(n), which may be expressed as:




  
    
      
        
          
            Y
            tot
            ′
          
          ⁡
          
            (
            n
            )
          
        
        =
        
          
            ∑
            
              i
              =
              1
            
            T
          
          ⁢
          
            
              ∑
              
                k
                =
                1
              
              
                
                  2
                  ⁢
                  L
                
                +
                1
              
            
            ⁢
            
              
                
                  
                  
                    
                      r
                      i
                    
                    ⁡
                    
                      (
                      k
                      )
                    
                  
                  
                
                2
              
              .
            
          
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          11
          )
        
      
    
  




Multiplier 782 scales the combined threshold value with a scaling factor S2a to provide the final threshold value, which may be given as Y′(n)=S2a·Ytot′(n). In general, the threshold value Y′(n) and metric value E′(n) are each accumulated over the duration of the PDU to be detected. Thus, if the PDU spans multiple OFDM symbol periods, then the threshold and metric values are first computed as described above for each of these OFDM symbols and then accumulated to provide the final threshold and metric values for the PDU.

Comparator 790 compares the final metric value E′(n) against the final threshold value Y′(n) and provides the detector output D′(n), which may be expressed as:




  
    
      
        
          
            D
            ′
          
          ⁡
          
            (
            n
            )
          
        
        =
        
          {
          
            
              
                
                  “
                  
                    CH
                    ⁢
                    
                      
                    
                    ⁢
                    2
                    ⁢
                    
                      
                    
                    ⁢
                    PDU
                    ⁢
                    
                      
                    
                    ⁢
                    present
                  
                  ”
                
              
              
                
                  
                    
                      if
                      ⁢
                      
                        
                      
                      ⁢
                      
                        
                          E
                          ′
                        
                        ⁡
                        
                          (
                          n
                          )
                        
                      
                    
                    >
                    
                      
                        Y
                        ′
                      
                      ⁡
                      
                        (
                        n
                        )
                      
                    
                  
                  ,
                
              
            
            
              
                
                  “
                  
                    CH
                    ⁢
                    
                      
                    
                    ⁢
                    2
                    ⁢
                    
                      
                    
                    ⁢
                    PDU
                    ⁢
                    
                      
                    
                    ⁢
                    not
                    ⁢
                    
                      
                    
                    ⁢
                    present
                  
                  ”
                
              
              
                
                  otherwise
                  .
                
              
            
          
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          12
          )
        
      
    
  




If the detector output D′(n) indicates that a CH2 PDU is present, then the CH2 message decoded by the RX data processor is deemed to be valid and may be further processed by a controller as appropriate. Otherwise, the CH2 message is discarded.

FIG. 8C shows a block diagram of a decision-directed detector 440e that performs coherent detection in the time domain and is another embodiment of detector 440c in FIG. 7. The samples xi(n) for each receive antenna are provided to a delay line/buffer 831 that is implemented with N−1 delay units 832, each of which provides one sample period of delay.
Detector 440e performs correlation of each received OFDM symbol with its corresponding “reconstructed” OFDM symbol to determine the metric E′′(n) for the received OFDM symbol. Each of the N samples xi(n) for the received OFDM symbol is provided to a respective multiplier 842, which also receives a corresponding conjugated reconstructed sample d*(j), where jε{0 . . . N−1}. To obtain d*(j), the pilot symbols p2(k) for the pilot subbands (e.g., as shown in Table 1), remodulated symbols c(k) for the data subbands, and zero signal values for the unused subbands (i.e., N symbols for the N total subbands) for an OFDM symbol period are transformed to the time domain by an N-point IFFT 830 to obtain N reconstructed samples, d(0) through d(N−1), which are then conjugated and provided to N multipliers 842. The operations performed by the other elements in FIG. 8C are as described above for FIG. 6. The metric value Ei′′(n) for each antenna may be expressed as:




  
    
      
        
          
            
              E
              i
              ′′
            
            ⁡
            
              (
              n
              )
            
          
          =
          
            
              
              
                
                  ∑
                  
                    j
                    =
                    0
                  
                  
                    N
                    -
                    1
                  
                
                ⁢
                
                  
                    
                      d
                      *
                    
                    ⁡
                    
                      (
                      j
                      )
                    
                  
                  ·
                  
                    
                      x
                      i
                    
                    ⁡
                    
                      (
                      
                        n
                        -
                        j
                      
                      )
                    
                  
                
              
              
            
            2
          
        
        ,
        
          
            for
            ⁢
            
              
            
            ⁢
            i
          
          ∈
          
            
              {
              
                1
                ⁢
                
                  
                
                ⁢
                ...
                ⁢
                
                  
                
                ⁢
                T
              
              }
            
            .
          
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          13
          )
        
      
    
  




The final metric value E′′ (n) for all T antennas may then be expressed as:





  
    
      
        
          
            E
            ′′
          
          ⁡
          
            (
            n
            )
          
        
        =
        
          
            ∑
            
              i
              =
              1
            
            T
          
          ⁢
          
            
              
                E
                i
                ′′
              
              ⁡
              
                (
                n
                )
              
            
            .
          
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          14
          )
        
      
    
  




The threshold Y′′(n) to use for comparing against the final metric value E′′ (n) may be determined as described above for FIG. 6. In particular, the combined threshold value Ytot′′(n) for all T antennas may be expressed as:




  
    
      
        
          
            Y
            tot
            ′′
          
          ⁡
          
            (
            n
            )
          
        
        =
        
          
            ∑
            
              i
              =
              1
            
            T
          
          ⁢
          
            
              ∑
              
                j
                =
                0
              
              
                N
                -
                1
              
            
            ⁢
            
              
                
                  
                  
                    
                      x
                      i
                    
                    ⁡
                    
                      (
                      
                        n
                        -
                        j
                      
                      )
                    
                  
                  
                
                2
              
              .
            
          
        
      
    
    
      
        Eq
        ⁢
        
          
        
        ⁢
        
          (
          15
          )
        
      
    
  




The final threshold value may then be given as Y′′(n)=S2b·Ytot′′(n).

For the decision-directed detector, the scaling factor S2 (which is S2a for detector 440d in FIGS. 8B and S2b for detector 440e in FIG. 8C) is a positive constant selected to provide (1) a particular missed detection probability for CH2 PDUs and (2) a particular false alarm rate for incorrectly declaring the presence of CH2 PDUs. If CH2 messages are defined such that they do not include CRC values, then the detector is relied upon exclusively to determine whether or not CH2 messages are present. Erroneous CH2 messages may be provided to the controller due to the following:

    
    
        false alarm—noise in the received signal falsely triggers detection; and
        incorrect decode—signal correctly triggers detection but the decoded CH2 message includes uncorrected and undetected errors.
    
    


If Channel 2 is used as a random access channel, then a false alarm for a CH2 PDU may cause the system to assign resources to a non-existent user terminal, which then results in wasted resources. In that case, it is desirable to select the scaling factor S2 to minimize the false alarm probability since it is undesirable to have noise frequently triggering a waste of resources.
The incorrect decode probability is related to the detection probability, and a higher detection probability can lead to more incorrect decode events. When an incorrect decode event occurs, an erroneously decoded CH2 message is provided to the controller. The controller may be able to check the validity of the CH2 message in some other manner. For example, if the CH2 message includes a unique identifier for the user terminal that transmitted the message, then the controller can check to see if the unique identifier for the recovered CH2 message is included in a list of valid identifiers. If the unique identifier in the received CH2 message is determined to be valid, then the system can assign resources to the user terminal associated with that identifier.
In selecting the scaling factor S2, it may be desirable to detect as many valid CH2 messages as possible while maintaining the false alarm rate and incorrect decode probability to below a particular level. It is also possible to vary the scaling factor S2 based on system loading. For example, if the system load is low and there are few valid identifiers, then the likelihood of the system erroneously allocating resources is smaller. In this case, a lower detection threshold may be used. As the system load increases, the detection threshold may be increased to reduce the rate of incorrect decode events.
FIG. 9 shows a block diagram of an embodiment of an access point 110x and a user terminal 120x in system 100. For this embodiment, access point 110x and user terminal 120x are each equipped with multiple antennas. In general, the access point and user terminal may each be equipped with any number of transmit/receive antennas.
On the uplink, at user terminal 120x, TX data processor 310 receives and processes traffic data from a data source 308 and other data (e.g., for CH1 and CH2 messages) from a controller 360 to provide multiplexed data and pilot symbols, as described above for FIG. 3A. TX spatial processor 320 may perform spatial processing on the pilot and data symbols to provide a stream of transmit symbols for each antenna. Each modulator 340 receives and processes a respective transmit symbol stream to provide a corresponding uplink modulated signal, which is then transmitted from an associated antenna 350.
At access point 110x, T antennas 408a through 408t receive the transmitted uplink modulated signals from the user terminal, and each antenna provides a received signal to a respective receiver 410. Each receiver 410 conditions the received signal and further digitizes the conditioned signal to provide samples. Detector/data demodulator 420 then performs processing to detect for CH1 and CH2 messages, as described above. RX data processor 450 processes recovered symbols to provide decoded traffic data (which may be provided to a data sink 452 for storage) and recovered CH1 and CH2 messages (which may be provided to a controller 460 for further processing).
The processing for the downlink may be the same or different from the processing for the uplink. Data from a data source 468 and signaling (e.g., reply messages) from controller 460 are processed (e.g., coded, interleaved, and modulated) by a TX data processor 470 and may be spatially processed by a TX spatial processor 480. The transmit symbols from TX spatial processor 480 are then processed by modulators 410a through 410t to generate T downlink modulated signals, which are transmitted via antennas 408a through 408t. 
At user terminal 120x, the downlink modulated signals are received by antennas 350, conditioned and digitized by receivers 340, and processed by an RX spatial processor 370 and an RX data processor 380 in a complementary manner to that performed at the access point. The decoded data for the downlink may be provided to a data sink 382 for storage and/or controller 360 for further processing.
Controllers 360 and 460 control the operation of various processing units at the user terminal and the access point, respectively. Memory units 362 and 462 store data and program codes used by controllers 360 and 460, respectively.
For clarity, specific embodiments of the correlation and decision-directed detectors, demodulators, and the receiver units have been described for specific PDU formats. Various other embodiments and uses for these detectors are also possible, and this is within the scope of the invention. For example, the correlation detector may be used for a channel whereby transmissions are time-compensated, and the decision-directed detector may be used for a channel whereby transmissions are not time-compensated.
The decision-directed detector may be implemented in the frequency domain (as shown in FIG. 8B) or the time domain (as shown in FIG. 8C). Moreover, the decision-directed detector may be used for various PDU formats. For example, the decision-directed detector may be used for a PDU format whereby data and pilot are subband multiplexed (as described above for CH2 PDU), a PDU format whereby data and pilot are time division multiplexed (TDM) (as described above for CH1 PDU), and others. The decision-directed detector may also be used with or without the pilot. In general, the decision-directed detector uses frequency-domain received data symbols or time-domain reconstructed data samples to detect for data transmissions in the received signal. This detector may advantageously be used when CRC or other error detection mechanisms are not available to detect for message errors.
The use of an adaptive threshold can provide robust detection performance in many operating scenarios, such as for an unlicensed frequency band where various sources of interference may be present. The threshold may be set based on a particular statistic for the transmission to be detected. This statistic may relate to the energy of the desired signal plus noise and interference in the transmission or some other parameter.
The detectors, demodulators, and receivers described herein may be used for various types of transport channels. For example, these units may be used for different types of random access channels, such as the ones described in detail in the aforementioned U.S. Patent Application Ser. No. 60/432,440 and provisional U.S. Patent Application Ser. No. 60/421,309.
The detectors, demodulators, and receivers described herein may also be used for various wireless multiple-access communication systems. One such system is a wireless multiple-access MIMO system described in the aforementioned provisional U.S. Patent Application Ser. No. 60/421,309. In general, these systems may or may not employ OFDM, or may employ some other multi-carrier modulation scheme instead of OFDM, and may or may not utilize MIMO.
The detectors, demodulators, and receivers described herein may be implemented by various means. For example, these units may be implemented in hardware, software, or a combination thereof. For a hardware implementation, the detectors and receivers may be implemented within one or more application specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), processors, controllers, micro-controllers, microprocessors, other electronic units designed to perform the functions described herein, or a combination thereof.
For a software implementation, the signal processing for the detectors, demodulators, and receivers may be implemented with modules (e.g., procedures, functions, and so on) that perform the functions described herein. The software codes may be stored in a memory unit (e.g., memory units 362 and 462 in FIG. 9) and executed by a processor (e.g., controllers 360 and 460). The memory unit may be implemented within the processor or external to the processor, in which case it can be communicatively coupled to the processor via various means as is known in the art.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

## Claims

1. A receiver unit in a wireless communication system, comprising:
a demodulator operative to process received data symbols to provide recovered symbols;
a first data processor operative to process the recovered symbols to provide decoded data;
a second data processor operative to process the decoded data to provide remodulated symbols; and
a detector operative to process the received data symbols and the remodulated symbols to provide a detector output, wherein the detector is further operative to process received pilot symbols to provide the detector output, wherein:
data symbols are transmitted on data subbands and pilot symbols are transmitted on pilot subbands, wherein the data subbands are interlaced with the pilot subbands such that each of the data subbands is flanked on both sides by pilot subbands; and
the data subbands are multiplexed with the pilot subbands.

2. The receiver unit of claim 1, wherein:
the received data symbols are for a data transmission hypothesized to have been received; and
the detector output indicates whether or not the data transmission is deemed to have been received.

3. The receiver unit of claim 1, further comprising:
a threshold computation unit operative to determine a threshold to use for the data transmission, wherein:
the detector is operative to provide a metric based on the received data symbols and the remodulated symbols; and
the detector output is determined based on the metric and the threshold.

4. The receiver unit of claim 3, wherein:
the threshold computation unit is operative to determine the threshold based on a plurality of received signals for a plurality of antennas; and
the detector is operative to determine the metric based on the plurality of received signals.

5. The receiver unit of claim 1, wherein:
the detector is operative to perform coherent detection in time domain;
the received data symbols are obtained based on input samples for a data transmission hypothesized to have been received; and
the detector is operative to perform correlation between the input samples and reconstructed samples obtained based on the remodulated symbols.

6. The receiver unit of claim 1, wherein the detector is operative to perform differential detection in the frequency domain.

7. A receiver unit in a wireless communication system, comprising:
a demodulator operative to process received data symbols to provide recovered symbols;
a first data processor operative to process the recovered symbols to provide decoded data;
a second data processor operative to process the decoded data to provide remodulated symbols; and
a detector operative to process the received data symbols and the remodulated symbols to provide a detector output, wherein the detector is operative to process received pilot symbols to provide the detector output;
multiply each of the received data symbols with a corresponding one of the remodulated symbols to provide a demodulated data symbol;
multiply each of the received pilot symbols with a corresponding one of known pilot symbols to provide a demodulated pilot symbol;
perform dot products between demodulated data symbols and demodulated pilot symbols; and
accumulate results of the dot products.

8. A method for receiving data in a wireless communication system, comprising:
demodulating received data symbols to provide recovered symbols;
processing the recovered symbols to provide decoded data;
processing the decoded data to provide remodulated symbols; and
detecting the received data symbols and the remodulated symbols to provide a detector output, wherein the detecting further comprises processing received pilot symbols to provide the detector output, wherein:
data symbols are transmitted on data subbands and pilot symbols are transmitted on pilot subbands, wherein the data subbands are interlaced with the pilot subbands such that each of the data subbands is flanked on both sides by pilot subbands; and
the data subbands are multiplexed with the pilot subbands.

9. The method of claim 8, wherein:
the received data symbols are for a data transmission hypothesized to have been received; and
the detector output indicates whether or not the data transmission is deemed to have been received.

10. The method of claim 8, further comprising:
determining a threshold to use for the data transmission, wherein:
the step of detecting includes providing a metric based on the received data symbols and the remodulated symbols; and
the detector output is determined based on the metric and the threshold.

11. The method of claim 10, wherein:
the step of determining a threshold includes determining the threshold based on a plurality of received signals for a plurality of antennas; and
the step of detecting includes determining the metric based on the plurality of received signals.

12. The method of claim 8, further including:
obtaining the received data symbols based on input samples for a data transmission hypothesized to have been received, wherein:
the step of detecting includes performing coherent detection in time domain; and
the step of detecting further includes performing correlation between the input samples and reconstructed samples obtained based on the remodulated symbols.

13. The apparatus of claim 8, wherein the step of detecting includes performing differential detection in the frequency domain.

14. A method for receiving data in a wireless communication system, comprising:
demodulating received data symbols to provide recovered symbols;
processing the recovered symbols to provide decoded data processing the decoded data to provide remodulated symbols; and
detecting the received data symbols and the remodulated symbols to provide a detector output, wherein the step of detecting includes:
processing received pilot symbols to provide the detector output;
multiplying each of the received data symbols with a corresponding one of the remodulated symbols to provide a demodulated data symbol;
multiplying each of the received pilot symbols with a corresponding one of known pilot symbols to provide a demodulated pilot symbol;
performing dot products between demodulated data symbols and demodulated pilot symbols; and
accumulating results of the dot products.

15. An apparatus for receiving data in a wireless communication system, comprising:
means for demodulating received data symbols to provide recovered symbols;
means for processing the recovered symbols to provide decoded data;
means for processing the decoded data to provide remodulated symbols; and
means for detecting the received data symbols and the remodulated symbols to provide a detector output, wherein the means for detecting comprises means for processing received pilot symbols to provide the detector output, wherein:
data symbols are transmitted on data subbands and pilot symbols are transmitted on pilot subbands, wherein the data subbands are interlaced with the pilot subbands such that each of the data subbands is flanked on both sides by pilot subbands; and
the data subbands are multiplexed with the pilot subbands.

16. The apparatus of claim 15, wherein:
the received data symbols are for a data transmission hypothesized to have been received;
and the detector output indicates whether or not the data transmission is deemed to have been received.

17. The apparatus of claim 15, further comprising:
means for determining a threshold to use for the data transmission, wherein:
the means for detecting includes means for providing a metric based on the received data symbols and the remodulated symbols; and
the detector output is determined based on the metric and the threshold.

18. The apparatus of claim 17, wherein:
the means for determining a threshold includes means for determining the threshold based on a plurality of received signals for a plurality of antennas; and
the means for detecting includes means for determining the metric based on the plurality of received signals.

19. The apparatus of claim 15, further including:
means for obtaining the received data symbols based on input samples for a data transmission hypothesized to have been received, wherein:
the means for detecting includes means for performing coherent detection in time domain; and
the means for detecting further includes means for performing correlation between the input samples and reconstructed samples obtained based on the remodulated symbols.

20. The apparatus of claim 15, wherein the means for detecting includes means for performing differential detection in the frequency claims.

21. An apparatus for receiving data in a wireless communication system, comprising:
means for demodulating received data symbols to provide recovered symbols;
means for processing the recovered symbols to provide decoded data;
means for processing the decoded data to provide remodulated symbols; and
means for detecting the received data symbols and the remodulated symbols to provide a detector output, wherein the means for detecting includes:
means for processing received pilot symbols to provide the detector output;
means for multiplying each of the received data symbols with a corresponding one of the remodulated symbols to provide a demodulated data symbol;
means for multiplying each of the received pilot symbols with a cooresponding one of known pilot symbols to provide a demodulated pilot symbol;

means for performing dot products between demodulated data symbols and demodulated pilot symbols; and
means for accumulating results of the dot products.

22. A computer-program apparatus for receiving data in a wireless communication system comprising at last one memory unit having instructions stored thereon, the instructions being executable by one or more processors and the instructions comprising:
instructions for demodulating received data symbols to provide recovered symbols;
instructions for processing the recovered symbols to provide decoded data;
instructions for processing the decoded data to provide remodulated symbols; and
instructions for detecting the received data symbols and the remodulated symbols to provide a detector output, wherein the instructions for detecting comprise instructions for processing received pilot symbols to provide the detector output, wherein:
data symbols are transmitted on data subbands and pilot symbols are transmitted on pilot subbands, wherein the data subbands are interlaced with the pilot subbands such that each of the data subbands is flanked on both sides by pilot subbands; and
the data subbands are multiplexed with the pilot subbands.

23. The computer-program apparatus of claim 22, wherein:
the received data symbols are for a data transmission hypothesized to have been received;
and
the detector output indicates whether or not the data transmission is deemed to have been received.

24. The computer-program apparatus of claim 22, further comprising:
instructions for determining a threshold to use for the data transmission, wherein:
the instructions for detecting includes instructions for providing a metric based on the received data symbols and the remodulated symbols; and
the detector output is determined based on the metric and the threshold.

25. The computer-program apparatus of claim 24, wherein:
the instructions for determining a threshold includes instructions for determining the threshold based on a plurality of received signals for a plurality of antennas; and
the instructions for detecting includes instructions for determining the metric based on the plurality of received signals.

26. The computer-program apparatus of claim 22, further including:
instructions for obtaining the received data symbols based on input samples for a data transmission hypothesized to have been received, wherein:
the instructions for detecting includes instructions for performing coherent detection in time domain; and
the instructions for detecting further includes instructions for performing correlation between the input samples and reconstructed samples obtained based on the remodulated symbols.

27. The computer-program apparatus of claim 22, wherein the instructions for detecting includes instructions for performing differential detection in the frequency domain.

28. A computer-program apparatus for receiving data in a wireless communication system comprising at last one memory unit having instructions stored thereon, the instructions being executable by one or more processors and the instructions comprising:
instructions for demodulating received data symbols to provide recovered symbols;
instructions for processing the recovered symbols to provide decoded data
instructions for processing the decoded data to provide remodulated symbols; and
instructions for detecting the received data symbols and the remodulated symbols to provide a detector output, wherein the instructions for detecting includes:
instructions for processing received pilot symbols to provide the detector output;
instructions for multiplying each of the received data symbols with a corresponding one of the remodulated symbols to provide a demodulated data symbol;
instructions for multiplying each of the received pilot symbols with a corresponding one of known pilot symbols to provide a demodulated pilot symbol;
instructions for performing dot products between demodulated data symbols and demodulated pilot symbols; and
instructions for accumulating results of the dot products.