Patent Grant
7903604
1. Field
This invention relates generally to a wireless communication system, and in particular to a wireless broadcast communication system.
2. Background
Wireless communication networks typically have a plurality of servicing base stations which receive and transmit signals to users' devices within the service area of the respective base stations. Communication between a user and their respective base station is maintained as a user moves about the network service area by handing off the user from one base station to another.
Many new services are being offered to customers of wireless communication carriers. One such service is providing customers with multimedia content via the wireless communication network. For example, it is desired to provide audio/video content to customers as they move about the network.
Providing multimedia content via wireless communication networks presents several challenges. For example, transmitting multimedia content typically consumes large amounts of a communication system's bandwidth. Limitations in the amount of bandwidth available in a communication system may limit the amount and variety of content that can be provided, or transmitted, by a communication system. Bandwidth constraints can also be compounded by the addition of overhead messages that may be included in signals transmitted by the communication system. For example, overhead messages may be added to a transmitted signal to provide error correction for the signal. Bandwidth constraints may limit the quality of the transmitted content due to insufficient bandwidth to support robust error correction schemes. The effect of bandwidth limitations on the communication system, such as limiting the variety and quality of the content available, may lead to dissatisfaction to the users.
Therefore, there is a need for improved systems, apparatus, and techniques for improving bandwidth utilization in communication systems that provide content, such as multimedia content, to users of the wireless communication network.
The present invention includes methods, apparatuses, and systems as described in the written description and claims. In one embodiment, a method of broadcasting content data in a macro-diversity region of a data frame is provided. This method comprises receiving a stream of transport packets, selecting at least one burst size, from amongst a set of a plurality of predetermined burst sizes, allocating one or more data bursts with the selected burst size to the macro-diversity region of the data frame, each data burst comprising at least a portion of the received transport packets and wherein the at least one burst size is selected so as to minimize a number of data bursts allocated to the macro-diversity region, and communicating information regarding the allocation of data bursts to the macro-diversity region for broadcasting a data frame comprising the macro-diversity region from at least a first transmitter.
In another embodiment, a method of generating a macro-diversity region in a data frame is provided. This method comprises identifying a plurality of sub-channels and a plurality of symbol periods, wherein a symbol period comprises a plurality of symbols, and wherein each symbol during an individual symbol period is associated with a different one of the plurality of sub-channels; generating a map that includes information that describes data bursts and a size of a map in a subsequent macro-diversity region, wherein the map information is included in at least a first symbol during a first symbol period and wherein a data burst is included in at least a second symbol during the first symbol period.
In yet another embodiment, there is provided a method of broadcasting content data in a macro-diversity region of a data frame. This method comprises encapsulating a plurality of transport packets, each transport packet comprising content data; selecting at least one burst size, from amongst a set of a plurality of predetermined burst sizes, and allocating one or more data bursts with the selected burst size to the macro-diversity region of the data frame, each data burst comprising at least a portion of the encapsulated transport packets and wherein the at least one burst size is selected so as to minimize the number of data bursts allocated to the macro-diversity region; and broadcasting from each of at least a first and a second transmitter a signal including the data frame in which the at least one data burst was allocated, such that the signals broadcasted from the first and second transmitter are synchronized.
In yet another embodiment, there is provided a scheduler comprising means for receiving a stream of transport packets; means for selecting at least one burst size, from amongst a set of a plurality of predetermined burst sizes; means for allocating one or more data bursts with the selected burst size to the macro-diversity region of the data frame, each data burst comprising at least a portion of the received transport packets and wherein the at least one burst size is selected so as to minimize a number of data bursts allocated to the macro-diversity region; and means for communicating information regarding the allocation of data bursts to the macro-diversity region for broadcasting a data frame comprising the macro-diversity region from at least a first transmitter.
In yet another embodiment, there is provided a scheduler comprising an input that receives a plurality of data packets; a processor that selects a burst size from among a set of a plurality of predetermined burst sizes, the selected burst size being the largest burst size that fits within a non-allocated portion of a macro-diversity region of a data frame, allocates the selected burst size to the macro-diversity region of the data frame, updates a size of the non-allocated portion of the macro-diversity region based on the allocated burst, and repeats selecting, allocating, and updating until none of the predetermined burst sizes will fit in the non-allocated portion of the macro-diversity region; and an output configured to communicate the allocation of data bursts.
Other features and advantages of the present invention should be apparent after reviewing the following detailed description and accompanying drawings which illustrate, by way of example, aspects of the invention.
These and other aspects, advantages and details of the present invention, both as to its structure and operation, may be gleaned in part by a study of the accompanying exemplary drawings, in which like reference numerals refer to like parts. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the invention.
Certain embodiments as disclosed herein provide for methods and systems for communication over a broadband wireless air interface. After reading this description it will become apparent how to implement the invention in various alternative embodiments and alternative applications. However, although various embodiments of the present invention will be described herein, it is understood that these embodiments are presented by way of example only, and not limitation. As such, this detailed description of various alternative embodiments should not be construed to limit the scope or breadth of the present invention as set forth in the appended claims.
Methods, apparatuses, and techniques are described for allocating data bursts to a macro-diversity region of a downlink communication signal transmitted from multiple base stations, or base transceiver stations, (BTS), such as, for example, BTSs in a single frequency network (SFN). As is known to those of skill in the art, a SFN refers to a network capable of simultaneously broadcasting the same signal (i.e., the same content) over the same frequency channel from multiple transmitters. Further, as used herein the term “macro-diversity region” refers to a portion of a data frame useable for broadcasting information. Exemplary macro-diversity regions include, for example, a Multicast and Broadcast Services (MBS) region of an Orthogonal Frequency Division Multiple Access (OFDMA) data frame, such as, for example, an OFDMA data frame in accordance with the Worldwide Interoperability for Microwave Access (WiMAX) standards (i.e., the Institute for Electrical and Electronics Engineers (IEEE) 802.16 Working Group on Broadband Wireless Access Standards). A further description of an exemplary macro-diversity region of a data frame is presented below. Further, as used herein the terms macro-diversity region and broadcast region are interchangeable.
In one embodiment, data bursts are allocated to the macro-diversity region to broadcast data using the macro-diversity region of a data frame. As used herein, the term data burst refers to a consecutive group of data bits or data packets. In accordance with one embodiment, data bursts are allocated to the macro-diversity region in a manner that optimizes the throughput and overall coding gain of the data transmitted via the macro-diversity region. For example, because there is overhead associated with each individual data burst, decreasing the number of data bursts may decrease the total amount of overhead associated with the macro-diversity region. Decreasing the required overhead, accordingly increases the amount of data that may be transmitted by the data frame and thus the overall throughput (i.e., transmitted data) may be increased. Thus, in accordance with one embodiment, larger data bursts are typically preferred over smaller bursts in allocating data bursts to a macro-diversity region of a data frame. A further description of exemplary methods and systems for allocating data bursts to a data frame is provided in more detail below.
In one embodiment, in allocating data bursts to the macro-diversity region, the size for each data burst may be selected from a set of predetermined data burst sizes. These predetermined data burst sizes may be selected, for example, based in part on their coding gain performance. For example, a data burst size of 4800 bits may have a desired, or optimal, coding gain and be the largest of the predetermined burst sizes. Therefore, in such an embodiment, data bursts may be allocated to the macro-diversity region in a manner such that as many data bursts with a size of 4800 bits are allocated to the macro-diversity region as will fit within the macro-diversity region. When the remaining portion of the macro-diversity region is not large enough to fit any additional 4800 bit data bursts, then a smaller data burst size is selected from the set of predetermined burst sizes and as many of data bursts at this new selected burst size are allocated to the macro-diversity region as will fit. This process may then repeat until the remaining non-allocated portion of the macro-diversity region is smaller than the smallest predetermined burst size (e.g., 144 bits), after which this remaining portion may be left empty, nulls may be allocated to it, or smaller sized data bursts may be allocated to it as will be described in further detail below.
In one embodiment, the predetermined burst sizes include a 4800 bit burst size, a 3840 bit burst size, a 2800 bit burst size, a 1920 bit burst size, a 960 bit burst size, a 480 bit burst size, a 384 bit burst size, a 288 bit burst size, a 192 bit burst size, and a 144 bit burst size. In this embodiment, the largest burst size, 4800 bit, is first selected and 4800 bit data bursts are allocated to the macro-diversity region until the remaining portion of the macro-diversity region is less that 4800 bits. Then, the next largest burst size that will fit in the remaining portion of the macro-diversity region is selected. This process continues until the macro-diversity region is filled or the remaining non-allocated portion of the macro-diversity region is smaller that any of the predetermined burst sizes (i.e., less than 144 bits). It should be noted that these burst sizes are exemplary only, and in other embodiments other data burst sizes may be selected as the predetermined available burst sizes based upon desired characteristics obtained using the data burst size, for example achieving a desired coding gain using the selected data burst size and/or other factors.
As noted, the access service network 105 includes at least one BTS 130. In the example illustrated in
The access service network 105 may also include an encapsulator module 116, a single frequency network (SFN) adapter module 120, and a macro-diversity region control module 150. In one embodiment, the macro-diversity region control module 150 can be a Multicast and Broadcast Services (MBS) controller capable of describing to the BTSs an MBS region for broadcasting data via a WiMAX OFDMA data frame. An exemplary macro-diversity region control module 150 will be described in more detail below.
In one embodiment, the encapsulator module 116 receives Internet Protocol (IP) packets from a network (not shown). The encapsulator module 116 encapsulates the IP packets and outputs transport packets, such as Motion Picture Expert Group 2 (MPEG-2) transport packets. As used herein, a transport packet refers to any type of data packet useable for transporting data, and may use any type of format or protocol in transporting the data. In another embodiment, the encapsulator module 116 can also perform time slicing operation in accordance with the European Telecommunications Standards Institute (ETSI) standard for Digital Video Broadcast-Handheld (DVB-H) along with performing multi-protocol encapsulation with forward error correction (MPE-FEC). Additionally, in an embodiment, the encapsulator module 116 may wrap the packets (e.g., transport packets) with an IP header prior to outputting the wrapped packets.
In one embodiment, the output of the encapsulator module 116 is communicated to the single frequency network (SFN) adapter module 120 that receives the MPEG-2 transport packets and inserts time stamping information. In one embodiment, the packets outputted to the SFN adapter module 120 may be transmitted to the SFN adapter module 120 over a network, such as an Ethernet network. In one embodiment, the time stamping information added to the MPEG-2 transport packets enables individual BTSs 130 to be time synchronized to each other. The SFN adapter module 120 may further combine multiple received MPEG-2 transport packets into a larger frame (referred to herein as a “mega-frame”) for transmission by the BTSs 130. In one embodiment, the output of the SFN module 120 is communicated to the macro-diversity region control module 150 that receives the time stamped MPEG-2 data (e.g., the received MPEG-2 transport packets or mega-frame) and defines a macro-diversity region in a data frame. For example, the macro-diversity region defined can be a Multicast Broadcast Services (MBS) region of an OFDMA data frame, such as, for example, an OFDMA data frame in accordance with the WiMAX standards. A further description of the macro-diversity region is provided below.
Information regarding the macro-diversity region may then be communicated to the BTS's 130. The BTSs 130 may then build data frames including the defined macro-diversity region using the information received from the macro-diversity region control module 150. These data frames may be, for example, OFDMA data frames in accordance with the WiMAX standards. The BTSs 130 may then broadcast the OFDMA data frames including the macro-diversity region. Further, the BTSs 130 may be synchronized so that the macro-diversity regions transmitted by the BTSs 130 are identical and synchronized. It should be noted that although in this embodiment, each BTS 130 simultaneously broadcasts a common macro-diversity region, the remainder of the data frames transmitted by each BTS 130 need not include common data. A further description of an exemplary data frame comprising a macro-diversity region is presented below.
The macro-diversity region control module 150 builds the macro-diversity region and communicates the macro-diversity region to an access service network gateway (ASN-GW) 204. In this embodiment, the macro-diversity region control module 150 delivers the macro-diversity region information to the ASN-GW 204 and the ASN-GW 204 distributes this information to at least one BTS 130. In another embodiment, the macro-diversity region control module 150 builds the macro-diversity region and communicates the macro-diversity region directly to the BTSs 130 (i.e., the macro-diversity region information from the macro-diversity region control module 150 bypasses the ASN Gateway 204 or, for example, no ASN gateway 204 is included in network 200). Additionally, in an embodiment, the macro-diversity control module 150 time stamps the information regarding the macro-diversity region prior to providing the macro-diversity region to the ASN-GW or BTSs 130. Time stamping the information regarding the macro-diversity region may used by the BTSs 130 in synchronizing the transmission of the macro-diversity region by the BTSs 130. For example, in an embodiment each BTS 130 in the network 200 may simultaneously transmit a particular macro-diversity region at a time specified by the time stamp.
As in the embodiment of
In the example of
In the example of
The macro-diversity region 340 includes a macro-diversity region Map 342 that defines the size and content of the macro-diversity region 340. In one embodiment, the macro-diversity map 342 rather than defining the macro-diversity region 340 for the data frame 302 the Map 342 resides in, the macro-diversity region Map 342 defines the size and content of a macro-diversity region 340 in a subsequent data frame 302 of data. For example, the macro-diversity Map 342 may define the size and content of a macro-diversity region in the next data frame in time (i.e., the frame sent immediately after the data frame in which the map 342 resides), or the second data frame 302 following the current frame, or other subsequent data frames of data.
The macro-diversity region control module 150 also includes a macro-diversity scheduler 406. The macro-diversity scheduler 406 selects a burst size from among a set of a plurality of predetermined burst sizes. In one embodiment, the selected burst size is the largest burst size that fits within the non-allocated portion of a macro-diversity region of a data frame. The scheduler 406 populates the selected burst size with at least a portion of the received data from the memory module 404 and allocates the populated selected burst to the macro-diversity region. The scheduler 406 then updates the size of the non-allocated portion of the macro-diversity region based on the allocated burst. The macro-diversity scheduler 406 repeats selecting, populating, allocating, and updating until none of the predetermined burst sizes will fit in the non-allocated portion of the macro-diversity region. The macro-diversity scheduler 406 communicates the populated bursts to an output 408 that communicates the macro-diversity region directly to at least one base station 130. The output 408 may be, for example, an interface implemented in software, hardware, or any combination thereof. Further, output 408 may be capable of converting the information regarding how to build the macro-diversity region to a protocol prior to communicating the macro-diversity region information. In another embodiment, the macro-diversity scheduler 406 communicates the macro-diversity region information via output 408 to an ASN-GW 204 and the ASN-GW 204 distributes this information to at least one BTS 130.
The macro-diversity scheduler 406 can be implemented with a general purpose processor, a digital signal processor (“DSP”), an application specific integrated circuit (“ASIC”), a field programmable gate array (“FPGA”) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general-purpose processor can be a microprocessor, but in the alternative, the processor can be any processor, controller, microcontroller, or state machine. A processor can also be implemented as a combination of computing devices, for example, a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
Larger burst sizes generally provide higher error protection. As noted above, in an embodiment, macro-diversity region Map 342 describes the macro-diversity region 340 including, for example, the size and location of the data burst allocations 506 within the macro-diversity region 340. Accordingly, in an embodiment, the size of the macro-diversity region Map 342 may depend, in part, on the number of data bursts 506 allocated to the macro-diversity region 340 of the data frame 302. Thus, using larger data burst sizes may also reduce the size of the macro-diversity region Map 342 and increase data throughput.
In an embodiment, a constant amount of overhead is introduced for each data burst 506 allocated to the macro-diversity region 340. For example, in one embodiment there are 16 error detection bits, such as Cyclic Redundancy Check (CRC) bits, of overhead and one Information Element (IE) that is 56 bits added to the macro-diversity Map 342 for each data burst 506 allocated to the macro-diversity region 340. Thus, in an embodiment, the macro-diversity region control module 150 can select larger and accordingly less data bursts 506 for the macro-diversity region to minimize the amount overhead and as such increase data throughput. In one example, the predetermined set of data burst 506 sizes are 144, 192, 288, 384, 480, 960, 1920, 2880, 3840, and 4800 bits. The data bursts 506 can be selected from the predetermined set of sizes to fill, or nearly fill, a given macro-diversity region 340. It should be noted that this is but one example, and in other embodiments the amount of overhead introduced for each data burst may be variable.
As noted, larger HARQ burst sizes generally provide improved error protection. In general, it is noted that: (1) for large data bursts 506, i.e., data burst greater than or equal to 960 bits, the coding performance is very good and only increases slightly with increases in the data burst 506 size; and (2) for small data bursts 506, i.e., data burst less than 960 bits, the coding performance increases rapidly with increases in the burst size. While it is generally preferred to use larger data burst sizes 506, this needs to be balanced against coding performance fluctuations caused by using different data burst 506 sizes.
In accordance with one embodiment, data bursts 506 are allocated to the macro-diversity region 340 by the macro-diversity region control module 150 by selecting the largest size data burst from a set of predetermined data burst sizes and determining how many, if any, of the selected size data burst will fit in the macro-diversity region 340. A Map 342 of the macro-diversity region 340 is updated and the data bursts are allocated to the macro-diversity region 340. Then, the next largest sized data burst is selected and the process continued until the macro-diversity region 340 is full, or the non-allocated portion of the macro-diversity region is smaller than the smallest predetermined data burst size. Any remaining non-allocated region of the macro-diversity region can be left empty, or filled with null data, or other predetermined data.
In an embodiment, macro-diversity region 340 may be an MBS region in accordance with WiMAX standards included in an OFDMA data frame. Typically, in an MBS region 340 using HARQ data bursts, the sub-channels 304 located directly below the Map 342 are required to be left empty or unused. As illustrated, however, in
An example technique of filling a macro-diversity region 340 is shown in
In the example of
The macro-diversity region control module 150 then selects the next largest data burst size from the set of predetermined data burst sizes. The macro-diversity region control module 150 then determines the number, if any, of the selected data burst size that will fit within the non-allocated region 612 of the macro-diversity region 340. If the selected data burst size will not fit within the macro-diversity region then the next largest size data burst size from the set of predetermined data burst sizes is selected.
In the example of
If the updated Map 615, the previously allocated data bursts 606, 608, and 610, and selected data burst 614 do fit in the macro-diversity region 340, the example illustrated in
The macro-diversity region control module 150 then continues the technique by selecting the next largest data burst size from the set of predetermined data burst sizes. The macro-diversity region control module 150 then determines the number, if any, of the selected data burst size will fit within the non-allocated region 616 of the macro-diversity region 340. If the selected data burst size will not fit within the macro-diversity region then the next largest size data burst from the set of predetermined data burst sizes is selected and repeats the process of determining if the data burst size fits in the non-allocated region.
In the example of
If the updated Map 622, the previously allocated data bursts 606, 608, 610, and 614, and selected data bursts 618 and 620 do fit in the macro-diversity region 340, the example illustrated in
The above process continues until none of the predetermined data burst sizes will fit within the non-allocated region of the macro-diversity region 340. For example, in
As noted above, in an embodiment, the Map 622 may not describe the data burst allocations to the macro-diversity region 340 in which the Map 622 is located, but instead describe a subsequent macro-diversity region 340, such as for example, the next macro-diversity region in time, the second macro-diversity region 340 later in time, or some other subsequent macro-diversity region 340. In an embodiment, this Map 622, in addition to describing the allocations to the subsequent macro-diversity region 340, may also include information describing the size of the Map that will be included in the subsequent macro-diversity region 340.
Flow continues to block 710 where the macro-diversity region control module determines if any data burst(s) of the selected size will fit in the macro-diversity region. If no data burst of the selected size fit then flow continues to block 712 where the next largest data burst size is selected. If, in block 710 it is determined that at least one data burst of the selected size fits, flow continues to block 714. In block 714 the macro-diversity region control module determines an amount of data needed to be added to a Map of the macro-diversity region to identify the additional data bursts that are added to the macro-diversity region. Flow continues to block 716 where the macro-diversity control module determines if the remaining non-allocated portion of the macro-diversity region is large enough for both the additional data bursts and the additional information that needs to be added to update the Map. If the macro-diversity region is not large enough for both the additional data bursts and the additional information that needs to be added to update the Map flow continues to block 718. In block 718 the number of data bursts is reduced by one. Flow continues to block 720 and the macro-diversity region control module determines if the number of additional data burst is zero. If the umber of data burst is not zero flow continues to block 716 and the macro-diversity region control module determines if the updated Map and number of data burst fit in the non-allocated portion of the macro-diversity region. If in block 720 it is determined that the number of additional data bursts is zero, flow continues to block 712 and the next largest data burst is selected.
Returning to block 716, if the data bursts and information to update the Map fit in the non-allocated portion of the macro-diversity region, flow continues to block 722. In block 722 the macro-diversity region control module allocates the updated Map and the data burst along with any previously allocated data bursts to the macro-diversity region. Flow then continues to block 724 where it is determined if the macro-diversity region is full, or if all of the data burst sizes in the set of predetermined data burst sizes have been selected. If the macro-diversity region is not full and not all of the predetermined data burst sizes have been selected, flow continues to block 712 where the next data burst size is selected. Returning to block 724, if the macro-diversity region is full, or all of the data burst sizes have been selected flow continues to block 726 and flow stops. Using this technique, the structure of the macro-diversity region of the downlink frame, as well as the effective number of bits it will carry, can be determined.
It should be noted that the technique illustrated in
As noted above, in an embodiment, the Map included in a macro-diversity region does not describe the data burst allocations to the macro-diversity region in which the Map is located, but instead describes a subsequent macro-diversity region, such as for example, the next macro-diversity region in time, the second macro-diversity region later in time, or some other subsequent macro-diversity region. For example, the techniques may perform a collective check of multiple macro-diversity regions. For example, when data is allocated to a current macro-diversity region, the Map that is updated or adjusted can be in the macro-diversity region of a previous data frame. Thus, as data burst are allocated to the current macro-diversity region and the Map is updated, the technique can be modified to check that the updated Map and data burst allocated in the previous macro-diversity region that carries the update Map still fit. If the updated Map and data burst allocation in the previous macro-diversity region no longer fit then, using the techniques described, the data allocation in the previous macro-diversity region can be adjusted. In one embodiment, if the data allocation and updated Map no longer fit in the previous macro-diversity region then data that was allocated to one of the data burst in the previous macro-diversity region is re-allocated to a later macro-diversity region. In another embodiment, if the data allocation and updated Map no longer fit in the previous macro-diversity region at least a portion of the data that was allocated to one of the data burst in the previous macro-diversity region is eliminated or not transmitted. For example, data included in the smallest data allocation can be eliminated.
Additionally, in yet another embodiment, the size and structure of the macro-diversity regions may remain constant over particular periods of time. For example, it may be known that during particular hours of the day the macro-diversity region will be used to broadcast content data (e.g., television or other audio/visual content) and that the amount of content data transmitted during these hours will fit a particular profile. For example, it may be known that during the hours of 7 am until lam the macro-diversity region will carry only content data of live television broadcasts in order to permit a larger portion of the data frame (e.g., the DL zone 336 and UL region 332 of the data frame 302 of
In such an embodiment, the macro-diversity region sizes during these fixed times may be constant and the maps included in each macro-diversity region may be identical in size and structure. Further, in such, an embodiment, there may be a transition frame used when transitioning from one macro-diversity region size to another. For example, in the example, in which size of the macro-diversity region is constant between the hours of 7 am and 1 am and then changes to a different size that remains constant between the hours of 1 am and 7 am, the system may use a transition frame at the hours of 7 am and 1 am when transitioning between macro-diversity region sizes. The size of the macro-diversity region for this transition frame may be, for example, in between the two sizes. In an embodiment using transition frames, the method discussed above with reference to
In yet another embodiment, transition frames may be used when transitioning from one macro-diversity region size to another and the maps included in the macro-diversity region may be used for mapping a subsequent macro-diversity region. Thus, in such an embodiment, the map appearing in the macro-diversity region of the transition frame may map a macro-diversity region with the new size, while the map that maps the macro-diversity region of the transition frame may be included in a macro-diversity region prior to the transition frame. In such an embodiment, the size of the map to be transmitted in the macro-diversity region of the transition frame may be known as well as the size permitted for the map that maps the transition frame to be included in the prior frame. This information may then be used in allocating data bursts to the macro-diversity region of the transition frame using a method similar to that described above with reference to
Further, in yet another embodiment, the size of the macro-diversity region may be increased by plus or minus (+/−) a predetermined number of symbol periods (e.g., one) during the regular course of transmitting data using the macro-diversity region. For example, referring back to
In accordance with another embodiment, HARQ data bursts 506 are allocated to the macro-diversity region 340 by the macro-diversity region control module 150 by selecting subgroups of data burst sizes from a set of predetermined data burst sizes. For example, the subgroups can be selected based upon the data bursts having similar coding performance. In one embodiment, three subgroups are used, a first subgroup comprising a data burst size of 4800 bits; a second subgroup comprising data burst sizes of 960, 1920, 2880, and 3840 bits; and a third subgroup comprising data burst sizes of 144, 192, 288, 384, 480 bits. In this embodiment, the macro-diversity control module 150 determines a number of data bursts from the first subgroup (4800 bits) that will fit in the macro diversity region 340 and allocates these data bursts to the macro-diversity region 340. The macro-diversity control module 150 then selects the largest data burst size that will fit in the non-allocated region of the macro diversity region 340 from the second subgroup (960, 1920, 2880, and 3840 bits) and allocates a data burst of this selected size to the macro-diversity region 340. Then, the macro-diversity control module 150 selects the largest data burst size from the third subgroup (144, 192, 288, 384, 480 bits) that will fit in the non-allocated region of the macro diversity region 340 and allocates as many data bursts of this selected size to the macro-diversity region 340 as will fit (i.e., one or two data bursts of this selected size).
In block 810 the macro-diversity region control module determines if the data burst(s) and updated Map will fit in the non-allocated macro-diversity region. If it is determined that the updated Map and data burst(s) do fit, flow continues to block 812. In block 812 the macro-diversity region control module allocates the updated Map and the data burst(s) to the macro-diversity region. Flow continues to block 814.
In block 814 the macro-diversity region control module determines if there are any more subgroups. If there are more subgroups flow continues to block 816 and the next subgroup is selected. If there are not any more subgroups flow continues to block 818 and flow stops.
Returning to block 810 if the macro-diversity region control module determines that the data burst(s) and Map do not fit in the macro-diversity region flow continues to block 820 where the number of burst(s) is reduced by one. Flow then continues to block 822 and the macro-diversity region control module determines if the number of data bursts is not zero flow continues to block 808 and the Map is updated. If the number of data bursts is zero flow continues to block 814 and flow continues as described above.
As with the embodiment of
Various implementations of the invention are realized in electronic hardware, computer software, or combinations of these technologies. Some implementations include one or more computer programs executed by one or more computing devices. In general, each computer includes one or more processors, one or more data-storage components (e.g., volatile or non-volatile memory modules and persistent optical and magnetic storage devices, such as hard and floppy disk drives, CD-ROM drives, and magnetic tape drives), one or more input devices (e.g., mice and keyboards), and one or more output devices (e.g., display consoles and printers).
The computer programs include executable code that is usually stored in a persistent storage medium and then copied into memory at run-time. At least one processor executes the code by retrieving program instructions from memory in a prescribed order. When executing the program code, the computer receives data from the input and/or storage devices, performs operations on the data, and then delivers the resulting data to the output and/or storage devices.
Various illustrative implementations of the present invention have been described. However, one of ordinary skill in the art will see that additional implementations are also possible and within the scope of the present invention.
Accordingly, the present invention is not limited to only those implementations described above. Those of skill in the art will appreciate that the various illustrative modules and method steps described in connection with the above described figures and the implementations disclosed herein can often be implemented as electronic hardware, software, firmware or combinations of the foregoing. To clearly illustrate this interchangeability of hardware and software, various illustrative modules and method steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled persons can implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the invention. In addition, the grouping of functions within a module or step is for ease of description. Specific functions can be moved from one module or step to another without departing from the invention.
Moreover, the various illustrative modules and method steps described in connection with the implementations disclosed herein can be implemented or performed with a general purpose processor, a digital signal processor (“DSP”), an application specific integrated circuit (“ASIC”), a field programmable gate array (“FPGA”) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general-purpose processor can be a microprocessor, but in the alternative, the processor can be any processor, controller, microcontroller, or state machine. A processor can also be implemented as a combination of computing devices, for example, a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
Additionally, the steps of a method or algorithm described in connection with the implementations disclosed herein can be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module can reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium including a network storage medium. An exemplary storage medium can be coupled to the processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium can be integral to the processor. The processor and the storage medium can also reside in an ASIC.
The above description of the disclosed implementations is provided to enable any person skilled in the art to make or use the invention. Various modifications to these implementations will be readily apparent to those skilled in the art, and the generic principles described herein can be applied to other implementations without departing from the spirit or scope of the invention. Thus, it is to be understood that the description and drawings presented herein represent example implementations of the invention and are therefore representative of the subject matter which is broadly contemplated by the present invention. It is further understood that the scope of the present invention fully encompasses other implementations and that the scope of the present invention is accordingly limited by nothing other than the appended claims.
This application claims the benefit of U.S. Provisional Patent Applications Ser. No. 60/912,661, filed Apr. 18, 2007, entitled “Base Station Synchronization For a Single Frequency Network”, Ser. No. 60/913,172, filed Apr. 20, 2007, entitled “Wireless Communications System With Broadcasting”, Ser. No. 60/953,452, filed Aug. 1, 2007, entitled “Base Stations Synchronization For a Single Frequency Network”, and Ser. No. 60/971,837 filed Sep. 12, 2007, entitled “Base Station Synchronization For a single Frequency Network” which are hereby incorporated by reference in their entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5452288 | Rahuel et al. | Sep 1995 | A |
| 5544198 | Saalfrank et al. | Aug 1996 | A |
| 5659685 | Williams et al. | Aug 1997 | A |
| 5740534 | Ayerst et al. | Apr 1998 | A |
| 5867791 | Chambert | Feb 1999 | A |
| 5892910 | Safadi | Apr 1999 | A |
| 6009325 | Retzer et al. | Dec 1999 | A |
| 6112100 | Ossoinig et al. | Aug 2000 | A |
| 6172988 | Tiernan et al. | Jan 2001 | B1 |
| 6192038 | Wallerius et al. | Feb 2001 | B1 |
| 6212190 | Mulligan et al. | Apr 2001 | B1 |
| 6502131 | Vaid et al. | Dec 2002 | B1 |
| 6628638 | Sato et al. | Sep 2003 | B1 |
| 6847826 | Wesby et al. | Jan 2005 | B1 |
| 6898640 | Kurita et al. | May 2005 | B1 |
| 7058407 | Chi et al. | Jun 2006 | B2 |
| 7099348 | Warwick et al. | Aug 2006 | B1 |
| 7242960 | Van Rooyen | Jul 2007 | B2 |
| 7283817 | Salo et al. | Oct 2007 | B2 |
| 7324832 | Van Rooyen | Jan 2008 | B2 |
| 7333829 | Malone et al. | Feb 2008 | B2 |
| 7362735 | Mantha | Apr 2008 | B2 |
| 7421244 | Van Rooyen | Sep 2008 | B2 |
| 7450899 | Roberts et al. | Nov 2008 | B2 |
| 20010030956 | Chillariga et al. | Oct 2001 | A1 |
| 20020061012 | Thi et al. | May 2002 | A1 |
| 20020086691 | Kostic et al. | Jul 2002 | A1 |
| 20020138560 | Aaltonen et al. | Sep 2002 | A1 |
| 20030002474 | Alexander et al. | Jan 2003 | A1 |
| 20030072255 | Ma et al. | Apr 2003 | A1 |
| 20030095513 | Woodmansee et al. | May 2003 | A1 |
| 20040017777 | Chaudhuri et al. | Jan 2004 | A1 |
| 20040141502 | Corson et al. | Jul 2004 | A1 |
| 20040153767 | Dolgonos | Aug 2004 | A1 |
| 20050090235 | Vermola et al. | Apr 2005 | A1 |
| 20050117070 | Wu et al. | Jun 2005 | A1 |
| 20050130661 | Aerrabotu et al. | Jun 2005 | A1 |
| 20050286408 | Jin et al. | Dec 2005 | A1 |
| 20060039285 | Chapman et al. | Feb 2006 | A1 |
| 20060079224 | Welnick et al. | Apr 2006 | A1 |
| 20060088023 | Muller | Apr 2006 | A1 |
| 20060128426 | Van Rooyen | Jun 2006 | A1 |
| 20060153147 | Chillariga et al. | Jul 2006 | A1 |
| 20060153232 | Shvodian | Jul 2006 | A1 |
| 20060205406 | Pekonen et al. | Sep 2006 | A1 |
| 20060233359 | Jung et al. | Oct 2006 | A1 |
| 20060246890 | Yasuda et al. | Nov 2006 | A1 |
| 20060262744 | Xu et al. | Nov 2006 | A1 |
| 20060262751 | Vermola et al. | Nov 2006 | A1 |
| 20060262793 | Vare et al. | Nov 2006 | A1 |
| 20060268673 | Roh et al. | Nov 2006 | A1 |
| 20060285508 | Vermola et al. | Dec 2006 | A1 |
| 20070026866 | Krishnamurthi et al. | Feb 2007 | A1 |
| 20070165104 | Khan et al. | Jul 2007 | A1 |
| 20070171910 | Kumar | Jul 2007 | A1 |
| 20070223612 | Simon | Sep 2007 | A1 |
| 20070240188 | Vermola et al. | Oct 2007 | A1 |
| 20070249380 | Stewart et al. | Oct 2007 | A1 |
| 20080037460 | Venkatachalam | Feb 2008 | A1 |
| 20080152018 | Ma et al. | Jun 2008 | A1 |
| 20080170529 | Connors et al. | Jul 2008 | A1 |
| 20080170530 | Connors et al. | Jul 2008 | A1 |
| 20080198785 | Huang | Aug 2008 | A1 |
| 20080205322 | Cai et al. | Aug 2008 | A1 |
| 20090028276 | Van Rooyen | Jan 2009 | A1 |
| 20090252070 | Connors et al. | Oct 2009 | A1 |
| Number | Date | Country |
|---|---|---|
| 1 237 371 | Sep 2002 | EP |
| 1237371 | Sep 2002 | EP |
| 1 594 330 | Nov 2005 | EP |
| 1594330 | Nov 2005 | EP |
| 2006-081171 | Mar 2006 | JP |
| 2006081171 | Mar 2006 | JP |
| 10-2004-0000953 | Jan 2004 | KR |
| 2004-0000953 | Jan 2004 | KR |
| 2005-0017046 | Feb 2005 | KR |
| 20050017046 | Feb 2005 | KR |
| 0150782 | Jul 2001 | WO |
| 0150782 | Jul 2001 | WO |
| 03-030451 | Apr 2003 | WO |
| 03030451 | Apr 2003 | WO |
| 03081938 | Oct 2003 | WO |
| 03081938 | Oct 2003 | WO |
| 2006047941 | May 2006 | WO |
| 2006047941 | May 2006 | WO |
| 2006099322 | Sep 2006 | WO |
| 2006105010 | Oct 2006 | WO |
| 2006138556 | Dec 2006 | WO |
| Number | Date | Country | |
|---|---|---|---|
| 20080259878 A1 | Oct 2008 | US |
| Number | Date | Country | |
|---|---|---|---|
| 60912661 | Apr 2007 | US | |
| 60913172 | Apr 2007 | US | |
| 60953452 | Aug 2007 | US | |
| 60971837 | Sep 2007 | US |
