JP2008507918A - Packet aware scheduler in wireless communication system - Google Patents

Packet aware scheduler in wireless communication system Download PDF

Info

Publication number
JP2008507918A
JP2008507918A JP2007522747A JP2007522747A JP2008507918A JP 2008507918 A JP2008507918 A JP 2008507918A JP 2007522747 A JP2007522747 A JP 2007522747A JP 2007522747 A JP2007522747 A JP 2007522747A JP 2008507918 A JP2008507918 A JP 2008507918A
Authority
JP
Japan
Prior art keywords
transmission
packet
information
packets
period
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.)
Withdrawn
Application number
JP2007522747A
Other languages
Japanese (ja)
Inventor
ティーグー、エドワード・ハリソン
ホーン、ギャビン・ベルナルド
Original Assignee
クゥアルコム・インコーポレイテッドQualcomm Incorporated
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 US58982004P priority Critical
Application filed by クゥアルコム・インコーポレイテッドQualcomm Incorporated filed Critical クゥアルコム・インコーポレイテッドQualcomm Incorporated
Priority to PCT/US2005/025856 priority patent/WO2006012405A2/en
Publication of JP2008507918A publication Critical patent/JP2008507918A/en
Application status is Withdrawn legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management, e.g. wireless traffic scheduling or selection or allocation of wireless resources
    • H04W72/12Dynamic Wireless traffic scheduling ; Dynamically scheduled allocation on shared channel
    • H04W72/1263Schedule usage, i.e. actual mapping of traffic onto schedule; Multiplexing of flows into one or several streams; Mapping aspects; Scheduled allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/10Flow control or congestion control
    • H04L47/14Flow control or congestion control in wireless networks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/10Flow control or congestion control
    • H04L47/15Flow control or congestion control in relation to multipoint traffic
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/50Queue scheduling
    • H04L47/56Delay aware scheduling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/70Admission control or resource allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/70Admission control or resource allocation
    • H04L47/78Resource allocation architecture
    • H04L47/788Autonomous allocation of resources
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/70Admission control or resource allocation
    • H04L47/80Actions related to the nature of the flow or the user
    • H04L47/803Application aware
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/70Admission control or resource allocation
    • H04L47/82Miscellaneous aspects
    • H04L47/824Applicable to portable or mobile terminals
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/04Network-specific arrangements or communication protocols supporting networked applications adapted for terminals or networks with limited resources or for terminal portability, e.g. wireless application protocol [WAP]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/32Network-specific arrangements or communication protocols supporting networked applications for scheduling or organising the servicing of application requests, e.g. requests for application data transmissions involving the analysis and optimisation of the required network resources
    • H04L67/325Network-specific arrangements or communication protocols supporting networked applications for scheduling or organising the servicing of application requests, e.g. requests for application data transmissions involving the analysis and optimisation of the required network resources whereby a time schedule is established for servicing the requests
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic or 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
    • H04W28/00Network traffic or resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/10Flow control between communication endpoints
    • H04W28/14Flow control between communication endpoints using intermediate storage
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic or resource management
    • H04W28/16Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/24Negotiating SLA [Service Level Agreement]; Negotiating QoS [Quality of Service]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management, e.g. wireless traffic scheduling or selection or allocation of wireless resources
    • H04W72/12Dynamic Wireless traffic scheduling ; Dynamically scheduled allocation on shared channel
    • H04W72/1205Schedule definition, set-up or creation

Abstract

An apparatus and method for facilitating packet aware scheduling is disclosed. In some embodiments, if all of the packet's information cannot be scheduled within a single transmission period, additional resources are allocated for transmission of packet content based on packet transmission constraints and / or latency requirements. .
[Selection] Figure 4

Description

  The following description relates generally to wireless communication, and more particularly to scheduling resource allocation to user devices in a wireless network environment.

  Wireless networking systems have become a popular way for many people around the world to communicate. Wireless communication devices have become smaller and more powerful to meet consumer needs and improve portability and convenience. The increased processing power in mobile devices that can be used in wireless communication systems, such as cellular telephones and access terminals, has led to increased types of applications and their complexity. All these services have different demands on bandwidth and latency.

  Wireless communication systems typically utilize different approaches to generate transmission resources that take the form of channels. These systems can be code division multiplexing (CDM) systems, frequency division multiplexing (FDM) systems, and time division multiplexing (TDM) systems. One variation commonly used in FDM is orthogonal frequency division multiplexing (OFDM), which effectively partitions the entire system bandwidth into multiple orthogonal subbands. These subbands are also referred to as tones, carriers, subcarriers, bins, and frequency channels. Each subband is associated with a subcarrier that can be modulated with data. Using time division based techniques, the bandwidth is temporally divided into successive time slices or time slots. Each user of the channel is provided with a time slice for transmitting and receiving information in a round robin manner. For example, at a given time t, the user is provided access to the channel for a short burst. Access then switches to another user who is provided with a short burst time for transmitting and receiving information. A cycle of “taking turns” follows, and ultimately each user is given multiple transmission and reception bursts.

  CDM-based technologies typically transmit data on many frequencies that are always available within range. In general, data is digitized and spread over the available bandwidth, multiple users are overlaid on the channel, and each user is assigned a unique sequence code. Users can transmit within the same wideband range of the spectrum, and each user's signal is spread across the entire bandwidth by its own unique spreading code. This technique can be provided for sharing and one or more users can send and receive simultaneously. Such sharing can be achieved by spread spectrum digital modulation, where the user's bitstream is encoded in a quasi-random manner and spread over a very wide channel. The receiver is designed to recognize the associated unique sequence code and undo this randomization to collect bits for a particular user in a coherent manner.

  A typical wireless communication network (e.g., frequency, time, and / or code division technique used) may transmit and receive data within the coverage area with one or more base stations that provide the coverage area. And one or more mobile (eg, wireless) terminals that can. A typical base station can transmit multiple data streams simultaneously for broadcast, multicast, and / or unicast services. Here, the data stream is a stream of data that can be an independent reception interest for the mobile terminal. Mobile terminals within the coverage area of the base station may be interested in receiving one, one or more or all of the data streams carried by the composite stream. Similarly, a mobile terminal can transmit data to the base station or another mobile terminal. In these systems, bandwidth and other system resources are allocated by the scheduler.

  Further, in a typical communication network, information is assigned to different levels of service based on the application or service for which the information is used. For example, in general, applications such as simple data requests have high acceptable latencies, while some applications such as voice or video require low latencies.

  The purpose of the scheduler in the communication system is to multiplex data from users into a bandwidth for multiple transmissions. The scheduler may multiplex user transmissions over time, frequency, code, and / or space. The goal of the scheduler is to maximize system capacity (throughput) while maintaining a fair level specified between users and / or throughput for each user. Furthermore, the scheduler provides a service to a specific user that contributes most to the application running on the user connection, such as, for example, a provided service or application. For example, the scheduler satisfies a latency goal for a connection running a latency sensitive application. The scheduler goals described above are often contradictory, and a particular scheduler can emphasize certain goals (eg, total sector capacity).

  In view of at least the above, there is a need in the art for systems and / or methodologies that improve frequency resource allocation and wireless communication for users in a wireless network environment.

  This application is filed on July 20, 2004, 35 U.S. from US Provisional Application No. 60 / 589,820 entitled “Packet Aware Scheduler”, which is incorporated herein by reference in its entirety. S. C. Insist on the benefit of §119 (e).

  The following provides a simplified summary of one or more embodiments to provide a basic understanding of the embodiments. This summary is not an extensive overview of all embodiments contemplated and does not identify key or critical elements of all embodiments nor delineate the scope of any or all embodiments. Is intended to be. Its sole purpose is to present some concepts of one or more embodiments in a simplified form as a prelude to the more detailed description that is discussed later.

  [As set forth in the final claims. ]

  Various embodiments are described with reference to the drawings, wherein like reference numerals are used to refer to like elements throughout. In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of one or more embodiments. It may be evident, however, that such embodiments may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate describing one or more embodiments.

  With reference to FIG. 1, a multiple access wireless communication system according to one embodiment is illustrated. The multiple access wireless communication system 100 includes a number of cells, such as cells 102, 104 and 106. In the embodiment of FIG. 1, cells 102, 104, and 106 may each include an access point 150 that includes multiple sectors. Multiple sectors are formed by groups of antennas each responsible for communication with access terminals in a portion of the cell. In cell 102, antenna groups 112, 114 and 116 each correspond to a different sector. In cell 104, antenna groups 118, 120, and 122 each correspond to a different sector. In cell 106, antenna groups 124, 126, and 128 each correspond to a different sector.

  Each cell includes a number of access terminals that communicate with one or more sectors of each access point. For example, access terminals 130 and 132 communicate with base 142, access terminals 134 and 136 communicate with access point 144, and access terminals 138 and 140 communicate with access point 146.

  Controller 130 is coupled to each of cells 102, 104 and 106. The controller 130 is one of many networks that exchange information with access terminals that communicate with cells of the multiple access wireless communication system 100, such as the Internet, other packet-based networks, and circuit switched voice networks. Or it includes multiple connections. Controller 130 includes or is coupled to a scheduler that schedules transmissions with access terminals. In other embodiments, the scheduler may be in an individual cell, each sector of the cell, or a combination thereof.

  As used herein, an access point may be a fixed station used to communicate with a terminal and is also referred to as a base station, Node B, or some other terminology, and some of these functions Or it may contain everything. An access terminal is also referred to as user equipment (UE), a wireless communication device, terminal, mobile station, or other terminology and includes some or all of these functions.

  As shown in FIG. 2, a spectrum allocation scheme of a multiple access wireless communication system is illustrated. Multiple OFDM symbols 200 are allocated over T symbol periods and S frequency subcarriers. Each OFDM symbol 200 includes one symbol period of T symbol periods and a tone or frequency subcarrier of S subcarriers.

  In an OFDM frequency hopping system, one or more symbols 200 may be assigned to a given access terminal. In one embodiment of the allocation scheme shown in FIG. 2, one or more hop regions of symbols to a group of access terminals for communication on the reverse link, such as hop region 202, for example. Within each hop region, symbol assignment is randomized, the possibility of interference is reduced, and frequency diversity is provided for harmful path effects.

  Each hop region 202 includes a symbol 204 that is in communication with the sector of the access point and is assigned to one or more access terminals assigned to the hop region. The position of the hop region 202 within each hop period, i.e., during the frame, within T symbol periods and S subcarriers varies according to the hopping sequence. Further, the assignment of symbols 204 to individual access terminals in hop region 202 may change during each hop period.

  The hop sequence selects the position of the hop region 202 for each hop period according to a quasi-random, random, or predetermined sequence. The hop sequences of different sectors of the same access point are designed to be orthogonal to each other to avoid “in-cell” interference between access terminals communicating with the same access point. Further, the hop sequence of each access point may be quasi-random with respect to the hop sequence of nearby access points. This helps to randomize “inter-cell” interference between access terminals communicating with different access points.

  For reverse link communications, some of the symbols 204 in the hop region 202 are assigned to pilot symbols transmitted from the access terminal to the access point. The assignment of pilot symbols to symbols 204 should preferably support space division multiple access (SDMA). Here, if sufficient spatial signatures corresponding to different access terminals are given, the signals of different access terminals overlapping in the same hop region are separated by multiple receive antennas in the sector or access point.

  While FIG. 2 shows a hop region 200 having a length of seven symbol periods, the length of the hop region 200 can be any desired amount, and the hop period or different hops in a given hop period It should be noted that the size between regions can vary.

  Symbols, hop regions, etc. generally do not map one-to-one with respect to packets in terms of size or timing. This results in the need to fragment the packet and combine symbols from the fragmented bits. This increases the difficulty in scheduling the information bits contained in the packet in an appropriate manner.

  It should be noted that although the embodiment of FIG. 2 is described with respect to the use of block hopping, it is not necessary to change the position of the blocks between consecutive hop periods.

  It should be noted that while the embodiment of FIG. 2 is related to an OFDMA system that utilizes block hopping, the present disclosure may operate in many different communication systems. In an embodiment, the communication system used may be a time division multiple system. There, each user is assigned one or more time slots, one or more time slots in a period, etc., or a part thereof. In such an embodiment, each time slot may comprise a plurality of transmission symbols. Further embodiments utilize CDMA or FDMA schemes, where each user is assigned transmission resources based on other criteria as long as the resources are divided or limited.

  FIG. 3 illustrates a simplified block diagram of a system that facilitates packet-aware resource allocation according to an embodiment. The network 300 transmits and receives packets to and from the wireless communication system 302. A received packet from the network 300 has a first format composed of a designated number of bits based on a communication protocol used by the network. The scheduler 304 allocates a packet and a part of the packet to channel resources depending on the size and information content. These channel resources may be, for example, the OFDM symbol 200 or other transmission symbols. In any communication system, the number of channel resources available in any given time period, such as OFDM symbols, time slots, CDMA codes, etc., is limited by system parameters. Thus, the scheduler 304 is included in each packet based in part on whether the entire information content of the packet was transmitted in the number of symbols, time slot, hop region, etc. for a predetermined period given by the application to which the packet belongs. Determine channel resources to be allocated to information bits.

  The scheduler 304 can apply complete scheduling requirements in addition to quality of service (QoS), proportional fairness criteria, other scheduling approaches, or combinations thereof. That is, one of the factors used in determining the schedule of symbols transmitted from the wireless communication system 302 has a certain latency constraint based on the application, and the information bits contained in the packet are required by the application, It can be transmitted within a time frame defined by symbols, time slots, hop regions, etc. of the wireless communication system. For example, if the packet is a video application packet given to user A, the scheduler 304 will determine the number of bits in the packet and determine the number of transmission symbols needed to transmit the content of the video application packet. . The scheduler 304 then schedules transmission to user A based on the user's QoS, fairness criteria, other scheduling approaches, or combinations thereof. However, if all the information bits contained in the video application packet cannot be transmitted within the required time period, the scheduler 304 may determine another part of the transmission time period, frame, or hop period based on the video application latency request. Schedule transmission of symbols corresponding to information bits contained in video application packets at or assign additional resources to information bits contained in video application packets in the current hop period, frame, transmission time period, etc. Would decide to try. This additional transmission resource may be assigned to another user or may be an additional resource such as a shared data channel.

  The scheduler 304 may reside within a single wireless communication device, such as a base station or access point, or many wireless devices such as between a base station or access point controller and a base station or access point. It may be distributed within the communication device.

  After scheduling, the information bits from the packet are modulated by modulator 306 and provided to transceiver 308 for transmission to the access terminal via one or more antennas.

  The wireless communication system 302 may provide communication services to users using OFDM, OFDMA, CDMA, TDMA, combinations thereof, or other suitable wireless communication protocols.

  FIG. 4 illustrates a functional block diagram of the scheduler according to the embodiment. Information received from the network is generally named at the application layer 400 or higher. This information is generally contained in the packet 402. These packets 402 typically have a bit size and may include a time stamp that indicates when the data was generated by the different application that generated the packet. The application latency request is known, for example, based on the information type identified in each packet. In order to transmit the information bits contained in the packet 402 over the air interface, the physical layer 406 needs to generate a transmission symbol 408 of an appropriate size and format for transmission over the channel 410.

  The channel 410 includes a plurality of portions 412-426 that are used for different purposes. For example, a certain part is used to transmit control information such as power control or reverse link scheduling information. On the other hand, the other part is used to transmit data to one or a plurality of access terminals. The resources of these parts 412-426 have many purposes consisting of transmissions for different purposes based on the type of information transmitted or the channel conditions for each user, taking into account the flexibility in using channel resources. Can be used for.

  There are two main interface options to convert the information bits contained in the packet at the application layer 400 into physical layer 406 transmission symbols or other channel resources. The first is a bit interface that transfers information from the application layer to the physical layer as a chunk of bits. The physical layer can request and transmit bits of any size chunk based on its own transmit symbol size. The second type of interface is a packet interface that transfers information from the application layer to the physical layer as a packet chunk. These packets may or may not be provided to scheduler 428 in chunks of equal size.

  The bit interface has the advantage that the physical layer 406 does not have a restriction on the data size that can be processed. This simplifies scheduler operation. This is because the scheduler can schedule any size chunk that fits the available channel resources. However, the drawback is that application level characteristics are not considered and application performance can be degraded by inefficient fragmentation of application packets. Furthermore, application latency requests cannot be handled by a scheduler that does not know the application packet latency. On the other hand, the packet interface has the advantage that the scheduler has access to application packet details such as packet boundaries. The disadvantage is that the scheduler may not have channel resources available for efficient multiplexing of many users on the channel.

  The scheduler 428 uses a hybrid interface 430 that includes functions of a bit interface and a packet interface. The hybrid interface 430 provides the ability for the physical layer to remove an arbitrarily sized chunk of data from the application to enable efficient scheduling and multiplex communication over limited resources in the channel. However, unlike the bit interface, this hybrid interface 430 provides the scheduler 428 with information related to application packets useful for scheduling purposes. For example, if the physical layer requests bits, information about the number of remaining bits in the current packet and the packet timestamp are provided. Further, the hybrid interface 430 may provide packet size and timestamp information for other packets waiting in the application queue to be passed to the physical layer.

  In one embodiment, scheduler 428 may leverage information available through hybrid interface 430 to reduce the likelihood that application packets will be fragmented. If the scheduler 428 knows the packet boundaries, it may be difficult with respect to available channel resources, but attempts to schedule the rest of the packet within the current hop period or other time frame Can do. The scheduler 428 uses the remaining number of bits, latency sensitivity, and difficulty in obtaining channel resources to determine whether to fragment the application packet or within the current hop period or other time period. To schedule the whole packet.

  One advantage of utilizing this hybrid interface 430 is that the scheduler 428 can utilize both channel constraints and application constraints to simultaneously optimize application channel and performance usage.

  As shown in FIGS. 5A, 5B and 5C, a methodology for a schedule according to many embodiments is illustrated. For example, the method may relate to packet aware scheduling in an OFDM environment, an OFDMA environment, a CDMA environment, a TDMA environment, or other suitable wireless environment. For purposes of brevity, the method is shown and described as a series of operations, some of which are shown and described herein according to one or more embodiments. It should be understood and appreciated that the method is not limited to this order of operation, since can occur simultaneously in a different order and / or another operation. A method can also be represented as a series of interrelated states or events, for example in a state diagram. Moreover, not all illustrated acts may be required to implement a methodology in accordance with one or more embodiments.

  In FIG. 5A, at block 502, information bits from multiple packets are received at the physical layer via the hybrid interface. Then, at block 504, a determination is made as to whether the scheduled information bits were provided from a packet where all of the content was scheduled during the current time period. At block 506, if the contents of each packet providing information bits for scheduling is scheduled during the current time period, the packet is scheduled by the system scheduling algorithm. The scheduling algorithm may be based on quality of service (QoS), proportional fairness criteria, other scheduling approaches, or combinations thereof.

  If the content of each packet that provided information bits for scheduling is not provided for scheduling or cannot be scheduled during the current time period, block 508 provides a latency constraint for the content of these packets. And / or other determinations regarding transmission requests are made.

  If there are no latency constraints and / or other transmission requests that prevent the remaining information bits from being transmitted in a later time period, at block 510, the information bits of these packets are scheduled within the current time period. Excluded from. If there is a latency constraint and / or other transmission request that requires transmission of the packet in the current time period, at block 512, allow all of the information bits from the packet with the latency constraint and / or other transmission request. In order to do so, the scheduler attempts to add additional channel resources or remove channel resources from other users for transmission to packet users. In block 514, the system schedules according to the system's scheduling algorithm.

  In FIG. 5B, at block 550, a packet to be fragmented to be provided to the scheduler is selected. Then, in block 552, it is determined whether there are sufficient rechannel resources to schedule all of the information bits from the packet in the current time period. If the contents of the packet can be scheduled for the current time period, the packet is fragmented at block 554 and provided for scheduling according to the system's scheduling algorithm. This scheduling algorithm may be based on quality of service (QoS), proportional fairness criteria, other scheduling approaches, or combinations thereof. If the contents of the packet cannot be scheduled during the current time period, at block 556, a determination is made regarding the packet content latency constraints and / or other transmission requests.

  If there are no latency constraints and / or other transmission requests that prevent the remaining information bits of the packet from being transmitted in a later time period, block 558 causes the packet to be scheduled for the current time period. Are fragmented to provide information bits for channel resources. The remaining information bits from the fragmented packet are held in one or more queues for scheduling in later time periods.

  If there are latency constraints and / or other transmission requests that require transmission of the packet in the current time period, block 560 allows all of the information bits from the packet with latency constraints and / or other transmission requests. To do so, the scheduler attempts to add additional channel resources or remove channel resources from other users for transmission to packet users. The system then schedules at block 562 according to the system's scheduling algorithm.

  In FIG. 5C, at block 570, the number of information bits scheduled for the user is determined. This can be determined based on the number of packets stored for the user, the number of packets transmitted in the time period of arrival, or other approaches. At block 572, channel resources are allocated to each user based on the number of information bits in the packet. In many cases, users are assigned a number of resources up to a fixed amount or up to an initial amount, depending on system load, to allow many users to access channel resources during the transmission period. . So, even if the system attempts to allocate channel resources based on information bits from fragmented packets, at least first of all, such allocation may not be done completely . Channel resource allocation may be performed according to a scheduling algorithm of the system. The scheduling algorithm may be based on quality of service (QoS), proportional fairness criteria, other scheduling approaches, or a combination of these.

  After channel resources are allocated, at block 574, it is determined whether all of the information bits from the fragmented packet for the user have been allocated channel resources within the current time period. If all of the information bits from the fragmented packet have been allocated channel resources within the current time period, at block 576, scheduling is complete. If all of the information bits from the fragmented packet have not been assigned channel resources within the current time period, at block 578 the content of the packet that does not have resources assigned to all of these information bits. Decisions regarding latency constraints and / or other transmission requests are made.

  If there are no latency constraints and / or other transmission requests that prevent the remaining information bits of the packet from being transmitted in a later time period, at block 580, the packet is Fragmented and provided information bits for channel resources. The remaining information bits from the fragmented packet are held in one or more queues for scheduling in later time periods.

  If there is a latency constraint and / or other transmission request that requires transmission of the packet in the current time period, block 582 allows all of the information bits from the packet with the latency constraint and / or other transmission request. To do so, the scheduler attempts to add additional channel resources or remove channel resources from other users for transmission to packet users. The system then schedules at block 584 according to the system's scheduling algorithm.

  With reference to FIG. 6, one embodiment of a transmitter and receiver in a multiple access wireless communication system is illustrated. At transmitter system 610, traffic data for a number of data streams is provided from a data source 612 to a transmit (TX) data processor 614. In an embodiment, each data stream is transmitted through a respective transmit antenna. TX data processor 614 formats, encodes, and interleaves the traffic data for each data stream based on the particular encoding scheme selected for that data stream to provide encoded data. In some embodiments, TX data processor 614 applies beamforming weights to the symbols of the data stream based on the user for which the symbols are being transmitted. In some embodiments, beamforming weights are generated based on the eigenbeam vectors generated at receiver 602 and provided to transmitter 600 as feedback. Further, for those scheduled transmissions, the TX data processor 614 can select the packet format based on the rank information transmitted from the user.

  The coded data for each data stream can be multiplexed with pilot data using OFDM techniques. The pilot data is typically a known data pattern that is processed in a known manner and can be used at the receiver system to estimate the channel response. The multiplexed pilot and encoded data for each data stream is the specific modulation scheme (eg, BPSK, QPSP, M-PSK, or M) selected for that data stream to provide modulation symbols. -Modulated (ie, symbol map) based on QAM). The data rate, coding, and modulation for each data stream may be determined by instructions performed or provided by processor 430.

The modulation symbols for all data streams are then provided to TX MIMO processor 620. TX MIMO processor 620 further processes the modulation symbols (eg, for OFDM). TX MIMO processor 620 then provides N T modulation symbol streams to N T transmitters (TMTR) 622a through 622t. In an embodiment, TX MIMO processor 620 applies beamforming weights to the symbols of the data stream from the user channel response information based on the user that is the destination of the symbol and the antenna that is the source of the symbol. .

Each transmitter 622 receives and processes a respective symbol stream to provide one or more analog signals, which are further processed (eg, amplified, filtered, and upconverted) to provide MIMO channels. To provide a modulated signal suitable for transmission over the network. N T modulated signals from transmitters 622a through 622t are then transmitted from N T antennas 624a through 624t, respectively.

At receiver system 650, the modulated signal transmitted are received by N R antennas 652A~652r, the received signal from each antenna 452 is provided to a respective receiver (RCVR) 654. Each receiver 654 processes (eg, filters, amplifies, and downconverts) the respective received signal, digitizes the processed signal to obtain a sample, further processes the sample, and processes the corresponding “ Provide a "received" symbol stream.

Then, RX data processor 660 receives the N R symbol streams from N R receivers 654, and processed based on a particular receiver processing technique provides N T "detected" symbol streams provide. The processing by RX data processor 660 is described in further detail below. Each detected symbol stream includes symbols that are estimates of the modulation symbols transmitted for the corresponding data stream. The RX data processor 660 then demodulates, deinterleaves, and decodes each detected symbol stream to recover the traffic data for the data stream. The processing by RX data processor 660 is complementary to that performed by TX MIMO processor 620 and TX data processor 614 at transmitter system 610.

  The channel response estimates generated by RX processor 660 are used for spatial, spatial / temporal processing execution, power level adjustments, modulation rate or scheme changes, or other operations at the receiver. RX processor 660 further estimates the signal-to-noise and interference ratio (SNR), and possibly other channel characteristics, of the detected symbol stream and provides these amounts to processor 670. RX data processor 660 or processor 670 may further derive an estimate of the “operating” SNR of the system. Processor 670 then provides estimated channel state information (CSI). This may include various types of information regarding the communication link and / or the received data stream. For example, the CSI may include only the operating SNR. The CSI is then processed by TX data processor 638, modulated by modulator 680, processed by transmitters 654a-454r, and sent back to transmitter system 610. TX data processor 638 also receives traffic data for a number of data streams from data source 676.

  At transmitter system 610, the modulated signal from receiver system 650 is received by antenna 624, processed by receiver 622, demodulated by demodulator 640, processed by RX data processor 642, and reported by the receiver system. CSI is restored. This reported CSI is provided to processor 630, (1) determining the data rate, coding and modulation scheme used for the data stream, and (2) of TX data processor 614 and TX MIMO processor 620. Used for the generation of various controls.

  Information stored in data sources 642 and 676 is scheduled by a scheduler based on the scheduler as described with respect to FIGS.

  Although FIG. 6 and related descriptions refer to a MIMO system, other systems such as multiple input single output (MISO) and single input multiple output (SIMO) are also described in the configuration of FIG. 6 and herein. Such a configuration, method, and system can be used.

  The techniques described herein can be implemented by various means. For example, these techniques can be realized by hardware, software, or a combination thereof. For hardware implementations, the processing units used for channel estimation are one or more application specific integrated circuits (ASIC), digital signal processors (DSP), digital signal processing devices (DSPD), programmable logic circuits (PLDs). ), A field programmable gate array (FPGA), a processor, a controller, a microcontroller, a microprocessor, other electronic units designed to perform the functions described herein, or combinations thereof. It is realized by a module that executes functions (for example, procedures, functions, and the like) described in this specification using software.

  What has been described above includes examples of one or more embodiments. It is of course impossible to describe all possible combinations of components or methods for the purpose of describing the embodiments described above, but those skilled in the art can make further combinations and substitutions of various embodiments. You can understand that. Accordingly, the described embodiments are intended to embrace all such alterations, modifications or variations that fall within the spirit and scope of the appended claims. Further, as the term “comprising” is used as a transitional term in the claims, so long as the term “includes” is used in either the detailed description or in the claims. This term is intended to be comprehensive as well as the term “comprising”.

FIG. 1 illustrates a multiple access wireless communication system according to an embodiment. FIG. 2 illustrates a spectrum allocation scheme of a multiple access wireless communication system according to an embodiment. FIG. 3 illustrates a simplified block diagram of a system that facilitates packet-aware resource allocation according to an embodiment. FIG. 4 illustrates a functional block diagram of the scheduler according to the embodiment. FIG. 5A illustrates a scheduling method according to an embodiment. FIG. 5B illustrates a scheduling method according to another embodiment. FIG. 5C illustrates a method of scheduling according to a further embodiment. FIG. 6 illustrates a transmitter and receiver in one embodiment of a multiple access wireless communication system.

Claims (39)

  1. A memory containing a plurality of packets including information transmitted over the wireless link, each comprising a plurality of bits;
    Allocation of transmission resources for transmission over the radio link to multiple bits of each packet based in part on whether all information bits of the packet are transmitted in a single transmission period or multiple transmission periods And a processor coupled to the memory.
  2.   The electronic device of claim 1, further comprising a hybrid interface that determines a size of each packet and an application of the packet.
  3.   3. The electronic device of claim 2, further comprising a scheduler that determines whether the information bits of the packet are scheduled in a single transmission period or in multiple transmission periods based on packet application latency constraints.
  4.   The electronic device of claim 1, wherein the transmission resource includes a plurality of OFDM symbols.
  5.   The electronic device of claim 1, wherein the processor is further configured to allow transmission of information contained in the packet in a plurality of transmission periods if a packet application latency constraint does not prevent transmission.
  6.   The electronic device of claim 1, wherein each transmission period of the single or multiple transmission periods includes a hop period.
  7.   The electronic device of claim 1, wherein each transmission period of the single or multiple transmission periods includes a frame.
  8. A method of scheduling transmission over a wireless link,
    Determining whether all information bits of a packet are scheduled in a single transmission period or in multiple transmission periods;
    Scheduling transmission over the wireless link based in part on whether all information bits of the packet are scheduled in a single transmission period or in multiple transmission periods.
  9.   9. The method of claim 8, further comprising fragmenting the packet prior to determining.
  10.   9. The method of claim 8, further comprising determining an application transmission constraint and / or a latency constraint for the packet if not all of the information bits can be scheduled.
  11.   11. The method of claim 10, further comprising allocating additional resources to schedule transmission of all information bits in the single transmission period if there are latency constraints and / or transmission constraints.
  12.   The method of claim 10, further comprising scheduling transmission of the packet information in the plurality of transmission periods if there is no transmission constraint and / or latency constraint for the packet.
  13.   The determining includes determining whether all information of a plurality of packets is scheduled in a single transmission period or in a plurality of transmission periods, wherein the scheduling includes the single transmission. Scheduling packets that can be scheduled over a period of time, and determining packet transmission constraints and / or latency constraints for packets for which not all information is scheduled in the single transmission period. The method of claim 8 comprising:
  14.   9. The method of claim 8, wherein each transmission period of the single or multiple transmission periods includes a hop period.
  15.   9. The method of claim 8, wherein each transmission period of the single or multiple transmission periods includes a frame.
  16. A method of scheduling transmission over a wireless link,
    Scheduling the transmission of multiple information bits of multiple packets over the wireless link in a single transmission period;
    Determining whether all information from each of the plurality of packets was scheduled in the single transmission period;
    If not all of the information from each of the plurality of packets is scheduled in the single transmission period, then transmission constraints and / or latency constraints for packets that are not all of the information scheduled. Determining.
  17.   The method of claim 16, further comprising fragmenting the packet prior to determining.
  18.   17. The method of claim 16, further comprising allocating additional resources to schedule transmission of all information bits of the packet in the single transmission period if there is any packet latency constraint and / or transmission constraint.
  19.   17. The method of claim 16, further comprising scheduling transmission of all information bits of these packets in the plurality of transmission periods if there are no latency and / or transmission constraints.
  20.   The method of claim 16, wherein each transmission period of the single or multiple transmission periods includes a hop period.
  21.   The method of claim 16, wherein each transmission period of the single or multiple transmission periods includes a frame.
  22. An apparatus that facilitates scheduling in a wireless communication environment, and that schedules information acquired from application packets to channel resources;
    An apparatus comprising an arbitrarily sized chunk of information from the packet and a hybrid interface that provides information related to the application.
  23.   23. The apparatus of claim 22, wherein the information includes a remaining number of bits in the application packet.
  24.   23. The apparatus of claim 22, wherein the information includes a time stamp of the application packet.
  25.   The scheduler determines whether all the information from each of the application packets is scheduled in a single transmission period, and all of the information from each of the application packets is scheduled in the single transmission period. 23. The apparatus of claim 22, wherein if not, the apparatus determines transmission constraints and / or latency constraints for packets where not all of the information is scheduled.
  26.   23. If there is any application packet latency constraint and / or transmission constraint, the scheduler allocates additional resources to schedule transmission of all information bits of the application packet in the single transmission period. Equipment.
  27.   23. The apparatus of claim 22, wherein the scheduler schedules transmission of all information bits of the application packet in multiple transmission periods if there are no latency constraints and / or transmission constraints.
  28. A memory for storing a plurality of packets for a user including information transmitted over a wireless link, each comprising a plurality of bits;
    The plurality of packets are fragmented and configured to determine an allocation of transmission resources to the user for transmission over a radio link based on the number of information bits and connected to the memory An electronic device comprising a processor.
  29.   30. The electronic device of claim 28, further comprising a hybrid interface that determines the number of information bits in each fragmented packet.
  30.   Further comprising a scheduler for determining whether to attempt to schedule additional transmission resources for a user based on application latency constraints for any packet that does not have all of the information bits scheduled in a single transmission period. Item 28. The electronic device according to Item 28.
  31.   32. The electronic device of claim 30, wherein the transmission resource includes a plurality of OFDM symbols.
  32.   31. The electronic device of claim 30, wherein the transmission resource includes a hop period.
  33.   32. The electronic device of claim 30, wherein the transmission resource includes a frame.
  34.   29. The electronic device of claim 28, wherein the processor is further configured to allow transmission of information from the packet in multiple transmission periods if application packet latency constraints do not prevent transmission.
  35. A method of scheduling transmission over a wireless link,
    Determining the number of information bits in a plurality of packets transmitted over a wireless link for a user;
    Scheduling transmission resources for the user based in part on the number of information bits.
  36.   34. The method of claim 33, further comprising fragmenting the plurality of packets prior to determining.
  37.   If not all of the information bits of the plurality of packets are scheduled in a single transmission period, determine a transmission constraint and / or a latency constraint of a packet where not all of the information bits are scheduled 34. The method of claim 33, further comprising:
  38.   36. The method of claim 35, further comprising allocating additional resources to schedule transmissions for the user in the single transmission period if there are latency constraints and / or transmission constraints.
  39. If there is no transmission constraint and / or latency constraint on the packet,
    36. The method of claim 35, further comprising scheduling transmissions for the packet information in the plurality of transmission periods.
JP2007522747A 2004-07-20 2005-07-20 Packet aware scheduler in wireless communication system Withdrawn JP2008507918A (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US58982004P true 2004-07-20 2004-07-20
PCT/US2005/025856 WO2006012405A2 (en) 2004-07-20 2005-07-20 Packet aware scheduler in wireless communication systems

Publications (1)

Publication Number Publication Date
JP2008507918A true JP2008507918A (en) 2008-03-13

Family

ID=35521016

Family Applications (2)

Application Number Title Priority Date Filing Date
JP2007522747A Withdrawn JP2008507918A (en) 2004-07-20 2005-07-20 Packet aware scheduler in wireless communication system
JP2011016964A Active JP5666326B2 (en) 2004-07-20 2011-01-28 Packet aware scheduler in wireless communication system

Family Applications After (1)

Application Number Title Priority Date Filing Date
JP2011016964A Active JP5666326B2 (en) 2004-07-20 2011-01-28 Packet aware scheduler in wireless communication system

Country Status (12)

Country Link
US (2) US7961609B2 (en)
EP (1) EP1779612A2 (en)
JP (2) JP2008507918A (en)
KR (1) KR100935559B1 (en)
CN (2) CN103124437A (en)
AU (1) AU2005267103A1 (en)
BR (1) BRPI0513704A (en)
CA (1) CA2574711A1 (en)
IL (1) IL180825D0 (en)
MX (1) MX2007000857A (en)
RU (1) RU2348119C2 (en)
WO (1) WO2006012405A2 (en)

Families Citing this family (48)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7961609B2 (en) * 2004-07-20 2011-06-14 Qualcomm Incorporated Packet aware scheduler in wireless communication systems
US7742444B2 (en) * 2005-03-15 2010-06-22 Qualcomm Incorporated Multiple other sector information combining for power control in a wireless communication system
CN102833685B (en) 2005-03-25 2016-01-27 桥扬科技有限公司 For method and apparatus and the data distribution of data communication
CN101998285B (en) 2005-06-09 2012-12-12 桥扬科技有限公司 Methods and apparatus for power efficient broadcasting and communication systems
US9055552B2 (en) * 2005-06-16 2015-06-09 Qualcomm Incorporated Quick paging channel with reduced probability of missed page
US8750908B2 (en) * 2005-06-16 2014-06-10 Qualcomm Incorporated Quick paging channel with reduced probability of missed page
CA2620217C (en) * 2005-08-24 2013-05-28 Qualcomm Incorporated Varied transmission time intervals for wireless communication system
US20070147226A1 (en) * 2005-10-27 2007-06-28 Aamod Khandekar Method and apparatus for achieving flexible bandwidth using variable guard bands
WO2007050982A1 (en) 2005-10-27 2007-05-03 Qualcomm Incorporated A method of serving sector maintenance in a wireless communication systems
US20070097935A1 (en) * 2005-10-27 2007-05-03 Alexei Gorokhov In-band rate control for an orthogonal frequency division multiple access communication system
US20090207790A1 (en) * 2005-10-27 2009-08-20 Qualcomm Incorporated Method and apparatus for settingtuneawaystatus in an open state in wireless communication system
US8588201B2 (en) * 2005-11-15 2013-11-19 Intel Corporation Method and apparatus for improving RF coverage area in a wireless network
JP4899637B2 (en) * 2006-05-29 2012-03-21 株式会社日立製作所 Wireless communication system and wireless communication method
JP4760557B2 (en) * 2006-06-08 2011-08-31 株式会社日立製作所 Wireless communication system and wireless communication apparatus
US8005002B2 (en) * 2006-11-09 2011-08-23 Palo Alto Research Center Incorporated Method and apparatus for performing a query-based convergecast scheduling in a wireless sensor network
US8144589B2 (en) 2007-05-07 2012-03-27 Qualcomm Incorporated Learning-based semi-persistent scheduling in wireless communications
US8571553B2 (en) 2007-07-16 2013-10-29 Qualcomm Incorporated Methods and apparatus for resolving pilot pseudorandom noise code conflicts in a communication system
KR101441147B1 (en) 2008-08-12 2014-09-18 엘지전자 주식회사 Method of transmitting sr in wireless communication system
CN102301813B (en) 2009-01-30 2017-07-28 三星电子株式会社 For the control signaling sent on contiguous band and non-contiguous band
CN102282550A (en) * 2009-01-30 2011-12-14 莫维克网络公司 Applications and use of the radio link transmission network-aware scheduler
US7940740B2 (en) * 2009-02-03 2011-05-10 Motorola Mobility, Inc. Apparatus and method for communicating and processing a positioning reference signal based on identifier associated with a base station
US8730925B2 (en) * 2009-04-09 2014-05-20 Motorola Mobility Llc Method and apparatus for generating reference signals for accurate time-difference of arrival estimation
US8144720B2 (en) * 2009-04-24 2012-03-27 Telefonaktiebolaget L M Ericsson (Publ) Uplink radio resource allocation in the presence of power limited users
US9002354B2 (en) * 2009-06-12 2015-04-07 Google Technology Holdings, LLC Interference control, SINR optimization and signaling enhancements to improve the performance of OTDOA measurements
US8483707B2 (en) * 2009-06-26 2013-07-09 Motorola Mobility Llc Wireless terminal and method for managing the receipt of position reference singals for use in determining a location
US20110039583A1 (en) * 2009-08-17 2011-02-17 Motorola, Inc. Muting time masks to suppress serving cell interference for observed time difference of arrival location
EP2642393B1 (en) * 2010-07-02 2019-09-04 Vodafone IP Licensing limited Optimised content upload in telecommunication networks
US8374633B2 (en) 2009-10-05 2013-02-12 Motorola Mobility Llc Muting indication to enable improved time difference of arrival measurements
CN102511035A (en) * 2009-11-09 2012-06-20 莫维克网络公司 Burst packet scheduler for improved RAN efficiency in UMTS/HSPA networks
US20110176440A1 (en) * 2010-01-15 2011-07-21 Motorola-Mobility, Inc. Restrictions on autonomous muting to enable time difference of arrival measurements
US8509102B2 (en) * 2010-02-24 2013-08-13 Motorola Mobility Llc Threshold determination in TDOA-based positioning system
CN102598628A (en) * 2010-03-15 2012-07-18 莫维克网络公司 Adaptive Chunked And Content-aware Pacing Of Multi-media Delivery Over Http Transport And Network Controlled Bit Rate Selection
US9203489B2 (en) 2010-05-05 2015-12-01 Google Technology Holdings LLC Method and precoder information feedback in multi-antenna wireless communication systems
US8428022B2 (en) 2010-08-27 2013-04-23 Motorola Mobility Llc Method and apparatus for transmitting positioning reference signals in a wireless communication network
US20120327867A1 (en) * 2011-06-27 2012-12-27 Renesas Mobile Corporation Subframe Scheduling
WO2013015613A2 (en) * 2011-07-25 2013-01-31 엘지전자 주식회사 Method and apparatus for transmitting data in a wireless communication system
EP2697954B1 (en) * 2011-10-05 2015-01-21 Peerialism AB Method and device for arranging peers in a live streaming p2p network
US9813262B2 (en) 2012-12-03 2017-11-07 Google Technology Holdings LLC Method and apparatus for selectively transmitting data using spatial diversity
US9591508B2 (en) 2012-12-20 2017-03-07 Google Technology Holdings LLC Methods and apparatus for transmitting data between different peer-to-peer communication groups
US9979531B2 (en) 2013-01-03 2018-05-22 Google Technology Holdings LLC Method and apparatus for tuning a communication device for multi band operation
US10229697B2 (en) 2013-03-12 2019-03-12 Google Technology Holdings LLC Apparatus and method for beamforming to obtain voice and noise signals
US9184966B2 (en) 2013-09-12 2015-11-10 Samsung Electronics Co., Ltd. Transmitting apparatus, method of mapping data thereof, receiving apparatus, data processing method thereof
US9386542B2 (en) 2013-09-19 2016-07-05 Google Technology Holdings, LLC Method and apparatus for estimating transmit power of a wireless device
US9807640B2 (en) * 2013-12-17 2017-10-31 Taiwan Semiconductor Manufacturing Company, Ltd. Network operating system resource coordination
US9549290B2 (en) 2013-12-19 2017-01-17 Google Technology Holdings LLC Method and apparatus for determining direction information for a wireless device
US9491007B2 (en) 2014-04-28 2016-11-08 Google Technology Holdings LLC Apparatus and method for antenna matching
US9478847B2 (en) 2014-06-02 2016-10-25 Google Technology Holdings LLC Antenna system and method of assembly for a wearable electronic device
EP2988420A1 (en) * 2014-08-20 2016-02-24 Areva NP SAS Circuit Arrangement for a Safety I&C System

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000151619A (en) * 1998-11-04 2000-05-30 Sony Corp Transmission method and transmitter
WO2002039760A2 (en) * 2000-11-07 2002-05-16 Nokia Corporation System for uplink scheduling of packet data traffic in wireless system
JP2003018117A (en) * 2001-07-04 2003-01-17 Nippon Telegr & Teleph Corp <Ntt> Multiple access equipment and multiple access method
JP2004503181A (en) * 2000-07-12 2004-01-29 クゥアルコム・インコーポレイテッドQualcomm Incorporated Multiplexing real-time and non-real-time services for OFDM systems

Family Cites Families (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5613207A (en) * 1994-05-27 1997-03-18 Motorola, Inc. Method for transmitting messages in a communication system
US5752193A (en) * 1995-09-01 1998-05-12 Motorola, Inc. Method and apparatus for communicating in a wireless communication system
EP0952752B1 (en) * 1998-03-30 2013-05-15 Alcatel Lucent ATM adaption layer traffic scheduling
US6885868B1 (en) 1999-09-30 2005-04-26 Nortel Networks Limited Fair packet scheduler and scheduling method for packet data radio
US6760328B1 (en) * 1999-10-14 2004-07-06 Synchrodyne Networks, Inc. Scheduling with different time intervals
US6952454B1 (en) 2000-03-22 2005-10-04 Qualcomm, Incorporated Multiplexing of real time services and non-real time services for OFDM systems
JP2001292476A (en) 2000-04-05 2001-10-19 Mitsubishi Electric Corp Wireless communication method and its wireless communication unit
US6920119B2 (en) * 2001-01-09 2005-07-19 Motorola, Inc. Method for scheduling and allocating data transmissions in a broad-band communications system
US8111689B2 (en) * 2001-01-16 2012-02-07 Nokia Corporation System for uplink scheduling packet based data traffic in wireless system
US7002934B2 (en) * 2001-01-22 2006-02-21 Unique Broadband Systems, Inc. OFDM multiple upstream receiver network
JP4187940B2 (en) * 2001-03-06 2008-11-26 株式会社エヌ・ティ・ティ・ドコモ Packet transmission method and system, packet transmission device, reception device, and transmission / reception device
WO2003017589A1 (en) * 2001-08-16 2003-02-27 British Telecommunications Public Limited Company Burst reservation multiple access scheme with free abd demand bandwidth assignment (brma-fd)
EP1289219A1 (en) * 2001-08-28 2003-03-05 Lucent Technologies Inc. A method of scheduling data packets for transmission over a shared channel, and a terminal of data packet transmission network
JP4806766B2 (en) 2001-09-17 2011-11-02 独立行政法人情報通信研究機構 Radio communication method, reception status estimation method, transmission device, and reception device
US7046660B2 (en) * 2001-10-03 2006-05-16 Internet Machines Corp. Switching apparatus for high speed channels using multiple parallel lower speed channels while maintaining data rate
GB0125390D0 (en) * 2001-10-23 2001-12-12 Ipwireless Inc Resource allocation in a packet-based radio communication system
US8493998B2 (en) * 2003-11-19 2013-07-23 Alcatel Lucent Method and apparatus for scheduling forward data bursts in wireless network
US20050207436A1 (en) * 2004-03-18 2005-09-22 Anujan Varma Switching device based on aggregation of packets
US7433314B2 (en) * 2004-06-01 2008-10-07 Samsung Electronics Co., Ltd. Method and system for acknowledging the receipt of a transmitted data stream in a wireless personal area network
US7961609B2 (en) 2004-07-20 2011-06-14 Qualcomm Incorporated Packet aware scheduler in wireless communication systems

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2000151619A (en) * 1998-11-04 2000-05-30 Sony Corp Transmission method and transmitter
JP2004503181A (en) * 2000-07-12 2004-01-29 クゥアルコム・インコーポレイテッドQualcomm Incorporated Multiplexing real-time and non-real-time services for OFDM systems
WO2002039760A2 (en) * 2000-11-07 2002-05-16 Nokia Corporation System for uplink scheduling of packet data traffic in wireless system
JP2003018117A (en) * 2001-07-04 2003-01-17 Nippon Telegr & Teleph Corp <Ntt> Multiple access equipment and multiple access method

Also Published As

Publication number Publication date
IL180825D0 (en) 2007-06-03
EP1779612A2 (en) 2007-05-02
WO2006012405A2 (en) 2006-02-02
US8971259B2 (en) 2015-03-03
MX2007000857A (en) 2007-04-18
US7961609B2 (en) 2011-06-14
US20060019677A1 (en) 2006-01-26
RU2007106048A (en) 2008-08-27
JP5666326B2 (en) 2015-02-12
JP2011139488A (en) 2011-07-14
BRPI0513704A (en) 2008-05-13
KR20070040400A (en) 2007-04-16
KR100935559B1 (en) 2010-01-07
AU2005267103A1 (en) 2006-02-02
WO2006012405A3 (en) 2006-06-29
US20110205987A1 (en) 2011-08-25
CN101310481A (en) 2008-11-19
CN103124437A (en) 2013-05-29
CN101310481B (en) 2013-03-27
CA2574711A1 (en) 2006-02-02
RU2348119C2 (en) 2009-02-27

Similar Documents

Publication Publication Date Title
Wang et al. A Unified Approach to QoS-Guaranteed Scheduling for Channel-Adaptive Wireless Networks.
KR101038406B1 (en) Multiplexing of real time services and non-real time services for ofdm systems
CA2497057C (en) Transmission apparatus and method for use in mobile communication system based on orthogonal frequency division multiplexing scheme
CN101965707B (en) Soft butter memory configuration in communication system
ES2464592T3 (en) Channel quality indicator for time, frequency and space channel in a terrestrial radio access network
TWI527417B (en) Quality of service based resource determination and allocation apparatus and procedure in high speed packet access evolution and long term evolution systems
JP5425869B2 (en) Superposition coding in wireless communication systems
ES2454557T3 (en) Procedures and devices to provide planning information efficiently
CN1906892B (en) Method and apparatus for providing an efficient control channel structure in a wireless communication system
EP1492280B1 (en) Quality driven adaptive channel assignment in an OFDMA radio communication system
RU2449486C2 (en) Structure of spatial pilot signal for wireless communication with multiple antennas
KR100955446B1 (en) Adaptive sectorization in cellular systems
TWI344281B (en) Method and apparatus for pilot communication in a multi-antenna wireless communication system
JP4335923B2 (en) Method, apparatus, and system for data transmission and processing in a wireless communication environment
US7391750B2 (en) System and method for dynamically allocating resources in a mobile communication system employing orthogonal frequency division multiple access
JP4772121B2 (en) Method, base station, mobile station and medium for reducing interference to downlink broadcast signals
KR100977125B1 (en) Segment sensitive scheduling
JP2009514365A (en) Method and apparatus for processing commands in a wireless communication system
AU2010202110B2 (en) Efficient signaling over access channel
JP4553893B2 (en) Subcarrier allocation method for reducing inter-cell interference in an OFDM cellular environment
JP2011061806A (en) Forward link handoff for wireless communication system including ofdm forward link and cdma reverse link
CN101346937B (en) Scalable frequency band operation in wireless communication systems
US7680199B2 (en) Communications systems
US8045519B2 (en) Scheduling in wireless communication systems
US7457588B2 (en) Channel quality indicator for time, frequency and spatial channel in terrestrial radio access network

Legal Events

Date Code Title Description
A977 Report on retrieval

Free format text: JAPANESE INTERMEDIATE CODE: A971007

Effective date: 20091102

A131 Notification of reasons for refusal

Free format text: JAPANESE INTERMEDIATE CODE: A131

Effective date: 20091110

A601 Written request for extension of time

Free format text: JAPANESE INTERMEDIATE CODE: A601

Effective date: 20100202

A602 Written permission of extension of time

Free format text: JAPANESE INTERMEDIATE CODE: A602

Effective date: 20100209

A521 Written amendment

Free format text: JAPANESE INTERMEDIATE CODE: A523

Effective date: 20100310

A02 Decision of refusal

Free format text: JAPANESE INTERMEDIATE CODE: A02

Effective date: 20100928

A761 Written withdrawal of application

Free format text: JAPANESE INTERMEDIATE CODE: A761

Effective date: 20110406