Puncturing signaling channel for a wireless communication system

Information

  • Patent Grant
  • 8565194
  • Patent Number
    8,565,194
  • Date Filed
    Thursday, October 27, 2005
    19 years ago
  • Date Issued
    Tuesday, October 22, 2013
    11 years ago
Abstract
A signaling channel that punctures traffic channels is used to send signaling, e.g., acknowledgments (ACKs). To send signaling, resources for the signaling channel are determined, e.g., based on a frequency hopping pattern. Signaling is spread with a spreading code (e.g., a Walsh code) to generate spread signaling, which is mapped to the resources for the signaling channel. Each resource may be partitioned into multiple clusters. A signaling message may be mapped to different clusters to achieve diversity. Traffic data may also be mapped to other resources for a traffic channel assigned for use. Traffic data mapped to the other resources for the signaling channel is punctured. The mapped signaling and traffic data are further processed (e.g., for OFDM or SC-FDMA) and transmitted.
Description
BACKGROUND

I. Reference to Co-Pending Applications for Patent


The present Application for Patent is related to the following co-pending U.S. patent applications:


U.S. patent application Ser. No. 11/261,806 entitled “Varied Signaling Channels for a Reverse Link in a Wireless Communication System”, filed Oct. 27, 2005, assigned to the assignee hereof, and expressly incorporated by reference herein; and


U.S. patent application Ser. No. 11/261,836 entitled “Systems And Methods For Control Channel Signaling”, filed Oct. 27, 2005, assigned to the assignee hereof; and expressly incorporated by reference herein.


U.S. Provisional Application No. 60/731,013 entitled “Mobile Wireless Access System”, filed Oct. 27, 2005, assigned to the assignee hereof, and expressly incorporated by reference herein.


II. Field


The present invention relates generally to communication, and more specifically to techniques for transmitting signaling in a communication system.


III. Background


Wireless communication systems are widely deployed to provide various communication services such as voice, packet data, broadcast, messaging, and so on. These systems may be multiple-access systems capable of supporting communication for multiple users by sharing the available system resources. Examples of such multiple-access systems include code division multiple access (CDMA) systems, time division multiple access (TDMA) systems, and frequency division multiple access (FDMA) systems.


A communication system may employ a transmission scheme with feedback to improve reliability for data transmission. For example, a transmitter may transmit a data packet to a receiver, which may send back an acknowledgment (ACK) if the packet is decoded correctly or a negative acknowledgment (NAK) if the packet is decoded in error. The transmitter uses the ACK to terminate the transmission of the packet and uses the NAK to retransmit all or a portion of the packet. The transmitter is thus able to transmit just enough data for each packet based on the feedback from the receiver.


A base station in a multiple-access system may concurrently communicate with multiple terminals on the forward and reverse links at any given moment. The forward link (or downlink) refers to the communication link from the base stations to the terminals, and the reverse link (or uplink) refers to the communication link from the terminals to the base stations. The base station may transmit data to multiple terminals on the forward link and may receive ACKs and/or NAKs (or ACK information) from these terminals on the reverse link. The ACK information from the terminals, although beneficial, represent overhead in the system.


There is therefore a need in the art for techniques to efficiently send ACK information in a communication system.


SUMMARY

Techniques for efficiently transmitting signaling in a communication system are described herein. The signaling may be ACK information or some other information. In an embodiment, a signaling channel that punctures traffic channels is used to send signaling. The signaling channel may also be called a control channel, an overhead channel, a feedback channel, and so on. The signaling channel may be mapped to resources, e.g. time-frequency segments, and each traffic channel may be mapped to different resources. Each time-frequency segment and each time-frequency block may be a block of time and frequency. A time-frequency segment and a time-frequency block may have the same or different sizes. The signaling channel punctures the traffic channels in that data is not sent on the traffic channels in the portion of the time-frequency blocks that collide with the time-frequency segments for the signaling channel. Hence, the signaling channel punctures or blanks out the traffic channels whenever collision occurs.


In an embodiment, signaling is sent with code division multiplexing (CDM) on the signaling channel. At a transmitter (e.g., a terminal), the resources, e.g. time-frequency segments, for the signaling channel are initially determined, e.g., based on a frequency hopping pattern for the signaling channel. Signaling is spread with a spreading code (e.g., a Walsh code) to generate spread signaling, which is then mapped to the resources for the signaling channel. In an embodiment, each resource is partitioned into multiple clusters, and a signaling message is mapped to different clusters in multiple resources to achieve diversity. Traffic data may be mapped to other resources for a traffic channel assigned for use. Traffic data that is mapped to the other resources for the signaling channel is punctured. The mapped signaling and traffic data are further processed (e.g., modulated for OFDM or SC-FDMA) and transmitted.


In an embodiment, to receive the signaling at a receiver (e.g., a base station), received symbols are extracted from the resources for the signaling channel. The extracted received symbols are despread with the spreading code to obtain despread symbols. The extracted received symbols may also be despread with one or more spreading codes not used for signaling to obtain interference estimates. The despread symbols are detected (e.g., with the interference estimates, if available) to recover the transmitted signaling. Extracted received symbols from different clusters may be despread and combined to recover a signaling message sent on these clusters. Received symbols may also be extracted from the resources for the assigned traffic channel. Received symbols extracted from the resources for the signaling channel are punctured. The unpunctured received symbols are processed to obtain decoded data.


Various aspects and embodiments of the invention are described in further detail below.





BRIEF DESCRIPTION OF THE DRAWINGS

The features and nature 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.



FIG. 1 shows a wireless communication system.



FIG. 2 illustrates H-ARQ transmission on the forward link.



FIGS. 3A and 3B show two subcarrier structures.



FIG. 4 shows a frequency-hopping scheme.



FIGS. 5A and 5B show two signaling transmission schemes for an ACK channel.



FIG. 6 shows puncturing of a time-frequency block for the ACK channel.



FIG. 7A shows an ACK segment with multiple clusters.



FIG. 7B shows a time-frequency block not punctured by an ACK segment.



FIG. 7C shows a time-frequency block punctured by an ACK segment.



FIG. 8 shows transmission of an ACK message to achieve diversity.



FIG. 9 shows a binary channel tree.



FIG. 10 shows a process for sending signaling and traffic data.



FIG. 11 shows an apparatus for sending signaling and traffic data.



FIG. 12 shows a process for receiving signaling and traffic data.



FIG. 13 shows an apparatus for receiving signaling and traffic data.



FIG. 14 shows a block diagram of a base station and a terminal.



FIG. 15 shows a block diagram of a transmit data and signaling processor.



FIG. 16 shows a block diagram of a receive data and signaling processor.





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 with multiple base stations 110 and multiple terminals 120. A base station is a station that communicates with the terminals. A base station may also be called, and may contain some or all of the functionality of, an access point, a Node B, and/or some other network entity. Each base station 110 provides communication coverage for a particular geographic area 102. The term “cell” can refer to a base station and/or its coverage area depending on the context in which the term is used. To improve system capacity, a base station coverage area may be partitioned into multiple smaller areas, e.g., three smaller areas 104a, 104b, and 104c. Each smaller area is served by a respective base transceiver subsystem (BTS). The term “sector” can refer to a BTS and/or its coverage area depending on the context in which the term is used. For a sectorized cell, the BTSs for all sectors of that cell are typically co-located within the base station for the cell. The signaling transmission techniques described herein may be used for a system with sectorized cells as well as a system with un-sectorized cells. For simplicity, in the following description, the term “base station” is used generically for a station that serves a sector as well as a station that serves a cell.


Terminals 120 are typically dispersed throughout the system, and each terminal may be fixed or mobile. A terminal may also be called, and may contain some or all of the functionality of, a mobile station, a user equipment, and/or some other device. A terminal may be a wireless device, a cellular phone, a personal digital assistant (PDA), a wireless modem card, and so on. A terminal may communicate with zero, one, or multiple base stations on the forward and reverse links at any given moment.


For a centralized architecture, a system controller 130 couples to base stations 110 and provides coordination and control for these base stations. System controller 130 may be a single network entity or a collection of network entities. For a distributed architecture, the base stations may communicate with one another as needed.


The signaling transmission techniques described herein may be used to send various types of signaling such as ACK information, power control commands, channel quality indicators (CQIs), requests for system resources, access probes, feedback information, and so on. These techniques may be used for the forward link as well as the reverse link. For clarity, these techniques are described below for sending ACK information on the reverse link.


System 100 may employ hybrid automatic repeat request (H-ARQ) transmission, which is also called incremental redundancy (IR) transmission. With H-ARQ, a transmitter sends one or more transmissions for a data packet until the packet is decoded correctly by a receiver or the maximum number of transmissions has been sent. H-ARQ improves reliability for data transmission and supports rate adaptation for packets in the presence of changes in channel conditions.



FIG. 2 illustrates H-ARQ transmission on the forward link. A base station processes (e.g., encodes and modulates) a data packet (Packet 1) and generates multiple (V) data blocks, where V>1. A data packet may also be called a codeword and so on. A data block may also be called a subpacket, an H-ARQ transmission, and so on. Each data block for the packet may contain sufficient information to allow a terminal to correctly decode the packet under favorable channel conditions. The V data blocks typically contain different redundancy information for the packet. Each data block may be sent in a frame, which may be of any time duration. The V data blocks are sent one at a time until the packet is terminated, and the block transmissions are spaced apart by Q frames, where Q>1.


The base station transmits the first data block (Block 1) for Packet 1 in frame m. The terminal receives and processes (e.g., demodulates and decodes) Block 1, determines that Packet 1 is decoded in error, and sends a NAK to the base station in frame m+q, where q is the ACK/NAK delay and 1≦q<Q. The base station receives the NAK and transmits the second data block (Block 2) for Packet 1 in frame m+Q. The terminal receives Block 2, processes Blocks 1 and 2, determines that Packet 1 is decoded in error, and sends back a NAK in frame m+Q+q. The block transmission and NAK response may continue up to V times. For the example shown in FIG. 2, the base station transmits data block 3 (Block 3) for Packet 1 in frame m+2Q. The terminal receives Block 3, processes Blocks 1 through 3 for Packet 1, determines that the packet is decoded correctly, and sends back an ACK in frame m+2Q+q. The base station receives the ACK and terminates the transmission of Packet 1. The base station processes the next data packet (Packet 2) and transmits the data blocks for Packet 2 in similar manner.


In FIG. 2, a new data block is sent every Q frames. To improve channel utilization, the base station may transmit up to Q packets in an interlaced manner. In an embodiment, a first interlace is formed with frames m, m+Q, and so on, a second interlace is formed with frames m+1, m+Q+1, and so on, and a Q-th interlace is formed with frames m+Q−1, m+2Q−1, and so on. The Q interlaces are offset from one another by one frame. The base station may transmit up to Q packets on the Q interlaces. For example, if Q=2, then the first interlace may include odd-numbered frames, and the second interlace may include even-numbered frames. As another example, if Q=6, then six interlaces may be formed and used to send six packets in an interlaced manner. In general, the H-ARQ retransmission delay Q and the ACK/NAK delay q are typically selected to provide sufficient processing time for both the transmitter and receiver.


For clarity, FIG. 2 shows transmission of both NAKs and ACKs. For an ACK-based scheme, which is assumed for the description below, an ACK is sent if a packet is decoded correctly, and NAKs are not sent and are presumed by the absence of ACKs.


The signaling transmission techniques described herein may be used for various wireless communication systems such as a CDMA system, a TDMA system, an FDMA system, an orthogonal frequency division multiple access (OFDMA) system, a single-carrier frequency division multiple access (SC-FDMA) system, and so on. An OFDMA system utilizes orthogonal frequency division multiplexing (OFDM), which is a modulation technique that partitions the overall system bandwidth into multiple (K) orthogonal subcarriers. These subcarriers are also called tones, bins, and so on. With OFDM, each subcarrier that may be independently modulated with data. An SC-FDMA system may utilize interleaved FDMA (IFDMA) to transmit on subcarriers that are distributed across the system bandwidth, localized FDMA (LFDMA) to transmit on a block of adjacent subcarriers, or enhanced FDMA (EFDMA) to transmit on multiple blocks of adjacent subcarriers. In general, modulation symbols are sent in the frequency domain with OFDM and in the time domain with SC-FDMA.


The signaling transmission techniques may also be used with various subcarrier structures. For simplicity, the following description assumes that the K total subcarriers arc usable for transmission and arc given indices of 1 through K.



FIG. 3A shows a distributed subcarrier structure 300. For subcarrier structure 300, the K total subcarriers are arranged into S non-overlapping sets such that each set contains N subcarriers that are uniformly distributed across the K total subcarriers. Consecutive subcarriers in each set are spaced apart by S subcarriers, where K=S·N. Hence, set s contains subcarriers s, S+s, 2S+s, . . . , (N−1)·S+s, for s ε{1, . . . , S}.



FIG. 3B shows a block subcarrier structure 310. For subcarrier structure 310, the K total subcarriers are arranged into S non-overlapping sets such that each set contains N consecutive subcarriers, where K=S·N. Hence, set s contains subcarriers (s−1)·N+1 through s·N, for s ε{1, . . . , S}.


In general, the signaling transmission techniques may be used with any subcarrier structure having any number of subcarrier sets. Each subcarrier set may include any number of subcarriers that may be arranged in any manner. For example, the subcarriers in each set may be uniformly distributed across the system bandwidth as shown in FIG. 3A, contiguous as shown in FIG. 3B, and so on. The subcarrier sets may include the same or different numbers of subcarriers.



FIG. 4 shows an exemplary partitioning of time and frequency into time-frequency blocks. A time-frequency block may also be called a tile, a traffic block, or some other terminology. In an embodiment, a time-frequency block corresponds to a specific subcarrier set in a specific time interval, which may span one or multiple symbol periods. A symbol period is the duration of one OFDM symbol or one SC-FDMA symbol. S orthogonal time-frequency blocks are available in each time interval.


System 100 may define traffic channels to facilitate allocation and use of the available system resources. A traffic channel is a means for sending data from a transmitter to a receiver and may also be called a channel, a physical channel, a physical layer channel, a data channel, a transmission channel, and so on. Traffic channels may be defined for various types of system resources such as frequency and time.


In general, any number of traffic channels may be defined, and the traffic channels may have the same or different transmission capacities. For simplicity, much of the following description assumes that S traffic channels are defined, with each traffic channel being mapped to one time-frequency block in each time interval used for data transmission. These S traffic channels may be assigned to up to S terminals.



FIG. 4 also shows an exemplary frequency-hopping scheme 400. For scheme 400, each traffic channel is mapped to a specific sequence of time-frequency blocks that hop across frequency in different time intervals to achieve frequency diversity, as shown in FIG. 4. A hop interval is the amount of time spent on a given subcarrier set and is equal to one time interval for the embodiment shown in FIG. 4. A frequency hopping (FH) pattern indicates the specific time-frequency block to use for each traffic channel in each time interval used for data transmission. FIG. 4 shows the sequence of time-frequency blocks for traffic channel y. The other traffic channels may be mapped to vertically and circularly shifted versions of the time-frequency block sequence for traffic channel y.


Frequency hopping may be used with the subcarrier structures shown in FIGS. 3A and 3B. In an embodiment, which is called symbol rate hopping, a time-frequency block is one distributed subcarrier set (e.g., as shown in FIG. 3A) in one symbol period. For symbol rate hopping, the subcarriers for a traffic channel span across the entire system bandwidth and change from symbol period to symbol period. In another embodiment, which is called block hopping, a time-frequency block is one contiguous subcarrier set (e.g., as shown in FIG. 3B) in multiple symbol periods. For block hopping, the subcarriers for a traffic channel are contiguous and fixed for an entire hop interval but change from hop interval to hop interval. Other frequency hopping schemes may also be defined.


A terminal may send ACK information on a reverse link acknowledgment channel (R-ACKCH) to a base station to acknowledge H-ARQ transmissions sent by the base station on the forward link. The R-ACKCH is also called an ACK channel in the following description. Referring back to FIG. 2, an H-ARQ transmission is sent in one frame, which may span one or multiple hop intervals. The terminal may send an ACK/NAK for each frame in which an H-ARQ transmission is received from the base station. Several embodiments of the ACK channel for different frame sizes are described below.



FIG. 5A shows a signaling transmission scheme 500 for the ACK channel. For the embodiment shown in FIG. 5A, a frame spans two hop intervals, and the ACK channel is mapped to one time-frequency block in each ACK frame. An ACK frame is a frame in which the ACK channel is sent, and a data frame is a frame used for data transmission. Each data frame may be associated with an ACK frame that is q frames away, as shown in FIG. 2. The ACK channel may puncture all or a portion of each time-frequency block to which the ACK channel is mapped, as described below.



FIG. 5B shows a signaling transmission scheme 510 for the ACK channel. For the embodiment shown in FIG. 5B, S=32, a frame spans one hop interval, and the ACK channel is mapped to four time-frequency blocks in each ACK frame. The ACK channel may puncture all or a portion of each time-frequency block.


For clarity, FIGS. 5A and 5B show the ACK channel puncturing one traffic channel y whenever the ACK channel is mapped to a time-frequency block used for traffic channel y. The ACK channel also punctures other traffic channels, which arc not labeled in FIGS. 5A and 5B for clarity. A terminal may transmit data on an assigned traffic channel (e.g., traffic channel y) and may transmit ACK messages on the ACK channel. If many traffic channels are available, then the ACK channel punctures only a portion of the transmission on the assigned traffic channel and punctures mostly the transmissions from other terminals on other traffic channels.


In general, the ACK channel may be mapped to any number of time-frequency blocks in each ACK frame. In an embodiment, the ACK channel is mapped to a fixed number of time-frequency blocks in each ACK frame. This fixed number may be determined based on the number of available traffic channels and/or some other factors. In another embodiment, the ACK channel is mapped to a configurable number of time-frequency blocks in each ACK frame. This configurable number may be determined based on the number of traffic channels that are in use, the number of packets that are sent on each traffic channel, the number of ACK bits that may be sent in each time-frequency block, and so on.



FIGS. 5A and 5B show specific embodiments for puncturing the traffic channels with the ACK channel. In another embodiment, the ACK channel is mapped to one or more fixed subcarrier sets, and the traffic channels hop around the fixed ACK channel. In yet another embodiment, the S subcarrier sets are arranged into G regions, with each region including S/G consecutive subcarrier sets. The ACK channel is then mapped to one subcarrier set in each region. The ACK channel may also puncture the traffic channels in other manners.


In general, the ACK channel may be mapped to time-frequency blocks in a pseudo-random or deterministic manner. The ACK channel may be mapped to different subcarrier sets to achieve frequency and interference diversity, e.g., as shown in FIGS. 5A and 5B. In an embodiment, the ACK channel is pseudo-random with respect to the traffic channels and equally punctures the traffic channels. This may be achieved by hopping the ACK channel, hopping the traffic channels, or hopping both the ACK channel and the traffic channels. An FH pattern may indicate the specific time-frequency block(s) for the ACK channel in each ACK frame. This FH pattern may be sent to the terminals or may be known a priori by the terminals. In any case, the terminals have knowledge of the time-frequency blocks occupied by the ACK channel.



FIG. 6 shows an embodiment of the puncturing of a time-frequency block by the ACK channel. The time-frequency block covers N subcarriers and spans T symbol periods. In general, the ACK channel may puncture all or a portion of the time-frequency block. An ACK segment is a time-frequency segment used for the ACK channel. An ACK segment is formed by the part of the time-frequency block that is punctured and used for the ACK channel. In general, an ACK segment may cover any number of subcarriers and may span any number of symbol periods. In an embodiment, which is not shown in FIG. 6, the ACK channel punctures the entire time-frequency block. For this embodiment, the ACK channel is sent in the entire time-frequency block, and traffic data is not sent in the time-frequency block. In another embodiment, which is shown in FIG. 6, the ACK channel punctures a portion of the time-frequency block. For example, the ACK channel may puncture a half, a quarter, an eighth, or some other fraction of the time-frequency block. The punctured portion may be contiguous in both time and frequency, as shown in FIG. 6. Transmission on contiguous subcarriers may result in a lower peak-to-average power ratio (PAPR), which is desirable. Alternatively, the punctured portion may be spread across frequency, across time, or across both frequency and time. In any case, the ACK channel is sent in the punctured portion of the time-frequency block, and traffic data may be sent in the remaining portion of the time-frequency block.



FIG. 7A shows an embodiment of an ACK segment. For this embodiment, the ACK segment covers 8 subcarriers and spans 8 symbol periods. The ACK segment includes 64 transmission units. A transmission unit is one subcarrier in one symbol period. For the embodiment shown in FIG. 7A, the ACK segment is partitioned into four clusters. Each cluster covers 8 subcarriers, spans 2 consecutive symbol periods, and includes 16 transmission units.


In general, an ACK segment may be partitioned in various manners. In another embodiment, each cluster covers two subcarricrs and spans all 8 symbol periods. In yet another embodiment, each cluster covers all subcarriers and spans all symbol periods in the ACK segment. For example, cluster 1 may include subcarriers 1 and 2 in symbol periods 1 and 5, subcarriers 3 and 4 in symbol periods 2 and 6, subcarriers 5 and 6 in symbol periods 3 and 7, and subcarriers 7 and 8 in symbol periods 4 and 8.



FIG. 7B shows an embodiment of a time-frequency block that is not punctured by an ACK segment. For this embodiment, the time-frequency block covers 16 subcarriers, spans 8 symbol periods, and includes 128 transmission units. Pilot symbols may be sent on some of the transmission units, and data symbols may be sent on the remaining transmission units. As used herein, a data symbol is a symbol for traffic data, a pilot symbol is a symbol for pilot, which is data that is known a priori by both the base station and the terminals, a signaling symbol is a symbol for signaling, and a symbol is typically a complex value. For the embodiment shown in FIG. 7B, pilot symbols are sent on subcarriers 1, 9 and 16 in symbol periods 1, 2, 3, 6, 7 and 8, or six strips of three pilot symbols. The pilot symbols may be distributed across frequency, e.g., as shown in FIG. 7B, and may be used to derive a channel estimate for the time-frequency block. The channel estimate may be used to perform data detection for the data symbols sent in the time-frequency block.



FIG. 7C shows an embodiment of a time-frequency block that is punctured by an ACK segment. For this embodiment, pilot symbols are sent on subcarriers 9 and 16 in symbol periods 1, 2, 3, 6, 7 and 8, or four strips of three pilot symbols. The pilot symbols may be used to derive a channel estimate for the unpunctured portion of the time-frequency block.


The embodiment shown in FIGS. 7B and 7C allows a serving sector to derive an interference estimate for an ACK segment for one or more neighbor sectors. A terminal may transmit on an entire time-frequency block to the serving sector if this time-frequency block is not punctured by an ACK segment for the serving sector. However, this time-frequency block may collide with an ACK segment for one or more neighbor sectors. In this case, the lower half of the time-frequency block may observe higher interference from the ACK segment for the neighbor sector(s). The serving sector may estimate the interference from the other sector(s) based on the pilot symbols sent on subcarrier 1 in symbol periods 1, 2, 3, 6, 7 and 8. The serving sector may use the interference estimate for data detection of the data symbols sent in the time-frequency block.



FIGS. 7B and 7C show one embodiment for sending pilot and data in a time-frequency block. Pilot and data may also be sent using various other patterns for a time-frequency block. In general, a sufficient number of pilot symbols may be sent on a time-frequency block to allow a serving sector to derive a channel estimate for the time-frequency block, with and without puncturing by an ACK segment for the serving sector. A sufficient number of pilot symbols may be located such that the serving sector can derive an interference estimate for the ACK segment from neighbor sectors.


A terminal may send an ACK message for each H-ARQ transmission received from a base station. The amount of information sent in each ACK message may be dependent on the number of packets sent in the corresponding H-ARQ transmission. In an embodiment, an ACK message includes one bit that acknowledges an H-ARQ transmission for one packet. In another embodiment, an ACK message includes multiple (B) bits that acknowledge an H-ARQ transmission for B packets. In an embodiment, an ACK message is sent with On/Off keying, for example, ‘1’ for ACK and ‘0’ for NAK. In another embodiment, an ACK message is encoded prior to transmission.


Multiple terminals may send their ACK messages using code division multiplexing (CDM), time division multiplexing (TDM), frequency division multiplexing (FDM), some other orthogonal multiplexing scheme, or a combination thereof. Multiple terminals may send their ACK messages in the same cluster of an ACK segment using any orthogonal multiplexing scheme.


In an embodiment, ACK messages are sent using CDM. For this embodiment, the terminals are assigned different spreading codes or sequences, and each terminal spread its ACK messages with its spreading code. The spread ACK messages for the terminals are orthogonal to one another in the code domain.


In an embodiment, the spreading codes are orthogonal codes formed with columns of a Hadamard matrix. A 2×2 Hadamard matrix W2×2 and a larger size Hadamard matrix W2L×2L may be expressed as:











W
_


2
×
2


=



[



1


1




1



-
1




]






and







W
_


2

L
×
2

L



=


[





W
_


L
×
L






W
_


L
×
L








W
_


L
×
L





-


W
_


L
×
L






]

.






Eq






(
1
)









Hadamard matrices of square dimensions that are power of two (e.g., 2×2, 4×4, 8×8, and so on) may be formed as shown in equation (1).


In another embodiment, the spreading codes are orthogonal codes formed with columns of a Fourier matrix. An L×L Fourier matrix FL×L has element fn,m in the n-th row of the m-th column, which may be expressed as:

fn,m=e−j2π(n−1)(m−1)/L, for n=1, . . . ,L and m=1, . . . ,L.  Eq. (2)

Fourier matrices of any square dimension (e.g., 2×2, 3x3, 4×4, 5×5, and so on) may be formed as shown in equation (2).


A 1-bit ACK message may be spread with an L-chip spreading code to generate a spread ACK message that contains L chips, as follows:

xu,i=au·wu,i, for i=1, . . . ,L,  Eq (3)

where au is an ACK bit for terminal u, which may have a value of 0 or 1, or au ε{0,1};


wu,i is the i-th chip of the spreading code assigned to terminal u; and


xu,i is the i-th chip of the spread ACK message for terminal u.


The L chips of the spread ACK message may be sent in the frequency domain by mapping these L ACK chips to L transmission units in an ACK segment, e.g., like OFDMA. Alternatively, these L ACK chips may be sent in the time domain by performing an L-point DFT/FFT to obtain L frequency-domain symbols and mapping these L symbols to L transmission units in an ACK segment, e.g., like SC-FDMA.


For the embodiment shown in FIG. 7A, a 1-bit ACK message may be sent in 16 transmission units, and the ACK bit may be spread with a 16-chip spreading code to generate 16 ACK chips. These 16 ACK chips may then be mapped to 16 transmission units in one ACK cluster. Up to 15 other terminals may send their ACK messages in the same cluster using other spreading codes. Up to 64 terminals may send ACK messages in one ACK segment.


In an embodiment, a subset of the available spreading codes is used for sending ACK information. The remaining spreading codes are not used for sending ACK information and are used instead for interference estimation. In an embodiment, each cluster includes 16 transmission units (e.g., as shown in FIG. 7A), eight spreading codes may be used to send ACK information and are called usable spreading codes, and the remaining eight spreading codes are used for interference estimation and are called reserved spreading codes. For this embodiment, eight usable spreading codes are available for each cluster, and up to 32 ACK messages may be sent in one ACK segment. For this embodiment, eight reserved spreading codes may be used for interference estimation in each cluster. More than 32 ACK messages may be sent in one ACK segment by allocating more spreading codes for sending ACK messages. More than 32 ACK messages may be sent in one ACK frame by allocating more ACK segments for the ACK channel.


In another embodiment, ACK messages arc sent using TDM or FDM. For this embodiment, the terminals are assigned different transmission units for the ACK channel, and each terminal sends its ACK message in its assigned transmission units. The ACK messages for the terminals would then be orthogonal to one another in time and/or frequency. In an embodiment based on the ACK segment shown in FIG. 7A, eight terminals may be assigned eight rows of a cluster, and each terminal may send its ACK bit on the two transmission units in the assigned row. In another embodiment, four clusters are formed, with each cluster covering two subcarriers and spanning 8 symbol periods. Eight terminals may be assigned eight columns of a cluster, and each terminal may send its ACK bit on the two transmission units in the assigned column.



FIG. 8 shows an embodiment for transmitting an ACK message to achieve frequency and time diversity. For this embodiment, the ACK message is sent on different clusters in multiple (C) ACK segments, one cluster in each ACK segment. For the embodiment shown in FIG. 8, C=4, and the ACK message is sent on four different clusters in four ACK segments to achieve time diversity. Sending the ACK message over a longer time interval may also improve link budget for terminals located at the edge of coverage. These disadvantage terminals typically have an upper limit on transmit power. A longer transmission time interval for the ACK message allows a disadvantage terminal to transmit the ACK message with more energy spread over a longer period of time, which improves the likelihood of correctly receiving the ACK message. The ACK message also achieves frequency diversity since the four ACK segments occupy different subcarrier sets in different 2-symbol intervals. C-th order diversity may be achieved for the ACK message by sending the ACK message in different clusters in C ACK segments.


In an embodiment, an ACK message is sent on different clusters in C ACK segments, and the terminals are mapped to the clusters in a pseudo-random or deterministic manner such that an ACK message for each terminal observes interference from a different set of terminals in each of the C clusters on which that ACK message is sent. This embodiment provides time and frequency diversity for the ACK message sent by each terminal. This embodiment further provides diversity with respect to the interference from the other terminals.


A base station performs the complementary despreading to recover the ACK messages sent by the terminals. For each terminal u, the base station despreads the received symbols from each of the C clusters used by terminal u with the spreading code assigned to terminal u and obtains C despread symbols for the C clusters. For each of the C clusters, the base station may also despread the received symbols with each of the reserved spreading codes to obtain an interference estimate for that cluster. The base station may then scale and combine the C despread symbols for terminal u with the interference estimates for the C clusters to obtain a detected ACK message for terminal u, as described below.


The signaling transmission techniques described herein may be used with various channel structures. An exemplary channel structure is described below.



FIG. 9 shows an embodiment of a binary channel tree 900. For the embodiment shown in FIG. 9, S=32 subcarrier sets are available for use. A set of traffic channels may be defined with the 32 subcarrier sets. Each traffic channel is assigned a unique channel ID and is mapped to one or more subcarrier sets in each time interval. For example, a traffic channel may be defined for each node in channel tree 900. The traffic channels may be sequentially numbered from top to bottom and from left to right for each tier. The largest traffic channel corresponding to the topmost node is assigned a channel ID of 0 and is mapped to all 32 subcarrier sets. The 32 traffic channels in the lowest tier 1 have channel IDs of 31 through 62 and are called base traffic channels. Each base traffic channel is mapped to one subcarrier set.


The tree structure shown in FIG. 9 places certain restrictions on the use of the traffic channels for an orthogonal system. For each traffic channel that is assigned, all traffic channels that are subsets (or descendants) of the assigned traffic channel and all traffic channels for which the assigned traffic channel is a subset are restricted. The restricted traffic channels are not used concurrently with the assigned traffic channel so that no two traffic channels use the same subcarrier set at the same time.


In an embodiment, an ACK resource is assigned to each traffic channel that is assigned for use. An ACK resource may also be called an ACK sub-channel or some other terminology. An ACK resource includes pertinent resources (e.g., a spreading code and a set of clusters) used to send an ACK message in each ACK frame. For this embodiment, the ACK messages for each traffic channel may be sent on the assigned ACK resource. The assigned ACK resources may be signaled to the terminal.


In another embodiment, an ACK resource is associated with each of the base traffic channels in the lowest tier of a channel tree. This embodiment allows for assignment of the maximum number of traffic channels of the minimum size. A larger traffic channel corresponding to a node above the lowest tier may use (1) the ACK resources for all base traffic channels under the larger traffic channel, (2) the ACK resource for one of the base traffic channels, e.g., the base traffic channel with the lowest channel ID, or (3) the ACK resources for a subset of the base traffic channels under the larger traffic channel. For options (1) and (3) above, an ACK message for the larger traffic channel may be sent using multiple ACK resources to improve the likelihood of correct reception. If multiple packets are sent in parallel, e.g., using multiple-input multiple-output (MIMO) transmission, then a larger traffic channel with multiple base traffic channels may be assigned for the transmission. The number of base traffic channels is equal to or greater than the number of packets. Each packet may be mapped to a different base traffic channel. The ACK for each packet may then be sent using the ACK resource for the associated base traffic channel.


In yet another embodiment, an ACK resource is assigned to each packet to be acknowledged. A terminal may be assigned one ACK resource if one packet is sent in a frame. A terminal may be assigned multiple ACK resources if multiple packets are sent in a frame, e.g., using either a larger traffic channel or spatial multiplexing to transmit via multiple antennas.


In yet another embodiment, an H-ARQ transmission may span multiple interlaces, and an ACK message is sent in multiple ACK frames. The base station may combine the detected ACK messages for the multiple ACK frames to improve ACK detection performance.


System 100 may support a single-carrier mode and a multi-carrier mode. In the single-carrier mode, K subcarriers may be available for transmission, and the ACK channel may puncture the traffic channels as described above. In the multi-carrier mode, K subcarriers may be available for each of multiple carriers. The ACK channel may be scaled up for the multi-carrier mode to support more traffic channels and/or to acknowledge more packets that may be sent with more carriers.


The transmit power for the ACK channel may be controlled to achieve good performance, which may be quantified by a given target ACK-to-NAK error rate (e.g., 1%), a given target NAK-to-ACK error rate (e.g., 0.1%), and/or some other metrics. In an embodiment, the transmit power for the ACK channel for a given terminal is adjusted based on the measured performance for the ACK channel for that terminal. In another embodiment, the transmit power for the ACK channel is adjusted based on the transmit power for a reference channel. The reference channel may be any channel that is sent often or regularly, e.g., a traffic channel or a signaling channel such as a channel quality indicator (CQI) channel. The ACK channel may use the transmit power for the reference channel as a power reference. The transmit power for the ACK channel may be set equal to the power reference plus a delta, which may be adjusted based on the performance of the ACK channel. The reference channel is thus used for short-term power set point while the long-term offset of the ACK channel is controlled based on the ACK performance.



FIG. 10 shows an embodiment of a process 1000 for sending signaling and traffic data. The signaling may be ACK messages or some other type of signaling. Process 1000 may be performed by a terminal to transmit on the reverse link.


For the embodiment shown in FIG. 10, signaling is sent with CDM. The time-frequency segments for a signaling channel that punctures traffic channels are determined, e.g., based on a frequency hopping pattern for the signaling channel (block 1012). Signaling is generated (block 1014) and spread with a spreading code (e.g., a Walsh code) to obtain spread signaling (block 1016). The spread signaling is mapped to the time-frequency segments for the signaling channel (block 1018). Each time-frequency segment may include multiple clusters. A signaling message may be mapped to different clusters in multiple time-frequency segments to achieve diversity. The signaling may also be sent with other multiplexing schemes instead of CDM.


Traffic data is processed and mapped to time-frequency blocks for a traffic channel assigned for use (block 1022). Traffic data that is mapped to the time-frequency segments for the signaling channel is punctured (block 1024). OFDM symbols or SC-FDMA symbols are generated for the mapped signaling and traffic data (block 1026).



FIG. 11 shows an embodiment of an apparatus 1100 for sending signaling and traffic data. Apparatus 1100 includes means for determining time-frequency segments for a signaling channel that punctures traffic channels (block 1112), means for generating signaling (block 1114), means for spreading the signaling with a spreading code (e.g., a Walsh code) to generate spread signaling (block 1116), and means for mapping the spread signaling to the time-frequency segments for the signaling channel (block 1118). A signaling message may be mapped to different clusters in multiple time-frequency segments to achieve diversity. Apparatus 1110 further includes means for processing and mapping traffic data to time-frequency blocks for an assigned traffic channel (block 1122), means for puncturing traffic data that is mapped to the time-frequency segments for the signaling channel (block 1124), and means for generating OFDM symbols or SC-FDMA symbols for the mapped signaling and traffic data (block 1126).



FIG. 12 shows an embodiment of a process 1200 for receiving signaling and traffic data. Process 1200 may be performed by a base station to receive signaling and data sent on the reverse link. The time-frequency segments for the signaling channel are determined (block 1212). Received symbols are extracted from the time-frequency segments for the signaling channel (block 1214). The extracted received symbols are processed to recover the transmitted signaling. For the embodiment shown in FIG. 12, the extracted received symbols are despread with a spreading code assigned to a terminal to obtain despread symbols for the terminal (block 1216). The extracted received symbols may also be despread with spreading code(s) not used for signaling to obtain interference estimates (block 1218). The despread symbols are detected (e.g., with the interference estimates, if available) to recover the signaling sent by the terminal (block 1220). A signaling message may be sent on different clusters in multiple time-frequency segments. In this case, received symbols are extracted from each cluster and despread with the spreading code, and the despread symbols for the different clusters are detected to recover the signaling message.


Received symbols are extracted from time-frequency blocks for a traffic channel assigned to the terminal (block 1222). Received symbols extracted from the time-frequency segments for the signaling channel are punctured (block 1224). The unpunctured received symbols are processed to obtain decoded data for the terminal (block 1226).



FIG. 13 shows an embodiment of an apparatus 1300 for receiving signaling and traffic data. Apparatus 1300 includes means for determining the time-frequency segments for the signaling channel (block 1312), means for extracting received symbols from the time-frequency segments for the signaling channel (block 1314), means for despreading the extracted received symbols with a spreading code assigned to a terminal to obtain despread symbols (block 1316), means for despreading the extracted received symbols with spreading code(s) not used for signaling to obtain interference estimates (block 1318), and means for performing detection on the despread symbols (e.g., with the interference estimates, if available) to recover the signaling sent by the terminal (block 1320). A signaling message may also be recovered from different clusters in multiple time-frequency segments. Apparatus 1300 further includes means for extracting received symbols from time-frequency blocks for a traffic channel assigned to the terminal (block 1322), means for puncturing received symbols extracted from the time-frequency segments for the signaling channel (block 1324), and means for processing the unpunctured received symbols to obtain decoded data for the terminal (block 1326).



FIG. 14 shows a block diagram of an embodiment of a base station 110 and a terminal 120 in FIG. 1. For this embodiment, base station 110 and terminal 120 are each equipped with a single antenna.


At base station 110, a transmit (TX) data and signaling processor 1410 receives traffic data for one or more terminals, processes (e.g., formats, encodes, interleaves, and symbol maps) the traffic data for each terminal based on one or more coding and modulation schemes selected for that terminal, and provides data symbols. Processor 1410 also generates pilot symbols and signaling symbols. An OFDM modulator 1412 performs OFDM modulation on the data symbols, pilot symbols, and signaling symbols and provides OFDM symbols. If system 100 utilizes SC-FDMA, then modulator 1412 performs SC-FDMA modulation and provides SC-FDMA symbols. A transmitter (TMTR) 1414 conditions (e.g., converts to analog, filters, amplifies, and upconverts) the OFDM symbols to generate an FL modulated signal, which is transmitted from an antenna 1416.


At terminal 120, an antenna 1452 receives FL modulated signals from base station 110 and possibly other base stations and provides a received signal to a receiver (RCVR) 1454. Receiver 1454 processes (e.g., conditions and digitizes) the received signal and provides received samples. An OFDM demodulator (Demod) 1456 performs OFDM demodulation on the received samples and provides received symbols for the K total subcarriers. A receive (RX) data and signaling processor 1458 processes (e.g., symbol demaps, deinterleaves, and decodes) the received symbols and provides decoded data and signaling for terminal 120.


A controller/processor 1470 receives decoding results from processor 1458 and generates ACK messages for terminal 120. A TX data and signaling processor 1460 generates signaling symbols for the ACK messages, data symbols for traffic data to be sent to base station 110, and pilot symbols. An OFDM modulator 1462 performs OFDM modulation on the data symbols, pilot symbols, and signaling symbols and provides OFDM symbols. A transmitter 1464 conditions the OFDM symbols and generates an RL modulated signal, which is transmitted from antenna 1452.


At base station 110, RL modulated signals from terminal 120 and other terminals are received by antenna 1416, conditioned and digitized by a receiver 1420, demodulated by an OFDM demodulator 1422, and processed by an RX data and signaling processor 1424 to recover the ACK messages and traffic data sent by terminal 120 and other terminals. A controller/processor 1430 receives the detected ACK messages and controls the data transmissions on the forward link to the terminals.


Controllers/processors 1430 and 1470 direct the operation of various processing units at base station 110 and terminal 120, respectively. Memories 1432 and 1472 store program codes and data for base station 110 and terminal 120, respectively.



FIG. 15 shows a block diagram of an embodiment of TX data and signaling processor 1460 at terminal 120. Processor 1460 includes a TX data processor 1510, a TX signaling processor 1520, and a multiplexer (MUX)/combiner 1530.


Within TX data processor 1510, a unit 1512 encodes, interleaves, and symbol maps traffic data and provides data symbols. A symbol-to-subcarrier mapper 1514 maps the data symbols to the time-frequency blocks for a traffic channel assigned to terminal 120. A puncturer 1516 punctures data symbols that arc mapped to time-frequency segments for the ACK channel and provides the unpunctured data symbols.


Within TX signaling processor 1520, a data spreader 1522 spreads an ACK message with a spreading code assigned to terminal 120 and provides ACK chips. For the embodiment shown in FIG. 15, the spreading is performed in the frequency domain, and data spreader 1522 provides the ACK chips as signaling symbols. In another embodiment, which is not shown in FIG. 15, the spreading is performed in the time domain, and a DFT unit transforms the ACK chips for each symbol period to the frequency domain and provides the signaling symbols. For both embodiments, a symbol-to-subcarrier mapper 1524 maps the signaling symbols to the proper clusters in the time-frequency segments for the ACK channel. Unit 1530 combines the data symbols from processor 1510 and the signaling symbols from processor 1520 and provides the mapped data and signaling symbols.



FIG. 16 shows a block diagram of an embodiment of RX data and signaling processor 1424 at base station 110. Processor 1424 includes an RX data processor 1610 and an RX signaling processor 1620. For clarity, the processing to recover traffic data and signaling from one terminal u (e.g., terminal 120 in FIGS. 14 and 15) is described below.


Within RX data processor 1610, a symbol-to-subcarrier demapper 1612 extracts received symbols from the time-frequency blocks for the traffic channel assigned to terminal 120. A puncturer 1614 punctures the received symbols extracted from the time-frequency segments for the ACK channel and provides the unpunctured received symbols. A unit 1616 symbol demaps, deinterleaves, and decodes the unpunctured received symbols and provides decoded data for terminal 120.


Within RX signaling processor 1620, a symbol-to-subcarrier demapper 1622 extracts received symbols from the time-frequency segments for the ACK channel. If the spreading is performed in the frequency domain, then an IDFT unit transforms the received symbols for each symbol period to the time domain and provides time-domain samples for despreading (not shown in FIG. 16). If the spreading is performed in the frequency domain, which is shown in FIG. 16 and assumed for the description below, then demapper 1622 provides the received symbols for despreading. A data despreader 1624 despreads the received symbols from each cluster with the spreading code assigned to terminal 120, as follows:











z

u
,
c


=



i











r

c
,
i


·

w

u
,
i





,




Eq






(
4
)









where rc,i is the i-th received symbol from cluster c; and


zu,c is a despread symbol from cluster c for terminal u.


An interference estimator 1626 despreads the received symbols from each cluster with each reserved spreading code as follows:











z

j
,
c


=



i











r

c
,
i


·

w

j
,
i





,






for





j


RC





Eq






(
5
)









where zj,c is a despread symbol for reserved spreading code j; and


RC is a set of all reserved spreading codes.


Interference estimator 1626 then derives an interference estimate for each cluster by summing the squared magnitude of the despread symbols for the reserved spreading codes, as follows:











I

0
,
c


=




j

RC














z

j
,
c




2



,




Eq






(
6
)









where I0,c is the interference estimate for cluster c.


A detector 1628 performs detection for the ACK message sent by terminal 120 based on the despread symbols and the interference estimates for all clusters, as follows:











A
u

=



c














z

u
,
c




2


I

0
,
c





,




and




Eq






(
7
)
















ACK
u



{




1















A
u

>

A
th


,






0













otherwise
,









Eq






(
8
)









where Ath is a threshold used for detecting an ACK bit and ACKu is the detected ACK message for terminal 120. Equation (7) computes the energy of the despread symbol for the ACK bit for each cluster, scales the symbol energy for each cluster based on the interference estimate for that cluster, and combines the weighted results for all clusters used to send the ACK bit.


The ACK detection may also be performed in other manners. In another embodiment, base station 110 performs ACK detection with interference cancellation. For example, base station 110 may detect the ACK bit for the strongest received terminal, estimate the interference due to this terminal, subtract the estimated interference from the received symbols, and detect the ACK bit for the next strongest received terminal based on the interference-canceled received symbols. In yet another embodiment, base station 110 performs coherent ACK detection. For this embodiment, base station 110 derives a channel estimate for each terminal based on a pilot sent by that terminal and performs ACK detection with the channel estimate.


The signaling transmission techniques described herein may be implemented by various means. For example, these techniques may be implemented in hardware, firmware, software, or a combination thereof. For a hardware implementation, the processing units at a terminal 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, electronic devices, other electronic units designed to perform the functions described herein, or a combination thereof. The processing units at a base station may also be implemented within one or more ASIC, DSPs, processors, and so on.


For a firmware and/or software implementation, the techniques 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 (e.g., memory 1432 or 1472 in FIG. 14) and executed by a processor (e.g., processor 1430 or 1470). The memory may be implemented within the processor or external to the processor.


It should be noted that the concept of channels herein refers to information or transmission types that may be transmitted by the access point or access terminal. It does not require or utilize fixed or predetermined blocks of subcarriers, time periods, or other resources dedicated to such transmissions.


Further, time-frequency segments are exemplary resources that may be assigned for signaling and data. The time-frequency segments may also comprise frequency subcarriers, transmission symbols, or other resources, in addition to time frequency segments.


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. An apparatus comprising: at least one processor configured to map signaling to resources for a signaling channel that punctures traffic channels; anda memory coupled to the at least one processor;wherein the signaling comprises acknowledgments for received data transmissions, and wherein the processor is configured to map the resources for the signaling channel in a pseudo-random manner with respect to the traffic channels.
  • 2. The apparatus of claim 1: wherein the at least one processor is configured to determine the resources for the signaling channel based on a frequency hopping pattern.
  • 3. The apparatus of claim 1, wherein the at least one processor is configured to spread the signaling with a spreading code, and to map the spread signaling to the resources for the signaling channel.
  • 4. The apparatus of claim 3, wherein the spreading code is derived from a Hadamard matrix or a Fourier matrix.
  • 5. The apparatus of claim 1, wherein the at least one processor is configured to map a signaling message to resources comprising multiple time-frequency segments.
  • 6. The apparatus of claim 5, wherein the signaling message observes interference from a different set of transmitters in each of the multiple time-frequency segments.
  • 7. The apparatus of claim 5, wherein the multiple time-frequency segments cover different frequency subcarriers.
  • 8. The apparatus of claim 1, wherein the resources comprise time-frequency segments that each comprise multiple clusters, and wherein the at least one processor is configured to map a signaling message to a cluster in each of multiple time-frequency segments.
  • 9. The apparatus of claim 8, wherein the at least one processor is configured to map the signaling message to clusters covering different time intervals in the multiple time-frequency segments.
  • 10. An apparatus comprising: at least one processor configured to map signaling to resources for a signaling channel that punctures traffic channels; anda memory coupled to the at least one processor;wherein the signaling comprises acknowledgments for received data transmissions, and wherein the signaling channel equally punctures the traffic channels.
  • 11. An apparatus comprising: at least one processor configured to map signaling to resources for a signaling channel that punctures traffic channels; anda memory coupled to the at least one processor;wherein the signaling comprises acknowledgments for received data transmissions, and wherein the traffic channels are defined by a channel tree, and wherein each node in the channel tree is associated with specific resources in the signaling channel.
  • 12. The apparatus of claim 1, wherein each traffic channel is associated with a specific spreading code and specific resources in the signaling channel.
  • 13. The apparatus of claim 1, wherein the at least one processor is configured to map data to resources for a traffic channel, and to puncture data mapped to the resources for the signaling channel.
  • 14. An apparatus comprising: at least one processor configured to map signaling to resources for a signaling channel that punctures traffic channels; anda memory coupled to the at least one processor;wherein the signaling comprises acknowledgments for received data transmissions, the at least one processor is configured to map data to resources for a traffic channel, and to puncture data mapped to the resources for the signaling channel and wherein the resources comprise time-frequency segments, wherein a time-frequency segment punctures a portion of a time-frequency block, and wherein data is mapped to remaining portion of the time-frequency block.
  • 15. The apparatus of claim 1, wherein the at least one processor is configured to generate orthogonal frequency division multiplexing (OFDM) symbols carrying the mapped signaling.
  • 16. The apparatus of claim 1, wherein the at least one processor is configured to generate single-carrier frequency division multiple access (SC-FDMA) symbols carrying the mapped signaling.
  • 17. A method comprising: generating electrical signaling for transmission via a communication channel;mapping the signaling to resources for a signaling channel that punctures traffic channels; andmapping the resources for the signaling channel in a pseudo-random manner with respect to the traffic channels;wherein the signaling comprises acknowledgments for received data transmissions.
  • 18. The method of claim 17, further comprising: determining the resources for the signaling channel based on a frequency hopping pattern.
  • 19. The method of claim 17, further comprising: spreading the signaling with a spreading code, and wherein the spread signaling is mapped to the resources for the signaling channel.
  • 20. The method of claim 17, wherein mapping the signaling to the resources comprises mapping a signaling message to multiple time-frequency segments.
  • 21. The method of claim 17, further comprising: mapping data other resources to time-frequency blocks for a traffic channel; andpuncturing data with resources comprising time-frequency segments for the signaling channel.
  • 22. An apparatus comprising: means for generating signaling for transmission via a communication channel;means for mapping the signaling to resources for a signaling channel that punctures traffic channels; andmeans for mapping the resources for the signaling channel in a pseudo-random manner with respect to the traffic channels;wherein the signaling comprises acknowledgments for received data transmissions.
  • 23. The apparatus of claim 22, further comprising: means for determining the resources for the signaling channel based on a frequency hopping pattern.
  • 24. The apparatus of claim 22, further comprising: means for spreading the signaling with a spreading code, and wherein the spread signaling is mapped to the resources for the signaling channel.
  • 25. The apparatus of claim 22, wherein the means for mapping the signaling to the resources for the signaling channel comprises means for mapping a signaling message to resources comprising multiple time-frequency segments.
  • 26. The apparatus of claim 22, further comprising: means for mapping data to time-frequency blocks for a traffic channel; andmeans for puncturing data mapped to the time-frequency segments for the signaling channel.
  • 27. An apparatus comprising: at least one processor configured to extract received symbols from resources for a signaling channel that punctures traffic channels, and to process the extracted received symbols to recover signaling sent on the signaling channel; anda memory coupled to the at least one processor;wherein the signaling comprises acknowledgments for received data transmissions, and wherein the at least one processor is configured to extract received symbols from resources comprising time-frequency blocks for a traffic channel, to puncture received symbols extracted from the time-frequency segments for the signaling channel, and to process unpunctured received symbols to obtain decoded data for the traffic channel.
  • 28. The apparatus of claim 27, wherein:
  • 29. The apparatus of claim 27, wherein the at least one processor is configured to despread the extracted received symbols with a spreading code to obtain despread symbols, and to perform detection on the despread symbols to recover the signaling sent on the signaling channel.
  • 30. The apparatus of claim 29, wherein the at least one processor is configured to despread the extracted received symbols with at least one spreading code not used for signaling to obtain interference estimates.
  • 31. The apparatus of claim 27, wherein the at least one processor is configured to despread the extracted received symbols with a spreading code to obtain despread symbols, to despread the extracted received symbols with at least one spreading code not used for signaling to obtain interference estimates, and to perform detection on the despread symbols with the interference estimates to recover the signaling sent on the signaling channel.
  • 32. An apparatus comprising: at least one processor configured to extract received symbols from resources for a signaling channel that punctures traffic channels, and to process the extracted received symbols to recover signaling sent on the signaling channel; anda memory coupled to the at least one processor,wherein the signaling comprises acknowledgments for received data transmissions;wherein the at least one processor is configured to despread the extracted received symbols with a spreading code to obtain despread symbols, and to perform detection on the despread symbols to recover the signaling sent on the signaling channel;wherein the at least one processor is configured to despread the extracted received symbols with at least one spreading code not used for signaling to obtain interference estimates; andwherein each time-frequency segment comprises multiple clusters, and wherein the at least one processor is configured to extract received symbols from a cluster in resources comprising multiple time-frequency segments, to despread the extracted received symbols for each of the multiple time-frequency segments with a spreading code to obtain a despread symbol for the time-frequency segment, and to combine despread symbols for the multiple time-frequency segments to recover a signaling message.
  • 33. The apparatus of claim 27, wherein the at least one processor is configured to assign spreading codes to terminals for sending signaling on the signaling channel, and wherein at least one spreading code is reserved for interference estimation.
  • 34. A method comprising: extracting received symbols from time-frequency segments for an electrical signaling channel that punctures traffic channels;processing the extracted received symbols to recover signaling sent on the signaling channel;despreading the extracted received symbols with a spreading code to obtain despread symbols; andperforming detection on the despread symbols to recover the signaling sent on the signaling channel;wherein despreading comprises despreading the extracted received symbols with at least one spreading code not used for signaling to obtain interference estimates, and wherein the signaling comprises acknowledgments for received data transmissions.
  • 35. The method of claim 34, further comprising: determining the resources for the signaling channel based on a frequency hopping pattern.
  • 36. A method comprising: extracting received symbols from time-frequency segments for an electrical signaling channel that punctures traffic channels;processing the extracted received symbols to recover signaling sent on the signaling channel;extracting received symbols from resources comprising time-frequency blocks for a traffic channel;puncturing received symbols extracted from resources comprising time-frequency segments for the signaling channel; andprocessing unpunctured received symbols to obtain decoded data for the traffic channel;wherein the signaling comprises acknowledgments for received data transmissions.
  • 37. The method of claim 36, wherein processing the extracted received symbols comprises despreading the extracted received symbols with a spreading code to obtain despread symbols, and performing detection on the despread symbols to recover the signaling sent on the signaling channel.
  • 38. The method of claim 36, wherein processing the extracted received symbols comprises despreading the extracted received symbols with a spreading code to obtain despread symbols, despreading the extracted received symbols with at least one spreading code not used for signaling to obtain interference estimates, and performing detection on the despread symbols with the interference estimates to recover the signaling sent on the signaling channel.
  • 39. An apparatus comprising: means for extracting received symbols from time-frequency segments for an electrical signaling channel that punctures traffic channels;means for processing the extracted received symbols to recover signaling sent on the signaling channel;means for despreading the extracted received symbols with a spreading code to obtain despread symbols; andmeans for performing detection on the despread symbols to recover the signaling sent on the signaling channel;wherein means for despreading comprises means for despreading the extracted received symbols with at least one spreading code not used for signaling to obtain interference estimates, and wherein the signaling comprises acknowledgments for received data transmissions.
  • 40. The apparatus of claim 39, further comprising: means for determining the resources for the signaling channel based on a frequency hopping pattern.
  • 41. An apparatus comprising: means for extracting received symbols from resources comprising time-frequency blocks for a signaling channel that punctures traffic channels;means for processing the extracted received symbols to recover signaling sent on the signaling channel;means for extracting received symbols from resources comprising time-frequency blocks for a traffic channel;means for puncturing received symbols extracted from the resources comprising time-frequency blocks for the signaling channel; andmeans for processing unpunctured received symbols to obtain decoded data for the traffic channel;wherein the signaling comprises acknowledgments for received data transmissions.
  • 42. The apparatus of claim 41, wherein the means for processing the extracted received symbols comprises means for despreading the extracted received symbols with a spreading code to obtain despread symbols, and means for performing detection on the despread symbols to recover the signaling sent on the signaling channel.
  • 43. The apparatus of claim 41, wherein the means for processing the extracted received symbols comprises means for despreading the extracted received symbols with a spreading code to obtain despread symbols, means for despreading the extracted received symbols with at least one spreading code not used for signaling to obtain interference estimates, and means for performing detection on the despread symbols with the interference estimates to recover the signaling sent on the signaling channel.
  • 44. A processor readable media for storing instructions operable to: generate signaling for transmission via a communication channel;map the signaling to resources for a signaling channel that punctures traffic channels; andmap the resources for the signaling channel in a pseudo-random manner with respect to the traffic channels;wherein the signaling comprises acknowledgments for received data transmissions.
  • 45. The processor readable media of claim 44, the instructions further operable to: determine the resources for the signaling channel based on a frequency hopping pattern.
  • 46. The processor readable media of claim 44, the instructions further operable to: spread the signaling with a spreading code, and wherein the spread signaling is mapped to the resources for the signaling channel.
  • 47. The processor readable media of claim 44, wherein mapping the signaling to the resources comprises mapping a signaling message to multiple time-frequency segments.
  • 48. The processor readable media of claim 44, the instructions further operable to: map data other resources to time-frequency blocks for a traffic channel; andpuncture data with resources comprising time-frequency segments for the signaling channel.
  • 49. A method comprising: generating electrical signaling for transmission via a communication channel; andmapping the signaling to resources for a signaling channel that punctures traffic channels;wherein the signaling comprises acknowledgments for received data transmissions and wherein the signaling channel equally punctures the traffic channels.
  • 50. An apparatus comprising: means for generating signaling for transmission via a communication channel; andmeans for mapping the signaling to resources for a signaling channel that punctures traffic channels;wherein the signaling comprises acknowledgments for received data transmissions and wherein the signaling channel equally punctures the traffic channels.
  • 51. A processor readable media for storing instructions operable to: generate signaling for transmission via a communication channel; andmap the signaling to resources for a signaling channel that punctures traffic channels;wherein the signaling comprises acknowledgments for received data transmissions and wherein the signaling channel equally punctures the traffic channels.
  • 52. A method comprising: generating electrical signaling for transmission via a communication channel; andmapping the signaling to resources for a signaling channel that punctures traffic channels;wherein the signaling comprises acknowledgments for received data transmissions, wherein the traffic channels are defined by a channel tree, and wherein each node in the channel tree is associated with specific resources in the signaling channel.
  • 53. An apparatus comprising: means for generating signaling for transmission via a communication channel; andmeans for mapping the signaling to resources for a signaling channel that punctures traffic channels;wherein the signaling comprises acknowledgments for received data transmissions, wherein the traffic channels are defined by a channel tree, and wherein each node in the channel tree is associated with specific resources in the signaling channel.
  • 54. A processor readable media for storing instructions operable to: generate signaling for transmission via a communication channel; andmap the signaling to resources for a signaling channel that punctures traffic channels;wherein the signaling comprises acknowledgments for received data transmissions, wherein the traffic channels are defined by a channel tree, and wherein each node in the channel tree is associated with specific resources in the signaling channel.
  • 55. A method comprising: generating electrical signaling for transmission via a communication channel;mapping the signaling to resources for a signaling channel that punctures traffic channels;mapping data to resources for a traffic channel; andpuncturing data mapped to the resources for the signaling channel;wherein the signaling comprises acknowledgments for received data transmissions, wherein the resources comprise time-frequency segments, wherein a time-frequency segment punctures a portion of a time-frequency block, and wherein data is mapped to remaining portion of the time-frequency block.
  • 56. An apparatus comprising: means for generating signaling for transmission via a communication channel;means for mapping the signaling to resources for a signaling channel that punctures traffic channels;means for mapping data to resources for a traffic channel; andmeans for puncturing data mapped to the resources for the signaling channel;wherein the signaling comprises acknowledgments for received data transmissions, wherein the resources comprise time-frequency segments, wherein a time-frequency segment punctures a portion of a time-frequency block, and wherein data is mapped to remaining portion of the time-frequency block.
  • 57. A processor readable media for storing instructions operable to: generate signaling for transmission via a communication channel;map the signaling to resources for a signaling channel that punctures traffic channels;map data to resources for a traffic channel; andpuncture data mapped to the resources for the signaling channel;wherein the signaling comprises acknowledgments for received data transmissions, wherein the resources comprise time-frequency segments, wherein a time-frequency segment punctures a portion of a time-frequency block, and wherein data is mapped to remaining portion of the time-frequency block.
  • 58. A processor readable media for storing instructions operable to: extract received symbols from time-frequency segments for an electrical signaling channel that punctures traffic channels;process the extracted received symbols to recover signaling sent on the signaling channel; anddetermine the resources for the signaling channel based on a frequency hopping pattern;wherein the signaling comprises acknowledgments for received data transmissions.
  • 59. A processor readable media for storing instructions operable to: extract received symbols from time-frequency segments for an electrical signaling channel that punctures traffic channels;process the extracted received symbols to recover signaling sent on the signaling channel;despread the extracted received symbols with a spreading code to obtain despread symbols; andperform detection on the despread symbols to recover the signaling sent on the signaling channel;wherein instructions operable to despread comprises instructions operable to despread the extracted received symbols with at least one spreading code not used for signaling to obtain interference estimates, and wherein the signaling comprises acknowledgments for received data transmissions.
  • 60. A processor readable media for storing instructions operable to: extract received symbols from time-frequency segments for an electrical signaling channel that punctures traffic channels;process the extracted received symbols to recover signaling sent on the signaling channel;extract received symbols from resources comprising time-frequency blocks for a traffic channel;puncture received symbols extracted from resources comprising time-frequency segments for the signaling channel; andprocess unpunctured received symbols to obtain decoded data for the traffic channel;wherein the signaling comprises acknowledgments for received data transmissions.
US Referenced Citations (668)
Number Name Date Kind
4393276 Steele Jul 1983 A
4554668 Deman et al. Nov 1985 A
4747137 Matsunaga May 1988 A
4783779 Takahata et al. Nov 1988 A
4783780 Alexis Nov 1988 A
4975952 Mabey et al. Dec 1990 A
5008900 Critchlow et al. Apr 1991 A
5115248 Roederer May 1992 A
5268694 Jan et al. Dec 1993 A
5282222 Fattouche et al. Jan 1994 A
5363408 Paik et al. Nov 1994 A
5371761 Daffara et al. Dec 1994 A
5384810 Amrany Jan 1995 A
5406551 Saito et al. Apr 1995 A
5410538 Roche et al. Apr 1995 A
5455839 Eyuboglu Oct 1995 A
5465253 Rahnema Nov 1995 A
5491727 Petit Feb 1996 A
5513379 Benveniste et al. Apr 1996 A
5539748 Raith Jul 1996 A
5548582 Brajal et al. Aug 1996 A
5583869 Grube et al. Dec 1996 A
5594738 Crisler et al. Jan 1997 A
5604744 Andersson et al. Feb 1997 A
5612978 Blanchard et al. Mar 1997 A
5625876 Gilhousen et al. Apr 1997 A
5684491 Newman et al. Nov 1997 A
5726978 Frodigh et al. Mar 1998 A
5732113 Schmidl et al. Mar 1998 A
5745487 Hamaki Apr 1998 A
5768276 Diachina et al. Jun 1998 A
5790537 Yoon et al. Aug 1998 A
5812938 Gilhousen et al. Sep 1998 A
5815488 Williams et al. Sep 1998 A
5822368 Wang Oct 1998 A
5838268 Frenkel Nov 1998 A
5867478 Baum et al. Feb 1999 A
5870393 Yano et al. Feb 1999 A
5887023 Mabuchi Mar 1999 A
5907585 Suzuki et al. May 1999 A
5920571 Houck et al. Jul 1999 A
5926470 Tiedemann, Jr. Jul 1999 A
5933421 Alamouti et al. Aug 1999 A
5949814 Odenwalder et al. Sep 1999 A
5953325 Willars Sep 1999 A
5955992 Shattil Sep 1999 A
5956642 Larsson et al. Sep 1999 A
5995992 Eckard Nov 1999 A
5999826 Whinnett Dec 1999 A
6002942 Park Dec 1999 A
6016123 Barton et al. Jan 2000 A
6038150 Yee et al. Mar 2000 A
6038263 Kotzin et al. Mar 2000 A
6038450 Brink et al. Mar 2000 A
6052364 Chalmers et al. Apr 2000 A
6061337 Light et al. May 2000 A
6067315 Sandin May 2000 A
6075350 Peng Jun 2000 A
6075797 Thomas Jun 2000 A
6076114 Wesley Jun 2000 A
6088345 Sakoda et al. Jul 2000 A
6108323 Gray Aug 2000 A
6108550 Wiorek et al. Aug 2000 A
6112094 Dent Aug 2000 A
6128776 Kang Oct 2000 A
6138037 Jaamies Oct 2000 A
6141317 Marchok et al. Oct 2000 A
6154484 Lee et al. Nov 2000 A
6169910 Tamil et al. Jan 2001 B1
6175550 van Nee Jan 2001 B1
6175650 Sindhu et al. Jan 2001 B1
6176550 Lamart et al. Jan 2001 B1
6198775 Khayrallah et al. Mar 2001 B1
6215983 Dogan et al. Apr 2001 B1
6226280 Roark et al. May 2001 B1
6232918 Wax et al. May 2001 B1
6240129 Reusens et al. May 2001 B1
6249683 Lundby et al. Jun 2001 B1
6256478 Allen et al. Jul 2001 B1
6271946 Chang et al. Aug 2001 B1
6272122 Wee Aug 2001 B1
6310704 Dogan et al. Oct 2001 B1
6317435 Tiedemann, Jr. et al. Nov 2001 B1
6335922 Tiedemann, Jr. et al. Jan 2002 B1
6337659 Kim Jan 2002 B1
6337983 Bonta et al. Jan 2002 B1
6353637 Mansour et al. Mar 2002 B1
6363060 Sarkar Mar 2002 B1
6374115 Barnes et al. Apr 2002 B1
6377539 Kang et al. Apr 2002 B1
6377809 Rezaiifar et al. Apr 2002 B1
6388998 Kasturia May 2002 B1
6393008 Cheng et al. May 2002 B1
6393012 Pankaj May 2002 B1
6401062 Murashima Jun 2002 B1
6438369 Huang et al. Aug 2002 B1
6449246 Barton et al. Sep 2002 B1
6466800 Sydon et al. Oct 2002 B1
6473467 Wallace et al. Oct 2002 B1
6477317 Itokawa Nov 2002 B1
6478422 Hansen Nov 2002 B1
6483820 Davidson et al. Nov 2002 B1
6487243 Hwang et al. Nov 2002 B1
6496790 Kathavate et al. Dec 2002 B1
6501810 Karim et al. Dec 2002 B1
6507601 Parsa et al. Jan 2003 B2
6519462 Lu et al. Feb 2003 B1
6529525 Pecen et al. Mar 2003 B1
6535666 Dogan et al. Mar 2003 B1
6539008 Ahn et al. Mar 2003 B1
6539213 Richards et al. Mar 2003 B1
6542485 Mujtaba Apr 2003 B1
6542743 Soliman Apr 2003 B1
6563806 Yano et al. May 2003 B1
6563881 Sakoda et al. May 2003 B1
6577739 Hurtig et al. Jun 2003 B1
6584140 Lee Jun 2003 B1
6590881 Wallace et al. Jul 2003 B1
6597746 Amrany et al. Jul 2003 B1
6601206 Marvasti Jul 2003 B1
6614857 Buehrer et al. Sep 2003 B1
6625172 Odenwalder et al. Sep 2003 B2
6636568 Kadous Oct 2003 B2
6654339 Bohnke et al. Nov 2003 B1
6654431 Barton et al. Nov 2003 B1
6657949 Jones, IV et al. Dec 2003 B1
6658258 Chen et al. Dec 2003 B1
6674787 Dick et al. Jan 2004 B1
6674810 Cheng Jan 2004 B1
6675012 Gray Jan 2004 B2
6678318 Lai Jan 2004 B1
6690951 Cuffaro et al. Feb 2004 B1
6693952 Chuah et al. Feb 2004 B1
6701165 Ho et al. Mar 2004 B1
6704571 Moon Mar 2004 B1
6711400 Aura Mar 2004 B1
6717908 Zehavi et al. Apr 2004 B2
6721568 Gustavsson et al. Apr 2004 B1
6724719 Tong et al. Apr 2004 B1
6731602 Watanabe et al. May 2004 B1
6735244 Hasegawa et al. May 2004 B1
6744743 Walton et al. Jun 2004 B2
6748220 Chow et al. Jun 2004 B1
6751444 Meiyappan Jun 2004 B1
6751456 Bilgic Jun 2004 B2
6754511 Halford et al. Jun 2004 B1
6763009 Bedekar et al. Jul 2004 B1
6765969 Vook et al. Jul 2004 B1
6776165 Jin Aug 2004 B2
6776765 Soukup et al. Aug 2004 B2
6778513 Kasapi et al. Aug 2004 B2
6785341 Walton et al. Aug 2004 B2
6798736 Black et al. Sep 2004 B1
6799043 Tiedemann, Jr. et al. Sep 2004 B2
6802035 Catreux et al. Oct 2004 B2
6804307 Popovic Oct 2004 B1
6813284 Vayanos et al. Nov 2004 B2
6821535 Nurmi et al. Nov 2004 B2
6828293 Hazenkamp et al. Dec 2004 B1
6829293 Jones et al. Dec 2004 B2
6831943 Dabak et al. Dec 2004 B1
6842487 Larsson Jan 2005 B1
6850481 Wu et al. Feb 2005 B2
6850509 Lee et al. Feb 2005 B2
6862271 Medvedev et al. Mar 2005 B2
6870808 Liu et al. Mar 2005 B1
6870826 Ishizu Mar 2005 B1
6904097 Agami et al. Jun 2005 B2
6904283 Li et al. Jun 2005 B2
6904550 Sibecas et al. Jun 2005 B2
6907020 Periyalwar et al. Jun 2005 B2
6907269 Yamaguchi et al. Jun 2005 B2
6909707 Rotstein et al. Jun 2005 B2
6909797 Romsdahl et al. Jun 2005 B2
6917602 Toskala et al. Jul 2005 B2
6917821 Kadous et al. Jul 2005 B2
6927728 Vook et al. Aug 2005 B2
6928047 Xia Aug 2005 B1
6934266 Dulin et al. Aug 2005 B2
6934275 Love et al. Aug 2005 B1
6934340 Dollard Aug 2005 B1
6940842 Proctor, Jr. Sep 2005 B2
6940845 Benveniste Sep 2005 B2
6954481 Laroia et al. Oct 2005 B1
6954622 Nelson et al. Oct 2005 B2
6961364 Laroia et al. Nov 2005 B1
6963543 Diep et al. Nov 2005 B2
6970682 Crilly, Jr. et al. Nov 2005 B2
6975868 Joshi et al. Dec 2005 B2
6980540 Laroia et al. Dec 2005 B1
6985434 Wu et al. Jan 2006 B2
6985453 Lundby et al. Jan 2006 B2
6985466 Yun et al. Jan 2006 B1
6985498 Laroia et al. Jan 2006 B2
6987746 Song Jan 2006 B1
6993342 Kuchibhotla et al. Jan 2006 B2
7002900 Walton et al. Feb 2006 B2
7006529 Alastalo et al. Feb 2006 B2
7006557 Subrahmanya et al. Feb 2006 B2
7006848 Ling et al. Feb 2006 B2
7009500 Rao et al. Mar 2006 B2
7010048 Shattil Mar 2006 B1
7013143 Love et al. Mar 2006 B2
7016318 Pankaj et al. Mar 2006 B2
7016319 Baum et al. Mar 2006 B2
7016425 Kraiem Mar 2006 B1
7020110 Walton et al. Mar 2006 B2
7039356 Nguyen May 2006 B2
7039370 Laroia et al. May 2006 B2
7042857 Krishnan et al. May 2006 B2
7047006 Classon et al. May 2006 B2
7050402 Schmidl et al. May 2006 B2
7050405 Attar et al. May 2006 B2
7050759 Gaal et al. May 2006 B2
7054301 Sousa et al. May 2006 B1
7061898 Hashem et al. Jun 2006 B2
7069009 Li et al. Jun 2006 B2
7072315 Liu et al. Jul 2006 B1
7079867 Chun et al. Jul 2006 B2
7085574 Gaal et al. Aug 2006 B2
7095708 Alamouti et al. Aug 2006 B1
7099299 Liang et al. Aug 2006 B2
7099630 Brunner et al. Aug 2006 B2
7103384 Chun Sep 2006 B2
7106319 Ishiyama Sep 2006 B2
7113808 Hwang et al. Sep 2006 B2
7120134 Tiedemann, Jr. et al. Oct 2006 B2
7120395 Tong et al. Oct 2006 B2
7131086 Yamasaki et al. Oct 2006 B2
7133460 Bae et al. Nov 2006 B2
7139328 Thomas et al. Nov 2006 B2
7145940 Gore et al. Dec 2006 B2
7145959 Harel et al. Dec 2006 B2
7149199 Sung et al. Dec 2006 B2
7149238 Agee et al. Dec 2006 B2
7151761 Palenius Dec 2006 B1
7151936 Wager et al. Dec 2006 B2
7154936 Bjerke et al. Dec 2006 B2
7155236 Chen et al. Dec 2006 B2
7157351 Cheng et al. Jan 2007 B2
7161971 Tiedemann, Jr. et al. Jan 2007 B2
7164649 Walton et al. Jan 2007 B2
7164696 Sano et al. Jan 2007 B2
7167916 Willen et al. Jan 2007 B2
7170937 Zhou Jan 2007 B2
7177297 Agrawal et al. Feb 2007 B2
7177351 Kadous Feb 2007 B2
7180627 Moylan et al. Feb 2007 B2
7181170 Love et al. Feb 2007 B2
7184426 Padovani et al. Feb 2007 B2
7188300 Eriksson et al. Mar 2007 B2
7197282 Dent et al. Mar 2007 B2
7200177 Miyoshi Apr 2007 B2
7209712 Holtzman Apr 2007 B2
7215979 Nakagawa et al. May 2007 B2
7230942 Laroia et al. Jun 2007 B2
7233634 Hassell Sweatman et al. Jun 2007 B1
7236747 Meacham et al. Jun 2007 B1
7242722 Krauss et al. Jul 2007 B2
7243150 Sher et al. Jul 2007 B2
7248559 Ma et al. Jul 2007 B2
7248841 Agee et al. Jul 2007 B2
7254158 Agrawal Aug 2007 B2
7257167 Lau Aug 2007 B2
7257406 Ji Aug 2007 B2
7257423 Iochi Aug 2007 B2
7260153 Nissani et al. Aug 2007 B2
7280467 Smee et al. Oct 2007 B2
7289570 Schmidl et al. Oct 2007 B2
7289585 Sandhu et al. Oct 2007 B2
7290195 Guo et al. Oct 2007 B2
7292651 Li Nov 2007 B2
7292863 Chen et al. Nov 2007 B2
7295509 Laroia et al. Nov 2007 B2
7313086 Aizawa Dec 2007 B2
7313126 Yun et al. Dec 2007 B2
7313174 Alard et al. Dec 2007 B2
7313407 Shapira Dec 2007 B2
7327812 Auer Feb 2008 B2
7330701 Mukkavilli et al. Feb 2008 B2
7336727 Mukkavilli et al. Feb 2008 B2
7349371 Schein et al. Mar 2008 B2
7349667 Magee et al. Mar 2008 B2
7356000 Oprescu-Surdobe et al. Apr 2008 B2
7356005 Derryberry et al. Apr 2008 B2
7356073 Heikkila Apr 2008 B2
7359327 Oshiba Apr 2008 B2
7363055 Castrogiovanni et al. Apr 2008 B2
7366223 Chen et al. Apr 2008 B1
7366253 Kim et al. Apr 2008 B2
7366520 Haustein et al. Apr 2008 B2
7369531 Cho et al. May 2008 B2
7372911 Lindskog et al. May 2008 B1
7372912 Seo et al. May 2008 B2
7379489 Zuniga et al. May 2008 B2
7382764 Uehara Jun 2008 B2
7392014 Baker et al. Jun 2008 B2
7394865 Borran et al. Jul 2008 B2
7403745 Dominique et al. Jul 2008 B2
7403748 Keskitalo et al. Jul 2008 B1
7406119 Yamano et al. Jul 2008 B2
7406336 Astely et al. Jul 2008 B2
7411898 Erlich et al. Aug 2008 B2
7412212 Hottinen Aug 2008 B2
7418043 Shattil Aug 2008 B2
7418246 Kim et al. Aug 2008 B2
7423991 Cho et al. Sep 2008 B2
7426426 Van Baren Sep 2008 B2
7428426 Kiran et al. Sep 2008 B2
7433661 Kogiantis et al. Oct 2008 B2
7437164 Agrawal et al. Oct 2008 B2
7443835 Lakshmi Narayanan et al. Oct 2008 B2
7447270 Hottinen Nov 2008 B1
7450548 Haustein et al. Nov 2008 B2
7460466 Lee et al. Dec 2008 B2
7463698 Fujii et al. Dec 2008 B2
7468943 Gu et al. Dec 2008 B2
7469011 Lin et al. Dec 2008 B2
7471963 Kim et al. Dec 2008 B2
7483408 Bevan et al. Jan 2009 B2
7483719 Kim et al. Jan 2009 B2
7486408 Van Der Schaar et al. Feb 2009 B2
7486735 Dubuc et al. Feb 2009 B2
7492788 Zhang et al. Feb 2009 B2
7499393 Ozluturk Mar 2009 B2
7508748 Kadous Mar 2009 B2
7508842 Baum et al. Mar 2009 B2
7512096 Kuzminskiy et al. Mar 2009 B2
7551564 Mattina Jun 2009 B2
7567621 Sampath et al. Jul 2009 B2
7573900 Kim et al. Aug 2009 B2
7599327 Zhuang Oct 2009 B2
7616955 Kim Nov 2009 B2
7627051 Shen et al. Dec 2009 B2
7664061 Hottinen Feb 2010 B2
7676007 Choi et al. Mar 2010 B1
7684507 Levy Mar 2010 B2
7724777 Sutivong et al. May 2010 B2
7768979 Sutivong et al. Aug 2010 B2
7916624 Laroia et al. Mar 2011 B2
7924699 Laroia et al. Apr 2011 B2
7990843 Laroia et al. Aug 2011 B2
7990844 Laroia et al. Aug 2011 B2
8045512 Khandekar et al. Oct 2011 B2
8095141 Teague Jan 2012 B2
8098568 Laroia et al. Jan 2012 B2
8098569 Laroia et al. Jan 2012 B2
8199634 Laroia et al. Jun 2012 B2
8218425 Laroia et al. Jul 2012 B2
8223627 Laroia et al. Jul 2012 B2
8295154 Laroia et al. Oct 2012 B2
8446892 Ji et al. May 2013 B2
8462859 Sampath et al. Jun 2013 B2
8477684 Khandekar et al. Jul 2013 B2
20010021180 Lee et al. Sep 2001 A1
20010024427 Suzuki Sep 2001 A1
20010030948 Tiedemann, Jr. Oct 2001 A1
20010053140 Choi et al. Dec 2001 A1
20010055294 Motoyoshi Dec 2001 A1
20020015405 Sepponen et al. Feb 2002 A1
20020018157 Zhang et al. Feb 2002 A1
20020044524 Laroia et al. Apr 2002 A1
20020061742 Lapaille et al. May 2002 A1
20020077152 Johnson et al. Jun 2002 A1
20020085521 Tripathi et al. Jul 2002 A1
20020090004 Rinchiuso Jul 2002 A1
20020090024 Tan Jul 2002 A1
20020101839 Farley et al. Aug 2002 A1
20020122400 Vayanos et al. Sep 2002 A1
20020128035 Jokinen et al. Sep 2002 A1
20020159422 Li et al. Oct 2002 A1
20020160781 Bark et al. Oct 2002 A1
20020168946 Aizawa et al. Nov 2002 A1
20020172293 Kuchi et al. Nov 2002 A1
20020176398 Nidda Nov 2002 A1
20020191569 Sung et al. Dec 2002 A1
20020193146 Wallace et al. Dec 2002 A1
20030002464 Rezaiifar et al. Jan 2003 A1
20030035491 Walton et al. Feb 2003 A1
20030040283 Kawai et al. Feb 2003 A1
20030043732 Walton et al. Mar 2003 A1
20030043764 Kim et al. Mar 2003 A1
20030063579 Lee Apr 2003 A1
20030068983 Kim et al. Apr 2003 A1
20030072255 Ma et al. Apr 2003 A1
20030072280 McFarland et al. Apr 2003 A1
20030072395 Jia et al. Apr 2003 A1
20030073409 Nobukiyo et al. Apr 2003 A1
20030073464 Giannakis et al. Apr 2003 A1
20030076890 Hochwald et al. Apr 2003 A1
20030086393 Vasudevan et al. May 2003 A1
20030096579 Ito et al. May 2003 A1
20030103520 Chen et al. Jun 2003 A1
20030109266 Rafiah et al. Jun 2003 A1
20030112745 Zhuang et al. Jun 2003 A1
20030125040 Walton et al. Jul 2003 A1
20030142648 Semper Jul 2003 A1
20030147371 Choi et al. Aug 2003 A1
20030181170 Sim Sep 2003 A1
20030185310 Ketchum et al. Oct 2003 A1
20030190897 Lei et al. Oct 2003 A1
20030193915 Lee et al. Oct 2003 A1
20030202491 Tiedemann, Jr. et al. Oct 2003 A1
20030228850 Hwang Dec 2003 A1
20030235255 Ketchum et al. Dec 2003 A1
20030236080 Kadous et al. Dec 2003 A1
20040001429 Ma et al. Jan 2004 A1
20040002364 Trikkonen et al. Jan 2004 A1
20040009783 Miyoshi Jan 2004 A1
20040015692 Green et al. Jan 2004 A1
20040017785 Zelst Jan 2004 A1
20040048609 Kosaka Mar 2004 A1
20040058687 Kim et al. Mar 2004 A1
20040066761 Giannakis et al. Apr 2004 A1
20040067756 Wager et al. Apr 2004 A1
20040072565 Nobukiyo et al. Apr 2004 A1
20040076185 Kim et al. Apr 2004 A1
20040077379 Smith et al. Apr 2004 A1
20040081195 El-Maleh et al. Apr 2004 A1
20040087325 Cheng et al. May 2004 A1
20040097215 Abe et al. May 2004 A1
20040098505 Clemmensen May 2004 A1
20040105489 Kim et al. Jun 2004 A1
20040114618 Tong et al. Jun 2004 A1
20040120411 Walton et al. Jun 2004 A1
20040125792 Bradbury et al. Jul 2004 A1
20040131110 Alard et al. Jul 2004 A1
20040136344 Kim et al. Jul 2004 A1
20040136349 Walton et al. Jul 2004 A1
20040156328 Walton et al. Aug 2004 A1
20040160914 Sarkar Aug 2004 A1
20040160933 Odenwalder et al. Aug 2004 A1
20040166867 Hawe Aug 2004 A1
20040166887 Laroia et al. Aug 2004 A1
20040170152 Nagao et al. Sep 2004 A1
20040170157 Kim et al. Sep 2004 A1
20040171384 Holma et al. Sep 2004 A1
20040171385 Haustein et al. Sep 2004 A1
20040185792 Alexiou et al. Sep 2004 A1
20040202257 Mehta et al. Oct 2004 A1
20040208138 Hayashi et al. Oct 2004 A1
20040219819 Di Mascio Nov 2004 A1
20040219919 Whinnett et al. Nov 2004 A1
20040224711 Panchal et al. Nov 2004 A1
20040228313 Cheng et al. Nov 2004 A1
20040240419 Abrishamkar et al. Dec 2004 A1
20040240572 Brutel et al. Dec 2004 A1
20040248604 Vaidyanathan Dec 2004 A1
20040252529 Huber et al. Dec 2004 A1
20040252629 Hasegawa et al. Dec 2004 A1
20040252655 Lim et al. Dec 2004 A1
20040252662 Cho Dec 2004 A1
20040257979 Ro et al. Dec 2004 A1
20040264507 Cho et al. Dec 2004 A1
20050002412 Sagfors et al. Jan 2005 A1
20050002440 Alamouti et al. Jan 2005 A1
20050002468 Walton et al. Jan 2005 A1
20050003782 Wintzell Jan 2005 A1
20050008091 Boutros et al. Jan 2005 A1
20050009486 Al-Dhahir et al. Jan 2005 A1
20050013263 Kim et al. Jan 2005 A1
20050030886 Wu et al. Feb 2005 A1
20050030964 Tiedemann et al. Feb 2005 A1
20050034079 Gunasekar et al. Feb 2005 A1
20050041611 Sandhu Feb 2005 A1
20050041618 Wei et al. Feb 2005 A1
20050041775 Batzinger et al. Feb 2005 A1
20050044206 Johansson et al. Feb 2005 A1
20050047517 Georgios et al. Mar 2005 A1
20050052991 Kadous Mar 2005 A1
20050053081 Andersson et al. Mar 2005 A1
20050063298 Ling et al. Mar 2005 A1
20050073976 Fujii Apr 2005 A1
20050085236 Gerlach et al. Apr 2005 A1
20050111397 Attar et al. May 2005 A1
20050122898 Jang et al. Jun 2005 A1
20050128683 Watanabe et al. Jun 2005 A1
20050135324 Kim et al. Jun 2005 A1
20050135498 Yee Jun 2005 A1
20050141624 Lakshmipathi et al. Jun 2005 A1
20050147024 Jung et al. Jul 2005 A1
20050157807 Shim et al. Jul 2005 A1
20050159162 Park Jul 2005 A1
20050164709 Balasubramanian et al. Jul 2005 A1
20050165949 Teague Jul 2005 A1
20050174981 Heath, Jr. et al. Aug 2005 A1
20050175070 Grob et al. Aug 2005 A1
20050180311 Wang et al. Aug 2005 A1
20050180313 Kim et al. Aug 2005 A1
20050181799 Laroia et al. Aug 2005 A1
20050192011 Hong et al. Sep 2005 A1
20050195733 Walton et al. Sep 2005 A1
20050195852 Vayanos et al. Sep 2005 A1
20050195886 Lampinen et al. Sep 2005 A1
20050201296 Vannithamby et al. Sep 2005 A1
20050204247 Guo et al. Sep 2005 A1
20050207367 Onggosanusi et al. Sep 2005 A1
20050239465 Lee et al. Oct 2005 A1
20050243791 Park et al. Nov 2005 A1
20050246548 Laitinen Nov 2005 A1
20050249266 Brown et al. Nov 2005 A1
20050254416 Laroia et al. Nov 2005 A1
20050254467 Li et al. Nov 2005 A1
20050254477 Lee et al. Nov 2005 A1
20050254556 Fujii et al. Nov 2005 A1
20050259005 Chiang et al. Nov 2005 A1
20050259723 Blanchard Nov 2005 A1
20050259757 Wu et al. Nov 2005 A1
20050265293 Ro et al. Dec 2005 A1
20050276347 Mujtaba et al. Dec 2005 A1
20050276348 Vandenameele Dec 2005 A1
20050277423 Sandhu et al. Dec 2005 A1
20050281029 Inamoto Dec 2005 A1
20050281290 Khandekar et al. Dec 2005 A1
20050282500 Wang et al. Dec 2005 A1
20050286408 Jin et al. Dec 2005 A1
20050289256 Cudak et al. Dec 2005 A1
20060002451 Fukuta et al. Jan 2006 A1
20060013285 Kobayashi et al. Jan 2006 A1
20060018336 Sutivong et al. Jan 2006 A1
20060018347 Agrawal Jan 2006 A1
20060018397 Sampath et al. Jan 2006 A1
20060026344 Sun Hsu et al. Feb 2006 A1
20060029289 Yamaguchi et al. Feb 2006 A1
20060034173 Teague et al. Feb 2006 A1
20060039332 Kotzin Feb 2006 A1
20060039344 Khan Feb 2006 A1
20060039500 Yun et al. Feb 2006 A1
20060040655 Kim Feb 2006 A1
20060045003 Choi et al. Mar 2006 A1
20060050770 Wallace et al. Mar 2006 A1
20060056340 Hottinen et al. Mar 2006 A1
20060057958 Ngo et al. Mar 2006 A1
20060067421 Walton et al. Mar 2006 A1
20060078075 Stamoulis et al. Apr 2006 A1
20060083159 Laroia et al. Apr 2006 A1
20060083183 Teague et al. Apr 2006 A1
20060092054 Li et al. May 2006 A1
20060104333 Rainbolt et al. May 2006 A1
20060104381 Menon et al. May 2006 A1
20060111054 Pan et al. May 2006 A1
20060111148 Mukkavilli et al. May 2006 A1
20060114858 Walton et al. Jun 2006 A1
20060120469 Maltsev et al. Jun 2006 A1
20060120471 Learned et al. Jun 2006 A1
20060126491 Ro et al. Jun 2006 A1
20060133269 Prakash et al. Jun 2006 A1
20060133455 Agrawal et al. Jun 2006 A1
20060133521 Sampath et al. Jun 2006 A1
20060140289 Mandyam et al. Jun 2006 A1
20060153239 Julian et al. Jul 2006 A1
20060155534 Lin et al. Jul 2006 A1
20060156199 Palanki et al. Jul 2006 A1
20060172704 Nishio et al. Aug 2006 A1
20060189321 Oh et al. Aug 2006 A1
20060203708 Sampath et al. Sep 2006 A1
20060203794 Sampath et al. Sep 2006 A1
20060203891 Sampath et al. Sep 2006 A1
20060203932 Palanki et al. Sep 2006 A1
20060209670 Gorokhov et al. Sep 2006 A1
20060209732 Gorokhov et al. Sep 2006 A1
20060209754 Ji et al. Sep 2006 A1
20060209764 Kim et al. Sep 2006 A1
20060209973 Gorokhov et al. Sep 2006 A1
20060215777 Krishnamoorthi Sep 2006 A1
20060218459 Hedberg Sep 2006 A1
20060223449 Sampath et al. Oct 2006 A1
20060233124 Palanki Oct 2006 A1
20060233131 Gore et al. Oct 2006 A1
20060262754 Andersson et al. Nov 2006 A1
20060270427 Shida et al. Nov 2006 A1
20060274836 Sampath et al. Dec 2006 A1
20060285485 Agrawal et al. Dec 2006 A1
20060285515 Julian et al. Dec 2006 A1
20060286974 Gore et al. Dec 2006 A1
20060286982 Prakash et al. Dec 2006 A1
20060286995 Onggosanusi et al. Dec 2006 A1
20060291371 Sutivong et al. Dec 2006 A1
20060292989 Gerlach et al. Dec 2006 A1
20070004430 Hyun et al. Jan 2007 A1
20070005749 Sampath Jan 2007 A1
20070009011 Coulson Jan 2007 A1
20070019596 Barriac et al. Jan 2007 A1
20070025345 Bachl et al. Feb 2007 A1
20070041404 Palanki et al. Feb 2007 A1
20070041457 Kadous et al. Feb 2007 A1
20070047485 Gorokhov et al. Mar 2007 A1
20070047495 Ji et al. Mar 2007 A1
20070049218 Gorokhov et al. Mar 2007 A1
20070053282 Tong et al. Mar 2007 A1
20070053383 Choi et al. Mar 2007 A1
20070060178 Gorokhov et al. Mar 2007 A1
20070064669 Classon et al. Mar 2007 A1
20070071147 Sampath et al. Mar 2007 A1
20070097853 Khandekar et al. May 2007 A1
20070097889 Wang et al. May 2007 A1
20070097897 Teague et al. May 2007 A1
20070097908 Khandekar et al. May 2007 A1
20070097909 Khandekar et al. May 2007 A1
20070097910 Ji et al. May 2007 A1
20070097922 Parekh et al. May 2007 A1
20070097942 Gorokhov et al. May 2007 A1
20070097981 Papasakellariou May 2007 A1
20070098050 Khandekar et al. May 2007 A1
20070098120 Wang May 2007 A1
20070110172 Faulkner et al. May 2007 A1
20070115795 Gore et al. May 2007 A1
20070149194 Das et al. Jun 2007 A1
20070149228 Das Jun 2007 A1
20070159969 Das et al. Jul 2007 A1
20070160115 Palanki et al. Jul 2007 A1
20070165738 Barriac et al. Jul 2007 A1
20070177631 Popovic et al. Aug 2007 A1
20070177681 Choi et al. Aug 2007 A1
20070183303 Pi et al. Aug 2007 A1
20070183386 Muharemovic et al. Aug 2007 A1
20070207812 Borran et al. Sep 2007 A1
20070211616 Khandekar et al. Sep 2007 A1
20070211667 Agrawal et al. Sep 2007 A1
20070211668 Agrawal et al. Sep 2007 A1
20070230324 Li et al. Oct 2007 A1
20070242653 Yang et al. Oct 2007 A1
20070263743 Lee et al. Nov 2007 A1
20070280336 Zhang et al. Dec 2007 A1
20070281702 Lim et al. Dec 2007 A1
20080039129 Li et al. Feb 2008 A1
20080063099 Laroia et al. Mar 2008 A1
20080095223 Tong et al. Apr 2008 A1
20080095262 Ho et al. Apr 2008 A1
20080151829 Khandekar et al. Jun 2008 A1
20080181139 Rangarajan et al. Jul 2008 A1
20080214222 Atarashi et al. Sep 2008 A1
20080253279 Ma et al. Oct 2008 A1
20080267157 Lee et al. Oct 2008 A1
20080299983 Kwak et al. Dec 2008 A1
20090003466 Taherzadehboroujeni et al. Jan 2009 A1
20090010351 Laroia et al. Jan 2009 A1
20090022098 Novak et al. Jan 2009 A1
20090041150 Tsai et al. Feb 2009 A1
20090110103 Maltsev et al. Apr 2009 A1
20090180459 Orlik et al. Jul 2009 A1
20090197646 Tamura et al. Aug 2009 A1
20090201826 Gorokhov et al. Aug 2009 A1
20090201872 Gorokhov et al. Aug 2009 A1
20090213750 Gorokhov et al. Aug 2009 A1
20090213950 Gorokhov et al. Aug 2009 A1
20090262641 Laroia et al. Oct 2009 A1
20090262699 Wengerter et al. Oct 2009 A1
20090285163 Zhang et al. Nov 2009 A1
20090287977 Chang et al. Nov 2009 A1
20100002570 Walton et al. Jan 2010 A9
20100135242 Nam et al. Jun 2010 A1
20100220800 Erell et al. Sep 2010 A1
20100232384 Farajidana et al. Sep 2010 A1
20100238902 Ji et al. Sep 2010 A1
20100254263 Chen et al. Oct 2010 A1
20110064070 Gore et al. Mar 2011 A1
20110235733 Laroia et al. Sep 2011 A1
20110235745 Laroia et al. Sep 2011 A1
20110235746 Laroia et al. Sep 2011 A1
20110235747 Laroia et al. Sep 2011 A1
20110306291 Ma et al. Dec 2011 A1
20120002623 Khandekar et al. Jan 2012 A1
20120063441 Palanki Mar 2012 A1
20120120925 Kadous et al. May 2012 A1
20120140798 Kadous et al. Jun 2012 A1
20120140838 Kadous et al. Jun 2012 A1
20130016678 Laroia et al. Jan 2013 A1
Foreign Referenced Citations (391)
Number Date Country
2348137 Nov 2001 CA
2477536 Sep 2003 CA
2540688 May 2005 CA
2577369 Mar 2006 CA
1400-1993 Dec 1994 CL
953-1997 Jan 1998 CL
27102004 Aug 2005 CL
22892004 Sep 2005 CL
3086-2004 Oct 2005 CL
30862004 Oct 2005 CL
29932005 May 2006 CL
2203-2006 Feb 2007 CL
15212006 Mar 2007 CL
14922006 Apr 2007 CL
14892006 May 2007 CL
14902006 May 2007 CL
29012006 Oct 2007 CL
29022006 Oct 2007 CL
29032006 Oct 2007 CL
29042006 Oct 2007 CL
29062006 Oct 2007 CL
29082006 Oct 2007 CL
46151 Dec 2009 CL
1252919 May 2000 CN
1267437 Sep 2000 CN
1284795 Feb 2001 CN
1296682 May 2001 CN
1344451 Apr 2002 CN
1346221 Apr 2002 CN
1383631 Dec 2002 CN
1386344 Dec 2002 CN
1402916 Mar 2003 CN
1424835 Jun 2003 CN
1132474 Dec 2003 CN
1467938 Jan 2004 CN
1487755 Apr 2004 CN
1520220 Aug 2004 CN
1525678 Sep 2004 CN
1642051 Jul 2005 CN
1647436 Jul 2005 CN
19800653 Jul 1999 DE
19800953 Jul 1999 DE
19957288 May 2001 DE
10240138 Aug 2003 DE
10254384 Jun 2004 DE
0488976 Jun 1992 EP
0568291 Nov 1993 EP
0786889 Jul 1997 EP
0805576 Nov 1997 EP
0807989 Nov 1997 EP
0844796 May 1998 EP
0981222 Feb 2000 EP
1001570 May 2000 EP
1047209 Oct 2000 EP
1061687 Dec 2000 EP
1091516 Apr 2001 EP
1093241 Apr 2001 EP
1148673 Oct 2001 EP
1180907 Feb 2002 EP
1187506 Mar 2002 EP
1204217 May 2002 EP
1255369 Nov 2002 EP
1267513 Dec 2002 EP
1286490 Feb 2003 EP
1335504 Aug 2003 EP
1376920 Jan 2004 EP
1392073 Feb 2004 EP
1434365 Jun 2004 EP
1441469 Jul 2004 EP
1445873 Aug 2004 EP
1465449 Oct 2004 EP
1478204 Nov 2004 EP
1507421 Feb 2005 EP
1513356 Mar 2005 EP
1531575 May 2005 EP
1533950 May 2005 EP
1538863 Jun 2005 EP
1542488 Jun 2005 EP
1601149 Nov 2005 EP
1643669 Apr 2006 EP
1898542 Mar 2008 EP
1941693 Jul 2011 EP
2584884 Jan 1987 FR
2279540 Jan 1995 GB
2348776 Oct 2000 GB
2412541 Sep 2005 GB
167573 Feb 2011 IL
201872 May 2012 IL
9284200 Oct 1987 JP
4301931 Oct 1992 JP
7336323 Dec 1995 JP
8116329 May 1996 JP
08288927 Nov 1996 JP
9008725 Jan 1997 JP
H09501548 Feb 1997 JP
9131342 May 1997 JP
9182148 Jul 1997 JP
09214404 Aug 1997 JP
10117162 May 1998 JP
H10210000 Aug 1998 JP
10322304 Dec 1998 JP
11191756 Jul 1999 JP
11196109 Jul 1999 JP
11508417 Jul 1999 JP
11239155 Aug 1999 JP
11298954 Oct 1999 JP
11331927 Nov 1999 JP
2000102065 Apr 2000 JP
2000184425 Jun 2000 JP
2000511750 Sep 2000 JP
2000332724 Nov 2000 JP
2001016644 Jan 2001 JP
2001045573 Feb 2001 JP
2001057545 Feb 2001 JP
2001156732 Jun 2001 JP
2001238269 Aug 2001 JP
2001245355 Sep 2001 JP
2001249802 Sep 2001 JP
2001285927 Oct 2001 JP
2001521698 Nov 2001 JP
2001526012 Dec 2001 JP
2002026790 Jan 2002 JP
2002515203 May 2002 JP
2002534925 Oct 2002 JP
2002534941 Oct 2002 JP
2003032218 Jan 2003 JP
2003500909 Jan 2003 JP
200369472 Mar 2003 JP
2003101515 Apr 2003 JP
2003169367 Jun 2003 JP
2003174426 Jun 2003 JP
2003199173 Jul 2003 JP
2003520523 Jul 2003 JP
2003249907 Sep 2003 JP
2003292667 Oct 2003 JP
2003318857 Nov 2003 JP
2003347985 Dec 2003 JP
2003348047 Dec 2003 JP
2004007643 Jan 2004 JP
2004023716 Jan 2004 JP
2004048716 Feb 2004 JP
200472457 Mar 2004 JP
2004072157 Mar 2004 JP
2004096142 Mar 2004 JP
2004507950 Mar 2004 JP
2004153676 May 2004 JP
2004158901 Jun 2004 JP
2004162388 Jun 2004 JP
2004194262 Jul 2004 JP
2004215022 Jul 2004 JP
2004221972 Aug 2004 JP
2004266818 Sep 2004 JP
2004529524 Sep 2004 JP
2004297276 Oct 2004 JP
2004297756 Oct 2004 JP
2004534456 Nov 2004 JP
2004535106 Nov 2004 JP
2005006337 Jan 2005 JP
2005020530 Jan 2005 JP
2005502218 Jan 2005 JP
2005506757 Mar 2005 JP
2005130491 May 2005 JP
2005197772 Jul 2005 JP
2005203961 Jul 2005 JP
2005521327 Jul 2005 JP
2005521358 Jul 2005 JP
2006505172 Feb 2006 JP
2006505230 Feb 2006 JP
2006506860 Feb 2006 JP
2006211537 Aug 2006 JP
2006518173 Aug 2006 JP
2007500486 Jan 2007 JP
2007503790 Feb 2007 JP
2007519281 Jul 2007 JP
2007520309 Jul 2007 JP
2007525043 Aug 2007 JP
2007527127 Sep 2007 JP
20085005587 Feb 2008 JP
2008535398 Aug 2008 JP
4188372 Nov 2008 JP
2008546314 Dec 2008 JP
04694628 Jun 2011 JP
0150275 Jun 1998 KR
20000060428 Oct 2000 KR
100291476 Mar 2001 KR
20010056333 Apr 2001 KR
20010087715 Sep 2001 KR
20030007965 Jan 2003 KR
20030035969 May 2003 KR
20040063057 Jul 2004 KR
200471652 Aug 2004 KR
20040103441 Dec 2004 KR
20050063826 Jun 2005 KR
100606099 Jul 2006 KR
95121152 Dec 1997 RU
2141168 Nov 1999 RU
2141706 Nov 1999 RU
2159007 Nov 2000 RU
2162275 Jan 2001 RU
2192094 Oct 2002 RU
2197778 Jan 2003 RU
2207723 Jun 2003 RU
2208913 Jul 2003 RU
2210866 Aug 2003 RU
2216101 Nov 2003 RU
2216105 Nov 2003 RU
2225080 Feb 2004 RU
2235429 Aug 2004 RU
2235432 Aug 2004 RU
2237379 Sep 2004 RU
2238611 Oct 2004 RU
2242091 Dec 2004 RU
2250564 Apr 2005 RU
2257008 Jul 2005 RU
2267224 Dec 2005 RU
2005129079 Feb 2006 RU
2285338 Oct 2006 RU
2285351 Oct 2006 RU
2292655 Jan 2007 RU
2005106258 Oct 2008 RU
2349043 Mar 2009 RU
1320883 Jun 1987 SU
508960 Nov 2002 TW
510132 Nov 2002 TW
200302642 Aug 2003 TW
200401572 Jan 2004 TW
1232040 May 2005 TW
248266 Jan 2006 TW
200718128 May 2007 TW
WO9408432 Apr 1994 WO
WO9521494 Aug 1995 WO
WO9613920 May 1996 WO
WO9701256 Jan 1997 WO
WO9737456 Oct 1997 WO
WO9746033 Dec 1997 WO
WO9800946 Jan 1998 WO
WO9814026 Apr 1998 WO
WO9837706 Aug 1998 WO
WO9848581 Oct 1998 WO
WO9853561 Nov 1998 WO
WO9854919 Dec 1998 WO
WO9941871 Aug 1999 WO
WO9944313 Sep 1999 WO
WO9944383 Sep 1999 WO
WO9952250 Oct 1999 WO
WO9953713 Oct 1999 WO
WO9959265 Nov 1999 WO
WO9960729 Nov 1999 WO
WO0002397 Jan 2000 WO
WO0033503 Jun 2000 WO
WO0070897 Nov 2000 WO
WO0101596 Jan 2001 WO
WO01001596 Jan 2001 WO
WO0117125 Mar 2001 WO
WO0126269 Apr 2001 WO
WO0139523 May 2001 WO
WO0145300 Jun 2001 WO
0148969 Jul 2001 WO
WO0158054 Aug 2001 WO
WO0160106 Aug 2001 WO
WO0169814 Sep 2001 WO
0182544 Nov 2001 WO
WO0182543 Nov 2001 WO
WO0189112 Nov 2001 WO
WO0193505 Dec 2001 WO
WO0204936 Jan 2002 WO
WO0207375 Jan 2002 WO
WO0215616 Feb 2002 WO
0219746 Mar 2002 WO
WO0231991 Apr 2002 WO
WO0233848 Apr 2002 WO
0249306 Jun 2002 WO
WO0245456 Jun 2002 WO
WO0249305 Jun 2002 WO
WO0249385 Jun 2002 WO
WO02060138 Aug 2002 WO
WO02065675 Aug 2002 WO
02082743 Oct 2002 WO
WO02082689 Oct 2002 WO
WO02089434 Nov 2002 WO
WO02093782 Nov 2002 WO
WO02093819 Nov 2002 WO
WO02100027 Dec 2002 WO
03001696 Jan 2003 WO
WO03001696 Jan 2003 WO
WO03001761 Jan 2003 WO
WO03001981 Jan 2003 WO
WO03003617 Jan 2003 WO
WO03019819 Mar 2003 WO
WO03030414 Apr 2003 WO
WO03034644 Apr 2003 WO
WO03043262 May 2003 WO
WO03043369 May 2003 WO
WO03058871 Jul 2003 WO
WO03067783 Aug 2003 WO
WO03069832 Aug 2003 WO
WO03073646 Sep 2003 WO
WO03075479 Sep 2003 WO
WO03085876 Oct 2003 WO
WO03088538 Oct 2003 WO
WO03094384 Nov 2003 WO
WO03103331 Dec 2003 WO
WO2004002047 Dec 2003 WO
WO2004004370 Jan 2004 WO
WO2004008671 Jan 2004 WO
WO2004008681 Jan 2004 WO
WO2004015912 Feb 2004 WO
WO2004016007 Feb 2004 WO
WO2004021605 Mar 2004 WO
WO2004023834 Mar 2004 WO
WO2004030238 Apr 2004 WO
WO2004032443 Apr 2004 WO
2004040825 May 2004 WO
2004040827 May 2004 WO
WO2004038954 May 2004 WO
WO2004038972 May 2004 WO
WO2004038988 May 2004 WO
WO2004040690 May 2004 WO
WO2004047354 Jun 2004 WO
WO2004049618 Jun 2004 WO
WO2004051872 Jun 2004 WO
WO2004062255 Jul 2004 WO
WO2004064294 Jul 2004 WO
WO2004064295 Jul 2004 WO
WO2004066520 Aug 2004 WO
WO2004068721 Aug 2004 WO
WO2004073276 Aug 2004 WO
WO2004075023 Sep 2004 WO
WO2004075442 Sep 2004 WO
WO2004075448 Sep 2004 WO
WO2004075468 Sep 2004 WO
WO2004075596 Sep 2004 WO
WO2004077850 Sep 2004 WO
WO2004084509 Sep 2004 WO
2004086711 Oct 2004 WO
WO2004086706 Oct 2004 WO
2004095851 Nov 2004 WO
2004098072 Nov 2004 WO
WO2004095730 Nov 2004 WO
WO2004095854 Nov 2004 WO
WO2004098222 Nov 2004 WO
WO2004102815 Nov 2004 WO
WO2004102816 Nov 2004 WO
2004114564 Dec 2004 WO
WO2004105272 Dec 2004 WO
WO2004114549 Dec 2004 WO
WO2005002253 Jan 2005 WO
WO2005005527 Jan 2005 WO
2005015941 Feb 2005 WO
2005011163 Feb 2005 WO
2005018270 Feb 2005 WO
WO 2005015941 Feb 2005 WO
WO2005015795 Feb 2005 WO
WO2005015797 Feb 2005 WO
WO2005015810 Feb 2005 WO
WO2005020488 Mar 2005 WO
WO2005020490 Mar 2005 WO
WO2005022811 Mar 2005 WO
WO2005025110 Mar 2005 WO
WO2005012004 Apr 2005 WO
WO2005043855 May 2005 WO
WO2005046080 May 2005 WO
2005055527 Jun 2005 WO
WO2005055484 Jun 2005 WO
WO2005060192 Jun 2005 WO
2005065062 Jul 2005 WO
WO2005069538 Jul 2005 WO
WO2005074184 Aug 2005 WO
2005096538 Oct 2005 WO
WO2005122628 Dec 2005 WO
2006007292 Jan 2006 WO
WO2006019710 Feb 2006 WO
2006026344 Mar 2006 WO
WO2006044487 Apr 2006 WO
2006069301 Jun 2006 WO
WO2006069300 Jun 2006 WO
WO2006069397 Jun 2006 WO
WO2006077696 Jul 2006 WO
WO2006096784 Sep 2006 WO
WO2006099349 Sep 2006 WO
WO2006099545 Sep 2006 WO
WO2006099577 Sep 2006 WO
WO2006127544 Nov 2006 WO
2006134032 Dec 2006 WO
2006138196 Dec 2006 WO
2006138573 Dec 2006 WO
WO2006138581 Dec 2006 WO
WO2007024934 Mar 2007 WO
WO2007024935 Mar 2007 WO
WO2007025160 Mar 2007 WO
WO2007051159 May 2007 WO
Non-Patent Literature Citations (117)
Entry
Junyi Li et al: “An integrated approach based on cross-layer optimization—Designing a mobile broadband wireless access network” IEEE Signal Processing Magazine, IEEE Service Center, Piscataway, NJ, US, vol. 21, No. 5, Sep. 2004.
Jim Tomcik, Qualcomm Incorporated: “QFDD Technology Overview Presentation” IEEE 802.20 Working Group on Mobile Broadband Wireless Access, Oct. 28, 2005.
John B. Groe, Lawrence E. Larson, “CDMA Mobile Radio Design” Sep. 26, 2001, Artech House, Norwood, MA02062 580530, XP002397967, pp. 157-159.
Das,Arnab, et al. “Adaptive, asynchronous incremental redundancy (A-IR) with fixed transmission time intervals TTI for HSDPA.” IEEE, pp. 10-83-1087.
Lau, et al., “On the Design of MIMO Block-Fading Channels with Feedback-Link Capacity Constraint,” IEEE Transactions on Communications, IEEE Service Center, Piscataway, NJ, US, v. 52, No. 1, Jan. 2004, pp. 62-70, XP001189908.
Digital cellular telecommunications system (Phase 2+); Mobile radio interface layer 3 specification (GSM 04.08 version 7..7.1 Release 1998); ETSI EN 300 940 V7.7.7 (Oct. 2000), pp. 1,2,91-93.
TIA-1121.001 “Physical Layer for Ultra Mobile Broadband (UMB) Air Interface Specification,” 3GPP2 C.S0084-001-0, Version 2.0 (Aug. 2007).
TIA-1121.002 “Medium Access Control Layer for Ultra Mobile Broadband (UMB) Air Interface Specification,” 3GPP2 C. S0084-002-0, Version 2.0 (Aug. 2007).
International Search Report—PCT/US06/060291, International Search Authority—European Patent Office, May 3, 2007.
Written Opinion—PCT/US06/060291, International Search Authority—European Patent Office, May 3, 2007.
International Preliminary Report on Patentability—PCT/US06/060291, International Bureau of WIPO—Geneva, Switzerland , Apr. 29, 2008.
International Search Report—PCT/US06/021211, International Search Authority—European Patent Office, Sep. 25, 2006.
Written Opinion—PCT/US06/021211, International Search Authority—European Patent Office, Sep. 25, 2006.
International Preliminary Report on Patentability—PCT/US06/021211, International Bureau of WIPO—Geneva. Switzerland , Dec. 6, 2007.
Favre et al: “Self-Adaptive Transmission Procedure” IBM Technical Disclosure Bulletin, IBM Corporation, Sep. 1976, vol. 19, No. 4, pp. 1283-1284, New York, New York.
Lettieri et al: “Adaptive frame length control for improving wireless link throughput, range, and energy efficiency”, INFOCOM 98, 17th Annual Joint Conference of the IEEE Computer and Communications Societies, Mar. 29-Apr. 2, 1998, pp. 564-571, vol. 2, IEEE San Francisco, CA, New York, New York.
Molisch, et al., MIMO systems with antenna selection, IEEE Microwave Magazine, URL: http://ieeexplore.ieee.org/iel5/6668/28677/01284943.pdf, Retrieved on Dec. 8, 2006, pp. 46-56 (2004).
Tomcik, J.: “MBFDD and MBTDD Wideband Mode: Technology Overview,” IEEE 802.20 Working Group Mobile Broadband Wireless Access, Jan. 2006, pp. 1-109, XP002429968.
Toufik I et al., “Channel allocation algorithms for multi-carrier systems”, Vehicular Technology Conference, 2004. VTC2004-Fall. 2004 IEEE 60TH Los Angeles, CA, USA Sep. 26-29, 2004, pp. 1129-1133, XP010786798, ISBN: 07-7803-8521-7.
Blum, R. et al: “On Optimum MIMO with Antenna Selection,” IEEE International Conference on Communications: Conference Proceedings, vol. 1, Apr. 28, 2002, pp. 386-390.
Catreux, S. et al.: “Simulation results for an interference-limited multiple input multiple output cellular system,” Global Telecommunications Conference, 2000. GLOBECOM '00. IEEE. Dec. 1, 2000. vol. 2, pp. 1094-1096, http://ieeexplore.ieee.org/ie15/7153/19260/00891306.pdf?tp=&isnumber=19260&arnumber=8913063&punumber=7153.
Chung, S. et al.: “Low complexity algorithm for rate and power quantization in extended V-Blast” VTC Fall 2001. IEEE 54th. Vehicular Technology Conference Proceedings. Atlantic City, NJ, Oct. 7-11, 2001, vol. 1 of 4, pp. 910-914, Conf. 54.
El Gamal, H. et al.: “Universal Space-Time Coding,” IEEE Transactions on Information Theory, vol. 49, Issue 5, pp. 1097-1119, XP011074756, ISSN: 0018-9448, May 2003.
Hochwald, B. et al., “Achieving near-capacity on a multiple-antenna channel,” IEEE Transactions on Communications, IEEE Service Center, Piscataway, New Jersey, vol. 51, No. 3, pp. 389-399 (2003).
Kiessling, M. et al., “Short-term and long-term diagonalization of correlated MIMO channels with adaptive modulation” IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, vol. 2, Sep. 15, 2002, pp. 593-597.
Kousa, M. et al: “Adaptive Binary Coding for Diversity Communication Systems” IEEE International Conference on Personal Wireless Communications Proceedings, pp. 80-84, XP000992269, (1997).
Maniatis, I. et al., “Pilots for joint channel estimation in multi-user OFDM mobile radio systems,” Spread Spectrum Techniques and Applications, 2002 IEEE Seventh International Symposium, Sep. 2, 2002, pp. 44-48, XP010615562.
Prasad, N. et al.: “Analysis of Decision Feedback Detection for MIMO Rayleigh Fading Channels and Optimum Allocation of Transmitter Powers and QAM Constellations,” pp. 1-10, 39th Annual Conference on Comm. Control and Comput., Monticello, IL Oct. 2001.
Qualcomm Europe: “Description and link simulations for OFDMA based E-UTRA uplink” 3GPP Draft; R1-051100, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; Sophia-Antipolis Cedex, France, vol. RAN WG1, no. San Diego, USA; Oct. 4, 2005, pp. 1-10, XP050100715.
Taiwanese Search report—095139878—TIPO—Nov. 8, 2010.
Tomcik, Jim: “QFDD Technology Overview Presentation,” IEEE 802.20 Working Group on Mobile Broadband Wireless Access, [Online] Nov. 15, 2005, pp. 1-73, XP002467626.
Widdup, B. et al., “A highly-parallel VLSI architecture for a list sphere detector,” IEEE International Conference, Paris, France, vol. 5, pp. 2720-2725 (2004).
Wiesel, A. et al.: “Efficient implementation of sphere demodulation” Signal Processing Advances in Wireless Communications, 2003. SPAWC 200 3. 4th IEEE Workshop on Rome. Italy Jun. 15-18, 2003, Piscataway, NJ, USA, IEEE, US, p. 36-40, XP010713463.
Kappes, J.M., and Sayegh, S.1., “Programmable Demultiplexer/Demodulator Processor,” COMSAT Laboratories, IEEE, 1990, pp. 230-234.
NTT DoCoMo, et al.: “Orthogonal Common Pilot Channel and Scrambling Code in Evolved UTRA Downlink,” 3GPP TSG RAN WG1 #42 on LTE, pp. 1-8 (Aug.-Sep. 2005).
TIA/EIA/IS-2000 “Standards for CDMA2000 Spread Spectrum Systems” Version 1.0 Jul. 1999.
TIA/EIA/IS-95 “Mobile Station-Base Station Compatibility Standard for Dual-Mode Wideband Spread Spectrum Cellular System” Jul. 1993.
3GPP TS 33.220 V.1.1.0 XX,XX, “3rd Generation Partnership Projects; Technical Specification Group Services and System Aspects; Generic Authentication Architecture (GAA); Generic Bootstrapping Architecture (Release 6)” Feb. 9, 2004, pp. 1-17, figure 4, XP002996023.
3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Physical Layer Aspects for Evolved UTRA (Release 7), 3GPP TR 25.814 v0.3.1 (Nov. 2005).
B. Sklar: “The process of thus correcting the channel-induced distortion is called equalization”, Digital Communications, PTR Prentice Hall, Upper Saddle River, New Jersey, 1998, Formatting and Baseband Transmission, Chap. 2, Section 2.11.2, pp. 104-105.
Bahai, Saltzberg: “System Architecture,” Multi-Carrier Digital Communications, Kluwer Academic, New York, NY, XP-002199501, 1999, pp. 17-21.
Bingham: “Other Types of MCM,” ADSL, VDSL, and Multicarrier Modulation, John wiley & Sons, New York, XP-002199502. 2000, pp. 111-113.
Carl R. Nassar, Balasubramaniam Natarajan and Steve Shattil: Introduction of Carrier Interference to Spread Spectrum Multiple Access, Apr. 1999, IEEE, pp. 1-5.
Chennakeshu, et al. “A Comparison of Diversity Schemes for a Mixed-Mode Slow Frequency-Hopped Cellular System,” IEEE, 1993, pp. 1749-1753.
Chennakeshu, et al. “Capacity Analysis of a TDMA-Based Slow-Frequency -Hopped Cellular System,” IEEE Transaction on Vehicular Technology, vol. 45., No. 3 Aug. 1996, pp. 531-542.
Chiani, et al. “Outage Evaluation for Slow Frequency-Hopping Mobile Radio Systems” IEEE Transactions on Communications, vol. 47, No. 12, pp. 1865-1874, Dec. 1999.
Choi, et al., “Design of the Optimum Pilot Pattern for Channel Estimation in OFDM Systems,” Global Telecommunications Conference, IEEE Communications Society, Globecom, Dallas, Texas (2004), p. 3661-3665.
Czylwik: “Comparison Between Adaptive OFDM and Single Carrier Modulation with Frequency Domain Equalization,” IEEE 47th Vehicular Technology Conference, vol. 2, May 4-7, 1997, pp. 865-869.
Das, et al. “On the Reverse Link Interference Structure for Next Generation Cellular Systems,” European Microwave Conference, Oct. 11, 2004, pp. 3068-3072.
Dinis, et al., “A Multiple Access Scheme for the Uplink of Broadband Wireless Systems,” IEEE Global Telecommunications Conference, 2004, GLOBECOM '04, vol. 6, Nov. 29 Dec. 3, 2004, pp. 3808-3812.
Fuchs, et al., “A Novel Tree-Based Scheduling Algorithm for the Downlink of Multi-User MIMO Systems with ZF Beamforming,” IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005, Proceedings, Philadelphia, PA, pp. 1121-1124.
Groe, et al., “CDMA Mobile Radio Design,” Sep. 26, 2001, Artech House, Norwood, MA 02062, pp. 257-259.
Hermann Rohling et al., : “Performance Comparison of Different Multiple Access Schemes for the Downlink of an OFDM Communication System”, Vehicular Technology Conference, 1997, 47th IEEE, vol. 3, May 4-7, 1997, pp. 1365-1369.
Hill, et al., “Cyclic Shifting and Time Inversion of Partial Transmit Sequences to Reduce the Peak-to-Average Power Ratio in OFDM,” IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, vol. 2, Sep. 18, 2000, Piscataway, NJ, pp. 1256-1259.
J.S. Chow and J.M. Cioffi: “A cost-effective maximum likelihood reciever for multicarrier systems”, Proc. IEEE Int. Conf. on Comm., pp. 948-952, Jun. 1992.
Je, et al. “A Novel Multiple Access Scheme for Uplink Cellular Systems,” IEEE Vehicular Technology Conference, Sep. 26, 2004 pp. 984-988.
Kaleh: “Channel Equalization for Block Transmission Systems,” IEEE Journal on Selected Areas in Communications, vol. 13, No. 1, Jan. 1995, pp. 110-121.
Karsten Bruninghaus et al., : “Multi-Carrier Spread Spectrum and It's relationship to Single-Carrier Transmission”, Vehicular technology Conference, 1998, VTC 98, 48th IEEE, vol. 3, May 18-21, 1998, pp. 2329-2332.
Keller, et al.: “Adaptive Multicarrier Modulation: A Convenient Framework for Time-Frequency Processing in Wireless Communications,” Proceedings of the IEEE, vol. 88, No. 5, May 2000, pp. 611-640.
Kim, et al. “Performance of TDMA System With SFH and 2-Bit Differentially Detected GMSK Over Rayleigh Fading Channel,” IEEE Vehicular Technology Conference, Apr. 28, 1996, pp. 789-793.
Kishiyama et al., Investigation of optimum pilot channle structure for VSF-OFCDM broadband wireless access in forward link, VTC 2003-Spring, The 57th IEEE Semiannual Vehicular Technology Conference, Proceedings JEJU, korea, Apr. 22-25, 2003, pp. 139-144.
Kostic, et al. “Dynamic Frequency Hopping in Wireless Cellular Systems-Simulations of Full-Replacement and Reduced-Overhead Methods,” IEEE Vehicular Technology Conference, May 16, 1999, pp. 914-918.
Kostic, et al. “Fundamentals of Dynamic Frequency Hopping in Cellular Systems,” IEEE Journal on Selected Areas in Communications, vol. 19, No. 11, Nov. 2001, pp. 2254-2266.
Lacroix, et al.: “A Study of OFDM Parameters for High Data Rate Radio LAN's,” 2000 IEEE 51st Vehicular Technology Conference Proceedings, vol. 2, May 15-18, 2000, pp. 1075-1079.
Leon, et al., “Cyclic Delay Diversity for Single Carrier-Cyclic Prefix Systems,” Conference Record of the Thirty-Ninth Asilomar Conference on Signals, Systems and Computers, Oct. 28, 2005, Piscataway, NJ, pp. 519-523.
Lott: “Comparison of Frequency and Time Domain Differential Modulation in an OFDM System for Wireless ATM,” 1999 IEEE 49th Vehicular Technology Conference, vol. 2, Jul. 1999, pp. 877-883.
Mignone, et al.: “CD3-OFDM: A New Channel Estimation Method to Improve the Spectrum Efficiency in Digital Terrestrial Television Systems,” International Broadcasting Convention, Sep. 14-18, 1995 Conference Publication No. 413, IEE 1995, pp. 122-128.
Naofal Al-Dhahir: “A Bandwidth-Optimized Reduced-Complexity Equalized Multicarrier Transceiver”, IEEE Transactions on Communications, vol. 45, No. 8, Aug. 1997.
Naofal Al-Dhahir: “Optimum Finite-Length Equalization for Multicarrier Transceivers”, IEEE Trans. on Comm., pp. 56-64, Jan. 1996.
Nassar, Carl R., et al., “High-Performance MC-CDMA via Carrier Interferometry Codes”, IEEE Transactions on Vehicular Technology, vol. 50, No. 6, Nov. 2001.
Net Working Group, T. Dierks, C. Allen, Certicom; The TLS Protocol Version 1.0; Jan. 1999.
Sari, et al., “Transmission Techniques for Digital Terrestrial TV Broadcasting,” IEEE Communications Magazine, Feb. 1995, pp. 100-109.
Schnell, et al, “Application of IFDMA to Mobile Radio Transmission,” IEEE 1998 International Conference on Universal Personal Communications, vol. 2, Oct. 5-9, 1998, pp. 1267-1272.
Schnell, et al., “A Promising New Wideband Multiple-Access Scheme for Future Mobile Communications Systems,” European Transactions on Telecommunications, Wiley & Sons, Chichester, GB, vol. 10, No. 4, Jul. 1999, pp. 417-427.
Shattil et al., “Array Control Systems for Multicarrier Protocols Using a Frequency-Shifted Feedback Cavity”, IEEE, 1999.
Sklar: “Formatting and Baseband Transmission”, Chapter 2, pp. 54, 104-106.
Sorger U. et al., : “Interleave FDMA—a new spread-spectrum multiple-access scheme”, IEEE Int. Conference on Atlanta, GA, USA Jun. 7-11, 1998, XP010284733.
Tellado, “Multicarrier Modulation with Low Par,” Kluwer Academic, Dordrecht, NL, XP-002199500, 2000, pp. 6-11 and 55-60.
Tellambura, “Use of m-sequences for OFDM Peak-to-Average Power Ratio Reduction,” Electronics Letters, vol. 33, No. 15, Jul. 17, 1997, pp. 1300-1301.
Torrieri, “Cellular Frequency-Hopping CDMA Systems,” IEEE Vehicular Technology Conference, May 16, 1999, pp. 919-925.
Xiaodong, et al., “M-Sequences for OFDM Peak-to-Average Power Ratio Reduction and Error Correction,” Electronics Letters, vol. 33, Issue 7, Mar. 27, 1997, pp. 554-555.
Zekri, et al., “DMT Signals with Low Peak-to-Average Power Ratio,” Proceedings, IEEE International Symposium on Computers and Communications, 1999, Jul. 6-8, 1999, pp. 362-368.
“Design of the optimum pilot pattern for channel estimation in OFDM systems” Global Telecommunication Conference, 2004. GLOBECOM '04. IEEE Dallas, TX, USA Nov. 29 Dec. 23, 2004, vol. 6, Nov. 29, 2004, XP010758420.
Wang et al., “Improving performance of multi-user OFDM systems using bit-wise interleaver” Electronics Letters IEE Stevenage, GB, vol. 37. No. 19, Sep. 13, 2001, pp. 1173-1174 XP006017222.
Yun et al., “Performance of an LDPC-Coded Frequency-Hopping QFDMA System Based on Resource Allocation in the Uplink” Vehicular Technology -Conference 2004. VTO 2004-Spring, 2004 IEEE 59th Milan, Italy May 17-19, 2004, Piscataway, NJ, USA, vol. 4, pp. 1925-1928. XP010766497.
“Investication of Optimum Pilot Channel Structure for VSF-OFCDM Broadband Wireless Access in Forward Link”, VTC 2003-Spring. The 57th IEEE Semiannual Vehicular Technology Conference. Proceedings. JEJU, Korea, Apr. 22-25, 2003, vol. 1, XP010862089.
Martin Fuchs et al.: “A novel tree-based scheduling algorithm for the downlink of multi-user MIMO systems with ZF beamforming” IEEE International Conference on Acoustics, Speech and Signal Processing Proceedings iii/1121, 2005.
Alcatel-Lucent, et al., “Dedicated Reference Signals for Precoding in E-UTRA Downlink” 3GPP Draft; R1-071718, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre ; 650, Route Des Lucioles ; F-06921 Sophia-Antipolis Cedex; France, vol. RAN WG1, No. St. Julian; Apr. 3, 2007, XP050105640 [retrieved on Apr. 3, 2007].
Ken Murakami et al., “Status Toward Standardization at IEEE 802.3ah and items on the construction of GE-PON system ,” Technical Report of the Institute of Electronics, Information and Communication Engineers, Jun. 13, 2003, vol. 103, No. 124, pp. 1-6, IN2003-24 .
Sklar, B., “The process of thus correcting the channel-induced distortion is called equalization”, Digital Communications, PTR Prentice Hall, Upper Saddle River, New Jersey, 1998, Formatting and Baseband Transmission, Chap. 2, Section 2.11.2, pp. 54, 104-106.
Yatawatta, S. et al., “Energy Efficient Channel Estimation in MIMO Systems”, 2005 IEEE International Conference on Acoustics, Speech, and Signal Processing, March 18-23, 2005, Philadelphia, vol. 4, pp. 317-320, Mar. 18, 2005.
Morandi D., et al., “Analysis of master-slave protocols for real-time industrial communications over IEEE 802.11 WLANs” Industrial Informatics, 2004, INDIN '04, 2nd International Conference on Berlin, Germany, Jun. 24-26, 2004. Piscataway, NJ, USA IEEE, Jun. 24, 2004, pp. 143-148, XP010782619, ISBN 0789385136, Para 3, point B.
Das,Arnab, et al. “Adaptive, asynchronous incremental redundacy (A-IR) with fixed transmission time intervals TTI for HSDPA.” IEEE, pp. 10-83-1087, Sep. 2002.
Alcatel-Lucent, et al., “Dedicated Reference Signals for Precoding in E-UTRA Downlink” 3GPP Draft; R1-071718, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; 650, Route Des Lucioles; F-06921 Sophia-Antipolis Cedex; France, vol. RAN WG1, No. St. Julian; 20070403, Apr. 3, 2007, XP050105640 [retrieved on Apr. 3, 2007].
Bengtsson, M. et at, “A Generalization of Weighted Subspace Fitting to Full-Rank Models”, IEEE Transactions on Signal Processing, IEEE Service Center, New York, NY, US, vol. 49, No. 5, pp. 1002-1012, May 1, 2001.
Dai, Y. et al., “A List Sphere Decoder based turbo receiver for groupwise space time trellis coded (GSTTC) systems,” 2004 IEEE 59th Vehicular Technology Conference, vol. 2, pp. 804-808, May 17, 2004, doi: 10.1109/VETECS.2004.1388940.
Dammann, A. et al., “Beamforming in Combination with Space-Time Diversity for Broadband OFDM Systems”, ICC 2002. 2002 IEEE International Conference on Communications. Apr. 28-May 2, 2002, pp. 165-171, XP010589479.
Guo, K. Et al., “Providing end-to-end QoS for multimedia applications in 3G wireless networks,” Proceedings vol. 5242, SPIE ITCom 2003 Conf. Internet Multimedia Management Systems IV, Nov. 26, 2003, pp. 1-14, DOI: 10.1117/12.514061.
Ken Murakami et al., “Status Toward Standardization at IEEE 802.3ah and items on the construction of GE-PON system ,” Technical Report of the Institute of Electronics, Information and Communication Engineers, Jun. 13, 2003, vol. 103, No. 124, pp. 1-6, IN2003-24.
Nokia, “Uplink Considerations for UTRA LTE”, 3GPP TSG RAN WG1#40bis, Beijing, CN, R1-050251, 3GPP, Apr. 4, 2005, pp. 1-9.
NTT DoCoMo, “Downlink Multiple Access Scheme for Evolved UTRA”, 3GPP R1-050249, 3GPP, Apr. 4, 2005, pp. 1-9.
Physical Channels and Multiplexing in Evolved UTRA Downlink TSG-RAN Working Group 1 Meeting, XX, XX, vol. RI-050590, Jun. 20, 2005, pp. 1-24, XP003006923 the whole document.
S. Nishimura et al., “Downlink Nullforming by a Receiving Antenna Selection for a MIMO/SDMA Channel”, Technical Search Report of Electric Information Communication Academic Conference, Feb. 28, 2002, Vol. 101, No. 683, pp. 17-22, RCS 2001-286.
Siemens, “Evolved UTRA uplink scheduling and frequency reuse” [online], 3GPP TSG-RAN WG1 # 41 R1-050476, Internet <URL:http://www.3gpp.org/ftp/tsg—ran/WG1—RL1/TSGR1—41/Docs/R1-050476.zip>, May 9, 2005.
Sklar, B., “The process of thus correcting the channel-induced distortion is called equalization”, Digital Communications, PTR Prentice Hall, Upper Saddle River, New Jersey, 1998, Formatting and Baseband Transmission, Chap. 2, Section 2.11.2, pp. 54,104-106.
Sumii, Kenji, et al., “A Study on Computational Complexity Reduction of Iterative Decoding for Turbo-coded MIMO-SDM Using Sphere Decoding,” Technical Report of IEICE. RCS, Nov. 9, 2010, vol. 104, No. 675, pp. 43-48.
Tomcik, T.: “QTDD Performance Report 2,” IEEE C802.20-05/88, IEEE 802.20 Working Group on Mobile Broadband Wireless Access, <http://ieee802.org/20/>, pp. 1-56, XP002386798 (Nov. 15, 2005).
Viswanath, P. et al, “Opportunistic Beamforming Using Dumb Antennas” IEEE Transactions on Information Theory, IEEE USA, vol. 48, No. 6, Jun. 2002, pp. 1277-1294, XP002314708 ISSN: 0018-9448 abstract right-hand column, paragraph 1.
Voltz, P. J.,“Characterization of the optimum transmitter correlation matrix for MIMO with antenna subset selection”, IEEE Transactions on Communications, vol. 51, No. 11, pp. 1779-1782, (Nov. 1, 2003).
Yatawatta, S. et al., “Energy Efficient Channel Estimation in MIMO Systems”, 2005 IEEE International Conference on Acoustics, Speech, and Signal Processing, Mar. 18-23, 2005, Philadelphia, vol. 4, pp. 317-320, Mar. 18, 2005.
Anonymous: “3GPP TS 36.211 V8.0.0; Evolved Universal Terrestrial Radio Access (E-UTRA); Physical channels and modulation (Release 8)” 3rd Generation Partnership Prokect; Technical Specification Group Radio Access Network, [Online] 2007m XP002520076 Retrieved from the Internet: URL:http://www.Sgpp.org/ftp/Specs/html-i nf o/36211.htm> [retrieved on Sep. 27, 2007] Section 5.
Jim Tomcik, QFDD and QTDD: Technology Overview, IEEE 802.20 Working Group on Mobile Broadband Wireless Access, Oct. 28, 2005, pp. 48-50, http://www.ieee802.org/20/contribs/c802.20-05-68.zip.
Nokia: “Compact signalling of multi-coe allocation for HSDPA”, version 2.3GPP R1-02-0018, Jan. 11, 2002.
Sethi M, et al., “Code Reuse DS-CDMA—A Space Time Approach”, Proceedings of the 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), pp. 2297-2300, May 13-17, 2002.
Bhushan N., “UHDR Overview”, C30-20060522-037, Denver, CO, May 22, 2006, pp. 1-115.
Samsung: “Uplink Transmission and Multiplexing for EUTRA”, 3GPP Draft; R1-050605 UL Multiplexing, Jun. 16, 2005, XP050111420.
Tachikawa (Editor): “W-CDMA Mobile Communication Systems,” Joh Wiley & Sons Ltd., Japan, Maruzen: pp. 82-213, Jun. 25, 2001.
Related Publications (1)
Number Date Country
20070097927 A1 May 2007 US