Shared signaling channel

Information

  • Patent Grant
  • 9225488
  • Patent Number
    9,225,488
  • Date Filed
    Thursday, October 27, 2005
    19 years ago
  • Date Issued
    Tuesday, December 29, 2015
    9 years ago
Abstract
A shared signaling channel can be used in an Orthogonal Frequency Division Multiple Access (OFDMA) communication system to provide signaling, acknowledgement, and power control messages to access terminals within the system. The shared signaling channel can be assigned to a predetermined number of sub-carriers within any frame. The assignment of a predetermined number of sub-carriers to the shared signaling channel establishes a fixed bandwidth overhead for the channel. The actual sub-carriers assigned to the channel can be varied periodically, and can vary according to a predetermined frequency hopping schedule. The amount of signal power allocated to the signaling channel can vary on a per symbol basis depending on the power requirements of the communication link. The shared signaling channel can direct each message carried on the channel to one or more access terminals. Unicast messages allow the channel power to be controlled per the needs of individual communication links.
Description
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,832, entitled “SCALABLE FREQUENCY BAND OPERATION IN WIRELESS COMMUNICATION SYSTEMS”, filed Oct. 27, 2005, and U.S. patent application Ser. No. 11/261,805, entitled “SCALABLE FREQUENCY BAND OPERATION IN WIRELESS COMMUNICATION SYSTEMS”, filed Oct. 27, 2005, assigned to the assignee hereof, and expressly incorporated by reference herein; and


U.S. patent application Ser. No. 11/260,895, entitled “ADAPTIVE SECTORIZATION IN CELLULAR SYSTEMS”, filed Oct. 27, 2005, assigned to the assignee hereof, and expressly incorporated by reference herein.


BACKGROUND

1. Field of the Disclosure


The disclosure relates to the field of wireless communications. More particularly, the disclosure relates to a shared signaling channel in a wireless communication system.


2. Description of Related Art


Wireless communication systems can be configured as multiple access communication systems. In such systems, the communication system can concurrently support multiple users across a predefined set of resources. Communication devices can establish a link in the communication system by requesting access and receiving an access grant.


The resources the wireless communication system grants to the requesting communication device depends, largely, on the type of multiple access system implemented. For example, multiple access systems can allocate resources on the basis of time, frequency, code space, or some combination of factors.


The wireless communication system needs to communicate the allocated resources and track them to ensure that two or more communication devices are not allocated overlapping resources, such that the communication links to the communication devices are not degraded. Additionally, the wireless communication system needs to track the allocated resources in order to track the resources that are released or otherwise available when a communication link is terminated.


The wireless communication system typically allocates resources to communication devices and the corresponding communication links in a centralized manner, such as from a centralized communication device. The resources allocated, and in some cases de-allocated, need to be communicated to the communication devices. Typically, the wireless communication system dedicates one or more communication channels for the transmission of the resource allocation and associated overhead.


However, the amount of resources allocated to the overhead channels typically detracts from the resources and corresponding capacity of the wireless communication system. Resource allocation is an important aspect of the communication system and care needs to be taken to ensure that the channels allocated to resource allocation are robust.


However, the wireless communication system needs to balance the need for a robust resource allocation channel with the need to minimize the adverse effects on the communication channels.


It is desirable to configure resource allocation channels that provide robust communications, yet introduce minimal degradation of system performance.


BRIEF SUMMARY

A shared signaling channel can be used in a wireless communication system to provide signaling messages to access terminals within the system. The shared signaling channel can be assigned to a predetermined number of sub-carriers within any frame. The assignment of a predetermined number of sub-carriers to the shared signaling channel establishes a fixed bandwidth overhead for the channel. The actual sub-carriers assigned to the channel can be varied periodically, and can vary according to a predetermined frequency hopping schedule. The amount of signal power allocated to the signaling channel can vary on a per symbol basis depending on the power requirements of the communication link. The shared signaling channel can direct each message carried on the channel to one or more access terminals. Unicast or otherwise directed messages allow the channel power to be controlled per the needs of individual communication links.


The disclosure includes a method of generating signaling channel messages in a wireless communication system including a plurality of sub-carriers spanning at least a portion of an operating frequency band. The method includes assigning resources corresponding to a predetermined bandwidth allocated to a signaling channel, generating at least one message, encoding the at least one message to generate at least one message symbol, controlling a power density of the at least one message symbol, and modulating at least a portion of the resources allocated to the signaling channel.


The disclosure also includes a method that includes generating at least one message, encoding the at least one message to generate a plurality of message symbols, adjusting a power density associated with the plurality of message symbols, determining a subset of sub-carriers assigned to a signaling channel from the plurality of sub-carriers, and modulating each of the subset of sub-carriers with at least one symbol from the plurality of message symbols.


The disclosure includes an apparatus configured to generate signaling channel messages in a wireless communication system including a plurality of sub-carriers spanning an operating frequency band. The apparatus includes a scheduler configured to assign a subset of the plurality of sub-carriers to a signaling channel, a signaling module configured to generate at least one signaling message, a power control module configured to adjust a power density of the at least one signaling message, and a signal mapper coupled to the scheduler and the signaling module and configured to map symbols from the at least one signaling message to the subset of the plurality of sub-carriers.


The disclosure includes an apparatus that includes means for generating at least one message, means for encoding the at least one message to generate a plurality of message symbols, means for adjusting a power density associated with the plurality of message symbols, means for determining a subset of sub-carriers assigned to a signaling channel from the plurality of sub-carriers, and means for modulating each of the subset of sub-carriers with at least one symbol from the plurality of message symbols.





BRIEF DESCRIPTION OF THE DRAWINGS

The features, objects, and advantages of embodiments of the disclosure will become more apparent from the detailed description set forth below when taken in conjunction with the drawings, in which like elements bear like reference numerals.



FIG. 1 is a simplified functional block diagram of an embodiment of a communication system having a shared signaling channel.



FIG. 2 is a simplified functional block diagram of an embodiment of a transmitter supporting a shared signaling channel.



FIG. 3 is a simplified time-frequency diagram of an embodiment of a shared signaling channel.



FIG. 4 is a simplified flowchart of an embodiment of a method of generating shared signaling channel messages.



FIG. 5 is a simplified flowchart of an embodiment of a method of generating shared signaling channel messages.





DETAILED DESCRIPTION OF EMBODIMENTS OF THE INVENTION

A shared signaling channel (SSCH) in an OFDMA wireless communication system can be used to communicate various signaling and feedback messages implemented within the system. The wireless communication system can implement a SSCH as one of a plurality of forward link communication channels. The SSCH can be simultaneously or concurrently shared among a plurality of access terminals within the communication system.


The wireless communication system can communicate various signaling messages in a forward link SSCH. For example, the wireless communication system can include access grant messages, forward link assignment messages, reverse link assignment messages, as well as any other signaling messages that may be communicated on a forward link channel. The SSCH can also be used to communicate feedback messages to access terminals. The feedback messages can include acknowledgement (ACK) messages confirming successful receipt of access terminal transmissions. The feedback messages can also include reverse link power control messages that are used to instruct a transmitting access terminal to vary its transmit power.


The actual channels utilized in an SSCH may be all or some of the ones described above. Additionally, other channels may be included in SSCH in addition or in lieu of, any of the above channels.


The wireless communication system can allocate a predetermined number of sub-carriers to the SSCH. Assigning a predetermined number of sub-carriers to the SSCH establishes a fixed bandwidth overhead for the channel. The actual sub-carriers assigned to the SSCH can be varied periodically, and can vary according to a predetermined frequency hopping schedule. In one embodiment, the identity of the sub-carriers assigned to the SSCH can vary across each frame.


The amount of power that is allocated to the SSCH can vary depending on the requirements of the communication link carrying the SSCH message. For example, the SSCH power can be increased when the SSCH messages are transmitted to a distant access terminal. Conversely, the SSCH power can be decreased when the SSCH messages are transmitted to a nearby access terminal. If there is no SSCH message to be transmitted, the SSCH need not be allocated any power. Because the power allocated to the SSCH can be varied on a per user basis when unicast messaging is implemented, the SSCH requires a relatively low power overhead. The power allocated to the SSCH increases only as needed by the particular communication link.


The amount of interference that the SSCH contributes to the data channels for the various access terminals can vary based on the sub-carriers assigned to the SSCH and the access terminals, as well as the relative power levels of the SSCH and the data channels. The SSCH contributes substantially no interference for many communication links.



FIG. 1 is a simplified functional block diagram of an embodiment of a wireless communication system 100 implementing a SSCH on the forward link. The system 100 includes one or more fixed elements that can be in communication with one or more access terminals 110a-110b. Although the description of the system 100 of FIG. 1 generally describes a wireless telephone system or a wireless data communication system, the system 100 is not limited to implementation as a wireless telephone system or a wireless data communication system nor is the system 100 limited to having the particular elements shown in FIG. 1.


Each access terminal 110a-110b can be, for example, a wireless telephone configured to operate according to one or more communication standards. An access terminal 110a can be a portable unit, a mobile unit, or, a stationary unit. Each of the access terminals 110a-110b may also be referred to as a mobile unit, a mobile terminal, a mobile station, a user terminal, user equipment, a portable, a phone, and the like. Although only two access terminals 110a-110b are shown in FIG. 1, it is understood that a typical wireless communication system 100 has the ability to communicate with multiple access terminals 110a-110b.


An access terminal 110a typically communicates with one or more base stations 120a or 120b, here depicted as sectored cellular towers. Other embodiments of the system 100 may include access points in place of the base stations 120a and 120b. In such a system 100 embodiment, the BSC 130 and MSC 140 may be omitted and may be replaced with one or more switches, hubs, or routers.


As used herein, a base station may be a fixed station used for communicating with the terminals and may also be referred to as, and include some or all the functionality of, an access point, a Node B, or some other terminology. An access terminal may also be referred to as, and include some or all the functionality of, a user equipment (UE), a wireless communication device, terminal, a mobile station or some other terminology.


The access terminal 110a will typically communicate with the base station, for example 120b that provides the strongest signal strength at a receiver within the access terminal 110a. A second access terminal 110b can also be configured to communicate with the same base station 120b. However, the second access terminal 110b may be distant from the base station 120b, and may be on the edge of a coverage area served by the base station 120b.


The one or more base stations 120a-120b can be configured to schedule the channel resources used in the forward link, reverse link, or both links. Each base station, 120a-120b, can communicate sub-carrier assignments, acknowledgement messages, reverse link power control messages, and other overhead messages using the SSCH.


Each of the base stations 120a and 120b can be coupled to a Base Station Controller (BSC) 130 that routes the communication signals to and from the appropriate base stations 120a and 120b. The BSC 130 is coupled to a Mobile Switching Center (MSC) 140 that can be configured to operate as an interface between the access terminals 110a-110b and a Public Switched Telephone Network (PSTN) 150. In another embodiment, the system 100 can implement a Packet Data Serving Node (PDSN) in place or in addition to the PSTN 150. The PDSN can operate to interface a packet switched network, such as network 160, with the wireless portion of the system 100.


The MSC 140 can also be configured to operate as an interface between the access terminals 110a-110b and a network 160. The network 160 can be, for example, a Local Area Network (LAN) or a Wide Area Network (WAN). In one embodiment, the network 160 includes the Internet. Therefore, the MSC 140 is coupled to the PSTN 150 and network 160. The MSC 140 can also be configured to coordinate inter-system handoffs with other communication systems (not shown).


The wireless communication system 100 can be configured as an OFDMA system with communications in both the forward link and reverse link utilizing OFDM communications. The term forward link refers to the communication link from the base stations 120a or 120b to the access terminals 110a-110b, and the term reverse link refers to the communication link from the access terminals 110a-110b to the base stations 120a or 120b. Both the base stations 120a and 120b and the access terminals 110a-110b may allocate resources for channel and interference estimation.


The base stations, 120a and 120b, and the access terminal 110 can be configured to broadcast a pilot signal for purposes of channel and interference estimation. The pilot signal can include broadband pilots such as a plurality of CDMA waveforms or a collection of narrow band pilots that span the overall spectrum. The broadband pilots could also be a collection of narrow band pilots staggered in time and frequency.


In one embodiment, the pilot signal can include a number of tones selected from the OFDM frequency set. For example, the pilot signal can be formed from uniformly spaced tones selected from the OFDM frequency set. The uniformly spaced configuration may be referred to as a staggered pilot signal.


The wireless communication system 100 can include a set of sub-carriers, alternatively referred to as tones that span an operating bandwidth of the OFDMA system. Typically, the sub-carriers are equally spaced. The wireless communication system 100 may allocate one or more sub-carriers as guard bands, and the system 100 may not utilize the sub-carriers within the guard bands for communications with the access terminals 110a-110b.


In one embodiment, the wireless communication system 100 can include 2048 sub-carriers spanning an operating frequency band of 20 MHz. A guard band having a bandwidth substantially equal to the bandwidth occupied by one or more sub-carriers can be allocated on each end of the operating band.


The wireless communication system 100 can be configured to Frequency Division Duplex (FDD) the forward and reverse links. In a FDD embodiment, the forward link is frequency offset from the reverse link. Therefore, forward link sub-carriers are frequency offset from the reverse link sub-carriers. Typically, the frequency offset is fixed, such that the forward link channels are separated from the reverse link sub-carriers by a predetermined frequency offset. The forward link and reverse link may communicate simultaneously, or concurrently, using FDD.


In another embodiment, the wireless communication system 100 can be configured to Time Division Duplex (TDD) the forward and reverse links. In such an embodiment, the forward link and reverse link can share the same sub-carriers, and the wireless communication system 100 can alternate between forward and reverse link communications over predetermined time intervals. In TDD, the allocated frequency channels are identical between the forward and reverse links, but the times allocated to the forward and reverse links are distinct. A channel estimate performed on a forward or reverse link channel is typically accurate for the complementary reverse or forward link channel because of reciprocity.


The wireless communication system 100 can also implement an interlacing format in one or both the forward and reverse links. Interlacing is a form of time division multiplexing in which the communication link timing is cyclically assigned to one of a predetermined number of interlace periods. A particular communication link to one of the access terminals, for example 110a, can be assigned to one of the interlace periods, and communications over the particular assigned communication link occurs only during the assigned interlace period. For example, the wireless communication system 100 can implement an interlace period of six. Each interlace period, identified 1-6, has a predetermined duration. Each interlace period occur periodically with a period of six. Thus, a communication link assigned to a particular interlace period is active once every six periods.


Interlaced communications are particularly useful in wireless communication systems 100 implementing an automatic repeat request architecture, such as a Hybrid Automatic Repeat Request (HARQ) algorithm. The wireless communication system 100 can implement a HARQ architecture to process data retransmission. In such a system, a transmitter may send an initial transmission at a first data rate and may automatically retransmit the data if no acknowledgement message is received. The transmitter can send subsequent retransmissions at lower data rates. HARQ incremental redundancy retransmission schemes can improve system performance in terms of providing early termination gain and robustness.


The interlace format allows sufficient time for processing of the ACK messages prior to the next occurring assigned interlace period. For example, an access terminal 110a can receive transmitted data and transmit an acknowledgement message, and a base station 120b can receive and process the acknowledgement message in time to prevent retransmission at the next occurring interlace period. Alternatively, if the base station 120b fails to receive the ACK message, the base station 120b can retransmit the data at the next occurring interlace period assigned to the access terminal 110a.


The base stations 120a-120b can transmit the SSCH messages in each interlace, but may limit the messages occurring in each interlace to those messages intended for access terminals 110a-110b assigned to that particular active interlace. The base stations 120a-120b can limit the amount of SSCH messages that need to be scheduled in each interlace period.


The wireless communication system 100 can implement a Frequency Division Multiplex (FDM) SSCH in the forward link for the communication of signaling and feedback messages. Each base station 120a-120b can allocate a predetermined number of sub-carriers to the SSCH. The wireless communication system 100 can be configured to allocate a fixed bandwidth overhead to the SSCH. Each base station 120a-120b can allocate a predetermined percentage of its sub-carriers to the SSCH. Additionally, each base station 120a or 120b may allocate a different set of sub-carriers to the SSCH or the set of sub-carriers may overlap the SSCH sub-carrier assignment of another base station. For example, each base station 120a or 120b can be configured to allocate approximately 10% of the bandwidth to the SSCH. Thus, in a wireless communication system 100 having up to 2000 sub-carriers that can be allocated to the SSCH, each base station 120a or 120b allocates 200 sub-carriers to the SSCH. Of course other wireless communication systems 100 can be configured with other bandwidth overhead targets. For example, the wireless communication system 100 can have a target SSCH bandwidth allocation that is 2%, 5%, 7%, 15%, 20% or some other number, based on the projected channel loading.


Each base station, for example 120b, can allocate a plurality of nodes from a channel tree to the SSCH. The channel tree is a channel model that can include a plurality of branches that eventually terminate in leaf or base nodes. Each node in the tree can be labeled, and each node identifies every node and base node beneath it. A leaf or base node of the tree can correspond to the smallest assignable resource, such as a single sub-carrier. Thus, the channel tree provides a logical map for assigning and tracking the available sub-carrier resources in the wireless communication system 100.


The base station 120b can map the nodes from the channel tree to physical sub-carriers used in the forward and reverse links. For example, the base station 120b can allocate a predetermined number of resources to the SSCH by assigning a corresponding number of base nodes from a channel tree to the SSCH. The base station 120b can map the logical node assignment to a physical sub-carrier assignment that ultimately is transmitted by base station 120b.


It may be advantageous to use the logical channel tree structure or some other logical structure to track the resources assigned to the SSCH when the physical sub-carrier assignments can change. For example, the base stations 120a-120b can implement a frequency hopping algorithm for the SSCH as well as other channels, such as data channels. The base stations 120a-120b can implement a pseudorandom frequency hopping scheme for each assigned sub-carrier. The base stations 120a-120b can use the frequency hopping algorithm to map the logical nodes from the channel tree to corresponding physical sub-carrier assignments.


The frequency hopping algorithm can perform frequency hopping on a symbol basis or a block basis. Symbol rate frequency hopping can frequency hop each individual sub-carrier distinct from any other sub-carrier, except that no two node are assigned to the same physical sub-carrier. In block hopping, a contiguous block of sub-carriers can be configured to frequency hop in a manner that maintains the contiguous block structure. In terms of the channel tree, a branch node that is higher than a leaf node can be assigned to a hopping algorithm. The base nodes under the branch node can follow the hoping algorithm applied to the branch node.


The base station 120a-120b can perform frequency hopping on a periodic basis, such as each frame, a number of frames, or some other predetermined number of OFDM symbols. As used herein, a frame refers to a predetermined structure of OFDM symbols, which may include one or more preamble symbols and one or more data symbols. The receiver can be configured to utilize the same frequency hopping algorithm to determine which sub-carriers are assigned to the SSCH or a corresponding data channel.


The base stations 120a-120b can modulate each of the sub-carriers assigned to the SSCH with the SSCH messages. The messages can include signaling messages and feedback messages. The signaling messages can include access grant messages, forward link assignment block messages, and reverse link block assignment messages. The feedback messages can include acknowledgement (ACK) messages and reverse link power control messages. The actual channels utilized in an SSCH may be all or some of the ones described above. Additionally, other channels may be included in SSCH in addition or in lieu of, any of the above channels.


The access grant message is used by the base station 120b to acknowledge an access attempt by an access terminal 110a and assign a Media Access Control Identification (MACID). The access grant message can also include an initial reverse link channel assignment. The sequence of modulation symbols corresponding to the access grant can be scrambled according to an index of the preceding access probe transmitted by the access terminal 110a. This scrambling enables the access terminal 110a to respond only to access grant blocks that correspond to the probe sequence that it transmitted.


The base station 120b can use the forward and reverse link access block messages to provide forward or reverse link sub-carrier assignments. The assignment messages can also include other parameters, such as modulation format, coding format, and packet format. The base station typically provides a channel assignment to a particular access terminal 110a, and can identify the target recipient using an assigned MACID.


The base stations 120a-120b typically transmit the ACK messages to particular access terminals 110a-110b in response to successful receipt of a transmission. Each ACK message can be as simple as a one-bit message indicating positive or negative acknowledgement. An ACK message can be linked to each sub-carrier, e.g. by using related nodes in a channel tree to others for that access terminal, or can be linked to a particular MACID. Further, the ACK messages may be encoded over multiple packets for the purposes of diversity.


The base stations 120a-120b can transmit reverse link power control messages to control the power density of reverse link transmissions from each of the access terminals 110a-110b. The base station 120a-120b can transmit the reverse power control message to command the access terminal 110a-110b to increase or decrease its power density.


The base stations 120a-120b can be configured to unicast each of the SSCH messages individually to particular access terminals 110a-110b. In unicast messaging, each message is modulated and power controlled independently from other messages. Alternatively, messages directed to a particular user can be combined and independently modulated and power controlled.


In another embodiment, the base stations 120a-120b can be configured to combine the messages for multiple access terminals 110a-110b and multi-cast the combined message to the multiple access terminals 110a-110b. In multicast, messages for multiple access terminals can be grouped in jointly encoded and power controlled sets. The power control for the jointly encoded messages needs to target the access terminal having the worst communication link. Thus, if the messages for two access terminals 110a and 110b are combined, the base station 120b sets the power control of the combined message to ensure that the access terminal 110a having the worst link receives the transmission. However, the level of power needed to ensure the worst communication link is satisfied may be substantially greater than required for an access terminal 110b at a close proximity to the base station 120b. Therefore, in some embodiments SSCH messages may be jointly encoded and power controlled for those access terminals having substantially similar channel characteristics, e.g. SNRs, power offsets, etc.


In another embodiment, the base stations 120a-120b can group all of the message information for all access terminals 110a-110b served by a base station, for example 120b, and broadcast the combined message to all of the access terminals 110a-110b. In the broadcast approach, all messages are jointly coded and modulated while power control targets the access terminal with the worst forward link signal strength.


Unicast signaling may be advantageous in those situations where multicast and broadcast require substantial power overhead to reach cell edge for a substantial number of bits. Unicast messages may benefit from power sharing between access terminals with different forward link signal strength through power control. Unicast messaging also benefits from the fact that many reverse link base nodes may not be assigned at any given point in time so that no energy needs to be expended reporting an ACK for those nodes.


From the MAC logic standpoint, unicast design enables the wireless communication system 100 to scramble ACK messages with the target MACID, preventing an access terminal that erroneously thinks that it is assigned the relevant resources targeted by the ACK (via assignment signaling errors such as missed de-assignment) from falsely interpreting the ACK that is actually intended for another MACID. Thus, such an access terminal will recover from the erroneous assignment state after a single packet since that packet cannot be positively acknowledged, and the access terminal will expire the erroneous assignment.


From the link performance standpoint, the main advantage of broadcast or multicast methods is coding gain due to joint encoding. However, the gain of power control exceeds substantially coding gain for practical geometry distributions. Also, unicast messaging can exhibit higher error rates compared to jointly encoded and CRC protected messages. However, practically achievable error rates of 0.01% to 0.1% are satisfactory.


It may be advantageous for the base stations 120a-120b to multicast or broadcast some messages while unicasting others. For example, an assignment message can be configured to automatically de-assigns resources from the access terminal that is currently using resources corresponding to the sub-carriers indicated in the assignment message. Hence, assignment messages are often multicast since they target both the intended recipient of the assignment as well as any current users of the resources specified in the assignment message.



FIG. 2 is a simplified functional block diagram of an embodiment of an OFDMA transmitter 200 such as can be incorporated within a base station of the wireless communication system of FIG. 1. The transmitter 200 is configured to transmit one or more OFDMA signals to one or more access terminals. The transmitter 200 includes a SSCH module 230 configured to generate and implement a SSCH in the forward link.


The transmitter 200 includes a data buffer 210 configured to store data destined for one or more access terminals. The data buffer 210 can be configured, for example, to hold the data destined for each of the access terminals in a coverage area supported by the corresponding base station.


The data can be, for example, raw unencoded data or encoded data. Typically, the data stored in the data buffer 210 is unencoded, and is coupled to an encoder 212 where it is encoded according to a desired encoding rate. The encoder 212 can include encoding for error detection and Forward Error Correction (FEC). The data in the data buffer 210 can be encoded according to one or more encoding algorithms. Each of the encoding algorithms and resultant coding rates can be associated with a particular data format of a multiple format Hybrid Automatic Repeat Request (HARQ) system. The encoding can include, but is not limited to, convolutional coding, block coding, interleaving, direct sequence spreading, cyclic redundancy coding, and the like, or some other coding.


The encoded data to be transmitted is coupled to a serial to parallel converter and signal mapper 214 that is configured to convert a serial data stream from the encoder 212 to a plurality of data streams in parallel. The signal mapper 214 can determine the number of sub-carriers and the identity of the sub-carriers for each access terminal based on input provided by a scheduler (not shown). The number of carriers allocated to any particular access terminal may be a subset of all available carriers. Therefore, the signal mapper 214 maps data destined for a particular access terminal to those parallel data streams corresponding to the data carriers allocated to that access terminal.


A SSCH module 230 is configured to generate the SSCH messages, encode the messages, and provide the encoded messages to the signal mapper 214. The SSCH module 230 can also provide the identity of the sub-carriers assigned to the SSCH. The SSCH module 230 can include a scheduler 252 configured to determine and assign nodes from a channel tree to the SSCH. The output of the scheduler 252 can be coupled to a frequency hopping module 254. The frequency hopping module 254 can be configured to map the assigned channel tree nodes determined by the scheduler 252 to the physical sub-carrier assignments. The frequency hopping module 254 can implement a predetermined frequency hopping algorithm.


The signal mapper 214 receives the SSCH message symbols and sub-carrier assignments, and maps the SSCH symbols to the appropriate sub-carriers. In one embodiment, the SSCH module 230 can be configured to generate a serial message stream and the signal mapper 214 can be configured to map the serial message to the assigned sub-carriers.


In one embodiment, the signal mapper 214 can be configured to interleave each modulation symbol from the SSCH message across all of the assigned sub-carriers. Interleaving the modulation symbols for the SSCH provides the SSCH signal with the maximum frequency and interference diversity.


The output of the serial to parallel converter/signal mapper 214 is coupled to a pilot module 220 that is configured to allocate a predetermined portion of the sub-carriers to a pilot signal. In one embodiment, the pilot signal can include a plurality of equally spaced sub-carriers spanning substantially the entire operating band. The pilot module 220 can be configured to modulate each of the carriers of the OFDMA system with a corresponding data or pilot signal.


Transmitting signaling blocks using the highest possible spectral efficiency is desirable to minimize bandwidth overhead of signaling messages. However, the downside of high spectral efficiency is the need for a higher energy per bit (Eb/N0), which drives power overhead. Spectral efficiencies between 0.5 bps/Hz and 1 bps/Hz have been found to be a good compromise as they allow for a low bandwidth overhead while achieving minimum (Eb/N0) requirements. However, other spectral efficiencies may be suitable for some systems.


In one embodiment, the SSCH symbols are used to BPSK modulate the assigned sub-carriers. In another embodiment, the SSCH symbols are used to QPSK modulate the assigned sub-carriers. While practically any modulation type can be accommodated, it may be advantageous to use a modulation format that has a constellation that can be represented by a rotating phasor, because the magnitude does not vary as a function of the symbol. This may be beneficial because SSCH may then have different offsets but the same pilot references, and thereby be easier to demodulate.


The output of the pilot module 220 is coupled to an Inverse Fast Fourier Transform (IFFT) module 222. The IFFT module 222 is configured to transform the OFDMA carriers to corresponding time domain symbols. Of course, a Fast Fourier Transform (FFT) implementation is not a requirement, and a Discrete Fourier Transform (DFT) or some other type of transform can be used to generate the time domain symbols. The output of the IFFT module 222 is coupled to a parallel to serial converter 224 that is configured to convert the parallel time domain symbols to a serial stream.


The serial OFDMA symbol stream is coupled from the parallel to serial converter 224 to a transceiver 240. In the embodiment shown in FIG. 2, the transceiver 240 is a base station transceiver configured to transmit the forward link signals and receive reverse link signals.


The transceiver 240 includes a forward link transmitter module 244 that is configured to convert the serial symbol stream to an analog signal at an appropriate frequency for broadcast to access terminals via an antenna 246. The transceiver 240 can also include a reverse link receiver module 242 that is coupled to the antenna 246 and is configured to receive the signals transmitted by one or more remote access terminals.


The SSCH module 230 is configured to generate the SSCH messages. As described earlier, The SSCH messages can include signaling messages. Additionally, the SSCH messages can include feedback messages, such as ACK messages or power control messages. The SSCH module 230 is coupled to the output of the receiver module 242 and analyzes the received signals, in part, to generate the signaling and feedback messages.


The SSCH module 230 includes a signaling module 232, an ACK module 236, and a power control module 238. The signaling module 232 can be configured to generate the desired signaling messages and encode them according to the desired encoding. For example, the signaling module 232 can analyze the received signal for an access request and can generate an access grant message directed to the originating access terminal. The signaling module 232 can also generate and encode any forward link or reverse link block assignment messages.


Similarly, the ACK module 236 can generate ACK messages directed to access terminals for which a transmission was successfully received. The ACK module 236 can be configured to generate unicast, multicast, or broadcast messages, depending on the system configuration.


The power control module 238 can be configured to generate any reverse link power control messages based in part on the received signals. The power control module 238 can also be configured to generate the desired power control messages.


The power control module 238 can also be configured to generate the power control signals that control the power density of the SSCH messages. The SSCH module 230 can power control individual unicast messages based on the needs of the destination access terminal. Additionally, the SSCH module 230 can be configured to power control the multicast or broadcast messages based on the weakest forward link signal strength reported by the access terminals. The power control module 238 can be configured to scale the encoded symbols from each of the modules within the SSCH module 230. In another embodiment, the power control module 238 can be configured to provide control signals to the pilot module 220 to scale the desired SSCH symbols. The power control module 238 thus allows the SSCH module 230 to power control each of the SSCH messages according to its needs. This results in reduced power overhead for the SSCH.



FIG. 3 is a simplified time-frequency diagram 300 of an embodiment of a shared signaling channel, such a channel generated by the SSCH module of the transmitter of FIG. 2. The time frequency diagram 300 details the SSCH sub-carrier allocation for two successive frames, 310 and 320. The two successive frames 310 and 320 can represent the successive frames of an FDM system or a TDM system, although the successive frames in a TDM system may have one or more intervening frames allocated to reverse link access terminal transmissions (not shown).


The first frame 310 includes three frequency bands, 312a-312c, that can be representative of three separate sub-carriers assigned to the SSCH in the particular frame. The three sub-carrier assignments 312a-312c are shown as maintained over the entire duration of the frame 310. In some embodiments, the sub-carrier assignments can change during the course of the frame 310. The number of times that the sub-carrier assignments can change during the course of a frame 310 is defined by the frequency hopping algorithm, and is typically less than the number of OFDM symbols in the frame 310.


In the embodiment shown in FIG. 3, the sub-carrier assignment changes on the frame boundary. The second, successive frame 320 also includes the same number of sub-carriers assigned to the SSCH as in the first frame 310. In one embodiment, the number of sub-carriers assigned to the SSCH is predetermined and fixed. For example, the SSCH bandwidth overhead can be fixed to some predetermined level. In another embodiment, the number of sub-carriers assigned to the SSCH is variable, and can be assigned by a system control message. Typically, the number of sub-carriers assigned to the SSCH does not vary at a high rate.


The sub-carriers mapped to the SSCH can be determined by a frequency hopping algorithm that maps a logical node assignment to a physical sub-carrier assignment. In the embodiment shown in FIG. 3, the three sub-carrier physical assignments 322a-322c are different in the second, successive frame 320. As before, the embodiment depicts the sub-carrier assignments as stable for the entire length of the frame 320.



FIG. 4 is a simplified flowchart of an embodiment of a method 400 of generating shared signaling channel messages. The transmitter having the SSCH module as shown in FIG. 2 can be configured to perform the method 400. The method 400 depicts the generation of one frame of SSCH messages. The method 400 can be repeated for additional frames.


The method 400 begins at block 410 where the SSCH module generates the signaling messages. The SSCH module can generate signaling messages in response to requests. For example, the SSCH module can generate access grant messages in response to access requests. Similarly, the SSCH module can generate forward link or reverse link assignment block messages in response to a link request or a request to transmit data.


The SSCH module proceeds to block 412 and encodes the signaling messages. The SSCH can be configured to generate unicast messages for particular message types, for example access grants. The SSCH module can be configured to identify a MACID of a destination access terminal when formatting a unicast message. The SSCH module can encode the message and can generate a CRC code and append the CRC to the message. Additionally, the SSCH can be configured to combine the messages for several access terminals into a single multicast or broadcast message and encode the combined messages. The SSCH can, for example, include a MACID designated for broadcast messages. The SSCH can generate a CRC for the combined message and append the CRC to the encoded messages.


The SSCH module can proceed to block 414 to power control the signaling messages. In one embodiment, the SSCH can adjust or otherwise scale the amplitude of the encoded messages. In another embodiment, the SSCH module can direct a modulator to scale the amplitude of the symbols.


The SSCH module then performs similar steps for the generation of ACK and reverse link power control feedback messages. At block 420, the SSCH module generates the desired ACK messages based on received access terminal transmissions. The SSCH module proceeds to block 422 and encodes the ACK messages, for example, as unicast messages. The SSCH module proceeds to block 424 and adjusts the power of the ACK symbols.


The SSCH module proceeds to block 430 and generates reverse link power control messages based, for example, on the received signal strength of each individual access terminal transmission. The SSCH module proceeds to block 432 and encodes the power control messages, typically as unicast messages. The SSCH module proceeds to block 434 and adjusts the power of the reverse link power control message symbols.


The SSCH proceeds to block 440 and determines which nodes from a logical structure, such as a channel tree, are assigned to the SSCH. The SSCH module proceeds to block 450 and maps the physical sub-carrier assignment to the assigned nodes. The SSCH module can use a frequency hopper algorithm to map the logical node assignment to the sub-carrier assignment. The frequency hopper algorithm can be such that the same node assignment can produce different physical sub-carrier assignments for different frames. The frequency hopper can thus provide a level of frequency diversity, as well as some level of interference diversity.


The SSCH proceeds to block 460 and maps the message symbols to the assigned sub-carriers. The SSCH module can be configured to interleave the message symbols among the assigned sub-carriers to introduce diversity to the signal.


The symbols modulate the OFDM sub-carriers, and the modulated sub-carriers are transformed to OFDM symbols that are transmitted to the various access terminals. The SSCH module allows a fixed bandwidth FDM channel to be used for signaling and feedback messages while allowing flexibility in the amount of power overhead that is dedicated to the channel.



FIG. 5 is a simplified flowchart of another embodiment of a method 500 of generating shared signaling channel messages. The method 500 can be implemented, for example, by the transmitter having the SSCH module shown in FIG. 2.


The method 500 begins at block 510 where the transmitter assigns a predetermined bandwidth to the SSCH. The transmitter can assign a number of sub-carriers of a set of OFDM sub-carriers that is substantially equal to the predetermined bandwidth. For example, the transmitter can assign approximately 10% of the available bandwidth to the SSCH.


The transmitter proceeds to block 520 and assigns resources to the SSCH based on the predetermined bandwidth. In one embodiment, the transmitter can be configured to assign resources based on a logical resource model, such as a channel tree. The channel tree can be organized as a number of branches that split at nodes until reaching a final base node, alternatively referred to as a leaf node. The transmitter can assign the resources by assigning one or more nodes to the SSCH. After assigning the nodes from the channel tree, the transmitter can map the logical nodes to the physical sub-carriers in the OFDM system. The transmitter can assign the nodes based on a logical model in a system where the physical mapping can change over time. For example, the transmitter can implement frequency hopping in the sub-carriers of the SSCH. The transmitter can maintain the initial logical node assignment and can determine the physical sub-carrier mapping based on a predetermined frequency hopping algorithm.


The transmitter proceeds to block 530 and generates the messages that are to be carried over the SSCH. The messages can be nearly any type of signaling or overhead message. For example, the messages can include channel assignment messages directed to access terminals, ACK messages, and reverse link power control messages, as well as other types of overhead messages. The messages can be directed to individual access terminals or can be directed to multiple access terminals. In one embodiment, some or all of the messages can be broadcast messages that are directed to all access terminals within the coverage area served by the SSCH.


After generating the messages, the transmitter proceeds to block 540 and encodes the messages. The messages can be combined and jointly encoded, with a single CRC generated for the combined message. In another embodiment, some of the messages can be unicast messages each directed to a single access terminal and the message can include a CRC based on the unicast message contents. The SSCH messages can include a combination of combined and unicast messages. The transmitter encodes the messages to generate SSCH symbols. In one embodiment, each symbol is configured as a modulation symbol for a corresponding sub-carrier.


The transmitter proceeds to block 550 and adjusts the power density associated with each encoded message. In the case of a unicast message, the transmitter can adjust the power density of the message based on the quality of the communication link between the transmitter and the desired access terminal. In the case of a multicast or broadcast message, the transmitter can adjust the power density of the message based on the worst communication link, which typically corresponds to an access terminal at an edge of the coverage area supported by the SSCH.


The transmitter proceeds to block 560 and modulates the assigned resources with the message symbols. In one embodiment, the transmitter interleaves the message symbols across the assigned sub-carriers by mapping the symbols of a message to an assigned sub-carrier in a round-robin fashion. The transmitter modulates the sub-carrier with the message symbol.


In one embodiment, the transmitter can modulate the sub-carriers using distinct modulation formats based on the message. For example, the transmitter can modulate signaling messages, such as forward link and reverse link block assignment messages using a first modulation format, and can modulate ACK messages or some other message, using a second modulation format. The transmitter can implement various modulation formats, including but not limited to, On-Off-Keying, Binary Phase Shift Keying (BPSK), Quadrature Phase Shift Keying (QPSK), or some other modulation format.


The transmitter proceeds to block 570 and transforms the sub-carriers to OFDM symbols. In one embodiment, the modulation and sub-carrier transformation can be performed by the same module. In other embodiments, the modulation and transformation are distinct. The transmitter can, for example, implement an IFFT module that maps the total set of OFDM sub-carriers to an equivalent sized set of time domain symbols.


The transmitter proceeds to block 580 and transmits the OFDM symbols that include the SSCH. The transmitter can, for example, upconvert the OFDM symbols to a predetermined operating band prior to transmitting the OFDM symbols.


Methods and apparatus for generating a shared signaling channel (SSCH) for an OFDMA wireless communication system have been described herein. The SSCH can be an FDM channel that is assigned a predetermined bandwidth. The predetermined bandwidth establishes an overhead bandwidth used by the SSCH. The overhead bandwidth can be fixed by fixing the number of sub-carriers assigned to the SSCH.


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.


The power overhead used by the SSCH can be variable. The messages within the SSCH can be power controlled to a level necessary to satisfy a link requirement. The SSCH messages can be unicast messages and the power of the unicast messages can be controlled to a level dictated by the communication link to the desired access terminal. When multicast or broadcast messages are included, the SSCH can control the power of the combined message to satisfy the worst case communication link experienced by the destination access terminals. The FDM SSCH configuration allows much greater flexibility in the power resources that need to be allocated to support the channel.


The various illustrative logical blocks, modules, and circuits described in connection with the embodiments disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor (DSP), a Reduced Instruction Set Computer (RISC) processor, an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, for example, a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.


The steps of a method, process, or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two.


A software module may reside in RAM memory, flash memory, non-volatile memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. Further, the various methods may be performed in the order shown in the embodiments or may be performed using a modified order of steps. Additionally, one or more process or method steps may be omitted or one or more process or method steps may be added to the methods and processes. An additional step, block, or action may be added in the beginning, end, or intervening existing elements of the methods and processes.


The above description of the disclosed embodiments is provided to enable any person of ordinary skill in the art to make or use the disclosure. Various modifications to these embodiments will be readily apparent to those of ordinary skill in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the disclosure. Thus, the disclosure is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims
  • 1. A method of generating signaling channel messages in a wireless communication system including a plurality of sub-carriers spanning at least a portion of an operating frequency band, the method comprising: assigning resources in a predetermined bandwidth to a signaling channel;generating at least one message;encoding the at least one message to generate at least two message symbols comprising a first message symbol and a second message symbol;controlling a power density of the at least two message symbols; andmodulating at least a portion of the resources assigned to the signaling channel, the modulating comprisingmodulating at least a first sub-carrier assigned to the signaling channel with the first message symbol, andmodulating at least a second sub-carrier assigned to the signaling channel with the second message symbol.
  • 2. The method of claim 1, further comprising: transforming the plurality of sub-carriers, including the first and second sub-carriers within the predetermined bandwidth assigned to the signaling channel, to an OFDM symbol; andtransmitting the OFDM symbol over a wireless communication link.
  • 3. The method of claim 1, wherein assigning resources comprises: determining a number of sub-carriers from the plurality of sub-carriers corresponding to the predetermined bandwidth; andassigning a subset of the plurality of sub-carriers equal to the number of sub-carriers to the signaling channel.
  • 4. The method of claim 3, wherein the assigning the subset of the plurality of sub-carriers comprises determining the subset of sub-carriers based in part on a frequency hopping algorithm.
  • 5. The method of claim 1, wherein assigning resources comprises: assigning a set of logical resources corresponding to the predetermined bandwidth to the signaling channel; andmapping the set of logical resources to a corresponding subset of the plurality of sub-carriers.
  • 6. The method of claim 5, wherein mapping the set of logical resources comprises mapping the set of logical resources to the corresponding subset of the plurality of sub-carriers based in part on a frequency hopping algorithm.
  • 7. The method of claim 5, wherein the corresponding subset of the plurality of sub-carriers is varied periodically by a frequency hopping algorithm.
  • 8. The method of claim 5, wherein the corresponding subset of the plurality of sub-carriers is varied in accordance with a predetermined frequency hopping algorithm.
  • 9. The method of claim 1, wherein generating at least one message comprises generating at least one access grant message directed to a particular access terminal.
  • 10. The method of claim 9, wherein the at least one access grant message comprises a Media Access Control Identification (MACID) corresponding to the particular access terminal.
  • 11. The method of claim 1, wherein generating at least one message comprises generating at least one link assignment block message directed to a plurality of access terminals.
  • 12. The method of claim 11, wherein the at least one link assignment block message comprises a broadcast Media Access Control Identification (MACID).
  • 13. The method of claim 1, wherein generating at least one message comprises generating at least one acknowledgement (ACK) message in response to a received transmission from an access terminal.
  • 14. The method of claim 1, wherein generating at least one message comprises generating at least one power control message directed to a particular access terminal.
  • 15. The method of claim 1, wherein encoding the at least one message comprises: generating a Cyclic Redundancy Code (CRC) corresponding to a single message; andappending the CRC to the single message.
  • 16. The method of claim 1, wherein encoding the at least one message comprises: aggregating multiple messages to generate a combined message;encoding the combined message; andappending the combined message with a Cyclic Redundancy Check (CRC) corresponding to the combined message.
  • 17. The method of claim 1, wherein modulating at least the portion of the resources further comprises spreading the at least two message symbols across at least two sub-carriers assigned to the signaling channel.
  • 18. The method of claim 1, wherein generating at least one message comprises generating a unicast message directed to a particular access terminal.
  • 19. The method of claim 1, wherein generating at least one message comprises generating a multicast message directed to a particular group of access terminals.
  • 20. The method of claim 19, wherein controlling the power density comprises selecting the power density based on a worst access terminal in the particular group of access terminals.
  • 21. The method of claim 1, wherein generating at least one message comprises generating a broadcast message directed to any access terminal within a coverage area served by the signaling channel.
  • 22. The method of claim 21, wherein controlling the power density comprises selecting the power density based on a worst access terminal within the coverage area.
  • 23. The method of claim 1, wherein encoding the at least one message comprises aggregating multiple messages, andjointly encoding the multiple messages.
  • 24. A method of generating signaling channel messages in a wireless communication system including a plurality of sub-carriers spanning at least a portion of an operating frequency band, the method comprising: generating at least one message for a signaling channel;encoding the at least one message to generate at least one message symbol;adjusting a power density associated with the at least one message symbol;determining a subset of sub-carriers assigned to the signaling channel from the plurality of sub-carriers; andmodulating the subset of sub-carriers with the at least one message symbol.
  • 25. The method of claim 24, wherein generating at least one message comprises generating a unicast message directed to a particular access terminal.
  • 26. The method of claim 24, wherein generating at least one message comprises generating a multicast message directed to a particular group of access terminals.
  • 27. The method of claim 24, wherein generating at least one message comprises generating a broadcast message directed to any access terminal within a coverage area served by the signaling channel.
  • 28. The method of claim 24, further comprising; transforming the plurality of sub-carriers to an OFDM symbol; andtransmitting the OFDM symbol over a wireless channel.
  • 29. The method of claim 24, wherein the determining the subset of sub-carriers assigned to the signaling channel comprises determining the subset of sub-carriers based in part on a frequency hopping algorithm.
  • 30. The method of claim 24, wherein the subset of sub-carriers is varied periodically by a frequency hopping algorithm.
  • 31. The method of claim 24, wherein the subset of sub-carriers is varied in accordance with a predetermined frequency hopping algorithm.
  • 32. The method of claim 24, wherein the determining the subset of sub-carriers assigned to the signaling channel comprises determining logical resources assigned to the signaling channel, andmapping the logical resources to the subset of sub-carriers.
  • 33. The method of claim 24, wherein the generating at least one message comprises generating an acknowledgement (ACK) message.
  • 34. The method of claim 24, wherein the encoding the at least one message comprises spreading the at least one message.
  • 35. The method of claim 24, wherein the subset of sub-carriers assigned to the signaling channel includes a contiguous block of sub-carriers.
  • 36. The method of claim 24, wherein the subset of sub-carriers is varied with frequency hopping to maintain a contiguous block structure.
  • 37. An apparatus configured to generate signaling channel messages in a wireless communication system including a plurality of sub-carriers spanning at least a portion of an operating frequency band, the apparatus comprising: means for generating at least one message for a signaling channel;means for encoding the at least one message to generate at least one message symbol;means for adjusting a power density associated with the at least one message symbol;means for determining a subset of sub-carriers assigned to the signaling channel from the plurality of sub-carriers; andmeans for modulating the subset of sub-carriers with the at least one message symbol.
  • 38. The apparatus of claim 37, wherein the means for generating the at least one message comprises means for generating a broadcast signaling message.
  • 39. The apparatus of claim 37, wherein the means for generating the at least one message comprises means for generating a unicast signaling message.
  • 40. The apparatus of claim 37, wherein the means for generating the at least one message comprises means for generating a power control message.
  • 41. The apparatus of claim 37, wherein the means for determining the subset of sub-carriers assigned to the signaling channel comprises means for determining the subset of sub-carriers based in part on a frequency hopping algorithm.
  • 42. The apparatus of claim 37, wherein the means for generating at least one message comprises means for generating an acknowledgement (ACK) message.
  • 43. The apparatus of claim 37, wherein the means for encoding the at least one message comprises means for spreading the at least one message.
  • 44. The apparatus of claim 37, wherein the subset of sub-carriers assigned to the signaling channel includes a contiguous block of sub-carriers.
  • 45. The apparatus of claim 44, wherein the subset of sub-carriers is varied with frequency hopping to maintain a contiguous block structure.
  • 46. An apparatus for generating messages in a wireless communication system including a plurality of sub-carriers spanning at least a portion of an operating frequency band, the apparatus comprising: means for assigning resources in a predetermined bandwidth to a signaling channel;means for generating at least one message;means for encoding the at least one message to generate at least two message symbols comprising a first message symbol and a second message symbol;means for controlling a power density of the at least two message symbols; andmeans for modulating at least a portion of the resources assigned to the signaling channel, the means for modulating comprisingmeans for modulating at least a first sub-carrier assigned to the signaling channel with the first message symbol, andmeans for modulating at least a second sub-carrier assigned to the signaling channel with the second message symbol.
  • 47. The apparatus of claim 46, further comprising: means for transforming the plurality of sub-carriers, including the first and second sub-carriers, to an OFDM symbol; andmeans for transmitting the OFDM symbol over a wireless communication link.
  • 48. The apparatus of claim 46, wherein the means for assigning resources comprises: means for determining a number of sub-carriers from the plurality of sub-carriers corresponding to the predetermined bandwidth, andmeans for assigning a subset of the plurality of sub-carriers equal to the number of sub-carriers to the signaling channel.
  • 49. The apparatus of claim 46, wherein the means for assigning resources comprises: means for assigning a set of logical resources corresponding to the predetermined bandwidth to the signaling channel, andmeans for mapping the set of logical resources to a corresponding subset of the plurality of sub-carriers.
  • 50. The apparatus of claim 49, wherein the means for mapping the set of logical resources comprises means for mapping the set of logical resources to the corresponding subset of the plurality of sub-carriers based in part on a frequency hopping algorithm.
  • 51. The apparatus of claim 49, wherein the corresponding subset of the plurality of sub-carriers is varied periodically by a frequency hopping algorithm.
  • 52. The apparatus of claim 49, wherein the corresponding subset of the plurality of sub-carriers is varied in accordance with a predetermined frequency hopping algorithm.
  • 53. The apparatus of claim 46, wherein the means for generating at least one message comprises means for generating a unicast message directed to a particular access terminal.
  • 54. The apparatus of claim 46, wherein the means for generating at least one message comprises means for generating a multicast message directed to a particular group of access terminals.
  • 55. The apparatus of claim 46, wherein the means for generating at least one message comprises means for generating a broadcast message directed to any access terminal within a coverage area served by the signaling channel.
  • 56. The apparatus of claim 46, wherein the means for encoding the at least one message comprises means for aggregating multiple messages, andmeans for jointly encoding the multiple messages.
  • 57. A non-transitory computer-readable medium encoded with a computer program for a wireless communication system including a plurality of sub-carriers spanning at least a portion of an operating frequency band, comprising: instructions for assigning resources in a predetermined bandwidth to a signaling channel;instructions for generating at least one message;instructions for encoding the at least one message to generate at least two message symbols comprising a first message symbol and a second message symbol;instructions for controlling a power density of the at least two message symbols; andinstructions for modulating at least a portion of the resources assigned to the signaling channel, the instructions for modulating comprisinginstructions for modulating at least a first sub-carrier assigned to the signaling channel with the first message symbol, andinstructions for modulating at least a second sub-carrier assigned to the signaling channel with the second message symbol.
  • 58. A non-transitory computer-readable medium encoded with a computer program for a wireless communication system including a plurality of sub-carriers spanning at least a portion of an operating frequency band, comprising: instructions for generating at least one message;instructions for encoding the at least one message to generate at least one message symbol;instructions for adjusting a power density associated with the at least one message symbol;instructions for determining a subset of sub-carriers assigned to a signaling channel from the plurality of sub-carriers; andinstructions for modulating the subset of sub-carriers with the at least one message symbol.
  • 59. An apparatus configured to generate signaling channel messages in a wireless communication system including a plurality of sub-carriers spanning at least a portion of an operating frequency band, the apparatus comprising: at least one processor configured to generate at least one message for a signaling channel, to encode the at least one message to generate at least one message symbol, to adjust a power density associated with the at least one message symbol, to determine a subset of sub-carriers assigned to the signaling channel from the plurality of sub-carriers, and to modulate the subset of sub-carriers with the at least one message symbol; anda data buffer configured to store data for the at least one message.
  • 60. The apparatus of claim 59, wherein the at least one processor is configured to generate a unicast message.
  • 61. The apparatus of claim 59, wherein the at least one processor is configured to generate a multicast message.
  • 62. The apparatus of claim 59, wherein the at least one processor is configured to generate a broadcast message.
  • 63. The apparatus of claim 59, wherein the at least one processor is configured to generate an acknowledgement (ACK) message.
  • 64. The apparatus of claim 59, wherein the at least one processor is configured to spread the at least one message.
  • 65. The apparatus of claim 59, wherein the at least one processor is configured to determine the subset of sub-carriers based in part on a frequency hopping algorithm.
  • 66. The apparatus of claim 59, wherein the subset of sub-carriers assigned to the signaling channel includes a contiguous block of sub-carriers.
  • 67. The apparatus of claim 66, wherein the subset of sub-carriers is varied with frequency hopping to maintain a contiguous block structure.
  • 68. An apparatus for generating messages in a wireless communication system including a plurality of sub-carriers spanning at least a portion of an operating frequency band, the apparatus comprising: at least one processor configured to assign resources in a predetermined bandwidth to a signaling channel, to generate at least one message, to encode the at least one message to generate at least two message symbols comprising a first message symbol and a second message symbol, to control a power density of the at least two message symbols, to modulate at least a portion of the resources assigned to the signaling channel, to modulate at least a first sub-carrier assigned to the signaling channel with the first message symbol, and to modulate at least a second sub-carrier assigned to the signaling channel with the second message symbol; anda data buffer configured to store data for the at least one message.
  • 69. The apparatus of claim 68, wherein the at least one processor is configured to transform the plurality of sub-carriers, including the first and second sub-carriers, to an OFDM symbol, and to transmit the OFDM symbol over a wireless communication link.
  • 70. The apparatus of claim 68, wherein the at least one processor is configured to determine a number of sub-carriers from the plurality of sub-carriers corresponding to the predetermined bandwidth, and to assign a subset of the plurality of sub-carriers equal to the number of sub-carriers to the signaling channel.
  • 71. The apparatus of claim 68, wherein the at least one processor is configured to assign a set of logical resources corresponding to the predetermined bandwidth to the signaling channel, and to map the set of logical resources to a corresponding subset of the plurality of sub-carriers.
  • 72. The apparatus of claim 71, wherein the at least one processor is configured to map the set of logical resources to the corresponding subset of the plurality of sub-carriers based in part on a frequency hopping algorithm.
  • 73. The apparatus of claim 71, wherein the corresponding subset of the plurality of sub-carriers is varied periodically by a frequency hopping algorithm.
  • 74. The apparatus of claim 71, wherein the corresponding subset of the plurality of sub-carriers is varied in accordance with a predetermined frequency hopping algorithm.
  • 75. The apparatus of claim 68, wherein the at least one processor is configured to generate a unicast message.
  • 76. The apparatus of claim 68, wherein the at least one processor is configured to generate a multicast message.
  • 77. The apparatus of claim 68, wherein the at least one processor is configured to generate a broadcast message.
  • 78. The apparatus of claim 68, wherein the at least one processor is configured to aggregate multiple messages and to jointly encode the multiple messages.
US Referenced Citations (775)
Number Name Date Kind
4393276 Steele et al. 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 et al. 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
5553069 Ueno et al. Sep 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 Gilhousenn 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 et al. Oct 1998 A
5828650 Malkamaki et al. Oct 1998 A
5838268 Frenkel et al. Nov 1998 A
5867478 Baum et al. Feb 1999 A
5870393 Yano et al. Feb 1999 A
5887023 Mabuchi et al. 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 et al. Sep 1999 A
5955992 Shattil et al. Sep 1999 A
5956642 Larsson et al. Sep 1999 A
5995992 Eckard et al. Nov 1999 A
5999826 Whinnett Dec 1999 A
6002942 Park et al. 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 et al. Jun 2000 A
6075797 Thomas Jun 2000 A
6076114 Wesley Jun 2000 A
6088345 Sakoda et al. Jul 2000 A
6088592 Doner et al. Jul 2000 A
6108323 Gray et al. Aug 2000 A
6108550 Wiorek et al. Aug 2000 A
6112094 Dentt et al. Aug 2000 A
6128776 Kang et al. 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
6172993 Kim et al. Jan 2001 B1
6175550 Van Nee et al. 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 et al. 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 et al. 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 et al. 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 et al. 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 et al. 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 et al. Jan 2004 B1
6675012 Gray et al. Jan 2004 B2
6678318 Lai et al. 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 et al. Mar 2004 B1
6717908 Vijayan 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 et al. 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
6766146 Park et al. Jul 2004 B1
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 Medvedevv et al. Mar 2005 B2
6870808 Liu et al. Mar 2005 B1
6870826 Ishizu et al. 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 et al. 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
6954448 Farley et al. Oct 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 et al. 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 et al. Mar 2006 B1
7020110 Walton et al. Mar 2006 B2
7023880 El-Maleh et al. Apr 2006 B2
7039356 Nguyen May 2006 B2
7039370 Laroia et al. May 2006 B2
7042856 Walton 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
7095709 Walton et al. Aug 2006 B2
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
7126928 Tiedemann, Jr. 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
7142864 Laroia 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
7184713 Kadous et al. Feb 2007 B2
7188300 Eriksson et al. Mar 2007 B2
7197282 Dent et al. Mar 2007 B2
7200177 Miyoshi et al. 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 et al. Aug 2007 B2
7260153 Nissani 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 et al. Dec 2007 B2
7313126 Yun et al. Dec 2007 B2
7313174 Alard et al. Dec 2007 B2
7313407 Shapira et al. Dec 2007 B2
7327812 Auer et al. 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-Surcobe 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 et al. Aug 2008 B2
7418043 Shattil et al. Aug 2008 B2
7418246 Kim et al. Aug 2008 B2
7423991 Cho et al. Sep 2008 B2
7426426 Van Baren et al. 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 et al. Nov 2008 B1
7450532 Chae et al. Nov 2008 B2
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 et al. Mar 2009 B2
7508748 Kadous Mar 2009 B2
7508842 Baum et al. Mar 2009 B2
7512096 Kuzminskiy et al. Mar 2009 B2
7545867 Lou et al. Jun 2009 B1
7548506 Maa et al. Jun 2009 B2
7551546 Ma et al. Jun 2009 B2
7551564 Mattina Jun 2009 B2
7558293 Choi et al. Jul 2009 B2
7567621 Sampath et al. Jul 2009 B2
7573900 Kim et al. Aug 2009 B2
7599327 Zhuang Oct 2009 B2
7616955 Kim et al. 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
7899497 Kish et al. Mar 2011 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
8014271 Laroia et al. Sep 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
8582509 Khandekar et al. Nov 2013 B2
8582548 Gore et al. Nov 2013 B2
8879511 Agrawal et al. Nov 2014 B2
8885628 Palanki et al. Nov 2014 B2
20010021650 Bilgic et al. Sep 2001 A1
20010024427 Suzuki Sep 2001 A1
20010030948 Tiedemann, Jr. Oct 2001 A1
20010047424 Alastalo et al. Nov 2001 A1
20010053140 Choi et al. Dec 2001 A1
20010055294 Motoyoshi Dec 2001 A1
20010055297 Benveniste et al. Dec 2001 A1
20020000948 Chun et al. Jan 2002 A1
20020015405 Sepponen et al. Feb 2002 A1
20020018157 Zhang et al. Feb 2002 A1
20020039912 Yamaguchi et al. Apr 2002 A1
20020044524 Laroia et al. Apr 2002 A1
20020058525 Kasapi et al. May 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
20020122381 Wu et al. Sep 2002 A1
20020122403 Hashem et al. Sep 2002 A1
20020128035 Jokinen et al. Sep 2002 A1
20020147953 Catreux et al. Oct 2002 A1
20020159422 Li et al. Oct 2002 A1
20020160769 Gray 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
20020181571 Yamano et al. Dec 2002 A1
20020193146 Wallace et al. Dec 2002 A1
20030002464 Rezaiifar et al. Jan 2003 A1
20030020651 Crilly, Jr. et al. Jan 2003 A1
20030027579 Sydon Feb 2003 A1
20030035491 Walton et al. Feb 2003 A1
20030036359 Dent 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
20030072254 Ma 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
20030086371 Walton et al. May 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
20030123414 Tong et al. Jul 2003 A1
20030125040 Walton et al. Jul 2003 A1
20030128658 Walton et al. Jul 2003 A1
20030133426 Schein et al. Jul 2003 A1
20030142648 Semper Jul 2003 A1
20030142729 Subrahmanya et al. Jul 2003 A1
20030147371 Choi et al. Aug 2003 A1
20030161281 Dulin et al. Aug 2003 A1
20030161282 Medvedev et al. Aug 2003 A1
20030165189 Kadous et al. Sep 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
20030202560 Tiedemann, Jr. et al. Oct 2003 A1
20030216156 Chun et al. Nov 2003 A1
20030228850 Hwang Dec 2003 A1
20030235255 Ketchum et al. Dec 2003 A1
20040001429 Ma et al. Jan 2004 A1
20040001460 Bevan et al. Jan 2004 A1
20040002364 Trikkonen et al. Jan 2004 A1
20040009783 Miyoshi et al. Jan 2004 A1
20040010623 Sher et al. Jan 2004 A1
20040015692 Green et al. Jan 2004 A1
20040017785 Zelst et al. Jan 2004 A1
20040032443 Moylan et al. Feb 2004 A1
20040042558 Hwang et al. Mar 2004 A1
20040048609 Kosaka Mar 2004 A1
20040048630 Shapira et al. Mar 2004 A1
20040054999 Willen et al. Mar 2004 A1
20040057394 Holtzman et al. Mar 2004 A1
20040058687 Kim et al. Mar 2004 A1
20040066754 Hottinen et al. Apr 2004 A1
20040066761 Giannakis et al. Apr 2004 A1
20040066772 Moon 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
20040077345 Turner et al. Apr 2004 A1
20040077379 Smith et al. Apr 2004 A1
20040081073 Walton et al. Apr 2004 A1
20040081195 El-Maleh et al. Apr 2004 A1
20040087325 Cheng et al. May 2004 A1
20040095907 Agee et al. May 2004 A1
20040097215 Abe et al. May 2004 A1
20040097240 Chen et al. May 2004 A1
20040098505 Clemmensen et al. 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
20040128605 Sibecas et al. Jul 2004 A1
20040131007 Smee et al. Jul 2004 A1
20040131008 Zuniga et al. Jul 2004 A1
20040131038 Kim 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 et al. Aug 2004 A1
20040160933 Odenwalder et al. Aug 2004 A1
20040162083 Chen et al. Aug 2004 A1
20040165564 Kim et al. Aug 2004 A1
20040166867 Hawe et al. 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
20040178954 Vook et al. Sep 2004 A1
20040179480 Attar et al. Sep 2004 A1
20040179494 Attar et al. Sep 2004 A1
20040179506 Padovani et al. Sep 2004 A1
20040179627 Ketchum et al. Sep 2004 A1
20040181569 Attar et al. Sep 2004 A1
20040185792 Alexiou et al. Sep 2004 A1
20040190640 Dubuc et al. Sep 2004 A1
20040202257 Mehta et al. Oct 2004 A1
20040208138 Hayashi et al. Oct 2004 A1
20040218520 Aizawa et al. Nov 2004 A1
20040219819 Di Mascio et al. Nov 2004 A1
20040219919 Whinnett et al. Nov 2004 A1
20040224711 Panchal et al. Nov 2004 A1
20040228267 Agrawal et al. Nov 2004 A1
20040228313 Cheng et al. Nov 2004 A1
20040229615 Agrawal et al. Nov 2004 A1
20040240419 Abrishamkar et al. Dec 2004 A1
20040240572 Brutel et al. Dec 2004 A1
20040248604 Vaidyanathan et al. 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
20040264585 Borran et al. Dec 2004 A1
20040264593 Shim et al. Dec 2004 A1
20050002412 Sagfors et al. Jan 2005 A1
20050002440 Alamouti et al. Jan 2005 A1
20050002467 Seo 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
20050025093 Yun et al. Feb 2005 A1
20050030886 Wu et al. Feb 2005 A1
20050030964 Tiedemann, Jr. et al. Feb 2005 A1
20050034079 Gunasekar et al. Feb 2005 A1
20050041611 Sandhu et al. Feb 2005 A1
20050041618 Wei et al. Feb 2005 A1
20050041750 Lau 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
20050053151 Lin et al. Mar 2005 A1
20050063298 Ling et al. Mar 2005 A1
20050068921 Liu Mar 2005 A1
20050073976 Fujii Apr 2005 A1
20050084000 Krauss et al. Apr 2005 A1
20050085195 Tong et al. Apr 2005 A1
20050085236 Gerlach et al. Apr 2005 A1
20050111397 Attar et al. May 2005 A1
20050113100 Oprescu-Surcobe et al. May 2005 A1
20050122898 Jang et al. Jun 2005 A1
20050128683 Watanabe et al. Jun 2005 A1
20050128983 Kim 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
20050147025 Auer et al. Jul 2005 A1
20050152484 Sandhu 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
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
20050215196 Krishnan et al. Sep 2005 A1
20050215251 Krishnan et al. Sep 2005 A1
20050226204 Uehara et al. Oct 2005 A1
20050239465 Lee et al. Oct 2005 A1
20050243791 Park et al. Nov 2005 A1
20050246548 Laitinen et al. 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 et al. Nov 2005 A1
20050259757 Wu et al. Nov 2005 A1
20050265220 Erlich et al. Dec 2005 A1
20050265293 Ro et al. Dec 2005 A1
20050265470 Kishigami et al. Dec 2005 A1
20050271012 Agrawal 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 et al. 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
20060034164 Ozluturk Feb 2006 A1
20060034173 Teague et al. Feb 2006 A1
20060039332 Kotzin Feb 2006 A1
20060039344 Khan et al. Feb 2006 A1
20060039500 Yun et al. Feb 2006 A1
20060040655 Kim et al. 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
20060089104 Kaikkonen et al. Apr 2006 A1
20060092054 Li et al. May 2006 A1
20060093065 Thomas et al. May 2006 A1
20060104333 Rainbolt et al. May 2006 A1
20060104381 Menon et al. May 2006 A1
20060107171 Skraparlis May 2006 A1
20060109814 Kuzminskiy 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
20060193294 Jorswieck 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 et al. Oct 2006 A1
20060233131 Gore et al. Oct 2006 A1
20060233222 Reial 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
20060280114 Osseiran 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 et al. Jan 2007 A1
20070019596 Barriac et al. Jan 2007 A1
20070025345 Bachl et al. Feb 2007 A1
20070041311 Baum 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
20070070952 Yoon 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
20070097927 Gorokhov et al. May 2007 A1
20070097942 Gorokhov et al. May 2007 A1
20070097981 Papasakellariou et al. May 2007 A1
20070098050 Khandekar et al. May 2007 A1
20070098120 Wang May 2007 A1
20070099666 Astely et al. 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
20070230324 Li et al. Oct 2007 A1
20070242653 Yang et al. Oct 2007 A1
20070263743 Lee et al. Nov 2007 A1
20070280336 Zhangg 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 Hoo 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 Leee 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
20090129501 Mehta et al. May 2009 A1
20090180459 Orlikk 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 Wengerterr 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
20110255518 Agrawal et al. Oct 2011 A9
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
20130208681 Gore et al. Aug 2013 A1
20130287138 Ma et al. Oct 2013 A1
20130315200 Gorokhov et al. Nov 2013 A1
20140247898 Laroia et al. Sep 2014 A1
20140376518 Palanki et al. Dec 2014 A1
Foreign Referenced Citations (434)
Number Date Country
2005319084 Apr 2010 AU
2348137 Nov 2001 CA
2477536 Sep 2003 CA
2540688 May 2005 CA
2577369 Mar 2006 CA
14001993 Dec 1994 CL
8461997 Jan 1998 CL
9531997 Jan 1998 CL
27102004 Aug 2005 CL
22892004 Sep 2005 CL
30862004 Oct 2005 CL
29932005 May 2006 CL
29012006 Oct 2006 CL
29022006 Oct 2006 CL
29032006 Oct 2006 CL
29042006 Oct 2006 CL
29062006 Oct 2006 CL
29082006 Oct 2006 CL
15202006 Dec 2006 CL
22032006 Feb 2007 CL
15212006 Mar 2007 CL
14922006 Apr 2007 CL
14892006 May 2007 CL
14902006 May 2007 CL
46151 Dec 2009 CL
29072006 Jan 2010 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
1636346 Jul 2005 CN
1642051 Jul 2005 CN
1642335 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
0740431 Oct 1996 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
1172983 Jan 2002 EP
1180907 Feb 2002 EP
1187506 Mar 2002 EP
1204217 May 2002 EP
1255369 Nov 2002 EP
1267513 Dec 2002 EP
1074099 Feb 2003 EP
1286490 Feb 2003 EP
1335504 Aug 2003 EP
1351538 Oct 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
H04111544 Apr 1992 JP
4301931 Oct 1992 JP
H0746248 Feb 1995 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
9284200 Oct 1997 JP
10117162 May 1998 JP
H10210000 Aug 1998 JP
10322304 Dec 1998 JP
H11168453 Jun 1999 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
2000022618 Jan 2000 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
2002111556 Apr 2002 JP
2002515203 May 2002 JP
2002290148 Oct 2002 JP
2002534925 Oct 2002 JP
2002534941 Oct 2002 JP
2002538696 Nov 2002 JP
200318054 Jan 2003 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
2003235072 Aug 2003 JP
2003249907 Sep 2003 JP
2003292667 Oct 2003 JP
2003318857 Nov 2003 JP
2003347985 Dec 2003 JP
2003348047 Dec 2003 JP
2003536308 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
2004507151 Mar 2004 JP
2004507950 Mar 2004 JP
2004153676 May 2004 JP
2004158901 Jun 2004 JP
2004162388 Jun 2004 JP
2004194262 Jul 2004 JP
2004201296 Jul 2004 JP
2004215022 Jul 2004 JP
2004221972 Aug 2004 JP
2004266818 Sep 2004 JP
2004529524 Sep 2004 JP
2004297276 Oct 2004 JP
2004297370 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
2005110130 Apr 2005 JP
2005130491 May 2005 JP
2005167502 Jun 2005 JP
2005197772 Jul 2005 JP
2005203961 Jul 2005 JP
2005521327 Jul 2005 JP
2005521358 Jul 2005 JP
2005236678 Sep 2005 JP
2006505172 Feb 2006 JP
2006506860 Feb 2006 JP
2006211537 Aug 2006 JP
2006524930 Nov 2006 JP
2007503790 Feb 2007 JP
2007519281 Jul 2007 JP
2007520309 Jul 2007 JP
2007525043 Aug 2007 JP
2007527127 Sep 2007 JP
2008505587 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
20050061559 Jun 2005 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
2183387 Jun 2002 RU
2192094 Oct 2002 RU
2197778 Jan 2003 RU
2201033 Mar 2003 RU
2207723 Jun 2003 RU
2208913 Jul 2003 RU
2210866 Aug 2003 RU
2216101 Nov 2003 RU
2216103 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
2003125268 Feb 2005 RU
2285388 Mar 2005 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
2335864 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
I232040 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
0004728 Jan 2000 WO
WO0002397 Jan 2000 WO
WO0033503 Jun 2000 WO
0041542 Jul 2000 WO
0051389 Aug 2000 WO
WO0070897 Nov 2000 WO
WO0101596 Jan 2001 WO
WO0117125 Mar 2001 WO
WO0126269 Apr 2001 WO
WO0139523 May 2001 WO
WO0145300 Jun 2001 WO
WO0148969 Jul 2001 WO
WO0158054 Aug 2001 WO
WO0160106 Aug 2001 WO
0165637 Sep 2001 WO
WO0169814 Sep 2001 WO
WO0182543 Nov 2001 WO
WO0182544 Nov 2001 WO
WO0189112 Nov 2001 WO
0195427 Dec 2001 WO
WO0193505 Dec 2001 WO
WO0207375 Jan 2002 WO
WO0224936 Jan 2002 WO
0215432 Feb 2002 WO
WO0215616 Feb 2002 WO
WO0219746 Mar 2002 WO
WO0231991 Apr 2002 WO
WO0233848 Apr 2002 WO
0245293 Jun 2002 WO
WO0245456 Jun 2002 WO
WO0249305 Jun 2002 WO
WO0249306 Jun 2002 WO
WO0249385 Jun 2002 WO
WO02060138 Aug 2002 WO
WO02065675 Aug 2002 WO
WO02082689 Oct 2002 WO
WO02082743 Oct 2002 WO
WO02089434 Nov 2002 WO
WO02093782 Nov 2002 WO
WO02093819 Nov 2002 WO
WO02100027 Dec 2002 WO
WO03001761 Jan 2003 WO
WO03001981 Jan 2003 WO
WO03003617 Jan 2003 WO
WO03001696 Mar 2003 WO
WO03019819 Mar 2003 WO
WO03030414 Apr 2003 WO
WO03034644 Apr 2003 WO
WO03043262 May 2003 WO
WO03043369 May 2003 WO
03049409 Jun 2003 WO
WO03058871 Jul 2003 WO
03069816 Aug 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
2004028037 Apr 2004 WO
WO2004030238 Apr 2004 WO
WO2004032443 Apr 2004 WO
2004038984 May 2004 WO
WO2004038954 May 2004 WO
WO2004038972 May 2004 WO
WO2004038988 May 2004 WO
WO2004040690 May 2004 WO
WO2004040827 May 2004 WO
WO2004047354 Jun 2004 WO
WO2004049618 Jun 2004 WO
WO2004051872 Jun 2004 WO
2004056022 Jul 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
WO2004086706 Oct 2004 WO
WO2004086711 Oct 2004 WO
WO2004095730 Nov 2004 WO
WO2004095851 Nov 2004 WO
WO2004095854 Nov 2004 WO
WO2004098072 Nov 2004 WO
WO2004098222 Nov 2004 WO
WO2004102815 Nov 2004 WO
WO2004102816 Nov 2004 WO
2004114564 Dec 2004 WO
2004114615 Dec 2004 WO
WO2004105272 Dec 2004 WO
WO2004114549 Dec 2004 WO
WO2005002253 Jan 2005 WO
WO2005011163 Feb 2005 WO
WO2005015795 Feb 2005 WO
WO2005015797 Feb 2005 WO
WO2005015810 Feb 2005 WO
WO2005015941 Feb 2005 WO
WO2005018270 Feb 2005 WO
WO2005020488 Mar 2005 WO
WO2005020490 Mar 2005 WO
WO2005022811 Mar 2005 WO
WO2005025110 Mar 2005 WO
WO2005032004 Apr 2005 WO
2005043780 May 2005 WO
WO2005043855 May 2005 WO
WO2005046080 May 2005 WO
2005055465 Jun 2005 WO
WO2005005527 Jun 2005 WO
WO2005055484 Jun 2005 WO
WO2005055527 Jun 2005 WO
WO2005060192 Jun 2005 WO
WO2005065062 Jul 2005 WO
WO2005069538 Jul 2005 WO
WO2005074184 Aug 2005 WO
2005086440 Sep 2005 WO
WO2005096538 Oct 2005 WO
WO2005122628 Dec 2005 WO
WO2006007292 Jan 2006 WO
WO2006019710 Feb 2006 WO
2006026344 Mar 2006 WO
WO2006044487 Apr 2006 WO
2006062356 Jun 2006 WO
WO2006069300 Jun 2006 WO
WO2006069301 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
WO2006134032 Dec 2006 WO
WO2006138196 Dec 2006 WO
WO2006138573 Dec 2006 WO
WO2006138581 Dec 2006 WO
2007022430 Feb 2007 WO
WO2007024934 Mar 2007 WO
WO2007025160 Mar 2007 WO
WO2007051159 Mar 2007 WO
WO2007051159 May 2007 WO
Non-Patent Literature Citations (133)
Entry
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.
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.
Groe, et al., “CDMA Mobile Radio Design,” Sep. 26, 2001, Artech House, Norwood, MA 02062, pp. 257-259.
Laroia, R. 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, pp. 20-28, XP011118149.
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.
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/ieI5/6668/28677/01284943.pdf, Retrieved on Dec. 8, 2006, pp. 46-56 (2004).
Tomcik, J.: “QFDD Technology Overview Presentation,” IEEE 802.20 Working Group on Mobile Broadband Wireless Access, Slides/pp. 1-73, Nov. 15, 2005.
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: 70-7803-8521-7.
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 Preliminary Report on Patentability—PCT/US06/060292, International Bureau of WIPO—Geneva, Switzerland, Apr. 29, 2008.
International Preliminary Report on Patentability—PCT/US06/060332, International Bureau of WIPO—Geneva, Switzerland, Apr. 29, 2008.
International Search Report—PCT/US06/060292, International Search Authority—European Patent Office, Apr. 20, 2007.
International Search Report—PCT/US06/060332, International Search Authority—European Patent Office, Apr. 19, 2007.
Written Opinion—PCT/US06/060292, International Search Authority—European Patent Office, Apr. 20, 2007.
Written Opinion—PCT/US06/060332, International Search Authority—European Patent Office, Apr. 19, 2007.
Das,Arnab, et al. “Adaptive, asynchronous incremental redundancy (A-IR) with fixed transmission time intervals TTI for HSDPA.” IEEE, pp. 10-83-1087.
“European Search Report—EP10011743, Search Authority—Munich Patent Office, Dec. 20, 2010”.
European Search Report—EP10012081, Search Authority—Munich Patent Office, Dec. 17, 2010.
European Search Report—EP10012082, Search Authority—Munich Patent Office, Dec. 20, 2010.
European Search Report—EP10012083, Search Authority—Munich Patent Office, Dec. 30, 2010.
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.
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.
Taiwanese Search Report—095139893—TIPO—Dec. 30, 2010.
Translation of Office Action in Chinese Application 2006800295980 corresponding to U.S. Appl. No. 11/260,895, citing CN1346221 and CN1383631 dated Feb. 16, 2011.
Translation of Office Action in Japan application 2008-538193 corresponding to U.S. Appl. No. 11/261,065, citing JP11196109, JP10322304 and JP09008725 dated Mar. 8, 2011.
Translation of Office Action in Korean application 10-2007-7031029 corresponding to U.S. Appl. No. 11/260,931, citing US20030202491 and KR20040063057 dated Jan. 28, 2011.
Translation of Office Action in Canadian application 2625987 corresponding to U.S. Appl. No. 11/261,065, citing CA2557369 dated Apr. 12, 2011.
Translation of Office Action in Chinese application 200680040236.1 corresponding to U.S. Appl. No. 11/261,065, citing US20040048609 and CN1402916 dated Feb. 17, 2011.
Translation of Office Action in Chinese application 200680048265.2 corresponding to U.S. Appl. No. 11/260,931, citing US6904097, WO2004095851, CN1344451 dated Jan. 26, 2011.
Translation of Office Action in Chinese application 200680048832.4 corresponding to U.S. Appl. No. 11/261,158, citing CN1132474 dated Dec. 31, 2010.
Translation of Office Action in Japanese Application 2008-514880 corresponding to U.S. Appl. No. 11/445,377, citing JP2007519281 and JP2006505172 dated Nov. 9, 2010.
Translation of Office Action in Japanese application 2008-528103 corresponding to U.S. Appl. No. 11/260,924, citing JP2005502218, JP2004534456, JP2003348047, JP2003199173, JP2004529524, JP11508417, JP2001238269, JP2005130491 and JP2003500909 dated Feb. 8, 2011.
Translation of Office Action in Japanese Application 2008-529216 corresponding to U.S. Appl. No. 11/261,159, citing GB2348776 , WO2004098222, WO2005065062 and WO2004102815.Dated Jan. 1, 2011.
Translation of Office Action in Japanese application 2008-538181 corresponding to U.S. Appl. No. 11/511,735, citing WO04064295, JP2002515203, JP8288927, JP7336323 and JP200157545 dated Jan. 25, 2011.
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).
Yongmei Dai,; Sumei Sun; Zhongding Lei; Yuan Li.: “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.
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.
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-8.
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. RAB WG1, no. San Diego, USA; 20051004, Oct. 4, 2005, pp. 1-10, XP050100715.
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.
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).
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, Jun. 15, 2003, pp. 36-40, XP010713463.
John B. Groe, Lawrence E. Larson, “CDMA Mobile Radio Design” Sep. 26, 2001, Artech House, Norwood MA02062 580530, XP002397967, pp. 157-159.
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 (2005-2011)
B. Sklar: “The process of thus correcting the channel-induced distortion is called equalization”. Digital Communications, PTR Pretence 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), pp. 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. 60. Nov. 29-Dec. 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.
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 receiver 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 Equilization 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 the 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 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, 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. 2011, 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 Transmissions,” 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, Jul. 6-8, 1999, pp. 362-368.
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, May 17, 2004. pp. 1925-1928, XP010766497.
European Search Report—EP11007140—Search Authority—Munich—Oct. 28, 2011.
European Search Report—EP11007141—Search Authority—Munich—Oct. 31, 2011.
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.
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.
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.
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.
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.
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.
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.
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.
Miorandi D., et al., “Analysis of master-slave protocols for real-time industrial communications over IEEE 802.11 WLANs” Industrial Informatics, 2004. INDIN '04, 2nd IEEE 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.
Anonymous: “3GPP TS 36.211 V8.0.0; Evolved Universal Terrestrial Radio Access (E-UTRA); Physical channels and modulation (Release 8)” 3rd Generation Partnership Project; Technical Specification Group Radio Access Network, [Online] 2007, 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, URL, http://www.IEEE802.org/20/contribs/C802.20-05-68.zip.
Nokia: “Compact signalling of multi-code allocation for HSDPA”, version 2,3GPP R1-02-0018, Jan. 11, 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.
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.
Tachikawa (Editor); “W-CDMA Mobile Communication Systems,” John Wiley & Sons Ltd., Japan, Maruzen: pp. 82-213, Jun. 25, 2001.
LG Electronics: “PAPR comparison of uplink MA schemes”, 3GPP TSG RAN WG1 Meeting #41, R1-050475, May 9-13, 2005, pp. 6.
Motorola,“Uplink Numerology and Frame Structure”, 3GPP TAG RAN1 #41 Meeting R1-050397, May 13, 2005.
Samsung Electonics Co. Ltd.; “Uplink Multiple Access and Multiplexing for Evolved UTRA”, R1-050439, May 3, 2005, pp. 1-22, XP55018616, Retrieved from the Internet: URL:http://www.3gpp.org/ftp/tsg—ran/WG1—R1/TSGR1/DOCS/ [retrieved on Feb. 7, 2012].
Digital cellular telecommunications system (Phase 2+); General Packet Radio Service (GPRS); Mobile Station (MS)-Base Station System (BSS)interface; Radio Link Control/Medium Access Control (RLC/MAC) protocol (GSM 04.60 version 8.4.1 Release 1999), 3GPP Standard; ETSI EN 301 349, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; 650, Route Des Lucioles; F-06921 Sophia-Antipolis Cedex; France, No. V8.4.1, Oct. 1, 2000, pp. 1-243, XP050358534.
Tomcik J., “QFDD and QTDD: Proposed Draft Air Interface Specification,” IEEE C802.20-05/69, IEEE 802.20 Working Group on Mobile Broadband Wireless Access, Oct. 28, 2005, pp. 1-6, 1-7, 1-16, 6-65, 7-11, 7-33, 7-37˜7-55, 9-21, 9-22, 9-24˜9-32.
Institute for Infocomm Research et al., “Intra-Node B Macro Diversity based on Cyclic Delay Transmissions”, 3GPP TSG RAN WG1 #42 on LTE, R1-050795, Aug. 29-Sep. 2, 2005, pp. 1-5.
Sommer D., et al., “Coherent OFDM transmission at 60 GHz”, Vehicular Technology Conference, 1999, VTC 1999-Fall, IEEE VTS 50th Amsterdam, Netherlands Sep. 19-22, 1999, Piscataway, NJ, USA, IEEE, US, vol. 3, Sep. 19, 1999, pp. 1545-1549, XP010353233, DOI: 10.1109/VETECF.1999.801553, ISBN: 978-0-7803-5435-7.
Zhang H., “A new space-time-frequency MIMO-OFDM scheme with cyclic delay diversity”, Frontiers of Mobile and Wireless Communication, 2004. Proceedings of the IEEE 6th Circuits and Systems Symposium on vol. 2, Jun. 2, 2004, pp. 647-650.
Related Publications (1)
Number Date Country
20070097853 A1 May 2007 US