US 7,548,507 B2Granted

Method constructing a downlink frame for a communication system

AssigneeIntel Corporation

InventorsPuneet Pandoh, Balaji Rengarajan, Muthaiah Venkatachalam

Life of this patent

Estimating the term…

Loading patent…

Abstract

A method constructing a downlink frame for a communication system using a plurality of coding schemes and a quality metric. The method includes: (a) In no particular order: (1) establishing stripes along a first axis; (2) establishing slots within each stripe; and (3) assigning each flow to a group according to its coding scheme. (b) Evaluating a wastage metric for each group. (c) Evaluating the quality metric for each group. (d) Employing the wastage metric and the quality metric to establish an efficiency metric for each group. (e) Allocating a first group having a predetermined efficiency metric to a first stripe. (f) Continuing allocating until all stripes are filled to desired capacity or until all flows are fully allocated. (g) Populating the frame according to the allocating.

Claims20

Dependent claims

A method for constructing a downlink frame for a communication system;

said communication system handling communication data using a plurality of modulation and coding schemes;
said communication system scheduling said communication data for treatment according to predetermined criteria including at least one quality of service metric;
said communication system requiring said communication data be established in a plurality of flows arranged in a plurality of substantially rectangular sub-frames in said downlink frame;
each respective flow of said plurality of flows being identifiable by a respective coordinate pair measured along a first axis and a second axis;
the method comprising:
(a) in no particular order:
(1) establishing a plurality of symbol space stripes along at least a portion of said first axis;
each respective symbol space stripe of said plurality of symbol space stripes accommodating a plurality of symbol space slots along said second axis;
each said slot having a slot width along said first axis;
each said respective stripe having a width substantially equal to at least one said slot width along said first axis;
(2) assigning each said respective flow to a respective data group of at least one data group according said modulation and coding scheme employed by said respective flow;
(b) in no particular order:
(1) evaluating a wastage metric for each respective said data group;
and
(2) evaluating at least one respective quality of service metric of said at least one quality of service metric for each said respective data group;
(c) employing said wastage metric and said quality of service metric to establish an efficiency metric for each said respective data group;
(d) allocating a first said respective data group having a predetermined efficiency metric to a first stripe of said plurality of stripes;
(e) if said first respective data group is fully allocated and more than a predetermined number of said plurality of slots remain in said first stripe, carry out steps (b) through (d) for said first stripe for a next said respective data group;
(f) if said first stripe is filled and more than a predetermined number of said plurality of slots in unfilled stripes of said plurality of stripes are empty slots, carry out steps (b) through (e) for a next respective unfilled stripe of said plurality of stripes;
(g) if said first stripe is filled and less than a predetermined number of said plurality of slots in unfilled stripes of said plurality of stripes are empty slots, carry out step (i);
(h) if no said respective data group remains unallocated to said frame, carry out step (i);
(i) populating respective stripes of said plurality of stripes according to said allocating;
and
(j) ending the method for said frame.

21 more elements

A method for allocating data in a frame for use in a communication system;

said frame being configured for arraying a plurality of flows in rectangular patterns at data loci in said frame;
said data loci being identified by respective coordinate pairs measured along a first axis and a second axis;
the method comprising:
(a) in no particular order:
(1) establishing a plurality of rectangular data spaces in said frame;
each respective data space of said plurality of data spaces presenting a respective stripe extending at least one slot width along said first axis and presenting a respective plurality of slots defining a respective length extending along said second axis;
and
(2) identifying a data group for each respective said flow of said plurality of flows according to a modulation and coding scheme employed by each said respective flow;
(b) in no particular order:
(1) evaluating a wastage metric for each respective said data group;
(2) evaluating at least one respective quality of service metric of said at least one quality of service metric for each said respective data group;
(c) employing said wastage metric and said quality of service metric to establish an efficiency metric for each said respective data group;
(d) allocating a first said respective data group having a predetermined efficiency metric to a first data space of said plurality of data spaces;
(e) if said first respective data group is fully allocated and more than a predetermined number of said plurality of slots remain unfilled in said first data space, carry out steps (b) through (d) for said first data space for a next said respective data group;
(f) if said first data space is filled and more than a predetermined number of said plurality of slots in unfilled data spaces of said plurality of data spaces are empty slots, carry out steps (b) through (e) for a next respective unfilled data space of said plurality of data spaces;
(g) if said first data space is filled and less than a predetermined number of said plurality of slots in unfilled data space of said plurality of data space are empty slots, carry out step (i);
(h if no said respective data group remains unallocated to said frame, carry out step (i);
(i) populating respective stripes of said plurality of stripes according to said allocating;
and
(j) ending the method for said frame.

17 more elements

Dependencies are inferred from the claim text.

Facts

Application: 11/395,342Filed 31 Mar 2006
Published: US 2007/0230326 A14 Oct 2007
Granted: 16 Jun 2009
Term ends: Not estimatedThe source records don’t support an estimate.

Classification10 codes

H04L 5/0046
Allocation of payload; Allocation of data channels, e.g. PDSCH or PUSCH: determination of the number of bits transmitted on different sub-channels
H04L 5/0058
Arrangements for allocating sub-channels of the transmission path: allocation criteria
H04L 5/0007
Time-frequency: the frequencies being orthogonal, e.g. OFDM or DMT
H04L 5/0037
Arrangements for allocating sub-channels of the transmission path: inter-user or inter-terminal allocation