Multi-channel SDMA
Summary by NHIP
Multi-channel SDMA scheduling
The method schedules packet transmissions in a multi-channel wireless system using spatial division multiple access. It simultaneously transmits downlink packets to nodes on a first channel and to other nodes on a second channel according to the generated schedule.
Claim Score by NHIP
Abstract
Certain embodiments provide a method for scheduling packet transmissions in a multi-channel wireless communications system. The method generally includes requesting, from a plurality of wireless network nodes, an identification of channels available for communicating with the wireless network nodes, receiving an identification of channels available for communicating with the wireless network nodes, determining a schedule for packet transmission for the wireless network nodes based on the identification of channels, and communicating the schedule to the wireless network nodes.

Term
4 yearsleft in the term
Expires 8 October 2030, including 415 days of term adjustment.
- Priority
- Filed
- Granted
- Today
- Expires
42 claims: 16 independent, 26 dependent
- 1A method for scheduling packet transmissions in a multi-channel wireless communications system, comprising:receiving an identification of channels available for communicating simultaneously with a plurality of wireless network nodes via a spatial division multiple access (SDMA) scheme;determining a schedule for packet transmission for the plurality of wireless network nodes based on the identification of the available channels and selection of the available channels by the wireless communications system;transmitting the schedule to each of the plurality of wireless network nodes;transmitting downlink packets to one or more of the wireless network nodes on a first channel simultaneously via the SDMA scheme and according to the transmitted schedule;and transmitting downlink packets to at least one of the wireless network nodes on a second channel according to the transmitted schedule, wherein the downlink packets are transmitted on the second channel simultaneously with the downlink packets transmitted on the first channel.
- 9A method for exchanging packet transmissions in a multi-channel wireless communications system, comprising:sending an identification of one or more channels available for communicating with a plurality of wireless network nodes as an uplink spatial division multiple access (SDMA) transmission;receiving a schedule based on the one or more channels identified;and receiving a downlink SDMA transmission on at least one of the identified channels.
- 16A method for scheduling packet transmissions in a multi-channel wireless network, comprising:receiving an uplink spatial division multiple access (SDMA) transmission identifying channels available for communicating with a plurality of wireless network nodes;determining schedules indicating packet transmissions for different wireless network nodes among the plurality of wireless network nodes based on the identified available channels, wherein the schedules are determined based on the available channels identified by a corresponding wireless network node and available channels identified by other wireless network nodes;and communicating the schedules to the wireless network nodes.
- 17A method for exchanging packet transmissions in a multi-channel wireless network, comprising:sending, from at least one wireless network node, an identification of two or more channels available for communicating with the wireless network;receiving a schedule for communicating with the wireless network from the wireless network, the received schedule generated based on the identification of the two or more available channels;and communicating between the at least one wireless network node and the wireless network on at least two of the identified two or more available channels simultaneously according to the received schedule.
- 18An apparatus for scheduling packet transmissions in a multi-channel wireless communications system, comprising:means for receiving an identification of channels available for communicating simultaneously with a plurality of wireless network nodes via a spatial division multiple access (SDMA) scheme;means for determining a schedule for packet transmission for the plurality of wireless network nodes based on the identification of the available channels;means for transmitting the schedule to each of the plurality of wireless network nodes;means for transmitting downlink packets to one or more of the wireless network nodes on a first channel simultaneously via the SDMA scheme and according to the transmitted schedule;and means for transmitting downlink packets to at least one of the wireless network nodes on a second channel according to the transmitted schedule, wherein the downlink packets are transmitted on the second channel simultaneously with the downlink packets transmitted on the first channel.
- 26An apparatus for exchanging packet transmissions in a multi-channel wireless communications system, comprising:means for sending an identification of one or more channels available for communicating with a plurality of wireless network nodes as an uplink spatial division multiple access (SDMA) transmission;means for receiving a schedule based on the one or more channels identified;and means for receiving a downlink SDMA transmission on at least one of the identified channels.
- 33An apparatus for scheduling packet transmissions in a multi-channel wireless network, comprising:means for receiving an uplink spatial division multiple access (SDMA) transmission identifying channels available for communicating with a plurality of wireless network nodes;means for determining schedules indicating packet transmissions for different wireless network nodes among the plurality of wireless network nodes based on the identified available channels, wherein the schedules are determined based on the available channels identified by a corresponding wireless network node and available channels identified by other wireless network nodes;and means for communicating the schedules to the wireless network nodes.
- 34Broadest claimClaim Score 74, broad(NHIP)An apparatus for exchanging packet transmissions in a multi-channel wireless network, comprising:means for sending, from at least one wireless network node, an identification of two or more channels available for communicating with the wireless network;means for receiving a schedule for communicating with the wireless network from the wireless network, the received schedule generated based on the identification of the two or more available channels;and means for communicating between the at least one wireless network node and the wireless network on at least two of the identified two or more available channels simultaneously according to the received schedule.
- 35An apparatus for scheduling packet transmissions in a multi-channel wireless communications system, comprising:a receiver configured to receive an identification of channels available for communicating simultaneously with a plurality of wireless network nodes via a spatial division multiple access (SDMA) scheme;a scheduler configured to determine a schedule for packet transmission for the plurality of wireless network nodes based on the identification of the available channels;and a transmitter configured to: transmit the schedule to each of the plurality of wireless network nodes;transmit downlink packets to one or more of the wireless network nodes on a first channel simultaneously via the SDMA scheme and according to the channel schedule;and transmit downlink packets to at least one of the wireless network nodes on a second channel according to the transmitted schedule and simultaneously with the downlink packets transmitted on the first channel.
- 36An apparatus for exchanging packet transmissions in a multi-channel wireless communications system, comprising:a transmitter configured to send an identification of one or more channels available for communicating with a plurality of wireless network nodes as an uplink spatial division multiple access (SDMA) transmission;and a receiver configured to: receive a schedule based on the one or more channels identified, and receive a downlink SDMA transmission on at least one of the identified channels.
- 37An apparatus for scheduling packet transmissions in a multi-channel wireless network, comprising:a receiver configured to receive an uplink spatial division multiple access (SDMA) transmission identifying channels available for communicating with a plurality of wireless network nodes;a scheduler configured to determine schedules indicating packet transmissions for different wireless network nodes among the plurality of wireless network nodes based on the identified available channels, wherein the schedules are determined based on the available channels identified by a corresponding wireless network node and available channels identified by other wireless network nodes;and a transmitter configured to communicate the schedules to the wireless network nodes.
- 38An apparatus for exchanging packet transmissions in a multi-channel wireless network, comprising:a transmitter configured to send, from at least one wireless network node, an identification of two or more channels available for communicating with the wireless network;a receiver configured to receive a schedule for communicating with the wireless network from the wireless network, the received schedule generated based on the identification of the two or more available channels;and logic configured to communicate between the at least one wireless network node and the wireless network on at least two of the identified two or more available channels simultaneously according to the received schedule.
- 39A non-transitory computer-program product for scheduling packet transmissions in a multi-channel wireless network comprising a computer readable medium having instructions stored thereon, the instructions being executable by one or more processors and the instructions comprising instructions for:receiving an identification of channels available for communicating simultaneously with a plurality of wireless network nodes via a spatial division multiple access (SDMA) scheme;determining a schedule for packet transmission for the plurality of wireless network nodes based on the identification of the available channels and selection of the available channels by the wireless network;transmitting the schedule to each of the plurality of wireless network nodes;transmitting downlink packets to one or more of the wireless network nodes on a first channel simultaneously via the SDMA scheme and according to the transmitted schedule;and transmitting downlink packets to at least one of the wireless network nodes on a second channel according to the transmitted schedule, wherein the downlink packets are transmitted on the second channel simultaneously with the downlink packets transmitted on the first channel.
- 40A non-transitory computer-program product for exchanging packet transmissions in a multi-channel wireless network comprising a computer readable medium having instructions stored thereon, the instructions being executable by one or more processors and the instructions comprising instructions for:sending an identification of one or more channels available for communicating with a plurality of wireless network nodes as an uplink spatial division multiple access (SDMA) transmission;receiving a schedule based on the one or more channels identified;and receiving a downlink SDMA transmission on at least one of the identified channels.
- 41A non-transitory computer-program product for scheduling packet transmissions in a multi-channel wireless network comprising a computer readable medium having instructions stored thereon, the instructions being executable by one or more processors and the instructions comprising instructions for:receiving an uplink spatial division multiple access (SDMA) transmission identifying channels available for communicating with a plurality of wireless network nodes;determining schedules indicating packet transmissions for different wireless network nodes among the plurality of wireless network nodes based on the identified available channels, wherein the schedules are determined based on the available channels identified by a corresponding wireless network node and available channels identified by other wireless network nodes;and communicating the schedules to the wireless network nodes.
- 42A non-transitory computer-program product for exchanging packet transmissions in a multi-channel wireless network comprising a computer readable medium having instructions stored thereon, the instructions being executable by one or more processors and the instructions comprising instructions for:sending, from at least one wireless network node, an identification of two or more channels available for communicating with the wireless network;receiving a schedule for communicating with the wireless network from the wireless network, the received schedule generated based on the identification of the two or more available channels;and communicating between the at least one wireless network node and the wireless network on at least two of the identified two or more available channels simultaneously according to the received schedule.
Independent claims16
81 paragraphs in 5 sections, as filed
CROSS-REFERENCE TO RELATED APPLICATION
This application claims benefit of U.S. Provisional Patent Application Ser. No. 61/090,518 filed Aug. 20, 2008, which is herein incorporated by reference in its entirety.
BACKGROUND
In order to address the issue of increasing bandwidth requirements that are demanded for wireless communications systems, different schemes are being developed to allow multiple user terminals to communicate with a single base station by sharing the same channel (same time and frequency resources) while achieving high data throughputs. One such scheme is spatial division multiple access (SDMA).
In SDMA systems, a base station may transmit or receive different signals to or from a plurality of mobile user terminals at the same time and using the same frequency. In order to achieve reliable data communication, user terminals may need to be located in sufficiently different directions. Independent signals may be simultaneously transmitted from each of space-separated antennas at the base station. Consequently, the combined transmissions may be directional, i.e., the signal that is dedicated for each user terminal may be relatively strong in the direction of that particular user terminal and sufficiently weak in directions of other user terminals. Similarly, the base station may simultaneously receive on the same frequency the combined signals from multiple user terminals through each of antennas separated in space, and the combined received signals from multiple antennas may be split into independent signals transmitted from each user terminal by applying the appropriate signal processing technique.
A multiple-input multiple-output (MIMO) wireless system employs multiple (N<sub>T</sub>) transmit antennas and multiple (N<sub>R</sub>) receive antennas for data transmission. A MIMO channel formed by the N<sub>T </sub>transmit and N<sub>R </sub>receive antennas may be decomposed into N<sub>S </sub>spatial channels, where N<sub>S</sub>≦min {N<sub>T</sub>,N<sub>R</sub>}. The N<sub>S </sub>spatial channels may be used to transmit N<sub>S </sub>independent data streams to achieve greater overall throughput.
In a multiple-access MIMO system based on SDMA, an access point can communicate with one or more user terminals at any given moment. If the access point communicates with a single user terminal, then the N<sub>T </sub>transmit antennas are associated with one transmitting entity (either the access point or the user terminal), and the N<sub>R </sub>receive antennas are associated with one receiving entity (either the user terminal or the access point). The access point can also communicate with multiple user terminals simultaneously via SDMA. For SDMA, the access point utilizes multiple antennas for data transmission and reception, and each of the user terminals typically utilizes one antenna for data transmission and multiple antennas for data reception.
SUMMARY
Certain embodiments provide a method for scheduling packet transmissions in a multi-channel wireless communications system. The method generally includes receiving an identification of channels available for communicating simultaneously with a plurality of wireless network nodes via a spatial division multiple access (SDMA) scheme, determining a schedule for packet transmission for the wireless network nodes based on the identification of channels, and transmitting downlink packets to at least some of the wireless network nodes simultaneously via the SDMA scheme according to the schedule.
Certain embodiments provide a method for scheduling packet transmissions in a multi-channel wireless communications system. The method generally includes sending an identification of one or more channels available for communicating with the wireless network nodes as an uplink spatial division multiple access (SDMA) transmission and receiving a downlink SDMA transmission on at least one of the identified communications channels.
Certain embodiments provide a method for scheduling packet transmissions in a multi-channel wireless communications system. The method generally includes receiving an identification of channels available for communicating with a plurality of wireless network nodes, determining a schedule for packet transmission for the wireless network nodes based on the identification of channels, and communicating the schedule to the wireless network nodes.
Certain embodiments provide a method for scheduling packet transmissions in a multi-channel wireless communications system. The method generally includes sending an identification of one or more channels available for communicating with the wireless network, receiving a schedule for communicating with the wireless network generated based on the identification of channels, and communicating with the wireless network according to the schedule.
Certain embodiments provide an apparatus for scheduling packet transmissions in a multi-channel wireless communications system. The apparatus generally includes means for receiving an identification of channels available for communicating simultaneously with a plurality of wireless network nodes via a spatial division multiple access (SDMA) scheme, means for determining a schedule for packet transmission for the wireless network nodes based on the identification of channels, and means for transmitting downlink packets to at least some of the wireless network nodes simultaneously via the SDMA scheme according to the schedule.
Certain embodiments provide an apparatus for scheduling packet transmissions in a multi-channel wireless communications system. The apparatus generally includes means for sending an identification of one or more channels available for communicating with the wireless network nodes as an uplink spatial division multiple access (SDMA) transmission, and means for receiving a downlink SDMA transmission on at least one of the identified communications channels.
Certain embodiments provide an apparatus for scheduling packet transmissions in a multi-channel wireless communications system. The apparatus generally includes means for receiving an identification of channels available for communicating with a plurality of wireless network nodes, means for determining a schedule for packet transmission for the wireless network nodes based on the identification of channels, and means for communicating the schedule to the wireless network nodes.
Certain embodiments provide an apparatus for scheduling packet transmissions in a multi-channel wireless communications system. The apparatus generally includes means for sending an identification of one or more channels available for communicating with the wireless network, means for receiving a schedule for communicating with the wireless network generated based on the identification of channels, and means for communicating with the wireless network according to the schedule.
Certain embodiments provide an apparatus for scheduling packet transmissions in a multi-channel wireless communications system. The apparatus generally includes a receiver configured to receive an identification of channels available for communicating simultaneously with a plurality of wireless network nodes via a spatial division multiple access (SDMA) scheme, a scheduler configured to determine a schedule for packet transmission for the wireless network nodes based on the identification of channels, and a transmitter configured to transmit downlink packets to at least some of the wireless network nodes simultaneously via the SDMA scheme according to the schedule.
Certain embodiments provide an apparatus for scheduling packet transmissions in a multi-channel wireless communications system. The apparatus generally includes a transmitter configured to send an identification of one or more channels available for communicating with the wireless network nodes as an uplink spatial division multiple access (SDMA) transmission and a receiver configured to receive a downlink SDMA transmission on at least one of the identified communications channels.
Certain embodiments provide an apparatus for scheduling packet transmissions in a multi-channel wireless communications system. The apparatus generally includes a receiver configured to receive an identification of channels available for communicating with a plurality of wireless network nodes, a scheduler configured to determine a schedule for packet transmission for the wireless network nodes based on the identification of channels, and logic configured to communicate the schedule to the wireless network nodes.
Certain embodiments provide an apparatus for scheduling packet transmissions in a multi-channel wireless communications system. The apparatus generally includes a transmitter configured to send an identification of one or more channels available for communicating with the wireless network, a receiver configured to receive a schedule for communicating with the wireless network generated based on the identification of channels, and logic configured to communicate with the wireless network according to the schedule.
Certain embodiments provide a computer-program product for scheduling packet transmissions in a multi-channel wireless network comprising a computer readable medium having instructions stored thereon, the instructions being executable by one or more processors. The instructions generally include instructions for receiving, from a plurality of wireless network nodes, an identification of channels available for communicating with the wireless network nodes, determining a schedule for packet transmission for the wireless network nodes based on the identification of channels, and communicating the schedule to the wireless network nodes.
Certain embodiments provide a computer-program product for scheduling packet transmissions in a multi-channel wireless network comprising a computer readable medium having instructions stored thereon, the instructions being executable by one or more processors. The instructions generally include instructions for sending an identification of one or more channels available for communicating with the wireless network, receiving a schedule for communicating with the wireless network generated based on the identification of channels, and communicating with the wireless network according to the schedule.
Certain embodiments provide a computer-program product for scheduling packet transmissions in a multi-channel wireless network comprising a computer readable medium having instructions stored thereon, the instructions being executable by one or more processors. The instructions generally include instructions for receiving an identification of channels available for communicating with a plurality of wireless network nodes, determining a schedule for packet transmission for the wireless network nodes based on the identification of channels, and communicating the schedule to the wireless network nodes.
Certain embodiments provide a computer-program product for scheduling packet transmissions in a multi-channel wireless network comprising a computer readable medium having instructions stored thereon, the instructions being executable by one or more processors. The instructions generally include instructions for sending an identification of one or more channels available for communicating with the wireless network, receiving a schedule for communicating with the wireless network generated based on the identification of channels, and communicating with the wireless network according to the schedule.
BRIEF DESCRIPTION OF THE DRAWINGS
So that the manner in which the above recited features of the present disclosure can be understood in detail, a more particular description, briefly summarized above, may be had by reference to embodiments, some of which are illustrated in the appended drawings. It is to be noted, however, that the appended drawings illustrate only certain typical embodiments of this disclosure and are therefore not to be considered limiting of its scope, for the description may admit to other equally effective embodiments.
<figref idrefs="DRAWINGS">FIG. 1</figref> shows a spatial division multiple access MIMO wireless system in accordance with certain embodiments of the present disclosure.
<figref idrefs="DRAWINGS">FIG. 2</figref> shows a block diagram of an access point and two user terminals in accordance with certain embodiments of the present disclosure.
<figref idrefs="DRAWINGS">FIG. 3</figref> illustrates example components of a wireless device in accordance with certain embodiments of the present disclosure.
<figref idrefs="DRAWINGS">FIG. 4</figref> illustrates example operations for scheduling transmissions in an SDMA system in accordance with certain embodiments of the present disclosure.
<figref idrefs="DRAWINGS">FIG. 4A</figref> illustrates example components capable of performing the operations shown in <figref idrefs="DRAWINGS">FIG. 4</figref>.
<figref idrefs="DRAWINGS">FIGS. 5 and 6</figref> are example timing diagrams showing example message flows for scheduling transmissions in an SDMA system.
DETAILED DESCRIPTION
The word “exemplary” is used herein to mean “serving as an example, instance, or illustration.” Any embodiment described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other embodiments.
The multi-antenna transmission techniques described herein may be used in combination with various wireless technologies such as Code Division Multiple Access (CDMA), Orthogonal Frequency Division Multiplexing (OFDM), Time Division Multiple Access (TDMA), and so on. Multiple user terminals can concurrently transmit/receive data via different (1) orthogonal code channels for CDMA, (2) time slots for TDMA, or (3) subbands for OFDM. A CDMA system may implement IS-2000, IS-95, IS-856, Wideband-CDMA (W-CDMA), or some other standards. An OFDM system may implement IEEE 802.11 or some other standards. A TDMA system may implement GSM or some other standards. These various standards are known in the art.
<figref idrefs="DRAWINGS">FIG. 1</figref> shows a multiple-access MIMO system <b>100</b> with access points and user terminals. For simplicity, only one access point <b>110</b> is shown in <figref idrefs="DRAWINGS">FIG. 1</figref>. An access point is generally a fixed station that communicates with the user terminals and may also be referred to as a base station or some other terminology. A user terminal may be fixed or mobile and may also be referred to as a mobile station, a wireless device or some other terminology. Access point <b>110</b> may communicate with one or more user terminals <b>120</b> at any given moment on the downlink and uplink. The downlink (i.e., forward link) is the communication link from the access point to the user terminals, and the uplink (i.e., reverse link) is the communication link from the user terminals to the access point. A user terminal may also communicate peer-to-peer with another user terminal. A system controller <b>130</b> couples to and provides coordination and control for the access points.
While portions of the following disclosure will describe user terminals <b>120</b> capable of communicating via SDMA, for certain embodiments, the user terminals <b>120</b> may also include some user terminals that do not support SDMA. Thus, for such embodiments, an AP <b>110</b> may be configured to communicate with both SDMA and non-SDMA user terminals. This approach may conveniently allow older versions of user terminals (“legacy” stations) to remain deployed in an enterprise, extending their useful lifetime, while allowing newer SDMA user terminals to be introduced as deemed appropriate.
System <b>100</b> employs multiple transmit and multiple receive antennas for data transmission on the downlink and uplink. Access point <b>110</b> is equipped with N<sub>ap </sub>antennas and represents the multiple-input (MI) for downlink transmissions and the multiple-output (MO) for uplink transmissions. A set of N<sub>u </sub>selected user terminals <b>120</b> collectively represents the multiple-output for downlink transmissions and the multiple-input for uplink transmissions. For pure SDMA, it is desired to have N<sub>ap</sub>≧N<sub>u</sub>≧1 if the data symbol streams for the N<sub>u </sub>user terminals are not multiplexed in code, frequency or time by some means. N<sub>u </sub>may be greater than N<sub>ap </sub>if the data symbol streams can be multiplexed using different code channels with CDMA, disjoint sets of subbands with OFDM, and so on. Each selected user terminal transmits user-specific data to and/or receives user-specific data from the access point. In general, each selected user terminal may be equipped with one or multiple antennas (i.e., N<sub>ut</sub>≧1). The N<sub>u </sub>selected user terminals can have the same or different number of antennas.
SDMA system <b>100</b> may be a time division duplex (TDD) system or a frequency division duplex (FDD) system. For a TDD system, the downlink and uplink share the same frequency band. For an FDD system, the downlink and uplink use different frequency bands. MIMO system <b>100</b> may also utilize a single carrier or multiple carriers for transmission. Each user terminal may be equipped with a single antenna (e.g., in order to keep costs down) or multiple antennas (e.g., where the additional cost can be supported).
<figref idrefs="DRAWINGS">FIG. 2</figref> shows a block diagram of access point <b>110</b> and two user terminals <b>120</b><i>m </i>and <b>120</b><i>x </i>in MIMO system <b>100</b>. Access point <b>110</b> is equipped with N<sub>ap </sub>antennas <b>224</b><i>a </i>through <b>224</b><i>ap. </i>User terminal <b>120</b><i>m </i>is equipped with N<sub>ut,m </sub>antennas <b>252</b><i>ma </i>through <b>252</b><i>mu</i>, and user terminal <b>120</b><i>x </i>is equipped with N<sub>ut,x </sub>antennas <b>252</b><i>xa </i>through <b>252</b><i>xu. </i>Access point <b>110</b> is a transmitting entity for the downlink and a receiving entity for the uplink. Each user terminal <b>120</b> is a transmitting entity for the uplink and a receiving entity for the downlink. As used herein, a “transmitting entity” is an independently operated apparatus or device capable of transmitting data via a wireless channel, and a “receiving entity” is an independently operated apparatus or device capable of receiving data via a wireless channel. In the following description, the subscript “dn” denotes the downlink, the subscript “up” denotes the uplink, N<sub>up </sub>user terminals are selected for simultaneous transmission on the uplink, N<sub>dn </sub>user terminals are selected for simultaneous transmission on the downlink, N<sub>ap </sub>may or may not be equal to N<sub>dn</sub>, and N<sub>up </sub>and N<sub>dn </sub>may be static values or can change for each scheduling interval. The beam-steering or some other spatial processing technique may be used at the access point and user terminal.
On the uplink, at each user terminal <b>120</b> selected for uplink transmission, a TX data processor <b>288</b> receives traffic data from a data source <b>286</b> and control data from a controller <b>280</b>. TX data processor <b>288</b> processes (e.g., encodes, interleaves, and modulates) the traffic data {d<sub>up,m</sub>} for the user terminal based on the coding and modulation schemes associated with the rate selected for the user terminal and provides a data symbol stream {s<sub>up,m</sub>} A TX spatial processor <b>290</b> performs spatial processing on the data symbol stream {s<sub>up,m</sub>} and provides N<sub>ut,m </sub>transmit symbol streams for the N<sub>ut,m </sub>antennas. Each transmitter unit (TMTR) <b>254</b> receives and processes (e.g., converts to analog, amplifies, filters, and frequency upconverts) a respective transmit symbol stream to generate an uplink signal. N<sub>ut,m </sub>transmitter units <b>254</b> provide N<sub>ut,m </sub>uplink signals for transmission from N<sub>ut,m </sub>antennas <b>252</b> to the access point.
N<sub>up </sub>user terminals may be scheduled for simultaneous transmission on the uplink. Each of these user terminals performs spatial processing on its data symbol stream and transmits its set of transmit symbol streams on the uplink to the access point.
At access point <b>110</b>, N<sub>ap </sub>antennas <b>224</b><i>a </i>through <b>224</b><i>ap </i>receive the uplink signals from all N<sub>up </sub>user terminals transmitting on the uplink. Each antenna <b>224</b> provides a received signal to a respective receiver unit (RCVR) <b>222</b>. Each receiver unit <b>222</b> performs processing complementary to that performed by transmitter unit <b>254</b> and provides a received symbol stream. An RX spatial processor <b>240</b> performs receiver spatial processing on the N<sub>ap </sub>received symbol streams from N<sub>ap </sub>receiver units <b>222</b> and provides N<sub>up </sub>recovered uplink data symbol streams. The receiver spatial processing is performed in accordance with the channel correlation matrix inversion (CCMI), minimum mean square error (MMSE), soft interference cancellation (SIC), or some other technique. Each recovered uplink data symbol stream {s<sub>up,m</sub>} is an estimate of a data symbol stream {s<sub>up,m</sub>} transmitted by a respective user terminal. An RX data processor <b>242</b> processes (e.g., demodulates, deinterleaves, and decodes) each recovered uplink data symbol stream {s<sub>up,m</sub>} in accordance with the rate used for that stream to obtain decoded data. The decoded data for each user terminal may be provided to a data sink <b>244</b> for storage and/or a controller <b>230</b> for further processing.
On the downlink, at access point <b>110</b>, a TX data processor <b>210</b> receives traffic data from a data source <b>208</b> for N<sub>dn </sub>user terminals scheduled for downlink transmission, control data from a controller <b>230</b>, and possibly other data from a scheduler <b>234</b>. The various types of data may be sent on different transport channels. TX data processor <b>210</b> processes (e.g., encodes, interleaves, and modulates) the traffic data for each user terminal based on the rate selected for that user terminal. TX data processor <b>210</b> provides N<sub>dn </sub>downlink data symbol streams for the N<sub>dn </sub>user terminals. A TX spatial processor <b>220</b> performs spatial processing on the N<sub>dn </sub>downlink data symbol streams, and provides N<sub>ap </sub>transmit symbol streams for the N<sub>ap </sub>antennas. Each transmitter unit <b>222</b> receives and processes a respective transmit symbol stream to generate a downlink signal. N<sub>ap </sub>transmitter units <b>222</b> providing N<sub>ap </sub>downlink signals for transmission from N<sub>ap </sub>antennas <b>224</b> to the user terminals.
At each user terminal <b>120</b>, N<sub>ut,m </sub>antennas <b>252</b> receive the N<sub>ap </sub>downlink signals from access point <b>110</b>. Each receiver unit <b>254</b> processes a received signal from an associated antenna <b>252</b> and provides a received symbol stream. An RX spatial processor <b>260</b> performs receiver spatial processing on N<sub>ut,m </sub>received symbol streams from N<sub>ut,m </sub>receiver units <b>254</b> and provides a recovered downlink data symbol stream {s<sub>dn,m</sub>} for the user terminal. The receiver spatial processing is performed in accordance with the CCMI, MMSE or some other technique. An RX data processor <b>270</b> processes (e.g., demodulates, deinterleaves and decodes) the recovered downlink data symbol stream to obtain decoded data for the user terminal.
At each user terminal <b>120</b>, a channel estimator <b>278</b> estimates the downlink channel response and provides downlink channel estimates, which may include channel gain estimates, SNR estimates, and so on. Similarly, a channel estimator <b>228</b> estimates the uplink channel response and provides uplink channel estimates. Controller <b>280</b> for each user terminal typically derives the spatial filter matrix for the user terminal based on the downlink channel response matrix H<sub>dn,m </sub>for that user terminal. Controller <b>230</b> derives the spatial filter matrix for the access point based on the effective uplink channel response matrix H<sub>up,eff</sub>. Controller <b>280</b> for each user terminal may send feedback information (e.g., the downlink and/or uplink steering vectors, SNR estimates, and so on) to the access point. Controllers <b>230</b> and <b>280</b> also control the operation of various processing units at access point <b>110</b> and user terminal <b>120</b>, respectively.
<figref idrefs="DRAWINGS">FIG. 3</figref> illustrates various components that may be utilized in a wireless device <b>302</b> that may be employed within the system <b>100</b>. The wireless device <b>302</b> is an example of a device that may be configured to implement the various methods described herein. The wireless device <b>302</b> may be an access point <b>110</b> or a user terminal <b>120</b>.
The wireless device <b>302</b> may include a processor <b>304</b> which controls operation of the wireless device <b>302</b>. The processor <b>304</b> may also be referred to as a central processing unit (CPU). Memory <b>306</b>, which may include both read-only memory (ROM) and random access memory (RAM), provides instructions and data to the processor <b>304</b>. A portion of the memory <b>306</b> may also include non-volatile random access memory (NVRAM). The processor <b>304</b> typically performs logic and arithmetic operations based on program instructions stored within the memory <b>306</b>. The instructions in the memory <b>306</b> may be executable to implement the methods described herein.
The wireless device <b>302</b> may also include a housing <b>308</b> that may include a transmitter <b>310</b> and a receiver <b>312</b> to allow transmission and reception of data between the wireless device <b>302</b> and a remote location. The transmitter <b>310</b> and receiver <b>312</b> may be combined into a transceiver <b>314</b>. A plurality of transmit antennas <b>316</b> may be attached to the housing <b>308</b> and electrically coupled to the transceiver <b>314</b>. The wireless device <b>302</b> may also include (not shown) multiple transmitters, multiple receivers, and multiple transceivers.
The wireless device <b>302</b> may also include a signal detector <b>318</b> that may be used in an effort to detect and quantify the level of signals received by the transceiver <b>314</b>. The signal detector <b>318</b> may detect such signals as total energy, energy per subcarrier per symbol, power spectral density and other signals. The wireless device <b>302</b> may also include a digital signal processor (DSP) <b>320</b> for use in processing signals.
The various components of the wireless device <b>302</b> may be coupled together by a bus system <b>322</b>, which may include a power bus, a control signal bus, and a status signal bus in addition to a data bus . . .
As used herein, the term “legacy” generally refers to wireless network nodes that support 802.11n or earlier versions of the 802.11 standard.
While certain techniques are described herein with reference to SDMA, those skilled in the art will recognize the techniques may be generally applied in systems utilizing any type of multiple access schemes, such as SDMA, OFDMA, CDMA, and combinations thereof.
Multichannel SDMA
SDMA may be used for improving utilization of the air link by scheduling multiple terminals for simultaneous transmission and reception using multiple channels. Data may be sent to each of the terminals using spatial streams. Certain embodiments of the present disclosure provide a protocol for efficient scheduling of the spatial streams for multiple terminals over multiple channels.
When considering the unlicensed spectrum available for the 802.11 wireless local area network (WLAN) systems, there is a significant amount of bandwidth available for the packet transmissions. Typically the bandwidth is split into different channels that are 20 MHz wide. If there is more than one single channel free in a distribution system, better utilization of this resource will enable higher aggregate throughputs. Certain embodiments of the present disclosure provide a methodology (protocol) for combining SDMA with the use of multiple channels to enhance the overall aggregate network throughput.
According to certain aspects, the protocol presented in the present disclosure allows an AP to determine a schedule for use in communicating with a plurality of wireless nodes (e.g., stations) over a plurality of wireless channels. In other words, the schedule may identify which, of the plurality of wireless nodes, communicate on which channels. According to certain aspects, the protocol may also provide for training of stations, wherein the AP may utilize sounding signals received from the stations to determine channel information for each station. The AP may use this channel information to optimize subsequent downlink SDMA transmissions to the stations.
<figref idrefs="DRAWINGS">FIG. 4</figref> illustrates example operations for scheduling transmissions in an SDMA system for multiple users over multiple channels in a wireless LAN system, according to certain embodiments of the present disclosure. <figref idrefs="DRAWINGS">FIG. 4</figref> illustrates operations that may performed by both the access points and operations performed by stations. In SDMA systems, the station operations may be performed simultaneously by multiple stations. The illustrated operations may be performed by any suitable components, such as those described above with reference to <figref idrefs="DRAWINGS">FIG. 3</figref>.
For the sake of illustration, the operations of <figref idrefs="DRAWINGS">FIG. 4</figref> are described below in conjunction with example timing diagrams illustrated in <figref idrefs="DRAWINGS">FIGS. 5 and 6</figref>. The operations begin, at <b>410</b>, where an access point (AP) sends a request to stations (STAs) for identification of available channels. For example, the request may take the form of a free channel request message (FCRM) <b>502</b> shown in <figref idrefs="DRAWINGS">FIGS. 5 and 6</figref>.
At <b>420</b>, the request is received by the STAs. At <b>430</b>, each STA sends an identification of available channels. At <b>440</b>, the identification of available channels sent by each STA is received by the AP. At <b>450</b>, the AP determines a schedule for packet transmissions based, at least in part, on the available channels. At <b>460</b>, the AP communicates the schedule to the STAs. At <b>470</b>, the schedule is received by the STAs. At <b>480</b> and <b>490</b>, the AP and STAs communicate according to the schedule.
For certain embodiments, the AP may not need to send a request in order to receive free channel information from the stations. Thus, operations <b>410</b> and <b>420</b> may be considered optional. For such embodiments, stations may send their free channel information periodically, or in response to some other triggering mechanism, such as when a new available channel is detected.
<figref idrefs="DRAWINGS">FIGS. 5 and 6</figref> illustrate example wireless communications between an AP and a plurality of stations (STA<b>1</b>, STA<b>2</b>, STA<b>3</b>, and STA<b>4</b>) using a plurality of wireless channels (a primary channel CH<b>1</b>, CH<b>2</b>, CH<b>3</b>, and CH<b>4</b>). In the figures, the horizontal axes correspond to the different wireless channels. In order to identify which entity is transmitting a particular message, a label is included in the box representing each message. As an example, the label “AP” in the box <b>502</b> representing the free channel request message (FCRM) indicates the AP transmits the FCRM <b>502</b>, while separate labels for “STA<b>1</b>,” STA<b>2</b>,” “STA<b>3</b>,” and “STA<b>4</b>” in boxes <b>504</b> representing a clear to send frame (CTS) indicate that each of the different stations transmits a CTS frame <b>504</b>.
<figref idrefs="DRAWINGS">FIG. 5</figref> is a timing diagram illustrating an example of scheduling SDMA transmissions for multiple users, in accordance with certain embodiments. In the illustrated example, stations respond with “staggered” clear to send (CTS) frames <b>504</b>, meaning stations send the CTS frames are different times.
The illustrated example assumes the following. The AP can transmit different packets on different channels simultaneously, can transmit packets on non-contiguous channels, and sees all four free channels <b>1</b>, <b>2</b>, <b>3</b>, and <b>4</b>. Station <b>1</b> sees channels <b>1</b>, <b>2</b>, and <b>4</b>, Station <b>2</b> sees channels <b>1</b> and <b>4</b>, Station <b>3</b> sees channels <b>1</b>, <b>3</b>, and <b>4</b>, while Station <b>4</b> sees channel <b>1</b> only. Thus, an optimal schedule may be for the AP to use Channel <b>1</b> for SDMA communication with all stations, Channel <b>2</b> for communication with Station <b>2</b>, Channel <b>3</b> for communication with Station <b>3</b>, and Channel <b>4</b> for SDMA communication with Stations <b>1</b>, <b>2</b> and <b>3</b>.
As shown in the example, the AP sends a Free channel request message (FCRM) <b>502</b>, which may be a multicast message for a specific set of nodes (e.g., with the nodes identified in a MAC header). The FCRM <b>502</b> may also contain information regarding the free channels seen by the AP (e.g., as a free channel list-FCL). The FCRM may also contain information indicating when the nodes are to respond with their respective FCL (e.g., in a Free Channel List Message <b>506</b>).
According the certain aspects, the AP may also send a clear to send (CTS) message <b>504</b> to itself (CTS to self) on all the identified free channels, to secure those channels for the exchange for the necessary amount of time. As illustrated, the FCRM and CTS messages sent by the AP may have a duration field setting that results in NAV settings (for the AP and stations) to protect the channels long enough to receive free channel list and sounding information from all the stations.
In response to the FCRM <b>502</b> sent by the AP, each STA may also send a CTS <b>504</b> to itself on all the free channels that station sees. This mechanism may help ensure that these channels are reserved for a period of time until the AP sends a training request (TRQ <b>408</b>) and all the stations respond with a sounding frame <b>510</b>. If there are nodes which identify the same channel as free, they may perform some type of arbitration, for example, sending the CTS to themselves in a staggered fashion with the order for each station determined by their station ID.
In the illustrated example, since all stations see the primary channel (channel <b>1</b>), the stations each send staggered CTSs <b>504</b> on the primary channel, illustratively in order of station number. Similarly, as Stations <b>1</b>, <b>2</b>, and <b>3</b>, all see Channel <b>4</b>, these stations each send staggered CTSs <b>504</b> on Channel <b>4</b>, as well. Since Station <b>1</b> is the only station to see Channel <b>2</b>, it is the only station to send a CTS <b>504</b> on Channel <b>2</b>. Similarly, as Station <b>3</b> is the only station to see Channel <b>3</b>, it is the only station to send a CTS <b>504</b> on Channel <b>3</b>. As illustrated, in this example, each station may send its CTS <b>504</b> on each channel at the same time specified for staggering.
To help the AP determine a schedule for communication with the stations on the multiple channels, the stations may provide an indication of the channels they see (their “available channels”) in an FCL message <b>506</b> to the AP. As illustrated, for certain embodiments, the FCL message <b>506</b> from each station may be transmitted on the (same) primary channel as an SDMA uplink transmission. Such scheduling of the FCL messages <b>506</b> may be specified by the AP in the FCRM <b>502</b>. For example, the FCRM may contain information indicating whether the stations should send their FCL messages <b>506</b> as an SDMA UL transmission (as shown) or in a staggered fashion.
Upon receiving all the FCL messages <b>506</b> from the STAs, the AP may compute schedules indicating the packet transmission for different responding STAs, based on the “available channels” for each station indicated in the free channel lists. The AP may then send some type of multichannel message on all the free channels to reserve these channels around the AP. Such a message may be chosen to be “legacy compatible,” in terms of network allocation vector (NAV) setting capabilities such that stations that are not SDMA-capable may still adjust their NAV settings accordingly. The NAV of the multicast request message should protect the primary channel until all the block acknowledgements (BAs) <b>516</b> are received. The NAV settings on the secondary channels (CH<b>2</b>-CH<b>4</b>) may also be set to protect those channels for the duration of their respective packet transmissions.
According to certain aspects, the multi-channel request message may take the form of training request messages (TRQs) <b>508</b>. As with the FCRM <b>502</b>, according to certain aspects, the stations may respond the TRQs <b>508</b> with staggered CTSs <b>504</b>.
As shown, the TRQs <b>508</b> may be sent on the free channels that are available to multiple stations. The stations receiving the TRQs <b>508</b> may respond by transmitting sounding signals <b>510</b>. The AP may utilize the sounding signals to determine channel information for each station, which may be used to optimize subsequent SDMA transmissions <b>512</b>. For certain embodiments, the CTS and sounding frames may be kept separate, as illustrated, which may allow the format of these messages to be combatable with legacy stations.
After training, the AP may send data to the stations. As illustrated, the AP may send data simultaneously via SDMA transmissions <b>512</b> to Stations <b>1</b>-<b>4</b> on the primary channel. Since Stations <b>1</b>-<b>3</b> all see Channel <b>4</b>, the AP may send data to these stations via SDMA transmissions <b>512</b> on Channel <b>4</b>. The AP may send data via (non-SDMA) transmissions <b>514</b> to Station <b>1</b> on Channel <b>2</b> and to Station <b>3</b> on Channel <b>3</b>, as these are the only stations that see these respective channels. As illustrated, the stations may acknowledge receipt of the data via block acknowledgements (BAs) <b>516</b>. According to certain aspects, the schedules for the BAs <b>516</b> may be carried in the MAC header (of the SDMA data transmissions <b>512</b>). As illustrated, all the SDMA stations may reply with a BA <b>516</b> as an UL SDMA transmission on the primary channel.
<figref idrefs="DRAWINGS">FIG. 6</figref> is a timing diagram illustrating another example of scheduling SDMA transmissions where it is assumed that symbol time of multiple stations is aligned (e.g., symbols sent from multiple stations arrive at the AP substantially aligned). Other assumptions for <figref idrefs="DRAWINGS">FIG. 6</figref>, regarding channel availability to the AP and per station are the same as in <figref idrefs="DRAWINGS">FIG. 5</figref>.
Again, the AP sends an FCRM <b>502</b>, which may be a multicast message for a specific set of nodes and may also contain information regarding the free channels seen by the AP. Due to the symbol time alignment, however, rather than send staggered CTSs <b>504</b>, as in <figref idrefs="DRAWINGS">FIG. 5</figref>, stations may send CTS messages <b>604</b> simultaneously on the same channel. As illustrated, Stations <b>1</b>-<b>4</b> send simultaneous CTS messages <b>604</b> on the primary channel (Channel <b>1</b>) while Stations <b>1</b>-<b>3</b> send simultaneous CTS messages <b>604</b> on Channel <b>4</b>. While Station <b>1</b> and Station <b>3</b> are the only stations that send CTS messages <b>604</b> on Channel <b>2</b> and Channel <b>3</b>, respectively, they may also do so simultaneously.
As illustrated, simultaneous CTS messages <b>604</b> may again be sent in response to the TRQ messages <b>508</b> sent by the AP after receiving the FCL messages <b>506</b>. Thus, in the symbol aligned case, the overall transaction time may be significantly reduced by eliminating the need for staggered CTS messages.
The various operations of methods described above may be performed by various hardware and/or software component(s), logic, and/or module(s) corresponding to means-plus-function blocks illustrated in the figures. Generally, where there are methods illustrated in figures any suitable means having corresponding counterpart means-plus-function figures, the operation blocks correspond to means-plus-function blocks with similar numbering. For example, operations <b>410</b>-<b>480</b> shown in <figref idrefs="DRAWINGS">FIG. 4</figref> may be performed by means <b>410</b>A-<b>480</b>A shown in <figref idrefs="DRAWINGS">FIG. 4A</figref>.
As used herein, the term “determining” encompasses a wide variety of actions. For example, “determining” may include calculating, computing, processing, deriving, investigating, looking up (e.g., looking up in a table, a database or another data structure), ascertaining and the like. Also, “determining” may include receiving (e.g., receiving information), accessing (e.g., accessing data in a memory) and the like. Also, “determining” may include resolving, selecting, choosing, establishing and the like.
Information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals and the like that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles or any combination thereof.
The various illustrative logic blocks, modules and circuits described in connection with the present disclosure may be implemented or performed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array signal (FPGA) or other programmable means device (PLD), discrete gate or transistor means, 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 commercially available processor, controller, microcontroller or state machine. A processor may also be implemented as a combination of computing devices, e.g., 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 or algorithm described in connection with the present disclosure 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 any form of storage medium that is known in the art. Some examples of storage media that may be used include random access memory (RAM), read only memory (ROM), flash memory, EPROM memory, EEPROM memory, registers, a hard disk, a removable disk, a CD-ROM and so forth. A software module may comprise a single instruction, or many instructions, and may be distributed over several different code segments, among different programs, and across multiple storage media. A storage medium may be coupled to a processor such that 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.
The methods disclosed herein comprise one or more steps or actions for achieving the described method. The method steps and/or actions may be interchanged with one another without departing from the scope of the claims. In other words, unless a specific order of steps or actions is specified, the order and/or use of specific steps and/or actions may be modified without departing from the scope of the claims.
The functions described may be implemented in hardware, software, firmware or any combination thereof. If implemented in software, the functions may be stored as one or more instructions on a computer-readable medium. A storage media may be any available media that can be accessed by a computer. By way of example, and not limitation, such computer-readable media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. Disk and disc, as used herein, include compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk, and Blu-ray® disc where disks usually reproduce data magnetically, while discs reproduce data optically with lasers.
Software or instructions may also be transmitted over a transmission medium. For example, if the software is transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the coaxial cable, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of transmission medium.
Further, it should be appreciated that modules and/or other appropriate means for performing the methods and techniques described herein can be downloaded and/or otherwise obtained by a user terminal and/or base station as applicable. For example, such a device can be coupled to a server to facilitate the transfer of means for performing the methods described herein. Alternatively, various methods described herein can be provided via storage means (e.g., RAM, ROM, a physical storage medium such as a compact disc (CD) or floppy disk, etc.), such that a user terminal and/or base station can obtain the various methods upon coupling or providing the storage means to the device. Moreover, any other suitable technique for providing the methods and techniques described herein to a device can be utilized.
It is to be understood that the claims are not limited to the precise configuration and components illustrated above. Various modifications, changes and variations may be made in the arrangement, operation and details of the methods and apparatus described above without departing from the scope of the claims.
Contents5
8 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8
Every citation, both waysCites: the store holds 10 of 11
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US11696228B2 | Cited by | United States of America | Applicant |
| US2016021669A1 | Cited by | United States of America | Pre-grant |
| US10798653B2 | Cited by | United States of America | Applicant |
| US11659305B2 | Cited by | United States of America | Applicant |
| US2012327850A1 | Cited by | United States of America | Pre-grant |
| US11516559B2 | Cited by | United States of America | Applicant |
| US9277564B2 | Cited by | United States of America | Applicant |
| US8885561B2 | Cited by | United States of America | Search report |
| US9467275B2 | Cited by | United States of America | Search report |
| WO0249305A2 | Cites | World Intellectual Property Organization (WIPO) | Applicant |
| EP1339245A1 | Cites | European Patent Office (EPO) | Applicant |
| US2005147023A1 | Cites | United States of America | Applicant |
| US2006040709A1 | Cites | United States of America | Search report |
| WO2007074452A2 | Cites | World Intellectual Property Organization (WIPO) | Applicant |
| US2008002621A1 | Cites | United States of America | Search report |
| WO2008011320A2 | Cites | World Intellectual Property Organization (WIPO) | Applicant |
| US2008020751A1 | Cites | United States of America | Search report |
| US2008072269A1 | Cites | United States of America | Search report |
| US2011216711A1 | Cites | United States of America | Search report |
| International Search Report and Written Opinion-PCT/US2009/054499, International Search Authority, European Patent Office, Dec. 7, 2009. | Non-patent | – | Applicant |
13 members in 8 offices
Priority claims6
| Document | Office | Kind | Date |
|---|---|---|---|
| 9051808 | United States of America | P | |
| 9051808 | United States of America | P | |
| 54384009 | United States of America | A | |
| 61090518 | – | – | – |
| US20080090518P | – | – | – |
| US20090543840 | – | – | – |
Members13
| Document | Office | Kind | |
|---|---|---|---|
| US2010046482A1 | United States of America | A1 | |
| WO2010022257A1 | World Intellectual Property Organization (WIPO) | A1 | |
| TW201012113A | Taiwan Province of China | A | |
| KR20110042385A | Republic of Korea | A | |
| EP2332381A1 | European Patent Office (EPO) | A1 | |
| CN102124797A | China | A | |
| JP2012500607A | Japan | A | |
| KR101229484B1 | Republic of Korea | B1 | |
| US8385288B2This record | United States of America | B2 | |
| JP5512679B2 | Japan | B2 | |
| EP2332381B1 | European Patent Office (EPO) | B1 | |
| ES2550622T3 | Spain | T3 | |
| CN102124797B | China | B |
53 transactions on the USPTO file
Allowed after 2 non-final rejections, 1 final rejection and 1 RCE.
- Non-final rejections
- 2
- Final rejections
- 1
- RCEs
- 1
- Appeals
- 0
Over time
Point at a mark for the transactionTransactions
| Event | Code | |
|---|---|---|
| Payment of Maintenance Fee, 12th Year, Large EntityM1553 | M1553 | |
| Payment of Maintenance Fee, 8th Year, Large EntityM1552 | M1552 | |
| Recordation of Patent Grant MailedPGM/ | PGM/ | |
| Patent Issue Date Used in PTA CalculationAllowedPTAC | PTAC | |
| Email NotificationEML_NTR | EML_NTR | |
| Issue Notification MailedAllowedWPIR | WPIR | |
| Dispatch to FDCD1935 | D1935 | |
| Application Is Considered Ready for IssuePILS | PILS | |
| Issue Fee Payment VerifiedN084 | N084 | |
| Issue Fee Payment ReceivedIFEE | IFEE | |
| Printer Rush- No mailingTCPB | TCPB | |
| Printer Rush- No mailingTCPB | TCPB | |
| Pubs Case Remand to TCPUBTC | PUBTC | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Notice of AllowanceAllowedMN/=. | MN/=. | |
| Notice of Allowance Data Verification CompletedAllowedN/=. | N/=. | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Disposal for a RCE / CPA / R129AbandonedABN9 | ABN9 | |
| Request for Continued Examination (RCE)RCEX | RCEX | |
| Workflow - Request for RCE - BeginBRCE | BRCE | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Final Rejection (PTOL - 326)Final rejectionMCTFR | MCTFR | |
| Final RejectionFinal rejectionCTFR | CTFR | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Information Disclosure Statement (IDS) FiledM844 | M844 | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Email NotificationEML_NTR | EML_NTR | |
| PG-Pub Issue NotificationPG-ISSUE | PG-ISSUE | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Application Dispatched from OIPEOIPE | OIPE | |
| Email NotificationEML_NTR | EML_NTR | |
| Filing ReceiptFLRCPT.O | FLRCPT.O | |
| Sent to Classification ContractorPGPC | PGPC | |
| Cleared by OIPE CSRL194 | L194 | |
| IFW Scan & PACR Auto Security ReviewSCAN | SCAN | |
| Initial Exam Team nnIEXX | IEXX |
6 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Maintenance fee paymentMAFP | MAFP | |
| Maintenance fee paymentMAFP | MAFP | |
| Fee paymentFPAY | FPAY | |
| Information on status: patent grantGrantedPATENTED CASESTCF | STCF | |
| AssignmentAS | AS | |
| AssignmentAS | AS |
Numbers
- Publication
- 08385288
- Publication, DOCDB
- 8385288
- Publication, EPODOC
- US8385288
- Application
- 12543840
- Application, DOCDB
- 54384009
- Application, EPODOC
- US20090543840
Titles
- English
- Multi-channel SDMA
Patent term adjustment
- A delay
- +415 daysthe office missed an examination deadline
- Net adjustment
- 415 days
Classification
- CPC, 5
- H04W72/12
- H04W72/1273
- H04W74/04
- H04W72/21
- H04B7/0697
- IPC, 1
- H04W4 00
- USPC, 2
- 370330000
- 455562100