EP2245892A2 - Procédé et système efficaces d'attribution de ressources radio - Google Patents

Procédé et système efficaces d'attribution de ressources radio

Info

Publication number
EP2245892A2
EP2245892A2 EP08863073A EP08863073A EP2245892A2 EP 2245892 A2 EP2245892 A2 EP 2245892A2 EP 08863073 A EP08863073 A EP 08863073A EP 08863073 A EP08863073 A EP 08863073A EP 2245892 A2 EP2245892 A2 EP 2245892A2
Authority
EP
European Patent Office
Prior art keywords
resource
address
grouping
station
groupings
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
EP08863073A
Other languages
German (de)
English (en)
Other versions
EP2245892A4 (fr
Inventor
Sean Cai
Jerry Chow
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.)
ZTE USA Inc
Original Assignee
ZTE USA Inc
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
Application filed by ZTE USA Inc filed Critical ZTE USA Inc
Publication of EP2245892A2 publication Critical patent/EP2245892A2/fr
Publication of EP2245892A4 publication Critical patent/EP2245892A4/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0044—Arrangements for allocating sub-channels of the transmission path allocation of payload
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/563—Allocation or scheduling criteria for wireless resources based on priority criteria of the wireless resources
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0001—Arrangements for dividing the transmission path
    • H04L5/0003—Two-dimensional division
    • H04L5/0005—Time-frequency
    • H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A), DMT
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/06—Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information

Definitions

  • the present invention relates generally to digital communications and more particularly to Orthogonal Frequency Division Multiplexing (OFDM) and Orthogonal Frequency Division Multiple Access (OFDMA) systems.
  • OFDM Orthogonal Frequency Division Multiplexing
  • OFDMA Orthogonal Frequency Division Multiple Access
  • OFDM divides an allocated communication channel into a number of orthogonal subchannels of equal bandwidth.
  • Each subchannel is modulated by a unique group of subcarrier signals, whose frequencies are equally and minimally spaced for optimal bandwidth efficiency.
  • the group of subcarrier signals are chosen to be orthogonal, meaning the inner product of any two of the subcarriers equals zero.
  • An inverse fast Fourier transform (IFFT) is often used to form the subcarriers.
  • the number of orthogonal subcarriers determines the fast Fourier transform (FFT) size (N) to be used.
  • FFT fast Fourier transform
  • Orthogonal Frequency Division Multiple Access is a multiuser version of OFDM.
  • OFDMA Orthogonal Frequency Division Multiple Access
  • OFDMA may be considered to be a combination of frequency and time domain multiple access, where a time-frequency space, is partitioned and the mobile station data is assigned along the OFDM symbols and subcarriers.
  • a frame is a fixed or variable length packet of data, which has been encoded by a communications protocol for digital transmission.
  • a frame structure is the way a multiplexer divides a communication channel into frames for transmission and if applicable, subdivides a frame into smaller portions with different transmission properties to satisfy different transmission requirements of the various data being carried over the digital communications channel or to assist in the effective reception of such data at the intended receiver over the physical medium.
  • the frame structure of an OFDM or OFDMA system contributes to determining the performance of the system.
  • An aspect of the frame structure design that can significantly impact the achievable performance of the resulting frame structure is the amount of control signaling protocol overhead required to specify the assignment of resources within the frame to the various data being carried within it.
  • One aspect of the present disclosure is directed to a method of allocating transmission resources to data being carried within a data transmission frame.
  • the method includes partitioning the transmission resources into a plurality of resource groupings; and individually addressing each of the plurality of resource groupings, based on a hierarchical group level of each of the plurality of resource groupings.
  • a further aspect of the present disclosure is directed to a station in a wireless communication system capable of allocating transmission resources to data being carried within a data transmission frame.
  • the station comprises a processing module, which is configured to partition the transmission resources into a plurality of resource groupings, and individually address each of the plurality of resource groupings, based on a hierarchical group level of each of the plurality of resource groupings.
  • Yet another aspect of the present disclosure is directed to system for allocating transmission resources to data being carried within a data transmission frame.
  • the system may comprise means for partitioning the transmission resources into a plurality of resource groupings; and means for individually addressing each of the plurality of resource groupings, based on a hierarchical group level of each of the plurality of resource groupings.
  • Yet another aspect of the present disclosure is directed to a computer- readable medium storing instructions thereon for allocating transmission resources to data being carried within a data transmission frame.
  • the instructions include code for partitioning the transmission resources into a plurality of resource groupings; and individually addressing each of the plurality of resource groupings, based on a hierarchical group level of each of the plurality of resource groupings.
  • embodiments of the present disclosure are further configured to variably allocate each of the plurality of resource groupings to respective portions of the data being carried within the data transmission frame, based on an amount of the data being carried in each respective portion.
  • embodiments of the present invention provide an efficient method and system for specifying the allocation of resources within a data transmission frame to the data being carried within the frame.
  • FIG. 1 is an illustration of an exemplary OFDM/OFDMA mobile radio channel operating environment, according to one embodiment of the present invention.
  • FIG. 2 is an illustration of an exemplary OFDM/OFDMA exemplary communication system according to one embodiment of the present invention.
  • FIG. 3 is an illustration of an exemplary OFDM/OFDMA sub frame structure, according to one embodiment of the present invention.
  • Figs 4(a) and 4(b) illustrate a general abstract model of a resource allocation management framework based on a two-dimensional radio resource space of time and frequency, according to one embodiment of the present invention.
  • Fig. 5 is an illustration of a general tree-based organization of RRE aggregation into allocable units of increasingly larger sizes, according to one embodiment of the present invention.
  • FIG. 6 is an illustration of a use of a binary tree as the basis of organizing RRE aggregation into allocable units of increasingly larger sizes, according to one embodiment of the present invention.
  • Figs. 7(a) and 7(b) show examples of addressing elements forming addresses to individual nodes, according to one embodiment of the present invention.
  • Figs. 8(a) and 8(b) illustrate examples of a compound address that supports the specification of multiple nodes (allocable units) from the resource allocation tree to be included in an allocation according to one embodiment of the invention.
  • Figs. 9(a) and 9(b) illustrate a form of a compound address that supports the specification of multiple nodes (allocable units) from a resource allocation tree to be included in an allocation according to one embodiment of the invention.
  • Fig. 10 illustrates a specific example of a binary tree for an RSS with
  • Fig. 11 illustrates a specific example of an M-ary tree for an RSS with
  • Fig. 12 is a flowchart illustrating a method of allocating transmission resources to data being carried within a data transmission frame, according to one embodiment of the present invention.
  • Fig. 13 illustrates a method of partitioning the transmission resources into a plurality of resource groupings, according to one embodiment of the present invention.
  • aspects of the present disclosure are directed toward systems and methods for OFDM/OFDMA frame structure technology for communication systems.
  • Embodiments of the invention are described herein in the context of one practical application, namely, communication between a base station and a plurality of mobile devices.
  • the exemplary system is applicable to provide data communications between a base station and a plurality of mobile devices.
  • Embodiments of the disclosure are not limited to such base station and mobile device communication applications, and the methods described herein may also be utilized in other applications such as mobile-to-mobile communications, or wireless local loop communications.
  • these are merely examples and the invention is not limited to operating in accordance with these examples.
  • the OFDM/OFDMA frame structure comprises a variable length sub-frame structure with an efficiently sized cyclic prefix operable to effectively utilize OFDM/OFDMA bandwidth.
  • the frame structure provides compatibility with multiple wireless communication systems.
  • Fig. 1 illustrates a mobile radio channel operating environment 100, according to one embodiment of the present invention.
  • the mobile radio channel operating environment 100 may include a base station (BS) 102, a mobile station (MS) 104, various obstacles 106/108/110, and a cluster of notional hexagonal cells 126/130/132/134/136/138/140 overlaying a geographical area 101.
  • Each cell 126/130/132/134/136/138/140 may include a base station operating at its allocated bandwidth to provide adequate radio coverage to its intended users.
  • the base station 102 may operate at an allocated channel transmission bandwidth to provide adequate coverage to the mobile station 104.
  • mobile station 104 may be any user device such as a mobile phone.
  • mobile station 104 may be a personal digital assistant (PDA) such as a Blackberry device, MP3 player or other similar portable device.
  • PDA personal digital assistant
  • mobile station 104 may be a personal wireless computer such as a wireless notebook computer, a wireless palmtop computer, or other mobile computer devices.
  • the base station 102 and the mobile station 104 may communicate via a downlink radio frame 118, and an uplink radio frame 124 respectively.
  • Each radio frame 118/124 may be further divided into sub-frames 120/126 which may include data symbols 122/124.
  • a signal transmitted from a base station 102 may suffer from the operating conditions mentioned above.
  • multipath signal components 112 may occur as a consequence of reflections, scattering, and diffraction of the transmitted signal by natural and/or man-made objects 106/108/110.
  • the receiver antenna 114 a multitude of signals may arrive from many different directions with different delays, attenuations, and phases.
  • the time difference between the arrival moment of the first received multipath component 116 (typically the line of sight component), and the last received multipath component (possibly any of the multipath signal components 112) is called delay spread.
  • the combination of signals with various delays, attenuations, and phases may create distortions such as ISI and ICI in the received signal.
  • the d istortion may complicate reception and conversion of the received signal into useful information. For example, delay spread may cause ISI in the useful information (data symbols) contained in the radio frame 124.
  • Orthogonal Frequency Division Multiplexing can mitigate delay spread and many other difficult operating conditions.
  • OFDM divides an allocated radio communication channel into a number of orthogonal subchannels of equal bandwidth. Each subchannel is modulated by a unique group of subcarrier signals, whose frequencies are equally and minimally spaced for optimal bandwidth efficiency.
  • the group of subcarrier signals are chosen to be orthogonal, meaning the inner product of any two of the subcarriers equals zero. In this manner, the entire bandwidth allocated to the system is divided into orthogonal subcarriers.
  • Orthogonal Frequency Division Multiple Access is a multiuser version of OFDM.
  • OFDM Orthogonal Frequency Division Multiple Access
  • a subscriber device may be a mobile station 104 with which the base station 102 is communicating.
  • An inverse fast Fourier transform is often used to form the subcarriers, and the number of orthogonal subcarriers determines the fast Fourier transform (FFT) size (N FFT ) to be used.
  • An information symbol (e.g., data symbol) in the frequency domain of the IFFT is transformed into a time domain modulation of the orthogonal subcarriers.
  • the modulation of the orthogonal subcarriers forms an information symbol in the time domain with a duration T 11 .
  • Duration T 11 is generally referred to as the OFDM useful symbol duration.
  • the spacing between the orthogonal subcarriers Af is chosen to be — ,
  • the OFDM symbol duration T 11 is — .
  • orthogonal subcarriers N c (an integer less than or equal to N FFT ) is the channel
  • BW transmission bandwidth (BW) divided by the subcarrier spacing or BW * T 11 .
  • Fig. 2 shows an exemplary wireless communication system 200 for transmitting and receiving OFDM/OFDMA transmissions, in accordance with one embodiment of the present invention.
  • the system 200 may include components and elements configured to support known or conventional operating features that need not be described in detail herein.
  • system 200 can be used to transmit and receive OFDM/OFDMA data symbols in a wireless communication environment such as the wireless communication environment 100 (Fig. 1).
  • System 200 generally comprises a base station 102 with a base station transceiver module 202, a base station antenna 206, a base station processor module 216 and a base station memory module 218.
  • System 200 generally comprises a mobile station 104 with a mobile station transceiver module 208, a mobile station antenna 212, a mobile station memory module 220, a mobile station processor module 222, and a network communication module 226.
  • BS 102 and MS 104 may include additional or alternative modules without departing from the scope of the present invention.
  • system 200 may be interconnected together using a data communication bus (e.g., 228, 230), or any suitable interconnection arrangement. Such interconnection facilitates communication between the various elements of wireless system 200.
  • a data communication bus e.g., 228, 230
  • interconnection facilitates communication between the various elements of wireless system 200.
  • a data communication bus e.g., 228, 230
  • Those skilled in the art will understand that the various illustrative blocks, modules, circuits, and processing logic described in connection with the embodiments disclosed herein may be implemented in hardware, computer-readable software, firmware, or any practical combination thereof. To clearly illustrate this interchangeability and compatibility of hardware, firmware, and software, various illustrative components, blocks, modules, circuits, and steps are described generally in terms of their functionality. Whether such functionality is implemented as hardware, firmware, or software depends upon the particular application and design constraints imposed on the overall system.
  • the base station transceiver 202 and the mobile station transceiver 208 each comprise a transmitter module and a receiver module (not shown). Additionally, although not shown in this figure, those skilled in the art will recognize that a transmitter may transmit to more than one receiver, and that multiple transmitters may transmit to the same receiver. In a TDD system, transmit and receive timing gaps exist as guard bands to protect against transitions from transmit to receive and vice versa.
  • an "uplink” transceiver 208 includes an OFDM/OFDMA transmitter that shares an antenna with an uplink receiver.
  • a duplex switch may alternatively couple the uplink transmitter or receiver to the uplink antenna in time duplex fashion.
  • a "downlink" transceiver 202 includes an OFDM/OFDMA receiver which shares a downlink antenna with a downlink transmitter.
  • a downlink duplex switch may alternatively couple the downlink transmitter or receiver to the downlink antenna in time duplex fashion.
  • OFDM/OFDMA transceiver modules 202/208 may utilize other communication techniques such as, without limitation, a frequency division duplex (FDD) communication technique.
  • FDD frequency division duplex
  • the mobile station transceiver 208 and the base station transceiver 202 are configured to communicate via a wireless data communication link 214.
  • the mobile station transceiver 208 and the base station transceiver 202 cooperate with a suitably configured RF antenna arrangement 206/212 that can support a particular wireless communication protocol and modulation scheme.
  • the mobile station transceiver 208 and the base station transceiver 202 are configured to support industry standards such as the Third Generation Partnership Project Long Term Evolution (3GPP LTE), Third Generation Partnership Project 2 Ultra Mobile Broadband (3Gpp2 UMB), Time Division-Synchronous Code Division Multiple Access (TD-SCDMA), and Wireless Interoperability for Microwave Access (WiMAX), and the like.
  • the mobile station transceiver 208 and the base station transceiver 202 may be configured to support alternate, or additional, wireless data communication protocols, including future variations of IEEE 802.16, such as 802.16e, 802.16m, and so on.
  • the base station 102 controls the radio resource allocations and assignments, and the mobile station 104 is configured to decode and interpret the allocation protocol.
  • the mobile station 104 controls allocation of radio resources for a particular link, and could implement the role of radio resource controller or allocator, as described herein.
  • Processor modules 216/222 may be implemented, or realized, with a general purpose processor, a content addressable memory, a digital signal processor, an application specific integrated circuit, a field programmable gate array, any suitable programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof, designed to perform the functions described herein.
  • a processor may be realized as a microprocessor, a controller, a microcontroller, a state machine, or the like.
  • a processor may also be implemented as a combination of computing devices, e.g., a combination of a digital signal processor and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a digital signal processor core, or any other such configuration.
  • Processor modules 216/222 comprise processing logic that is configured to carry out the functions, techniques, and processing tasks associated with the operation of OFDM/OFDM A system 200.
  • the processing logic is configured to support the OFDM/OFDMA frame structure parameters described herein.
  • the processing logic may be resident in the base station and/or may be part of a network architecture that communicates with the base station transceiver 202.
  • the steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in firmware, in a software module executed by processor modules 216/222, or in any practical combination thereof.
  • a software module may reside in memory modules 218/220, which may be realized as RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
  • memory modules 218/220 may be coupled to the processor modules 218/222 respectively such that the processors modules 216/220 can read information from, and write information to, memory modules 618/620.
  • processor module 216, and memory modules 218, processor module 222, and memory module 220 may reside in their respective ASICs.
  • the memory modules 218/220 may also be integrated into the processor modules 216/220.
  • the memory module 218/220 may include a cache memory for storing temporary variables or other intermediate information during execution of instructions to be executed by processor modules 216/222.
  • Memory modules 218/220 may also include non- volatile memory for storing instructions to be executed by the processor modules 216/220.
  • Memory modules 218/220 may include a frame structure database (not shown) in accordance with an exemplary embodiment of the invention.
  • Frame structure parameter databases may be configured to store, maintain, and provide data as needed to support the functionality of system 200 in the manner described below.
  • a frame structure database may be a local database coupled to the processors 216/222, or may be a remote database, for example, a central network database, and the like.
  • a frame structure database may be configured to maintain, without limitation, frame structure parameters as explained below. In this manner, a frame structure database may include a lookup table for purposes of storing frame structure parameters.
  • the network communication module 226 generally represents the hardware, software, firmware, processing logic, and/or other components of system 200 that enable bi-directional communication between base station transceiver 202, and network components to which the base station transceiver 202 is connected.
  • network communication module 226 may be configured to support internet or WiMAX traffic.
  • network communication module 226 provides an 802.3 Ethernet interface such that base station transceiver 202 can communicate with a conventional Ethernet based computer network.
  • the network communication module 226 may include a physical interface for connection to the computer network (e.g., Mobile Switching Center (MSC)).
  • MSC Mobile Switching Center
  • Fig. 3 is an illustration of an exemplary OFDM/OFDMA sub-frame structure, according to one embodiment of the present invention.
  • the OFDM/OFDMA sub-frame structure comprises a short sub-frame 302, a regular sub-frame 304, a long sub-frame 306, and an optional low chip rate (LCR) sub-frame 308.
  • a 10 ms radio frame may be divided into twenty or more short sub-frames 302, ten regular sub-frames 304, or five long sub-frames 306.
  • a short sub-frame 302 has a duration of 0.5 ms
  • a regular sub- frame 304 has a duration of 1 ms
  • a long sub-frame 306 has a duration of 2 ms.
  • Other numbers of sub-frames that do not necessarily divide the 10 ms radio frame evenly may also be used.
  • a gap remains in the radio frame.
  • the frame structure provides compatibility with multiple wireless communication systems.
  • the low chip rate sub-frame 308 duration of 0.675 ms may allow compatibility with the Time Division-Synchronous Code Division Multiple Access (TD-SCDMA) OFDM/OFDMA radio frame structure.
  • TD-SCDMA Time Division-Synchronous Code Division Multiple Access
  • the long sub-frame 306 duration of 2 ms may allow compatibility with the Third Generation Partnership Project Long Term Evolution (3GPP LTE) OFDM/OFDMA radio frame structure, and the like.
  • 3GPP LTE Third Generation Partnership Project Long Term Evolution
  • the exemplary frame structures of Fig. 3 are merely contextual, and various frame structures may be implemented without departing from the scope of the present invention.
  • Figs 4(a) and 4(b) illustrate a general abstract model of a resource allocation management framework based on a two-dimensional radio resource space of time and frequency, according to one embodiment of the present invention.
  • the elements in the model include the Radio Resource Segment (RRS) 400, and the Radio Resource Element (RRE) 410.
  • the RRS 400 defines the scope of applicability for a particular instance of the radio resource addressing method in that the particular instance of the addressing method need only accommodate the totality of radio resources 420 contained within an RRS 400.
  • Different RRSs 400 may structure their radio resources 420 differently for various reasons, such as to assist in the mitigation of impairments of the radio environments for which the type of RRS 400 may be employed while minimizing the impact to the data-carrying performance of the RRS 400.
  • the fundamental unit of radio resource allocation within an RRS 400 is the RRE 410.
  • an RRE 410 is defined as a small contiguous block of radio resources 420 within the resource space of the RRS 400.
  • Figs. 4(a) and 4(b) which provide examples of RREs 410 based on the two-dimensional radio resource space of OFDM/OFDM A technology
  • the simple form of an RRE 410 is the rectangular resource allocation, as shown in Fig. 4(a).
  • an RRE 410 may be comprised of a set of smaller contiguous blocks of radio resources 420 with the blocks dispersed in some reasonable fashion within the radio resource space of the RRS 400.
  • FIG. 4(b) shows an RRE 410 composed of four blocks of radio resources 420 with the blocks dispersed in both time and frequency within the RRS 400; such form of an RRE 410 may be useful in helping to mitigate the impact of a time and frequency selective radio environment.
  • RRE 410 structures provided in Figs. 4(a) and 4(b) show RREs 410 with uniform structures, this need not be the case.
  • Fig. 5 is an illustration of a general tree-based radio resource grouping and summarization structure, according to one embodiment of the invention. Each node at the root 520, forks 510, and leaves 500 of the tree represent a separately addressable allocable unit of radio resources within an RRS 400.
  • All of the individual RREs 410 of the RRS 400 are assigned as a leaf node 500 of the tree.
  • GL Grouping Levels
  • m 2 1 st Grouping Level (GLl) nodes are summarized into a parent 2 nd Grouping Level (GL2) node.
  • This m-ary relationship repeats at each successive higher order Grouping Level culminating in a single node at the root 520 of the tree.
  • This root 520 node represents the totality of radio resources 420 of the RRS 400 as a single allocable unit.
  • the number of nodes at a Grouping Level n is given by the number of nodes at the child Grouping Level divided by the grouping factor m n from the child level and rounded up to the next higher integer value. Therefore, for Grouping Level n, the number of allocable units (i.e., the number of nodes, N GL ⁇ ), as represented by the number of nodes at this level,
  • N RRE is the number of
  • RREs 410 in the RRS 400 there may be one node which summarizes less than m n child nodes if the number of nodes at the child level is not an integer multiple of m n .
  • Fig. 6 is an illustration of a use of a binary tree as the basis of organizing RRE 410 aggregation into allocable units of increasingly larger sizes, according to one embodiment of the present invention.
  • each node at the root 620, forks 610, and leaves 600 of the tree represent a separately addressable allocable unit of radio resources within an RRS 400.
  • Nodes in a radio resource allocation tree can be individually addressed based on an efficient method of variable length addressing according to an embodiment of the invention.
  • This variable-length addressing method takes advantage of increasingly fewer nodes at each level of the tree as the tree is traversed from leaf 500/600 to root 520/620 to reduce the number of bits required to address the nodes at each level closer to the root 520/620.
  • the addressing elements allow a structured way to define different address formats for each level of the tree.
  • one element in the address is the identification of the level of the tree to which the address pertains - this is done through a Grouping Level element which assigns a number to identify the level of the tree to which an address pertains.
  • This Grouping Level element may be encoded as 0 to NQ L - 1 in binary form, for example, using the least number of bits needed to accommodate the value of NQ L -
  • various encoding forms may be used to identify N GL without departing from the scope of the present disclosure.
  • “Grouping Level” is used throughout this disclosure to represent this address element; however, various nomenclatures may be used without departing from the scope of the present disclosure.
  • each node represents an individually allocable unit of radio resources for the RRS 400 - this consideration defines the size of an "Allocable Unit #" element for a particular level of the tree, and may be encoded as 0 to NQ L - 1 in binary form, for example, using at least the number of bits needed to accommodate the value of the number of nodes.
  • "Allocable Unit #" is used throughout this disclosure to represent this address element; however, various nomenclatures may be used without departing from the scope of the present disclosure.
  • the flag element is referred to as "Grouped"; however, various nomenclatures may be used without departing from the scope of the present disclosure.
  • Figs. 7(a) and 7(b) show examples of the addressing elements described above forming addresses to individual nodes, according to an embodiment of the present invention.
  • a 2-tuple address comprising the Grouped flag 700 and Allocable Unit # 710 may be used to create an efficient format for individual RREs 410.
  • the size of the Allocable Unit # 710 element (bits) may be determined by the expression:
  • Other nodes of the tree may be identified by a 3-tuple address comprising the Grouped flag 700, identification of the Grouping Level 720 (i.e., non- leaf level) of the tree, and the Allocable Unit # 710 within that level.
  • This latter format allows the address to any non-leaf node to use as short a field as possible to represent the required range of Allocable Unit # and thereby create an efficient addressing mechanism for these non-leaf nodes.
  • the size of the Grouping Level 720 field (bits) may be determined by the expression: ceil (log 2 (N G L)).
  • the size of the Allocable Unit # 710 field (bits) may be determined by the expression:
  • various other address elements may be included without departing from the scope of the present invention.
  • the ability to specify an allocation comprised of a disjoint set of RREs 410 may be necessary.
  • An efficient way to provide this identification for a set of RREs 410 to satisfy a particular amount of resources required of a particular allocation is to allow a disjoint set of allocable units from the resource allocation tree to be specified. This set of allocable units from the tree may be disjoint from the perspective of RREs 410 being included only once in the allocation.
  • Figs. 8(a) and 8(b) illustrate examples of a compound address that supports the specification of multiple nodes (allocable units) from the resource allocation tree to be included in an allocation according to an embodiment of the invention.
  • This form includes a list of individual addresses of allocable units, as described above. There may be multiple ways to identify how many individual addresses are included. In a first example, a 1-bit flag is appended to each individual address, as shown in Fig. 8(a). This flag identifies whether the individual address is the last one included or not.
  • This format is flexible and allows an arbitrary number of individual addresses to be included, but incurs some overhead due to the addition of the 1-bit flag on a per-individual-address basis.
  • a field is appended that identifies how many individual addresses are included, as shown in Fig. 8(b).
  • the size of this field (determined by the expression: ceil (log 2 (N max )), where N max is the maximum number of individual allocable units that can be included in set) limits the maximum number of individual addresses that may be included.
  • This format potentially introduces less overhead than the format described in Fig. 8(a), but setting the size of the new field properly is critical to ensuring a sufficient number of individual addresses per allocation is supported to meet all potential needs for allocation sizes.
  • the examples of Figs. 8(a) and 8(b) are merely exemplary, and various other ways to identify how many individual addresses are included may be implemented.
  • 9(a) and 9(b) illustrate another form of a compound address that supports the specification of multiple nodes (allocable units) from a resource allocation tree to be included in an allocation according to an embodiment of the invention.
  • This exemplary form uses a bitmap to provide an efficient way of identifying the Grouping Level values 720 associated with the addresses to specific nodes in the tree that comprise the resource allocation.
  • Each bit of the bitmap indicates whether an individual address from a Grouping Level, from the leaf level to the child level of the root, is included in the compound address. Therefore, the size of the bitmap is equal to the number of Grouping Levels, NQ L , in the tree.
  • the tradeoff to gain extra efficiency is some loss in flexibility as the bitmap can only identify a single constituent node of the compound allocation from each Grouping Level.
  • Figs. 9(a) and 9(b) since the applicable Grouping Levels have already been identified by the bitmap, only the value of the Allocable Unit # 710 elements associated with the nodes from the a Grouping Level or the leaf level with its corresponding bit in the bitmap set to TRUE need to be appended to the bitmap to form the compound address.
  • Fig. 9(a) shows an example in which a node (allocable unit) from each of the non-root levels of the tree are included in the compound address.
  • Fig. 9(b) shows an example in which a node (allocable unit) from only two of the non-root levels of the tree are included in the compound address.
  • Fig. 10 illustrates a specific example of a binary tree for an RSS 400 with 16 RREs 410 according to an embodiment of the invention. As shown in Fig. 10, this results in a five-level binary tree with all 16 RREs 410 addressable as a single allocable unit at the top root level (GL4) 1020 and each RRE 410 individually addressable at the leaf level 1000.
  • the intermediate Grouping Levels 1010 1 to 3 represent groupings of 2, 4 and 8 RREs 410 as individual allocable units, respectively.
  • Fig. 10 shows examples of addresses of individual nodes at each level of the tree based on the formats described herein, including the 2-tuple addresses to individual RREs 410 at the leaf level 1000 and the 3 -tuple addresses to individual non- leaf nodes 1010 and 1020 of the tree according to embodiments of the invention.
  • Fig. 10 also illustrates the flexibility of the list form of compound addressing by way of an example of a compound allocation that includes two nodes (allocable units) from the same level of the tree (in the case of the illustration, from the leaf level 1000 of the tree).
  • RRE 5 may be addressed as (ObO, ObOlOO).
  • a 3 -tuple grouped RRE 410 (e.g., grouping level 1 - RRE - GLl 8)
  • the Allocable Unit # is redundant and may be omitted.
  • the address may be expressed as (ObI, ObI 1).
  • the address for 2, RRE 6, RRE 8, for example may be expressed as (ObOl, (ObO, ObOlOl), (ObO, ObOl 11).
  • Fig. 11 illustrates a specific example of an M-ary tree for an RSS 400 with 36 RREs 410 according to embodiments of the invention.
  • Fig. 11 shows, by using child-to-parent ratios greater than 2 between the leaf and 1 st Grouping Level and between the 1 st Grouping Level and the 2 nd Grouping Level (these ratios being 3 in this example), the number of levels in the tree is kept the same as for the 16-RRE binary tree of Fig. 10 even though the number of individual RREs 410 available in the RRS 400 has more than doubled.
  • the intermediate Grouping Levels 1 to 3 represent groupings of 3, 9 and 18 RREs 410 as individual allocable units, respectively.
  • RRE 5 may be addressed as (ObO, ObOOOlOO).
  • a 3-tuple grouped RRE 410 (e.g., grouping level 1 - RRE - GLl 8)
  • the Allocable Unit # is redundant and may be omitted.
  • the address may still be expressed as (ObI, ObI 1).
  • the address for 2, RRE 6, RRE 8, for example may be expressed as (ObOl, (ObO, ObOOOlOl), (ObO, ObOOOl 11).
  • Fig. 12 is a flowchart illustrating a method of allocating transmission resources to data being carried within a data transmission frame, according to one embodiment of the present invention.
  • the transmission resources are partitioned into a plurality of resource groupings.
  • Resource groupings refer to each addressable group of RREs 410 at various hierarchical grouping levels. Specific functions involved with partitioning the transmission resources into a plurality of resource groupings are described in detail with respect to Fig. 13 below.
  • each of the plurality of resource groupings are addressed, based on a hierarchical group level of each of the plurality of resource groupings.
  • addresses may be assigned using various techniques (e.g., 2-tuple address, 3-tuple address, compound address, etc.).
  • each of the plurality of resource groupings are variably allocated to respective portions of the data being carried within the data transmission frame based on an amount of the data being carried in each respective portion.
  • different RRSs 400 may contain a different amount of radio resources 420.
  • Different RRSs 400 may structure their radio resources 420 differently for various reasons, such as to assist in the mitigation of impairments of the radio environments for which the type of RRS 400 may be employed while minimizing the impact to the data-carrying performance of the RRS 400.
  • An aspect of the frame structure design that can significantly impact the achievable performance of the resulting frame structure is the amount of control signaling protocol overhead required to specify the assignment of resources within the frame to the various data being carried within it.
  • Fig. 13 illustrates a method of partitioning the transmission resources into a plurality of resource groupings (see operation 1200 above), according to one embodiment of the present invention.
  • At operation 1310, one or more addressable resource elements (e.g., RREs 410 as leaf nodes) within the RRS 400 are determined. Addresses are given to each of the one or more addressable resource elements at operation 1320.
  • addressable resource elements e.g., RREs 410 as leaf nodes
  • the process continues to operation 1330, where the addressed one or more resource elements are grouped into one or more resource groupings (e.g., non-leaf nodes), such that higher hierarchical group levels include a greater amount of resource elements.
  • Each of the one or more resource groupings are addressed at operation 1340.
  • the grouped one or more addressed resource elements fully occupy resource space of the respective resource groupings.
  • the plurality of resource groupings may be further grouped into one or more larger resource groupings. Similarly, these one or more larger resource groupings may be addressed, and the process may be repeated until a root node is reached.
  • nodes in a radio resource allocation tree can be individually addressed based on an efficient method of variable length addressing according to an embodiment of the invention.
  • This variable-length addressing method takes advantage of increasingly fewer nodes at each level of the tree as the tree is traversed from leaf to root to reduce the number of bits required to address the nodes at each level closer to the root. Based on this consideration, the addressing elements allow a structured way to define different address formats for each level of the tree.
  • embodiments of the present invention are capable of providing an efficient method and system for specifying the allocation of resources within a data transmission frame to the data being carried within the frame.
  • module refers to software, firmware, hardware, and any combination of these elements for performing the associated functions described herein. Additionally, for purpose of discussion, the various modules are described as discrete modules; however, as would be apparent to one of ordinary skill in the art, two or more modules may be combined to form a single module that performs the associated functions according embodiments of the invention.
  • computer program product may be used generally to refer to media such as, memory storage devices, or storage unit. These, and other forms of computer- readable media, may be involved in storing one or more instructions for use by processor to cause the processor to perform specified operations. Such instructions, generally referred to as "computer program code” (which may be grouped in the form of computer programs or other groupings), when executed, enable the computing system.
  • memory or other storage may be employed in embodiments of the invention.
  • memory or other storage may be employed in embodiments of the invention.
  • any suitable distribution of functionality between different functional units, processing logic elements or domains may be used without detracting from the invention.
  • functionality illustrated to be performed by separate processing logic elements, or controllers may be performed by the same processing logic element, or controller.
  • references to specific functional units are only to be seen as references to suitable means for providing the described functionality, rather than indicative of a strict logical or physical structure or organization.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Time-Division Multiplex Systems (AREA)

Abstract

L'invention concerne un système et un procédé pour attribuer des ressources de transmission à des données portées dans une trame de transmission de données. Les ressources de transmission sont partagées entre une pluralité de groupages de ressources. Chaque groupage de la pluralité de groupages de ressources est individuellement adressé aux données portées dans la transmission de transmission de données, en se basant sur un niveau de groupe hiérarchique de chaque groupage de la pluralité de groupages de ressources. Chaque groupage de la pluralité de groupages de ressources peut être attribué de façon variable à des parties respectives des données portées dans la trame de transmission de données en se basant sur une quantité des données portées dans chaque partie respective.
EP08863073A 2007-12-18 2008-12-18 Procédé et système efficaces d'attribution de ressources radio Withdrawn EP2245892A4 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US1472307P 2007-12-18 2007-12-18
PCT/US2008/087530 WO2009079650A2 (fr) 2007-12-18 2008-12-18 Procédé et système efficaces d'attribution de ressources radio

Publications (2)

Publication Number Publication Date
EP2245892A2 true EP2245892A2 (fr) 2010-11-03
EP2245892A4 EP2245892A4 (fr) 2012-04-04

Family

ID=40796144

Family Applications (1)

Application Number Title Priority Date Filing Date
EP08863073A Withdrawn EP2245892A4 (fr) 2007-12-18 2008-12-18 Procédé et système efficaces d'attribution de ressources radio

Country Status (5)

Country Link
EP (1) EP2245892A4 (fr)
JP (1) JP2011509567A (fr)
KR (1) KR20100112135A (fr)
CN (1) CN101940045A (fr)
WO (1) WO2009079650A2 (fr)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9161244B2 (en) * 2010-12-10 2015-10-13 Lg Electronics Inc. Method for transceiving signal in multi-node system, and device therefor
JP5900947B2 (ja) * 2011-08-05 2016-04-06 日本電気株式会社 センサネットワークシステム、センサネットワーク制御方法、センサノード、センサノード制御方法、及び、センサノード制御プログラム
US10624112B2 (en) * 2015-09-23 2020-04-14 Qualcomm Incorporated Location and listen-before-schedule based resource allocation for vehicle-to-vehicle communication
EP3287914A1 (fr) 2016-08-23 2018-02-28 Siemens Healthcare GmbH Determination de donnees de resultat en fonction de donnees de mesure medicales provenant de differentes mesures

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1737155A1 (fr) * 2005-06-23 2006-12-27 Samsung Electronics Co., Ltd. Dispositif et procédé pour la configuration des trames dans des systèmes sans fil a bande large
EP1863215A2 (fr) * 2006-05-29 2007-12-05 Samsung Electronics Co., Ltd. Procédé et appareil d'affectation de ressources de fréquence dans un système de communication sans fil prenant en charge la multidiffusion de division de fréquence

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030123456A1 (en) * 2001-12-28 2003-07-03 Denz Peter R. Methods and system for data packet filtering using tree-like hierarchy
US20030152092A1 (en) * 2002-02-14 2003-08-14 Kai Lu Multilevel hierarchical addressing and routing mechanism for high-speed internet
CN100493060C (zh) * 2004-07-27 2009-05-27 华为技术有限公司 一种通信系统时频资源的分配方法
CA2581189A1 (fr) * 2004-09-29 2006-04-13 Sonus Networks, Inc. Groupes de circuits logiques dans un reseau a base de paquets

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1737155A1 (fr) * 2005-06-23 2006-12-27 Samsung Electronics Co., Ltd. Dispositif et procédé pour la configuration des trames dans des systèmes sans fil a bande large
EP1863215A2 (fr) * 2006-05-29 2007-12-05 Samsung Electronics Co., Ltd. Procédé et appareil d'affectation de ressources de fréquence dans un système de communication sans fil prenant en charge la multidiffusion de division de fréquence

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of WO2009079650A2 *

Also Published As

Publication number Publication date
EP2245892A4 (fr) 2012-04-04
WO2009079650A3 (fr) 2009-08-13
WO2009079650A2 (fr) 2009-06-25
CN101940045A (zh) 2011-01-05
KR20100112135A (ko) 2010-10-18
JP2011509567A (ja) 2011-03-24

Similar Documents

Publication Publication Date Title
US11063712B2 (en) Systems and methods for OFDM with flexible sub-carrier spacing and symbol duration
EP1856943B1 (fr) Utilisation d'affectations supplementaires
CN109997395A (zh) 用于无线通信系统的参数集确定的方法和系统
CN110636623B (zh) 一种基于载波聚合的无线宽带自组网的通信方法及其系统
CA2600392A1 (fr) Diminution des ressources par affectations supplementaires
WO2020025042A1 (fr) Procédé de configuration de ressources et dispositif terminal
CN110999244A (zh) 基于序列的信号处理方法及装置
US20100177726A1 (en) Method and system for synchronization and cell identification within communication systems
WO2009079650A2 (fr) Procédé et système efficaces d'attribution de ressources radio
CN101330484B (zh) 基于正交频分复用系统的混合资源分配及其信令表示方法
WO2023050243A1 (fr) Configuration d'éléments de ressource dans des signaux de référence de démodulation destinés à l'estimation de canal et à la transmission de données

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20100715

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MT NL NO PL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL BA MK RS

RIN1 Information on inventor provided before grant (corrected)

Inventor name: CHOW, JERRY

Inventor name: CAI, SEAN

DAX Request for extension of the european patent (deleted)
A4 Supplementary search report drawn up and despatched

Effective date: 20120307

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 5/00 20060101ALI20120301BHEP

Ipc: H04W 16/04 20090101ALI20120301BHEP

Ipc: H04W 72/06 20090101AFI20120301BHEP

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20140701