In modern wireless systems (e.g., LTE, WIMAX, HSPA, UMTS, CDMA, etc) base station (BS) antennas are defined both physically and logically (in LTE they are referred to as antenna ports). Logical antennas are mapped to and implemented via physical antennas (e.g., typically several physical antennas are mapped to one logical antenna). Physical antennas are generally transparent and not visible to mobile stations (MSs), while logical antennas are generally distinguishable to MSs.
When these physical antennas are combined to yield one logical antenna, identical signals corresponding to the logical antenna are transmitted over multiple physical antennas after they are pre-processed through pre-coding matrices. These signals thus transmitted combine over the air to yield one signal transmitted over a logical antenna.
Some of these signals (such as common channels including broadcast channels) need to achieve proper sector-wide (or cell-wide as it is known in the GSM/UMTS context) coverage. Achieving this coverage is often hard especially if the number of physical antennas that make up a logical antenna is small. For example, currently two physical antennas can not provide sector wide coverage for one logical antenna according to existing techniques. Furthermore, if sufficient physical antennas are used to obtain sector-wide coverage, existing techniques produce a combined over-the-air signal that fails to fully utilize the full BS power. Also it is desirable to do this without resorting to calibration capability that is needed to measure and equalize the phase differences across the physical antennas of the logical antenna port since doing so adds cost and complexity to the antenna.
The combining can in general (in most cases, but not all e.g., not with 2 antennas) yield proper sector wide static beams with proper choice of gains and phases. This typically requires correlated antenna configuration, i.e., under most circumstances co-polarized antennas that are spaced fractions of a wavelength, apart.
However, in general such combining often suffers from some problems. For example, such combining requires a calibration capability: measurement of gains and phases across the different transmission paths and compensating for any such differences across the different paths that exist in real physical systems. This calibration capability adds cost, operational complexity and an additional part that can fail. As another example problem, the gains that need to be employed often do not permit utilization of full transmission power of each path.
Another method is to map only one physical antenna (instead of N physical antennas) to one logical antenna port for these sector-wide beams and associated common channels. In this case, instead of utilizing the N-antenna's power for these common channels only the power of the one actual antenna that is used to map to the logical antenna port will be utilized. The disadvantage is that the BS power is significantly under-utilized and wasted for these common channels.
At least one embodiment relates to a method of generating transmission signals.
In one embodiment, the method includes receiving a signal, and generating first and second transmission signals from the received signal. The first signal has a fixed phase, and the second signal has a phase that changes over time. The first and second signals are sent from first and second antennas, respectively.
In one embodiment, the generating includes applying a first gain to the received signal to generate the first signal, and applying a second gain and phase shift to the received signal to generate the second signal. The applied phase shift changes over time.
In one embodiment, the first and second gains are equal.
In another embodiment, the method includes receiving a signal, and phase shifting the signal at a plurality of transformers to produce a plurality of phase shifted signals, each of the plurality of phase shifted signals having a phase that changes over time. Each of the plurality of phase shifted signals are sent from a different antenna.
In one embodiment, the phase shifting produces the phase shifted signals such that at least some of the phase shifted signals have phases that change at different phase change rates. In one embodiment, the phase change rate of each of the plurality of phase shifted signals is an integer multiple of a reference phase change rate. In one embodiment, one of the plurality of phase shifted signals has a phase that changes at the reference phase change rate.
Any of these embodiments may further include setting gains of the plurality of phase shifted signals. In one embodiment, the same gain is set for the plurality of phase shifted signals.
In a further embodiment, the method includes receiving first and second signals, generating first and second transmission signals from the first received signal such that the second transmission signal changes phase at a first rate greater than a rate of the first transmission signal, and generating third and fourth signals from the second received signal such that the fourth transmission signal changes phase at a second rate greater than a rate of the third transmission signal, the second rate being one of opposite and same as the first rate. The first, second, third and fourth transmission signals are sent from first, second, third and fourth antennas, respectively.
At least one embodiment relates to a transmitter.
In one embodiment, the transmitter includes a plurality of transformers. Each transformer receives a same signal, and at least one of the transformers phase shifts the signal to produce a phase shifted signal having a phase that changes over time. The transmitter also includes an antenna corresponding to each of the plurality of transformers. Each antenna sends output produced by the corresponding one of the plurality of transformers.
In one embodiment, the plurality of transformers produce more than one phase shifted signal such that at least some of the phase shifted signals have phases that change at different phase change rates
In one embodiment, the phase change rate of each of the phase shifted signals is an integer multiple of a reference phase change rate.
In one embodiment, one of the phase shifted signals has the reference phase change rate.
In any of the above embodiments, the transformers may apply respective gains to the signal. In one embodiment, the transformers apply a same gain to the signal.
The example embodiments will become more fully understood from the detailed description given herein below and the accompanying drawings, wherein like elements are represented by like reference numerals, which are given by way of illustration only and thus are not limiting of the present invention and wherein:
Various example embodiments will now be described more fully with reference to the accompanying drawings in which some example embodiments are shown.
While example embodiments are capable of various modifications and alternative forms, the embodiments are shown by way of example in the drawings and will be described herein in detail. It should be understood, however, that there is no intent to limit example embodiments to the particular forms disclosed. On the contrary, example embodiments are to cover all modifications, equivalents, and alternatives falling within the scope of this disclosure. Like numbers refer to like elements throughout the description of the figures.
Although the terms first, second, etc. may be used herein to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another. For example, a first element could be termed a second element, and similarly, a second element could be termed a first element, without departing from the scope of this disclosure. As used herein, the term “and/or,” includes any and all combinations of one or more of the associated listed items.
When an element is referred to as being “connected,” or “coupled,” to another element, it can be directly connected or coupled to the other element or intervening elements may be present. By contrast, when an element is referred to as being “directly connected,” or “directly coupled,” to another element, there are no intervening elements present. Other words used to describe the relationship between elements should be interpreted in a like fashion (e.g., “between,” versus “directly between,” “adjacent,” versus “directly adjacent,” etc.).
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting. As used herein, the singular forms “a,” “an,” and “the,” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises,” “comprising,” “includes,” and/or “including,” when used herein, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It should also be noted that in some alternative implementations, the functions/acts noted may occur out of the order noted in the figures. For example, two figures shown in succession may in fact be executed substantially concurrently or may sometimes be executed in the reverse order, depending upon the functionality/acts involved.
Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art to which example embodiments belong. It will be further understood that terms, e.g., those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the relevant art and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.
Portions of example embodiments and corresponding detailed description are presented in terms of algorithms performed by a controller. An algorithm, as the term is used here, and as it is used generally, is conceived to be a self-consistent sequence of steps leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of optical, electrical, or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.
Specific details are provided in the following description to provide a thorough understanding of example embodiments. However, it will be understood by one of ordinary skill in the art that example embodiments may be practiced without these specific details. For example, systems may be shown in block diagrams so as not to obscure the example embodiments in unnecessary detail. In other instances, well-known processes, structures and techniques may be shown without unnecessary detail in order to avoid obscuring example embodiments.
In the following description, illustrative embodiments will be described with reference to acts and symbolic representations of operations (e.g., in the form of flow charts, flow diagrams, data flow diagrams, structure diagrams, block diagrams, etc.) that may be implemented as program modules or functional processes include routines, programs, objects, components, data structures, etc., that perform particular tasks or implement particular abstract data types and may be implemented using existing hardware at existing network elements, existing end-user devices and/or post-processing tools (e.g., mobile devices, laptop computers, desktop computers, etc.). Such existing hardware may include one or more Central Processing Units (CPUs), digital signal processors (DSPs), application-specific-integrated-circuits, field programmable gate arrays (FPGAs) computers or the like.
Unless specifically stated otherwise, or as is apparent from the discussion, terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical, electronic quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.
Although a flow chart may describe the operations as a sequential process, many of the operations may be performed in parallel, concurrently or simultaneously. In addition, the order of the operations may be re-arranged. A process may be terminated when its operations are completed, but may also have additional steps not included in the figure. A process may correspond to a method, function, procedure, subroutine, subprogram, etc. When a process corresponds to a function, its termination may correspond to a return of the function to the calling function or the main function.
Note also that the software implemented aspects of example embodiments are typically encoded on some form of tangible (or recording) storage medium or implemented over some type of transmission medium. As disclosed herein, the term “storage medium” may represent one or more devices for storing data, including read only memory (ROM), random access memory (RAM), magnetic RAM, magnetic disk storage mediums, optical storage mediums, flash memory devices and/or other tangible machine readable mediums for storing information. The term “computer-readable medium” may include, but is not limited to, portable or fixed storage devices, optical storage devices, and various other mediums capable of storing, containing or carrying instruction(s) and/or data.
Furthermore, example embodiments may be implemented by hardware, software, firmware, middleware, microcode, hardware description languages, or any combination thereof. When implemented in software, firmware, middleware or microcode, the program code or code segments to perform the necessary tasks may be stored in a machine or computer readable medium such as a computer readable storage medium. When implemented in software, a processor or processors will perform the necessary tasks.
A code segment may represent a procedure, function, subprogram, program, routine, subroutine, module, software package, class, or any combination of instructions, data structures or program statements. A code segment may be coupled to another code segment or a hardware circuit by passing and/or receiving information, data, arguments, parameters or memory contents. Information, arguments, parameters, data, etc. may be passed, forwarded, or transmitted via any suitable means including memory sharing, message passing, token passing, network transmission, etc.
As used herein, the term “mobile station” may be synonymous to a mobile user, user equipment or UE, mobile terminal, user, subscriber, wireless terminal, terminal, and/or remote station and may describe a remote user of wireless resources in a wireless communication network. Accordingly, a mobile station (MS) may be a wireless phone, wireless equipped laptop, wireless equipped appliance, etc.
The term “base station” may be understood as a one or more cell sites, base stations, nodeBs, enhanced NodeBs (eNodeB), access points, and/or any terminus of radio frequency communication. Although current network architectures may consider a distinction between mobile/user devices and access points/cell sites, the example embodiments described hereafter may also generally be applicable to architectures where that distinction is not so clear, such as ad hoc and/or mesh network architectures, for example.
Communication from the base station to the MS is typically called downlink or forward link communication. Communication from the MS to the base station is typically called uplink or reverse link communication.
PSi=S*Ai*e^(j*ωi*t) (1)
where S is the original signal associated with the antenna port, A is the gain, ω is a phase change rate, and t is time. Stated another way, over the time of transmission, the phase of the phase shifted signal PSi may increase linearly with time. This results in the combined signal across the PSTD processed antennas sweeping across the sector over time.
In one embodiment, the gains may all be set to the same constant, for example set equal to 1 (i.e., Ai=1 for all i). The embodiments are not limited to this restriction. Namely, the transformers 200 may also affect the gain as well as the phase of the signal S, In addition, the signals may be transmitted in one particular embodiment over correlated antenna configurations, e.g., co-polarized antennas that are spaced fractions of wavelength, λ apart. Note that in other environments correlated antenna configurations may be feasible under non-co-polarized antennas or antennas spaced further apart than fractions of wavelength.
Alternatively or additionally, the phase change rates for a number of the antennas 210 may be set such that ωi=i*ωr, where ωr is a reference phase change rate. In one embodiment, ω1=ωr. Please note that this is not a requirement but an implementation simplification. Still further, one of the phase change rates may be set to zero. This may apply, for example, to a two antenna case described in detail below with respect to
The transformers 200 may be implemented in the analog domain using RF circuits where the phase changes uniformly as a function of time as described in the equation above for each antenna. The transformers 200 may instead be implemented in the digital domain using a processor such as a digital signal processor wherein the signal is multiplied with a precoder chosen from a precoder set in accordance to the above equation at applicable time t, stepping through each sequentially in specified intervals in a cyclic manner.
When viewed at a time snapshot, the effect of the PSTD pre-coding technique of the example embodiments is to cause the identical signals coming from different antennas to combine over the air in such a way as to form a directional beam. As time progresses, the directional beam will sweep spatially across the sector. These signals when integrated by MS (which is normally done by an MS for various operations such as channel estimates, channel quality estimates, channel rank, precoder matrix indices for feeding back to the base station, etc.) over several cycles of the highest frequency of PSTD across the antennas (e.g., ωn in the one example) will yield the equivalent beam pattern as that of a single physical antenna, but with the total power equivalent of all the transmit paths put together. Namely, the MS sees a static beam with N times the power of a single transmit branch. Accordingly, the beam being swept across the sector produces a virtual static sector-wide beam as seen by the MS. Furthermore, because of the MS time integration, any phase and amplitude calibration mismatch that exists across the transmit array will be nullified. Thus antenna level calibration is not needed. This method preserves the following benefits: excellent sector wide coverage for each antenna port across the band (identical to a single antenna coverage) to ensure sector wide coverage for common channels; utilization of full base station power across common channels to ensure adequate common channel coverage; simplicity of implementation of the static beam forming approach; simplicity of PSTD pre-coder to implement; and elimination of antenna level calibration.
The embodiment illustrated in
The example embodiments being thus described, it will be obvious that the same may be varied in many ways. For example, in a related embodiment the PSTD combining can be done across cross-polarized antenna 310 and 320 within the same column (or 310 and 340 across columns) instead of the co-polarized array as described above. This is intended to achieve a circularly or an elliptically polarized beam-formed signal in each logical antenna port instead of a uni-polarized beam-formed signal as described above. Such variations are not to be regarded as a departure from the invention, and all such modifications are intended to be included within the scope of the invention.
This application claims priority under 35 U.S.C. §119(e) to Provisional U.S. application No. 61/555,686 filed on Nov. 4, 2011.
Number | Name | Date | Kind |
---|---|---|---|
5204686 | Petrelis et al. | Apr 1993 | A |
5530449 | Wachs | Jun 1996 | A |
5686926 | Kijima et al. | Nov 1997 | A |
5761351 | Johnson | Jun 1998 | A |
6252912 | Salinger | Jun 2001 | B1 |
6509883 | Foti | Jan 2003 | B1 |
6542556 | Kuchi et al. | Apr 2003 | B1 |
6703976 | Jacomb-Hood et al. | Mar 2004 | B2 |
6735182 | Nishimori | May 2004 | B1 |
6788661 | Ylitalo et al. | Sep 2004 | B1 |
6906601 | Fayyaz | Jun 2005 | B2 |
6980778 | Benning et al. | Dec 2005 | B2 |
7272359 | Li | Sep 2007 | B2 |
7414577 | Mohamadi | Aug 2008 | B2 |
7433713 | Haskell | Oct 2008 | B2 |
7450657 | Paulraj | Nov 2008 | B2 |
7684511 | Chiurtu | Mar 2010 | B2 |
7697622 | Han et al. | Apr 2010 | B2 |
7817641 | Khandani | Oct 2010 | B1 |
7904034 | Khan | Mar 2011 | B2 |
8111772 | Chen | Feb 2012 | B2 |
8185161 | Haskell | May 2012 | B2 |
8249187 | Harel | Aug 2012 | B2 |
8345639 | Hensley et al. | Jan 2013 | B2 |
8374221 | Budampati | Feb 2013 | B2 |
8482462 | Komijani | Jul 2013 | B2 |
8508409 | Hosoya | Aug 2013 | B2 |
8526525 | Keerthi | Sep 2013 | B2 |
8526878 | Maruhashi et al. | Sep 2013 | B2 |
8619544 | Gaal | Dec 2013 | B2 |
8730922 | Hultell | May 2014 | B2 |
8744374 | Aue | Jun 2014 | B2 |
8774196 | Schmidt | Jul 2014 | B2 |
8872719 | Warnick | Oct 2014 | B2 |
9100076 | Naguib | Aug 2015 | B2 |
20020044564 | Ranta | Apr 2002 | A1 |
20020171583 | Purdy et al. | Nov 2002 | A1 |
20020193071 | Waltho | Dec 2002 | A1 |
20030021352 | Benning et al. | Jan 2003 | A1 |
20030022634 | Benning et al. | Jan 2003 | A1 |
20030108087 | Shperling | Jun 2003 | A1 |
20030137464 | Foti | Jul 2003 | A1 |
20030162566 | Shapira et al. | Aug 2003 | A1 |
20030190897 | Lei et al. | Oct 2003 | A1 |
20030195017 | Chen et al. | Oct 2003 | A1 |
20030227353 | Fayyaz | Dec 2003 | A1 |
20040027279 | Jacomb-Hood | Feb 2004 | A1 |
20040132413 | Hwang et al. | Jul 2004 | A1 |
20050012665 | Runyon et al. | Jan 2005 | A1 |
20050063483 | Wang | Mar 2005 | A1 |
20060058022 | Webster | Mar 2006 | A1 |
20060245346 | Bar-Ness | Nov 2006 | A1 |
20060250941 | Onggosanusi | Nov 2006 | A1 |
20060264183 | Chen et al. | Nov 2006 | A1 |
20070041465 | Paulraj et al. | Feb 2007 | A1 |
20070041466 | Chiurtu et al. | Feb 2007 | A1 |
20070080886 | Thomas et al. | Apr 2007 | A1 |
20070093274 | Jafarkhani et al. | Apr 2007 | A1 |
20070183515 | Lim et al. | Aug 2007 | A1 |
20070223380 | Gilbert et al. | Sep 2007 | A1 |
20070274411 | Lee et al. | Nov 2007 | A1 |
20070286190 | Denzel | Dec 2007 | A1 |
20080188229 | Melis et al. | Aug 2008 | A1 |
20080211717 | Boeck | Sep 2008 | A1 |
20080219377 | Nisbet | Sep 2008 | A1 |
20080260064 | Shen et al. | Oct 2008 | A1 |
20080273618 | Forenza | Nov 2008 | A1 |
20090167605 | Haskell | Jul 2009 | A1 |
20090213903 | Wu et al. | Aug 2009 | A1 |
20100020892 | Lee et al. | Jan 2010 | A1 |
20100073260 | Fujita | Mar 2010 | A1 |
20100074309 | Lee et al. | Mar 2010 | A1 |
20100091896 | Lee et al. | Apr 2010 | A1 |
20100151784 | Grau Besoli et al. | Jun 2010 | A1 |
20100156188 | Fishman | Jun 2010 | A1 |
20100189055 | Ylitalo | Jul 2010 | A1 |
20100214073 | Kasai et al. | Aug 2010 | A1 |
20100254485 | Yoshii | Oct 2010 | A1 |
20100321238 | Shen | Dec 2010 | A1 |
20100322349 | Lee et al. | Dec 2010 | A1 |
20110075745 | Kleider et al. | Mar 2011 | A1 |
20110102262 | Haskell | May 2011 | A1 |
20110187614 | Kirino et al. | Aug 2011 | A1 |
20110222503 | Nakao et al. | Sep 2011 | A1 |
20120050107 | Mortazawi et al. | Mar 2012 | A1 |
20120256702 | Khlat et al. | Oct 2012 | A1 |
20120275356 | Aharony | Nov 2012 | A1 |
20130057432 | Rajagopal et al. | Mar 2013 | A1 |
20130072247 | Park et al. | Mar 2013 | A1 |
20130147664 | Lin | Jun 2013 | A1 |
20130202054 | Khan et al. | Aug 2013 | A1 |
20130244594 | Alrabadi et al. | Sep 2013 | A1 |
20130314280 | Maltsev et al. | Nov 2013 | A1 |
20130336425 | Lee et al. | Dec 2013 | A1 |
20140016573 | Nuggehalli et al. | Jan 2014 | A1 |
20140056256 | Kim et al. | Feb 2014 | A1 |
20140076972 | Smith | Mar 2014 | A1 |
20140105319 | Lee et al. | Apr 2014 | A1 |
Number | Date | Country |
---|---|---|
1521957 | Aug 2004 | CN |
1282242 | Feb 2003 | EP |
Entry |
---|
International Search Report (PCT/ISA/210) for International Application No. PCT/US2012/063163 dated Feb. 6, 2013. |
Written Opinion of the International Searching Authority (PCT/ISA/237) for International Application No. PCT/US2012/063163 dated Feb. 6, 2013. |
International Preliminary Report on Patentability (PCT/IB/373) issued May 6, 2014 for corresponding International Application No. PCT/US2012/063163. |
Number | Date | Country | |
---|---|---|---|
20140079097 A1 | Mar 2014 | US | |
20150244442 A9 | Aug 2015 | US |
Number | Date | Country | |
---|---|---|---|
61555686 | Nov 2011 | US |