US20050141495A1 - Filling the space-time channels in SDMA - Google Patents

Filling the space-time channels in SDMA Download PDF

Info

Publication number
US20050141495A1
US20050141495A1 US10/749,293 US74929303A US2005141495A1 US 20050141495 A1 US20050141495 A1 US 20050141495A1 US 74929303 A US74929303 A US 74929303A US 2005141495 A1 US2005141495 A1 US 2005141495A1
Authority
US
United States
Prior art keywords
access point
mobile station
mobile stations
schedule
spatial channels
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US10/749,293
Inventor
Xintian Lin
Qinghua Li
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tahoe Research Ltd
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority to US10/749,293 priority Critical patent/US20050141495A1/en
Application filed by Individual filed Critical Individual
Assigned to INTEL CORPORATION reassignment INTEL CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: LI, QINGHUA, LIN, XINTIAN E.
Priority to CN201210209835.9A priority patent/CN102739296B/en
Priority to EP04815418.1A priority patent/EP1704678B1/en
Priority to PCT/US2004/043340 priority patent/WO2005067219A2/en
Priority to CN2004800395937A priority patent/CN1902861B/en
Publication of US20050141495A1 publication Critical patent/US20050141495A1/en
Priority to US12/584,144 priority patent/US8483128B2/en
Priority to US12/584,780 priority patent/US20100002677A1/en
Priority to US14/219,271 priority patent/US9584239B2/en
Priority to US15/410,167 priority patent/US10091807B2/en
Assigned to TAHOE RESEARCH, LTD. reassignment TAHOE RESEARCH, LTD. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: INTEL CORPORATION
Abandoned legal-status Critical Current

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling
    • H04W72/1263Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0613Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission
    • H04B7/0615Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal
    • H04B7/0617Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using simultaneous transmission of weighted versions of same signal for beam forming
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/02Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
    • H04B7/04Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
    • H04B7/06Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station
    • H04B7/0697Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas at the transmitting station using spatial multiplexing
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04JMULTIPLEX COMMUNICATION
    • H04J3/00Time-division multiplex systems
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/06Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
    • H04W28/065Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information using assembly or disassembly of packets
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation
    • H04W72/044Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453Resources in frequency domain, e.g. a carrier in FDMA
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling
    • H04W72/1263Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
    • H04W72/1273Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows of downlink data flows
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/02Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/10Small scale networks; Flat hierarchical networks
    • H04W84/12WLAN [Wireless Local Area Networks]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W88/00Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/08Access point devices

Definitions

  • SDMA Spatial-Division Multiple-Access
  • AP wireless Access Point
  • mobile stations mobile stations
  • SDMA provides a performance advantage by enabling the access point to transmit and receive signals to/from multiple stations simultaneously using different spatial channels, which increases throughput of the existing Wireless Local Area Networks (WLANs).
  • WLANs Wireless Local Area Networks
  • FIG. 1 illustrates a network that includes an Access Point (AP) and mobile stations;
  • AP Access Point
  • FIG. 2 illustrates a protocol in accordance with the present invention for downlink transmissions
  • FIG. 3 illustrates a protocol that includes an access point generated schedule for uplink transmissions in accordance with the present invention
  • FIG. 4 illustrates a protocol that includes multiple schedules generated by an access point for uplink transmissions in accordance with the present invention
  • FIG. 5 illustrates a transmission that incorporates fragmentation at the end of a protected interval
  • FIG. 6 illustrates a transmission that incorporates a code rate adjustment at the end of a protected interval.
  • Coupled may mean that two or more elements are in direct physical or electrical contact. However, “coupled” may also mean that two or more elements are not in direct contact with each other, but yet still co-operate or interact with each other.
  • FIG. 1 illustrates a network 100 that includes an Access Point (AP) 110 and mobile stations (STAs) 120 , 130 , 140 and 150 .
  • wireless network 100 is a Wireless Local Area Network (WLAN).
  • WLAN Wireless Local Area Network
  • mobile stations 120 , 130 , 140 and 150 and access point 110 may operate in compliance with a wireless network standard such as ANSI/IEEE Std. 802.11, 1999 Edition, although this is not a limitation of the present invention.
  • the term “802.11” refers to any past, present, or future IEEE 802.11 standard, or extension thereto, including, but not limited to, the 1999 edition.
  • Mobile stations 120 , 130 , 140 and 150 may be any type of terminal or mobile station capable of communicating in network 100 .
  • the mobile stations may be computers, personal digital assistants, wireless-capable cellular phones, home audio or video appliances, or the like.
  • Access point 110 communicates with mobile station 120 (also referred to as “STA 1 ”) using signal 122 .
  • Access point 110 may also communicate with mobile station 130 (also referred to as “STA 2 ”) using signal 132 , mobile station 140 (also referred to as “STA 3 ”) using signal 142 and mobile station 150 (also referred to as “STA 4 ”) using signal 152 .
  • Signals 122 , 132 , 142 and 152 are transmitted through a wireless channel in free space between access point 110 and the various mobile stations.
  • Access point 110 includes a processor 160 and a Radio Frequency (RF) transceiver to receive and transmit modulated signals from one or more antennas.
  • the analog front end transceiver may be provided as a stand-alone integrated analog circuit, or alternatively, be embedded with processor 160 as a mixed-mode integrated circuit.
  • the received modulated signals are frequency down-converted, filtered, and converted to digital signals.
  • Access point 110 also includes a scheduler 170 , a fragmentor 180 and a code rate adjuster 190 whose features are further described herein.
  • FIG. 2 illustrates a protocol in accordance with the present invention for downlink transmissions.
  • Channel access marks the beginning of the bi-directional communications between the access point and a mobile station.
  • the channel is accessed by the access point sending a Clear-To-Send (CTS) frame that broadcasts a protected time interval, but other schemes to broadcast a protected time interval may be applied.
  • CTS Clear-To-Send
  • the protected time interval is announced by access point 110 such that no mobile station contends for the medium during that time interval.
  • the time interval length may be equal to the length of a buffered packet as long as the transmission opportunity (TXOP) in the 802.11e standard, or another time period without limiting the present invention.
  • Access point 110 fills the M spatial channels using the data packets buffered for all stations. Note that this feature is in contrast to conventional Spatial-Division Multiple-Access (SDMA) systems where the access point fills the M channels only using packets buffered for M stations.
  • SDMA Spatial-Division
  • scheduler 170 schedules data packets that may have differing lengths for transmission to the selected mobile stations, and as shown, arranges those data packets based on transmission times to send on each of the spatial channels.
  • scheduler 170 One feature of scheduler 170 is that the system resources of SDMA are efficiently utilized by accounting for the differences in packet lengths to fill the spatial channels by signals in time. Accordingly, the features of scheduler 170 significantly improve the throughput of SDMA on the spatial channels during the protected time interval (beginning at time to) where data packets are transmitted to the mobile stations.
  • Scheduler 170 fills M spatial channels by scheduling the traffic for M stations at any time instant, where M is a constant less than or equal to the number of antennas N at the access point. For simplicity of description and by way of example, N antennas may form M spatial channels for M stations at any time instant.
  • the system network 100 throughput is dramatically increased when scheduler 170 fills the M spatial channels at all times.
  • the algorithm of scheduler 170 operates to maximize the usage of the M channels, maximize the total throughput of the M channels, minimize the average bit-error rates that may be affected by the interference between spatial channels, and minimize the average latency.
  • adaptive antenna arrays are used in conjunction with a beam forming algorithm to achieve spatial diversity within each spatial cell and implement SDMA. That is, signals output by the antennas are directionally formed by selectively energizing different antenna sensors with different signal gains so that remote terminals or mobile stations in one portion of a spatial cell may communicate with access point 110 while other remote mobile stations in a different portion of the spatial cell may communicate with the same access point, even if they are using the same tone set and code.
  • access point 110 in the SDMA downlink first selects a group of mobile stations having buffered data, and then forms spatial channels using the adaptive antenna arrays to send data to the mobile stations. To transmit data on the spatial channels, the access point retrieves the antenna resources to form that spatial channel, with capabilities to form new channels for a waiting mobile station developed on the fly.
  • the access point broadcasts a clear-to-send (CTS) packet to hold the medium for a certain duration.
  • Data packets are then sent to mobile stations 120 , 130 , 140 and 150 using only two spatial channels at any time instant.
  • the scheduler 170 designates two data packets, i.e., labeled Ack+Data 1 and Data 1 , for mobile station 120 .
  • Scheduler 170 does not place the data packets into two spatial channels at the same time since mobile station 120 may not be equipped with multiple antennas to receive the two packets simultaneously. Therefore, scheduler 170 does not exchange the position of the latter data packet labeled Data 1 with either the data packet labeled Data 2 or the data packet labeled Ack+Data 3 .
  • the algorithm of scheduler 170 does not exchange the data packet labeled Data 1 with the data packet labeled Data 4 .
  • FIG. 3 illustrates a protocol that includes an access point generated schedule for uplink transmissions in accordance with the present invention.
  • scheduler 170 first schedules the transmission intervals for different mobile stations according to the traffic information about the stations such as, for example, packet size, queue size and priority. This information may be acquired by access point 110 through polling or piggy-back feedback from mobile stations 120 , 130 , 140 and 150 .
  • the optimization goals of scheduler 170 are the same as those listed for the downlink.
  • the access point broadcasts the schedule to all the mobile stations and listens to the uplink packets.
  • the acknowledgements of the uplink data packets may be sent in normal downlink packets.
  • the access point broadcasts the schedule packet in order to both announce the transmission opportunities (or intervals) and hold the medium for a certain duration.
  • the addressed stations respond by sending their data packets within the specified intervals.
  • Mobile station 120 (STA 1 ) is assigned two time intervals and that station sends two packets in the first interval and one packet in the second interval.
  • Access point 110 may broadcast the schedule using an omni-directional antenna, since the schedule is directed collectively to mobile stations 120 , 130 , 140 and 150 , and there are only two spatial channels available at each time instant.
  • FIG. 4 illustrates a protocol that includes multiple schedules generated by access point 110 for uplink transmissions in accordance with the present invention. If the omni-directional antenna can not reach mobile stations based on distance, several schedule packets instead of one may be sent through spatial channels with higher antenna gains.
  • the figure illustrates an example for two schedule packets, where the first schedule packet is prepared for mobile stations 120 (STA 1 ) and 130 (STA 2 ) and the second schedule packet is prepared for mobile stations 140 (STA 3 ) and 150 (STA 4 ).
  • the first schedule packet schedules the uplink time interval using spatial channels pointed to STA 1 and STA 2
  • the second schedule packet schedules the uplink time interval using spatial channels pointed to STA 3 and STA 4 .
  • FIG. 5 illustrates a transmission of data packets that incorporates fragmentation at the end of a protected interval to improve the channel efficiency.
  • the fragmentor 180 in access point 110 may employ fragmentation to completely fill the space-time channels in the downlink.
  • the access point may fill the channels of data packets next to each other and fragment some packets at the end of the protected interval, although this is not a limitation of the present invention.
  • the data packet prepared for mobile station 150 (STA 4 ) is fragmented to fit the protected interval. Note that since data packets Data 2 and Data 3 are sent to different mobile stations through different spatial channels, they are placed next to each other and do not need to be separated by a Short Inter-Frame Spacing (SIFS).
  • SIFS Short Inter-Frame Spacing
  • FIG. 6 illustrates a data packet transmission that incorporates a code rate adjustment at the end of a protected interval.
  • Code rate adjustment changes the code rates of the Forward Error-Correction (FEC) codes in the packets and may be employed to fill the space-time channels.
  • FEC Forward Error-Correction
  • Code rate adjustment can be applied to multiple packets within the protected interval. Note that a higher code rate may increase the chance that the packet gets lost, while the lower code rate may increase the length of the data packets.
  • the access point and the mobile stations may adjust the packet length by changing the code rate and making the appropriate tradeoffs. Since the access point usually is not power critical, reducing the code rate to fill the channels may be desired. As illustrated in the figure, the code rate of the latter Data 1 packet has been reduced such that its reliability is increased without reducing the system throughput.
  • MAC Medium Access Control

Abstract

A Medium Access Control (MAC) protocol enhances the efficiency of SDMA systems and includes features for fragmentation, data traffic scheduling, adjusting error rate control bits and retrieving antenna resources to form spatial channels developed on the fly.

Description

  • Spatial-Division Multiple-Access (SDMA) is a technique that allows multiple independent transmissions between a wireless Access Point (AP) having multiple antennas and other wireless devices (mobile stations). SDMA provides a performance advantage by enabling the access point to transmit and receive signals to/from multiple stations simultaneously using different spatial channels, which increases throughput of the existing Wireless Local Area Networks (WLANs). However, a need exists for SDMA to mitigate unused channels in uplinks and downlinks.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • The subject matter regarded as the invention is particularly pointed out and distinctly claimed in the concluding portion of the specification. The invention, however, both as to organization and method of operation, together with objects, features, and advantages thereof, may best be understood by reference to the following detailed description when read with the accompanying drawings in which:
  • FIG. 1 illustrates a network that includes an Access Point (AP) and mobile stations;
  • FIG. 2 illustrates a protocol in accordance with the present invention for downlink transmissions;
  • FIG. 3 illustrates a protocol that includes an access point generated schedule for uplink transmissions in accordance with the present invention;
  • FIG. 4 illustrates a protocol that includes multiple schedules generated by an access point for uplink transmissions in accordance with the present invention;
  • FIG. 5 illustrates a transmission that incorporates fragmentation at the end of a protected interval; and
  • FIG. 6 illustrates a transmission that incorporates a code rate adjustment at the end of a protected interval.
  • It will be appreciated that for simplicity and clarity of illustration, elements illustrated in the figures have not necessarily been drawn to scale. For example, the dimensions of some of the elements may be exaggerated relative to other elements for clarity. Further, where considered appropriate, reference numerals have been repeated among the figures to indicate corresponding or analogous elements.
  • DETAILED DESCRIPTION
  • In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the invention. However, it will be understood by those skilled in the art that the present invention may be practiced without these specific details. In other instances, well-known methods, procedures, components and circuits have not been described in detail so as not to obscure the present invention.
  • In the following description and claims, the terms “coupled” and “connected,” along with their derivatives, may be used. It should be understood that these terms are not intended as synonyms for each other. Rather, in particular embodiments, “connected” may be used to indicate that two or more elements are in direct physical or electrical contact with each other. “Coupled” may mean that two or more elements are in direct physical or electrical contact. However, “coupled” may also mean that two or more elements are not in direct contact with each other, but yet still co-operate or interact with each other.
  • FIG. 1 illustrates a network 100 that includes an Access Point (AP) 110 and mobile stations (STAs) 120, 130, 140 and 150. In some embodiments, wireless network 100 is a Wireless Local Area Network (WLAN). For example, one or more of mobile stations 120, 130, 140 and 150 and access point 110 may operate in compliance with a wireless network standard such as ANSI/IEEE Std. 802.11, 1999 Edition, although this is not a limitation of the present invention. As used herein, the term “802.11” refers to any past, present, or future IEEE 802.11 standard, or extension thereto, including, but not limited to, the 1999 edition. Mobile stations 120, 130, 140 and 150 may be any type of terminal or mobile station capable of communicating in network 100. For example, the mobile stations may be computers, personal digital assistants, wireless-capable cellular phones, home audio or video appliances, or the like.
  • Access point 110 communicates with mobile station 120 (also referred to as “STA1”) using signal 122. Access point 110 may also communicate with mobile station 130 (also referred to as “STA2”) using signal 132, mobile station 140 (also referred to as “STA3”) using signal 142 and mobile station 150 (also referred to as “STA4”) using signal 152. Signals 122, 132, 142 and 152 are transmitted through a wireless channel in free space between access point 110 and the various mobile stations.
  • Access point 110 includes a processor 160 and a Radio Frequency (RF) transceiver to receive and transmit modulated signals from one or more antennas. The analog front end transceiver may be provided as a stand-alone integrated analog circuit, or alternatively, be embedded with processor 160 as a mixed-mode integrated circuit. The received modulated signals are frequency down-converted, filtered, and converted to digital signals. Access point 110 also includes a scheduler 170, a fragmentor 180 and a code rate adjuster 190 whose features are further described herein.
  • FIG. 2 illustrates a protocol in accordance with the present invention for downlink transmissions. Channel access marks the beginning of the bi-directional communications between the access point and a mobile station. The channel is accessed by the access point sending a Clear-To-Send (CTS) frame that broadcasts a protected time interval, but other schemes to broadcast a protected time interval may be applied. The protected time interval is announced by access point 110 such that no mobile station contends for the medium during that time interval. The time interval length may be equal to the length of a buffered packet as long as the transmission opportunity (TXOP) in the 802.11e standard, or another time period without limiting the present invention. Access point 110 fills the M spatial channels using the data packets buffered for all stations. Note that this feature is in contrast to conventional Spatial-Division Multiple-Access (SDMA) systems where the access point fills the M channels only using packets buffered for M stations.
  • Thus, in the SDMA downlink and prior to time to, access point 110 selects mobile stations that have buffered data. Scheduler 170 (see FIG. 1) schedules data packets that may have differing lengths for transmission to the selected mobile stations, and as shown, arranges those data packets based on transmission times to send on each of the spatial channels. One feature of scheduler 170 is that the system resources of SDMA are efficiently utilized by accounting for the differences in packet lengths to fill the spatial channels by signals in time. Accordingly, the features of scheduler 170 significantly improve the throughput of SDMA on the spatial channels during the protected time interval (beginning at time to) where data packets are transmitted to the mobile stations.
  • Scheduler 170 fills M spatial channels by scheduling the traffic for M stations at any time instant, where M is a constant less than or equal to the number of antennas N at the access point. For simplicity of description and by way of example, N antennas may form M spatial channels for M stations at any time instant. The system network 100 throughput is dramatically increased when scheduler 170 fills the M spatial channels at all times. The algorithm of scheduler 170 operates to maximize the usage of the M channels, maximize the total throughput of the M channels, minimize the average bit-error rates that may be affected by the interference between spatial channels, and minimize the average latency.
  • In accordance with one aspect of the present invention, adaptive antenna arrays are used in conjunction with a beam forming algorithm to achieve spatial diversity within each spatial cell and implement SDMA. That is, signals output by the antennas are directionally formed by selectively energizing different antenna sensors with different signal gains so that remote terminals or mobile stations in one portion of a spatial cell may communicate with access point 110 while other remote mobile stations in a different portion of the spatial cell may communicate with the same access point, even if they are using the same tone set and code.
  • In another aspect of the present invention, access point 110 in the SDMA downlink first selects a group of mobile stations having buffered data, and then forms spatial channels using the adaptive antenna arrays to send data to the mobile stations. To transmit data on the spatial channels, the access point retrieves the antenna resources to form that spatial channel, with capabilities to form new channels for a waiting mobile station developed on the fly.
  • In particular, the access point broadcasts a clear-to-send (CTS) packet to hold the medium for a certain duration. Data packets are then sent to mobile stations 120, 130, 140 and 150 using only two spatial channels at any time instant. In the illustrated downlink example, the scheduler 170 designates two data packets, i.e., labeled Ack+Data 1 and Data 1, for mobile station 120. Scheduler 170 does not place the data packets into two spatial channels at the same time since mobile station 120 may not be equipped with multiple antennas to receive the two packets simultaneously. Therefore, scheduler 170 does not exchange the position of the latter data packet labeled Data 1 with either the data packet labeled Data 2 or the data packet labeled Ack+Data 3. Furthermore, to improve channel efficiency and increase throughput, the algorithm of scheduler 170 does not exchange the data packet labeled Data 1 with the data packet labeled Data 4.
  • FIG. 3 illustrates a protocol that includes an access point generated schedule for uplink transmissions in accordance with the present invention. In the uplink, scheduler 170 first schedules the transmission intervals for different mobile stations according to the traffic information about the stations such as, for example, packet size, queue size and priority. This information may be acquired by access point 110 through polling or piggy-back feedback from mobile stations 120, 130, 140 and 150. The optimization goals of scheduler 170 are the same as those listed for the downlink. As shown in the figure, the access point broadcasts the schedule to all the mobile stations and listens to the uplink packets. The acknowledgements of the uplink data packets may be sent in normal downlink packets.
  • The access point broadcasts the schedule packet in order to both announce the transmission opportunities (or intervals) and hold the medium for a certain duration. After the broadcasted schedule is received by mobile stations 120, 130, 140 and 150, the addressed stations respond by sending their data packets within the specified intervals. Mobile station 120 (STA1) is assigned two time intervals and that station sends two packets in the first interval and one packet in the second interval. Access point 110 may broadcast the schedule using an omni-directional antenna, since the schedule is directed collectively to mobile stations 120, 130, 140 and 150, and there are only two spatial channels available at each time instant.
  • FIG. 4 illustrates a protocol that includes multiple schedules generated by access point 110 for uplink transmissions in accordance with the present invention. If the omni-directional antenna can not reach mobile stations based on distance, several schedule packets instead of one may be sent through spatial channels with higher antenna gains. The figure illustrates an example for two schedule packets, where the first schedule packet is prepared for mobile stations 120 (STA1) and 130 (STA2) and the second schedule packet is prepared for mobile stations 140 (STA3) and 150 (STA4). In other words, the first schedule packet schedules the uplink time interval using spatial channels pointed to STA1 and STA2, and the second schedule packet schedules the uplink time interval using spatial channels pointed to STA3 and STA4.
  • FIG. 5 illustrates a transmission of data packets that incorporates fragmentation at the end of a protected interval to improve the channel efficiency. The fragmentor 180 in access point 110 (see FIG. 1) and a fragmentor unit in mobile stations 120, 130, 140 and 150 may employ fragmentation to completely fill the space-time channels in the downlink. For example, the access point may fill the channels of data packets next to each other and fragment some packets at the end of the protected interval, although this is not a limitation of the present invention. As shown in the figure, the data packet prepared for mobile station 150 (STA4) is fragmented to fit the protected interval. Note that since data packets Data 2 and Data 3 are sent to different mobile stations through different spatial channels, they are placed next to each other and do not need to be separated by a Short Inter-Frame Spacing (SIFS).
  • FIG. 6 illustrates a data packet transmission that incorporates a code rate adjustment at the end of a protected interval. Code rate adjustment changes the code rates of the Forward Error-Correction (FEC) codes in the packets and may be employed to fill the space-time channels. Code rate adjustment can be applied to multiple packets within the protected interval. Note that a higher code rate may increase the chance that the packet gets lost, while the lower code rate may increase the length of the data packets. The access point and the mobile stations may adjust the packet length by changing the code rate and making the appropriate tradeoffs. Since the access point usually is not power critical, reducing the code rate to fill the channels may be desired. As illustrated in the figure, the code rate of the latter Data 1 packet has been reduced such that its reliability is increased without reducing the system throughput.
  • By now it should be apparent that a Medium Access Control (MAC) protocol may be used to enhance the efficiency of SDMA systems in accordance with features of the present invention, such features including fragmentation, data traffic scheduling, adding error rate control bits and retrieving antenna resources to form spatial channels developed on the fly.
  • While certain features of the invention have been illustrated and described herein, many modifications, substitutions, changes, and equivalents will now occur to those skilled in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and changes as fall within the true spirit of the invention.

Claims (29)

1. A device, comprising:
a scheduler in an access point to provide a schedule of variable length packets based on transmission times to send on spatial channels to mobile stations.
2. The device of claim 1 further including adaptive antenna arrays used in conjunction with a beam forming algorithm to achieve spatial diversity and implement Spatial-Division Multiple-Access (SDMA), wherein the adaptive antenna array changes beam weights based on the schedule.
3. The device of claim 1 wherein the scheduler in the downlink provides the schedule of transmission intervals for different mobile stations.
4. The device of claim 1 wherein the schedule accounts for traffic information to the mobile stations based on packet size.
5. The device of claim 1 wherein the schedule accounts for traffic information to the mobile stations based on queue size.
6. The device of claim 1 wherein the schedule accounts for traffic information to the mobile stations based on priority.
7. The device of claim 1 wherein the access point sends multiple schedules in a protected time interval to the mobile stations.
8. The device of claim 7 wherein a first schedule of the multiple schedules is sent to a first mobile station and a second schedule is sent to a second mobile station.
9. The device of claim 1 wherein the access point fills spatial channels using the data packets buffered for all the mobile stations.
10. A device, comprising:
a scheduler in an access point to receive traffic information from at least one mobile station in an uplink, where the traffic information is used to schedule packets to the at least one mobile station in a downlink.
11. The device of claim 10, wherein the scheduler in the access point provides scheduled, variable length packets on spatial channels to the at least one mobile station.
12. The device of claim 10, wherein the access point polls to acquire packet size information from the at least one mobile station.
13. The device of claim 10, wherein the access point polls to acquire queue size information from the at least one mobile station.
14. The device of claim 10, wherein the access point polls to acquire priority information from the at least one mobile station.
15. The device of claim 10, wherein the access point receives piggy-back feedback to acquire packet size information from the at least one mobile station.
16. The device of claim 10, wherein the access point receives piggy-back feedback to acquire queue size information from the at least one mobile station.
17. The device of claim 10, wherein the access point receives piggy-back feedback to acquire priority information from the at least one mobile station.
18. The device of claim 10 wherein the access point sends an acknowledgement of an uplink data packet to the at least one mobile station in a normal downlink packet.
19. A system, comprising:
mobile stations in a network; and
an access point having a scheduler to add code bits to a data packet to send on spatial channels to at least one mobile station.
20. The system of claim 19 further including a code rate adjuster to add a code rate adjustment to at least one data packet within a protected interval of a data packet transmission.
21. The system of claim 19 wherein the code rate adjuster changes a code rate of Forward Error-Correction (FEC) codes in the data packet to fill space-time channels.
22. The system of claim 19 wherein the access point provides a packet to hold a medium for a certain duration and the scheduler controls communication traffic on two spatial channels by not placing the data packets for the at least one mobile station into the two spatial channels at the same time.
23. A Wireless Local Area Network (WLAN), comprising:
mobile stations; and
an access point to incorporate fragmentation to at least one data packet within a protected interval to send to at least one mobile station.
24. The WLAN of claim 23, further including a fragmentor unit in the at least one mobile station to use fragmentation to fill space-time channels in a downlink transmission to the access point.
25. The WLAN of claim 23 wherein the access point fills channels of data packets next to each other and fragments at least one data packet within the protected interval.
26. A method for a Medium Access Control (MAC) protocol, comprising:
scheduling variable length packets in an access point based on transmission times to send on spatial channels to mobile stations.
27. The method of claim 26, further including:
retrieving antenna resources in the access point to form spatial channels developed on the fly for a waiting mobile station.
28. The method of claim 26, further including:
fragmenting at least one data packet within a protected interval to send to at least one of the mobile stations.
29. The method of claim 26, further including:
using a code rate adjustment to change code rates of Forward Error-Correction (FEC) codes in at least one of the variable length packets to fill the spatial channels.
US10/749,293 2003-12-30 2003-12-30 Filling the space-time channels in SDMA Abandoned US20050141495A1 (en)

Priority Applications (9)

Application Number Priority Date Filing Date Title
US10/749,293 US20050141495A1 (en) 2003-12-30 2003-12-30 Filling the space-time channels in SDMA
CN201210209835.9A CN102739296B (en) 2003-12-30 2004-12-23 The equipment of space-time channels, method and system are filled in space division multiple access SDMA
EP04815418.1A EP1704678B1 (en) 2003-12-30 2004-12-23 Filling the space-time channels in sdma
PCT/US2004/043340 WO2005067219A2 (en) 2003-12-30 2004-12-23 Filling the space-time channels in sdma
CN2004800395937A CN1902861B (en) 2003-12-30 2004-12-23 Filling the space-time channels in SDMA
US12/584,144 US8483128B2 (en) 2003-12-30 2009-09-01 Filling the space-time channels in SDMA
US12/584,780 US20100002677A1 (en) 2003-12-30 2009-09-10 Filling the space-time channels in SDMA
US14/219,271 US9584239B2 (en) 2003-12-30 2014-03-19 Filling the space-time channels in SDMA
US15/410,167 US10091807B2 (en) 2003-12-30 2017-01-19 Wireless transmission over space-time channels

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US10/749,293 US20050141495A1 (en) 2003-12-30 2003-12-30 Filling the space-time channels in SDMA

Related Child Applications (2)

Application Number Title Priority Date Filing Date
US12/584,144 Continuation US8483128B2 (en) 2003-12-30 2009-09-01 Filling the space-time channels in SDMA
US12/584,780 Continuation US20100002677A1 (en) 2003-12-30 2009-09-10 Filling the space-time channels in SDMA

Publications (1)

Publication Number Publication Date
US20050141495A1 true US20050141495A1 (en) 2005-06-30

Family

ID=34701044

Family Applications (5)

Application Number Title Priority Date Filing Date
US10/749,293 Abandoned US20050141495A1 (en) 2003-12-30 2003-12-30 Filling the space-time channels in SDMA
US12/584,144 Expired - Lifetime US8483128B2 (en) 2003-12-30 2009-09-01 Filling the space-time channels in SDMA
US12/584,780 Abandoned US20100002677A1 (en) 2003-12-30 2009-09-10 Filling the space-time channels in SDMA
US14/219,271 Expired - Lifetime US9584239B2 (en) 2003-12-30 2014-03-19 Filling the space-time channels in SDMA
US15/410,167 Expired - Lifetime US10091807B2 (en) 2003-12-30 2017-01-19 Wireless transmission over space-time channels

Family Applications After (4)

Application Number Title Priority Date Filing Date
US12/584,144 Expired - Lifetime US8483128B2 (en) 2003-12-30 2009-09-01 Filling the space-time channels in SDMA
US12/584,780 Abandoned US20100002677A1 (en) 2003-12-30 2009-09-10 Filling the space-time channels in SDMA
US14/219,271 Expired - Lifetime US9584239B2 (en) 2003-12-30 2014-03-19 Filling the space-time channels in SDMA
US15/410,167 Expired - Lifetime US10091807B2 (en) 2003-12-30 2017-01-19 Wireless transmission over space-time channels

Country Status (4)

Country Link
US (5) US20050141495A1 (en)
EP (1) EP1704678B1 (en)
CN (2) CN1902861B (en)
WO (1) WO2005067219A2 (en)

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070147520A1 (en) * 2005-12-23 2007-06-28 Qinghua Li Techniques to time vary pilot locations in wireless networks
US20090238132A1 (en) * 2008-03-24 2009-09-24 Kabushiki Kaisha Toshiba Wireless communication apparatus
US20100220678A1 (en) * 2009-02-27 2010-09-02 Qualcomm Incorporated Piggybacking information in transmit opportunities
WO2011090567A2 (en) 2009-12-28 2011-07-28 Intel Corporation Efficient uplink sdma operation
US20140269664A1 (en) * 2003-12-30 2014-09-18 Xintian Lin Filling the space-time channels in sdma
US20160007330A1 (en) * 2008-03-28 2016-01-07 Kabushiki Kaisha Toshiba Radio system, radio base station and radio terminal
US20170078052A1 (en) * 2015-09-10 2017-03-16 Kabushiki Kaisha Toshiba Wireless communication device and wireless communication method
US20190045539A1 (en) * 2014-06-09 2019-02-07 Intel Corporation Systems and methods for facilitating simultaneous poll responses
US10211895B2 (en) * 2006-02-28 2019-02-19 Woodbury Wireless Llc MIMO methods and systems
US20190281461A1 (en) * 2018-03-12 2019-09-12 At&T Digital Life, Inc. Detecting unauthorized access to a wireless network
US10660047B2 (en) * 2016-04-28 2020-05-19 Sony Mobile Communications Inc. Transmit power of pilot signals
RU205442U1 (en) * 2021-04-09 2021-07-14 Анатолий Николаевич Мартьянов DEVICE FOR MINIMIZING THE APPLICATION QUEUE IN MASS SERVICE SYSTEMS WITH PULSING INPUT FLOW

Families Citing this family (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2913210B1 (en) * 2007-03-02 2009-05-29 Sidel Participations IMPROVEMENTS IN THE HEATING OF PLASTIC MATERIALS BY INFRARED RADIATION
WO2011034753A2 (en) 2009-09-18 2011-03-24 Marvell World Trade Ltd. Short packet for use in beamforming
US8542696B2 (en) 2009-12-16 2013-09-24 Intel Corporation Device, system and method of simultaneously communicating with a group of wireless communication units
US20110149731A1 (en) * 2009-12-17 2011-06-23 Gong Michelle X Device, system and method of scheduling communications with a group of wireless communication units
US8774095B2 (en) * 2011-10-25 2014-07-08 Hon Hai Precision Industry Co., Ltd. Wireless access point device and communication collision avoiding method
US20160261388A1 (en) * 2013-11-25 2016-09-08 University Of Utah Research Foundation A multiple user communication network
EP3266171A4 (en) * 2015-03-06 2018-03-14 Telefonaktiebolaget LM Ericsson (publ) Multi-user packet transmission, clustering and/or scheduling in a wireless local area network
JP6938770B2 (en) * 2018-04-04 2021-09-22 株式会社ソニー・インタラクティブエンタテインメント Communication device, generated data size control method and program
RU203223U1 (en) * 2020-09-22 2021-03-26 Анатолий Николаевич Мартьянов DEVICE FOR CALCULATING THE OPTIMAL PACKET SIZE BY CRITERION OF MINIMUM DELAY AND MESSAGE TRANSMISSION TIME DIFFERENCE
RU202244U1 (en) * 2020-09-22 2021-02-09 Анатолий Николаевич Мартьянов DEVICE FOR CALCULATING THE OPTIMUM PACKET SIZE BY THE CRITERION OF THE MINIMUM TOTAL MESSAGE TRANSMISSION TIME
RU205444U1 (en) * 2021-04-09 2021-07-14 Анатолий Николаевич Мартьянов DEVICE FOR CALCULATING THE OPTIMAL PACKET SIZE BY THE CRITERION OF THE MINIMUM DELAYED DIGITAL COMPRESSED IMAGES IN THE CONDITIONS OF OPTIMAL Smoothing WITHOUT LOSS
CN113408629B (en) * 2021-06-22 2022-09-06 中国科学技术大学 Multiple completion method of motor vehicle exhaust telemetering data based on space-time convolution network

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20010047424A1 (en) * 2000-05-12 2001-11-29 Ari Alastalo Method for arranging communication between terminals and an access point in a communication system
US20030227914A1 (en) * 2002-06-05 2003-12-11 Hung Nguyen Wireless switch for use in wireless communications
US20050111376A1 (en) * 2003-11-21 2005-05-26 Nokia Corporation Flexible rate split method for MIMO transmission
US20070081498A1 (en) * 2003-11-07 2007-04-12 Mitsubishi Denki Kabushki Kaisha Mobile station, communication system, communication control method

Family Cites Families (35)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6567416B1 (en) * 1997-10-14 2003-05-20 Lucent Technologies Inc. Method for access control in a multiple access system for communications networks
US6826240B1 (en) * 2000-03-15 2004-11-30 Motorola, Inc. Method and device for multi-user channel estimation
US6504506B1 (en) * 2000-06-30 2003-01-07 Motorola, Inc. Method and device for fixed in time adaptive antenna combining weights
US6870808B1 (en) * 2000-10-18 2005-03-22 Adaptix, Inc. Channel allocation in broadband orthogonal frequency-division multiple-access/space-division multiple-access networks
EP1202587B1 (en) * 2000-10-31 2004-12-15 Kabushiki Kaisha Toshiba Wireless communication system, weight control apparatus, and weight vector generation method
US6721302B1 (en) * 2000-11-17 2004-04-13 Nokia Corporation Apparatus, and associated method, for communicating packet data in a SDMA (Space-Division, Multiple-Access) communication scheme
EP2259479B1 (en) * 2000-11-20 2019-04-17 Sony Deutschland GmbH Adaptive subcarrier loading
US20020093929A1 (en) * 2001-01-18 2002-07-18 Koninklijke Philips Electronics N.V. System and method for sharing bandwidth between co-located 802.11a/e and HIPERLAN/2 systems
GB0103274D0 (en) * 2001-02-09 2001-03-28 Nokia Networks Oy A data communication system
US7103022B2 (en) * 2001-02-14 2006-09-05 Ntt Docomo, Inc. Communication control method and apparatus in mobile communication system
US6847832B2 (en) * 2001-03-09 2005-01-25 Kathrein-Werke Kg System and method for providing phase matching with optimized beam widths
EP1246411B1 (en) * 2001-03-30 2004-02-18 Alcatel Method for multiplexing two data flows on a radio communication channel and corresponding transmitter
US6662024B2 (en) 2001-05-16 2003-12-09 Qualcomm Incorporated Method and apparatus for allocating downlink resources in a multiple-input multiple-output (MIMO) communication system
US7158501B2 (en) * 2001-05-29 2007-01-02 Kabushiki Kaisha Toshiba Wireless communication apparatus
KR100510679B1 (en) * 2003-03-21 2005-08-31 엘지전자 주식회사 Digital VSB transmitting system and enhanced data multiplexing method in a VSB transmitting system
US6965774B1 (en) * 2001-09-28 2005-11-15 Arraycomm, Inc. Channel assignments in a wireless communication system having spatial channels including enhancements in anticipation of new subscriber requests
US6999771B1 (en) * 2001-09-28 2006-02-14 Arraycomm Llc Channel assignments in a wireless communication system having spatial channels including grouping existing subscribers in anticipation of a new subscriber
US8090381B2 (en) * 2001-11-20 2012-01-03 At&T Intellectual Property Ii, L.P. Protocol assisted switched diversity of antennas
US7020110B2 (en) 2002-01-08 2006-03-28 Qualcomm Incorporated Resource allocation for MIMO-OFDM communication systems
US8027637B1 (en) * 2002-01-11 2011-09-27 Broadcom Corporation Single frequency wireless communication system
WO2003077588A1 (en) 2002-03-13 2003-09-18 Telefonaktiebolaget L M Ericsson Connection admission control in packet-oriented, multi-service networks
US7031679B2 (en) * 2002-03-27 2006-04-18 Arraycomm, Llc Estimating power on spatial channels
CN1663074A (en) 2002-06-17 2005-08-31 美商智慧财产权授权股份有限公司 Antenna steering scheduler for mobile station in wireless local area network
US7095709B2 (en) * 2002-06-24 2006-08-22 Qualcomm, Incorporated Diversity transmission modes for MIMO OFDM communication systems
US20040002357A1 (en) * 2002-06-25 2004-01-01 Mathilde Benveniste Directional antennas and wireless channel access
US8208364B2 (en) * 2002-10-25 2012-06-26 Qualcomm Incorporated MIMO system with multiple spatial multiplexing modes
US7352718B1 (en) * 2003-07-22 2008-04-01 Cisco Technology, Inc. Spatial division multiple access for wireless networks
US20050147115A1 (en) * 2003-12-24 2005-07-07 Qinghua Li SDMA training operations
US7394858B2 (en) * 2003-08-08 2008-07-01 Intel Corporation Systems and methods for adaptive bit loading in a multiple antenna orthogonal frequency division multiplexed communication system
KR100790092B1 (en) 2003-08-18 2007-12-31 삼성전자주식회사 Apparatus and method for scheduling resource in a radio communication system using multi-user multiple input multiple output scheme
US7668125B2 (en) 2003-09-09 2010-02-23 Qualcomm Incorporated Incremental redundancy transmission for multiple parallel channels in a MIMO communication system
US7443818B2 (en) * 2003-12-15 2008-10-28 Intel Corporation Method, apparatus and system of multiple-input-multiple-output wireless communication
US8199723B2 (en) 2003-12-23 2012-06-12 Intel Corporation Parallel wireless communication apparatus, method, and system
US20050141495A1 (en) 2003-12-30 2005-06-30 Lin Xintian E. Filling the space-time channels in SDMA
EP3654691A1 (en) * 2010-10-01 2020-05-20 Mitsubishi Electric Corporation Communication system, base station and radio network controller

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20010047424A1 (en) * 2000-05-12 2001-11-29 Ari Alastalo Method for arranging communication between terminals and an access point in a communication system
US20030227914A1 (en) * 2002-06-05 2003-12-11 Hung Nguyen Wireless switch for use in wireless communications
US20070081498A1 (en) * 2003-11-07 2007-04-12 Mitsubishi Denki Kabushki Kaisha Mobile station, communication system, communication control method
US20050111376A1 (en) * 2003-11-21 2005-05-26 Nokia Corporation Flexible rate split method for MIMO transmission

Cited By (29)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140269664A1 (en) * 2003-12-30 2014-09-18 Xintian Lin Filling the space-time channels in sdma
US10091807B2 (en) 2003-12-30 2018-10-02 Intel Corporation Wireless transmission over space-time channels
US9584239B2 (en) * 2003-12-30 2017-02-28 Intel Corporation Filling the space-time channels in SDMA
US7532675B2 (en) 2005-12-23 2009-05-12 Intel Corporation Techniques to time vary pilot locations in wireless networks
US20070147520A1 (en) * 2005-12-23 2007-06-28 Qinghua Li Techniques to time vary pilot locations in wireless networks
US10211895B2 (en) * 2006-02-28 2019-02-19 Woodbury Wireless Llc MIMO methods and systems
US9826492B2 (en) 2008-03-24 2017-11-21 Kabushiki Kaisha Toshiba Wireless communication apparatus
US8675633B2 (en) * 2008-03-24 2014-03-18 Kabushiki Kaisha Toshiba Wireless communication apparatus capable of avoiding collisions
US20090238132A1 (en) * 2008-03-24 2009-09-24 Kabushiki Kaisha Toshiba Wireless communication apparatus
US9198196B2 (en) 2008-03-24 2015-11-24 Kabushiki Kaisha Toshiba Wireless communication apparatus
US9565644B2 (en) 2008-03-24 2017-02-07 Kabushiki Kaisha Toshiba Wireless communication apparatus
US10231231B2 (en) * 2008-03-28 2019-03-12 Kabushiki Kaisha Toshiba Radio system, radio base station and radio terminal
US20160007330A1 (en) * 2008-03-28 2016-01-07 Kabushiki Kaisha Toshiba Radio system, radio base station and radio terminal
US20100220678A1 (en) * 2009-02-27 2010-09-02 Qualcomm Incorporated Piggybacking information in transmit opportunities
US8976741B2 (en) 2009-02-27 2015-03-10 Qualcomm Incorporated Piggybacking information in transmit opportunities
US10243714B2 (en) 2009-12-28 2019-03-26 Intel Corporation Efficient uplink SDMA operation
EP2520128A4 (en) * 2009-12-28 2014-12-10 Intel Corp Efficient uplink sdma operation
EP2520128A2 (en) * 2009-12-28 2012-11-07 Intel Corporation Efficient uplink sdma operation
WO2011090567A2 (en) 2009-12-28 2011-07-28 Intel Corporation Efficient uplink sdma operation
US9634811B2 (en) 2009-12-28 2017-04-25 Intel Corporation Access point and method for communicating with stations in accordance with a multiple-access technique
US11917678B2 (en) * 2014-06-09 2024-02-27 Intel Corporation Systems and methods for facilitating simultaneous poll responses
US20190045539A1 (en) * 2014-06-09 2019-02-07 Intel Corporation Systems and methods for facilitating simultaneous poll responses
US20170078052A1 (en) * 2015-09-10 2017-03-16 Kabushiki Kaisha Toshiba Wireless communication device and wireless communication method
US10911185B2 (en) * 2015-09-10 2021-02-02 Kabushiki Kaisha Toshiba Wireless communication device and wireless communication method
US10660047B2 (en) * 2016-04-28 2020-05-19 Sony Mobile Communications Inc. Transmit power of pilot signals
US20190281461A1 (en) * 2018-03-12 2019-09-12 At&T Digital Life, Inc. Detecting unauthorized access to a wireless network
US11689928B2 (en) 2018-03-12 2023-06-27 At&T Capital Services, Inc. Detecting unauthorized access to a wireless network
US11057769B2 (en) * 2018-03-12 2021-07-06 At&T Digital Life, Inc. Detecting unauthorized access to a wireless network
RU205442U1 (en) * 2021-04-09 2021-07-14 Анатолий Николаевич Мартьянов DEVICE FOR MINIMIZING THE APPLICATION QUEUE IN MASS SERVICE SYSTEMS WITH PULSING INPUT FLOW

Also Published As

Publication number Publication date
CN1902861A (en) 2007-01-24
US8483128B2 (en) 2013-07-09
CN102739296A (en) 2012-10-17
WO2005067219A3 (en) 2005-12-29
US20170135126A1 (en) 2017-05-11
US20140269664A1 (en) 2014-09-18
US9584239B2 (en) 2017-02-28
US10091807B2 (en) 2018-10-02
US20100002677A1 (en) 2010-01-07
EP1704678B1 (en) 2016-08-24
EP1704678A2 (en) 2006-09-27
CN1902861B (en) 2012-08-15
CN102739296B (en) 2016-12-07
US20090323627A1 (en) 2009-12-31
WO2005067219A2 (en) 2005-07-21

Similar Documents

Publication Publication Date Title
US10091807B2 (en) Wireless transmission over space-time channels
US7570921B2 (en) Systems and methods for improving range for multicast wireless communication
KR101613389B1 (en) System and method for sectorized transmission in a wireless network
US8583183B2 (en) Transmission and reception parameter control
US8989106B2 (en) Methods and apparatuses for scheduling uplink request spatial division multiple access (RSDMA) messages in an SDMA capable wireless LAN
US7046651B2 (en) System topologies for optimum capacity transmission over wireless local area networks
KR101649773B1 (en) Communication apparatus, communication method, computer program, and communication system
KR101693907B1 (en) Communication apparatus and communication method
US20100172296A1 (en) System and method for contention-based channel access for peer-to-peer connection in wireless networks
WO2013069906A1 (en) Link adaptation and device in active scanning method
US10172019B2 (en) Method and device for transmitting data in wireless LAN
US9425882B2 (en) Wi-Fi radio distribution network stations and method of operating Wi-Fi RDN stations
EP1925173A1 (en) Method and apparatus to transmit and receive data in a wireless communication system having smart antennas
US10292155B2 (en) Method and device for receiving multicast frame in wireless LAN
JP2006203266A (en) Transmission control method, wireless base station, and wireless terminal

Legal Events

Date Code Title Description
AS Assignment

Owner name: INTEL CORPORATION, CALIFORNIA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:LIN, XINTIAN E.;LI, QINGHUA;REEL/FRAME:015512/0585

Effective date: 20040621

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION

AS Assignment

Owner name: TAHOE RESEARCH, LTD., IRELAND

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:INTEL CORPORATION;REEL/FRAME:061175/0176

Effective date: 20220718