Particular embodiments in accordance with the invention will now be described, by way of example only, and with reference to the accompanying drawings:
Embodiments of this invention apply to all FDM based transmissions which utilize the concept of tones or sub-carriers. The following terminology definitions will be used throughout this description. A sub-channel is defined as any collection of one or more sub-carriers (or tones). In this document, the term “tones” and “sub-carriers” will be used interchangeably. An equi-spaced sub-channel “k” is a sub-channel “k” whose consecutive sub-carriers have a fixed spacing; this fixed sub-carrier spacing will henceforth be denoted as s[k]. “Spacing” between sub-carriers equals the difference between their indexes; for example, spacing between sub-carrier 4 and sub-carrier 1 is 3 (not 2).
Mapping unit 310 produces localized and distributed transmissions in the frequency domain. Control module 311 is responsive to scheduling commands received on the downlink from the serving NodeB and configures mapping unit 310 in response to the received commands. More specifically, the scheduling operation refers to localized signal transmission in contiguous parts of bandwidth (BW), referred to as resource blocks (RBs). In the some embodiments, the RBs assigned to a UE are consecutive, but in general they may be anywhere in the overall scheduling BW. The scheduling BW during a given time period is typically only a part of the total operating BW.
Typically, different data streams will be transmitted on different sub-channels, be it in the uplink or in the downlink of a wireless or wire-line communication system. Due to a number of different reasons, it may be desirable to define sub-channels with following two restrictions: 1) Sub-carriers of each sub-channel must be equi-spaced. That is, for each sub-channel “k”, the distance between consecutive sub-carriers is maintained at a fixed level s[k]. Clearly, different sub-channels can have different sub-carrier spacing s[k]; 2) Sub-channels must be non-overlapping.
Restriction 2 is typically imposed because of orthogonality requirements for different data streams. Restriction 1 may be imposed for simplicity of sub-channel definition. For example, a sub-channel can be defined and signaled (for instance in downlink) by defining the first used sub-carrier, sub-carrier spacing, and the number of used sub-carriers. Alternatively, Restriction 2 may be simply required due to alternate physical layer considerations. For example, in SC-OFDM(A) transmission, the set of used sub-carriers simply has to be equi-spaced. An exemplary diagram for SC-OFDM(A) transmission is given in
Clearly, when each of the sub-channels uses the same common tone spacing, then the problem of sub-channel specification is trivial. For example,
Embodiments of this invention define sub-channels which have different sub-carrier spacing, while simultaneously satisfying Restriction 1 and Restriction 2 from the above. For instance, sub-channel “k” must have a sub-carrier spacing of s[k]. Such a scenario can often arise because different sub-channels can carry different data streams, which have different data rates and some sub-channels may require more bandwidth. Such a scenario can also arise in cases where different data streams, for example, from different mobiles, are to use different densities of the reference signal due to different delay spreads.
In order to multiplex without overlapping two different sub-channels, each of which is equi-spaced, the sub-carrier spacing of one sub-channel must be an integral multiple of the sub-carrier spacing of another sub-channel. For example, it is impossible to multiplex spacing of s[1]=2 and s[2]=3, while it is feasible to multiplex spacing of s[1]=2 and s[2]=4. Thus, in order to define, or select, a valid set of sub-channels, it is useful to define a set of possible tone spacing's.
Definition: Let {M1, M2, . . . , MN} be any sequence of not necessarily different positive integers. Then, the set of possible tone spacing's is defined as follows
If any two tone spacing's are selected from this set Λ, one spacing will be an integral multiple of another, or alternatively, two spacing's will be the same.
A feasibility condition for multiplexing transmissions with different tone spacing's can be stated as follows. Without loss of generality, let s[1]≦s[2]≦ . . . ≦s[K] be the set of desired tone (sub-carrier) spacing's, where k-th spacing s[k] is to be applied to the k-th sub-channel. Then, the non-overlapping solution for the K sub-channels exists if and only if s[k] belongs to some set Λ, for some values of M1,M2, . . . , MN, and for every k from {1, 2, . . . , K}, and simultaneously
This mathematical fact (feasibility condition) can be proven using principles of discrete math; furthermore, this feasibility condition is assumed to be satisfied (possibly validated) before proceeding with all subsequently described designs. Thus, this design mandates the set of “possible tone spacing's” to be A, with the structure as defined above. Given this particular set Λ, it can be noted that for any pair of tone spacing's, one spacing is an integral multiple of another. Furthermore, the collection s[1], s[2], . . . , s[K] is the collection of “used tone spacing's,” where each s[k] belongs to the set Λ of “possible tone spacing's.” When and only when the strict equality holds in the above relation, then all sub-carriers are fully utilized. One example where four sub-channels are simultaneously defined and multiplexed is given in
In order to provide a design for multiplexing transmissions with possibly different tone spacing's, the concept of a “resource tree” is useful. The root vertex of the resource tree will be labeled as v[0, 1] and the root vertex will have M1 children, which descend from the root vertex. Children of the root vertex will be labeled as v[0, M1], v[1, M1], . . . , v[M1−1, M1]. Each of these children (of the root vertex) will have M2 children of their own, each of which will have M3 children of their own, etc until the last sub-level MN. In general, a resource tree is defined as follows:
Definition: The resource tree is defined recursively, starting from the root vertex v[0, 1], which has no parent node. The root vertex v[0, 1] has M1 children: v[0, M1], v[1, M1], . . . , v[M1−1, M1]. A recursive relationship for generating the remaining vertices of the resource tree is: any vertex v[m, M1M2 . . . Mn] will have Mn+1 children v[m+qM1M2 . . . Mn, M1M2 . . . MnMn+1], where q={0, 1, 2, . . . , Mn+1−1}. This recursive relationship, which fully defines the resource tree, is shown in
Vertices of the resource tree are interpreted as follows: each vertex v[m, M1M2 . . . Mn] represents a potential sub-channel which is defined by the tone spacing M1M2 . . . Mn and by the relative offset “m,” with respect to some frame of reference. The offset could be a fixed sub-carrier, for example. Note that each child vertex, which is labeled as v[m+qM1M2. . . Mn, M1M2 . . . MnMn+1], for some q, only occupies a subset of sub-carriers from its parent vertex v[m, M1M2 . . . Mn]. Thus, if a particular vertex v[m, M1M2 . . . Mn] is actually used in the final allocation of sub-channels, then no descendants (children, grand-children, . . . ) of that vertex (vertex v[m, M1M2 . . . Mn]) are allowed to be used, in the final allocation of sub-channels.
A “Valid Specification of Sub-Channels” is any set X of vertices on the resource tree, so that no vertex from X descends from another vertex from X. Each vertex v[m, M1M2 . . . Mn] from X, represents a sub-channel which uses sub-carrier spacing M1M2 . . . Mn with a relative offset “m.”
Any Valid Specification of Sub-Channels X solves the problem of multiplexing different UEs with different tone spacing's. Thus, when each sub-channel from X is allocated to a different UE, then two desired goals are satisfied: first, each UE transmitter uses equi-spaced tones, and second, tones used by different UEs are non-overlapping. An example of Valid Specification of Sub-Channels (for M1=3, M2=2, M3=2) is given in
Thus, specifying particular sub-channel, with equi-spaced sub-carriers, amounts to specifying a vertex from the resource tree. A valid specification of sub-channels is nothing more than a set of vertices, with the above stated properties. A greedy algorithm which is guaranteed to converge for a valid specification of sub-channels starts from s[1]≦s[2]≦ . . . ≦s[K], can be assumed without loss of generality with the appropriate ordering permutation. Table 1 presents an example of pseudo—code for a greedy algorithm.
During each pass (value of “k”), the above greedy algorithm for selecting a valid specification of sub-channels involves a selection, which is left up to implementer, for finding an available vertex v[m, s[k]], from the list of available vertices. This algorithm is just a mere example for finding a valid specification of sub-channels, and other algorithms are clearly possible. Thus, embodiments of this invention are not limited to a particular valid specification of sub-channels but instead encompass a wide variety of valid specifications.
Using basic combinatorial principles, it can be shown that the number of different available choices for a valid specification of sub-channels is given as follows
First term in above product is s[1], second term is s[2]-s[2]/s[1], third term is s[3]-s[3]/s[1]-s[3]/s[2] etc. This formula is one generalization of the factorial formula, because if all s[k] are equal, which is the case in the trivial specification of sub-channels, then the number of different available choices for the Valid Specification of Sub-Channels becomes factorial(s[k]). Still, above formula for L is much more general. The set of possible choices for valid specification of channels can be used to define frequency hopping solutions, as is described next.
Frequency hopping is typically desired in frequency division multiplex-based systems because it creates a number of beneficial effects, such as out-of-cell interference averaging. When frequency hopping is applied, the final choice for X changes over time. For example, hopping could be performed for each symbol, for each sub-frame, or for any other time unit. Thus, frequency hopping patterns for each sub-channel have to be designed jointly, and, at any given time, the used X must be a valid specification of sub-channels as defined above. Here, it is noted that for any desired set of s[1]≦s[2]≦ . . . ≦s[K], there are a total of L possibilities for the valid specification of sub-channels, so the maximum frequency hopping period is L. Nevertheless, other smaller periods are not precluded. Besides frequency hopping, other interference management strategies can also be combined with the above described allocation, such as for example, fractional frequency reuse.
In case of virtual multiple-input, multiple-output MIMO data channel transmissions, more than one UE can use any particular sub-channel v[m, M1M2 . . . Mn]. Thus, the case of “virtual MIMO” doesn't affect the Valid Specification of Sub-Channels, and the proposed sub-channel design can still be readily applied, even if a particular sub-channel is used by more than one mobile.
In many cases, it is not desired that one equi-spaced sub-channel spans across the whole bandwidth, but rather, only a portion of the bandwidth. In such cases, there are several design options, as follows.
Option1: As illustrated in
Option2: As illustrated in
Option3: A hybrid design of Option1 and Option2 is also possible.
Application 1: Multiplexing UEs with Different Bandwidth Requirements: One clear application of the described methodology is for the scenario where a number of different mobiles transmit data in the uplink, each with an equi-spaced set of sub-carriers, but with different tone spacing's. Such is the scenario where some mobiles are given more bandwidth than the other, and the above described design for a valid specification of sub-channels directly applies to this scenario.
Application2: Adapting Spacing of an FDM Reference Signal to Mobile's Delay Spreads: In this application, the reference (pilot) signal for each mobile is designed in accordance to its (the mobile's) delay spread. Timing uncertainty is also included in the delay spread. Thus, the reference signal from different mobiles is FDM multiplexed with different s[k], which are adjusted in accordance to each user device's delay spread. An example of such a design proceeds as follows. Based on the sampling theorem, if time duration of the reference signal is E (common for all mobiles), and the delay spread of the mobile k is F[k] (assume that F[K]≧ . . . ≧F[2]≧F[1]), then sub-carrier spacing for this mobile should not exceed E/F[k]. This means that s[k]≦E/F[k]. Thus, s[k] is selected to be the largest element of A which satisfies the sampling condition s[k]≦E/F[k]. This is performed for each s[k] individually, and the reference signal design proceeds using a valid specification of sub-channels as previously described. Naturally, this design requires delay spreads of mobiles to be measured and may require additional dedicated signaling. This design can be applied for both uplink and the downlink reference signal design.
A set of possible tone spacing's is defined 902 that is a sequence
where {M1, M2, . . . , MN} is a sequence of not necessarily different positive integers.
In certain embodiments, a delay spread of transmissions received at the base station from the user device is estimated. The set of possible tone spacing's for the user device reference signal is then limited such that a maximum tone spacing is less than or equal to a time duration of a reference signal from the user device divided by the estimated delay spread of transmissions received at the base station from the user device.
A resource tree is formed 904 that has a root vertex with N sub-levels of vertices, wherein each vertex represents a potential sub-channel which is defined by the Mn tone spacing's and by a relative offset “m,” with respect to a frame of reference, such that any vertex v[m, M1M2 . . . Mn] will have Mn+1 children v[m+qM1M2 . . . Mn, M1M2 . . . MnMn+1], where q={0, 1, 2, . . . , Mn+1−1}. The resource tree represents a mapping of all of the possible sub-channel spacing's and each vertex represents one particular sub-channel spacing.
A first valid set of sub-channels {1, 2, . . . , K} is selected 906 such that each of them can be mapped onto a vertex of the resource tree such that no selected sub-channel descends from another selected sub-channel. The selection meets the criteria for a valid set of sub-channels selected from the set of possible tone spacing's such that
Since this valid set of sub-channels is intended for non-equal spacing's, at least two s[k] will have different integer values
If frequency hopping is not being done 908, then transmission proceeds 910 using this set of valid sub-channels.
If frequency hopping is to be performed 908, then one or more additional sets of valid sub-channels are selected 912 using the same resource tree and selecting sub-channels each of which can be mapped onto a vertex of the resource tree such that no selected sub-channel descends from another previously selected sub-channel. Transmission then proceeds 914 by hopping across the multiple sets of valid sub-channels.
Referring again to
Analog baseband (ABB) unit 1004 performs processing on audio data received from stereo audio codec (coder/decoder) 1009. Audio codec 1009 receives an audio stream from FM Radio tuner 1008 and sends an audio stream to stereo headset 1016 and/or stereo speakers 1018. In other embodiments, there may be other sources of an audio stream, such a compact disc (CD) player, a solid state memory module, etc. ABB 1004 receives a voice data stream from handset microphone 1013a and sends a voice data stream to handset mono speaker 1013b. ABB 1004 also receives a voice data stream from microphone 1014a and sends a voice data stream to mono headset 1014b. Usually, ABB and DBB are separate ICs. In most embodiments, ABB does not embed a programmable processor core, but performs processing based on configuration of audio paths, filters, gains, etc being setup by software running on the DBB. In an alternate embodiment, ABB processing is performed on the same OMAP processor that performs DBB processing. In another embodiment, a separate DSP or other type of processor performs ABB processing.
RF transceiver 1006 includes a receiver for receiving a stream of coded data frames from a cellular base station via antenna 1007 and a transmitter for transmitting a stream of coded data frames to the cellular base station via antenna 1007. A reference signal is transmitted to nearby base stations and configuration commands are received from the serving base station. Among the configuration commands will be a command to use a particular sub-channel for transmission that has been selected from a valid set of sub-channels by the serving NodeB. The NodeB defines a valid set of sub-channels as described above. Transmission of the scheduled resource blocks are performed by the transceiver using the sub-channel designated by the serving NodeB. Frequency hopping may be implied be using two or more sub-channels as commanded by the serving NodeB. In this embodiment, a single transceiver supports SC-FDMA operation but other embodiments may use multiple transceivers for different transmission standards. Other embodiments may have transceivers for a later developed transmission standard with appropriate configuration. RF transceiver 1006 is connected to DBB 1002 which provides processing of the frames of encoded data being received and transmitted by cell phone 1000.
The basic SC-FDMA DSP radio includes DFT, subcarrier mapping, and IFFT to form a data stream for transmission and DFT, subcarrier de-mapping and IFFT to recover a data stream from a received signal. DFT, IFFT and subcarrier mapping/de-mapping may be performed by instructions stored in memory 1012 and executed by DBB 1002 in response to signals received by transceiver 1006. The sub-carrier(s) that is(are) used for transmission are selected from a valid set of sub-carriers that is defined as described above.
DBB unit 1002 may send or receive data to various devices connected to USB (universal serial bus) port 1026. DBB 1002 is connected to SIM (subscriber identity module) card 1010 and stores and retrieves information used for making calls via the cellular system. DBB 1002 is also connected to memory 1012 that augments the onboard memory and is used for various processing needs. DBB 1002 is connected to Bluetooth baseband unit 1030 for wireless connection to a microphone 1032a and headset 1032b for sending and receiving voice data.
DBB 1002 is also connected to display 1020 and sends information to it for interaction with a user of cell phone 1000 during a call process. Display 1020 may also display pictures received from the cellular network, from a local camera 1026, or from other sources such as USB 1026.
DBB 1002 may also send a video stream to display 1020 that is received from various sources such as the cellular network via RF transceiver 1006 or camera 1026. DBB 1002 may also send a video stream to an external video display unit via encoder 1022 over composite output terminal 1024. Encoder 1022 provides encoding according to PAL/SECAM/NTSC video standards.
In another embodiment, a resource tree as described above is stored in the embedded memory of DBB 1002. During operation, NodeB sends a command to the UE specifying a particular vertex. DBB 1002 then examines the stored resource tree and selects a sub-channel to use for transmission that corresponds to the specified vertex.
As used herein, the terms “applied,” “connected,” and “connection” mean electrically connected, including where additional elements may be in the electrical connection path. “Associated” means a controlling relationship, such as a memory resource that is controlled by an associated port. The terms assert, assertion, de-assert, de-assertion, negate and negation are used to avoid confusion when dealing with a mixture of active high and active low signals. Assert and assertion are used to indicate that a signal is rendered active, or logically true. De-assert, de-assertion, negate, and negation are used to indicate that a signal is rendered inactive, or logically false.
While the invention has been described with reference to illustrative embodiments, this description is not intended to be construed in a limiting sense. Various other embodiments of the invention will be apparent to persons skilled in the art upon reference to this description. This invention applies to all scheduled communication systems which perform channel sounding across multiple resource blocks. This invention applies in uplink and downlink.
Embodiments of this invention apply to any flavor of frequency division multiplex based transmission which is used to multiplex transmissions in an equi-spaced manner. Thus, the concept of valid specification of sub-channels can easily be applied to: OFDMA, OFDM, DFT-spread OFDM, DFT-spread OFDMA, SC-OFDM, SC-OFDMA, MC-CDMA, and all other FDM-based transmission strategies.
A Node B is generally a fixed station and may also be called a base transceiver system (BTS), an access point, or some other terminology. A UE, also commonly referred to as terminal or mobile station, may be fixed or mobile and may be a wireless device, a cellular phone, a personal digital assistant (PDA), a wireless modem card, and so on.
It is therefore contemplated that the appended claims will cover any such modifications of the embodiments as fall within the true scope and spirit of the invention.
This application for Patent claims priority to U.S. Provisional Application No. 60/824,366 entitled “Specification of Sub-Channels for FDM Based Transmission Including OFDMA and SC-OFDMA” filed Sep. 1, 2006, incorporated by reference herein.
Number | Date | Country | |
---|---|---|---|
60824366 | Sep 2006 | US |