Programmable, frequency agile direct conversion digital receiver with high speed oversampling
10630329 ยท 2020-04-21
Assignee
Inventors
Cpc classification
H03D7/1458
ELECTRICITY
H03D7/165
ELECTRICITY
International classification
Abstract
The invention described herein is directed to different embodiments of a wireless communications device that can be used in many different applications, such as but not limited to a digital oversampling receiver adapted to select desired signals and to reject undesired signals. In one embodiment, a wireless communications device is disclosed that comprises an architecture for a receiver front end that obviates the need for high order passive circuitry or RC active circuitry to select desired signals and to reject undesired signals.
Claims
1. A wireless transmission receiver comprising: an N stage ring counter programmed with a count pattern, wherein N is an integer of value greater than one; the N stage ring counter for producing an N-cycle digital waveform; a combiner for combining said N-cycle digital waveform with a wireless transmission; predictive coders for oversampling said combined digital waveform and said wireless transmission to form a high speed serial stream, said high speed serial stream comprised of a signal of interest and a quantization noise signal; a suppressor for suppressing said quantization noise signal; a converter for converting said high speed data stream into a lower speed; a clock coupled to said N stage ring counter; an N path switching network; at least two predictive coders, wherein a respective one of said at least two predictive coders is coupled to a respective switch of said N path switching network; and at least two (M) digital filters, each configured to receive an output signals from all of said at least two predictive coders, wherein the outputs of each of the at least two digital filters, each represent one phase state of a phase-shift keyed wireless transmission with M possible phase states, wherein the converter is an N stage ring counter programmed with a count pattern; and wherein the phase states correspond to bins and Bin 0 is prescribed to correspond to a phase of zero while Bin M1 is prescribed to represent a phase of
2. The receiver of claim 1, wherein said N stage ring counter is configured to produce a clock signal for an N path switching network and an at least one predictive coder.
3. The receiver of claim 2, wherein said N path switching network comprises at least one switch adapted to receive an input signal.
4. A wireless transmission receiver comprising: an N stage ring counter programmed with a count pattern, wherein N is an integer of value greater than one; the N stage ring counter for producing an N-cycle digital waveform; a combiner for combining said N-cycle digital waveform with a wireless transmission; predictive coders for oversampling said combined digital waveform and said wireless transmission to form a high speed serial stream, said high speed serial stream comprised of a signal of interest and a quantization noise signal; a suppressor for suppressing said quantization noise signal; a converter for converting said high speed data stream into a lower speed; a clock coupled to said N stage ring counter; an N path switching network; at least two predictive coders, wherein a respective one of said at least two predictive coders is coupled to a respective switch of said N path switching network; and at least two (M) digital filters, each configured to receive an output signals from all of said at least two predictive coders, wherein the outputs of each of the at least two digital filters, each represent one phase state of a phase-shift keyed wireless transmission with M possible phase states; wherein coefficients of the digital filters are adjusted to ensure that I and Q outputs of the at least two digital filters are amplitude and phase matched notwithstanding timing and gain imperfections in the output signals from all of said at least two predictive coders.
5. A wireless transmission receiver comprising: an N stage ring counter programmed with a count pattern, wherein N is an integer of value greater than one; the N stage ring counter for producing an N-cycle digital waveform; a combiner for combining said N-cycle digital waveform with a wireless transmission; predictive coders for oversampling said combined digital waveform and said wireless transmission to form a high speed serial stream, said high speed serial stream comprised of a signal of interest and a quantization noise signal; a suppressor for suppressing said quantization noise signal; a converter for converting said high speed data stream into a lower speed; a clock coupled to said N stage ring counter; an N path switching network; at least two predictive coders, wherein a respective one of said at least two predictive coders is coupled to a respective switch of said N path switching network; at least two (M) digital filters, each configured to receive an output signals from all of said at least two predictive coders, wherein the outputs of each of the at least two digital filters, each represent one phase state of a phase-shift keyed wireless transmission with M possible phase states; and N paths, each path from a switch of the N path switching network to a predictive coder of the at least two predictive coders, wherein each of the N stage ring counters is configured to produce a different output frequency such that each of N paths processes a relatively narrow subband of a wideband input; said subbands corresponding to each path are arranged in order of ascending frequency; and collectively these subbands cover a wide frequency span.
6. The wireless transmission receiver of claim 5, wherein the wideband input is an intermediate frequency signal formed by downconverting a wireless transmission.
7. A method of receiving a wireless transmission comprising the steps of: programming a count pattern into an N stage ring counter, wherein N is an integer of value greater than one; producing an N-cycle digital waveform; combining said N-cycle digital waveform with said wireless transmission; oversampling said combined digital waveform and said wireless transmission to form a high speed serial stream, said high speed serial stream comprised of a signal of interest and a quantization noise signal; suppressing said quantization noise signal; converting said high speed data stream into a lower speed; clocking said N stage ring counter with a clock coupled to the counter; wherein combining includes using an N path switching network; receiving an output from a respective switch of said N path switching network at a respective predictive coder of at least two predictive coders; and receiving output signals from all of said at least two predictive coders at each of least two (M) digital filters, wherein the outputs of each of the at least two digital filters, each represent one phase state of a phase-shift keyed wireless transmission with M possible phase states wherein the converter is an N stage ring counter programmed with a count pattern; and wherein the phase states correspond to bins and Bin 0 is prescribed to correspond to a phase of zero while Bin M1 is prescribed to represent a phase of
8. The method of claim 7, wherein said N stage ring counter is configured to produce a clock signal for an N path switching network and an at least one predictive coder.
9. The method of claim 8, wherein said N path switching network comprises at least one switch adapted to receive an input signal.
10. A method of receiving a wireless transmission comprising the steps of: programming a count pattern into an N stage ring counter, wherein N is an integer of value greater than one; producing an N-cycle digital waveform; combining said N-cycle digital waveform with said wireless transmission; oversampling said combined digital waveform and said wireless transmission to form a high speed serial stream, said high speed serial stream comprised of a signal of interest and a quantization noise signal; suppressing said quantization noise signal; converting said high speed data stream into a lower speed; clocking said N stage ring counter with a clock coupled to the counter; wherein combining includes using an N path switching network; receiving an output from a respective switch of said N path switching network at a respective predictive coder of at least two predictive coders; and receiving output signals from all of said at least two predictive coders at each of least two (M) digital filters, wherein the outputs of each of the at least two digital filters, each represent one phase state of a phase-shift keyed wireless transmission with M possible phase states, wherein coefficients of the digital filters are adjusted to ensure that I and Q outputs of the at least two digital filters are amplitude and phase matched notwithstanding timing and gain imperfections in the output signals from all of said at least two predictive coders.
11. A method of receiving a wireless transmission comprising the steps of: programming a count pattern into an N stage ring counter, wherein N is an integer of value greater than one; producing an N-cycle digital waveform; combining said N-cycle digital waveform with said wireless transmission; oversampling said combined digital waveform and said wireless transmission to form a high speed serial stream, said high speed serial stream comprised of a signal of interest and a quantization noise signal; suppressing said quantization noise signal; converting said high speed data stream into a lower speed; clocking said N stage ring counter with a clock coupled to the counter; wherein combining includes using an N path switching network; receiving an output from a respective switch of said N path switching network at a respective predictive coder of at least two predictive coders; and receiving output signals from all of said at least two predictive coders at each of least two (M) digital filters, wherein the outputs of each of the at least two digital filters, each represent one phase state of a phase-shift keyed wireless transmission with M possible phase states, receiving output signals at each of N paths from a switch of the N path switching network, each of the N paths outputting a signal to a predictive coder of the at least two predictive coders, wherein each of the N stage ring counters is configured to produce a different output frequency such that each of N paths processes a relatively narrow subband of a wideband input; said subbands corresponding to each path are arranged in order of ascending frequency; and collectively these subbands cover a wide frequency span.
12. The method of claim 11, wherein the wideband input is an intermediate frequency signal formed by downconverting a wireless transmission.
Description
DESCRIPTION OF THE DRAWINGS
(1)
(2)
(3)
(4)
(5)
(6)
(7)
(8)
(9)
(10)
(11)
(12)
(13)
(14)
(15)
(16)
(17)
(18)
(19)
(20)
(21)
(22)
(23)
(24)
(25)
(26) Throughout this description, elements appearing in FIGS. are assigned three-digit reference designators, where the most significant digit is the FIG. number and the two least significant digits are specific to the element. An element that is not described in conjunction with a FIG. may be presumed to have the same characteristics and function as a previously-described element having a reference designator with the same least significant digits.
DETAILED DESCRIPTION
(27) Description of Apparatus
(28) The invention described herein is directed to different embodiments of a wireless communications device that can be used in many different applications, such as but not limited to a digital oversampling receiver adapted to select desired signals and to reject undesired signals.
(29)
(30) The N stage ring counter 102 is configured to generate timing clock signals for the N path switching network 104 and the predictive coders 106.
(31)
(32) The N path switching network 104 is configured to have the same number of stages as the first N stage ring counter 102 that drives the network. In an embodiment of the one bit configuration, the switching network 104 can be comprised of N current steering MUXes that take the input differential signal and either inverts its polarity or passes it unchanged (mathematically this amounts to multiplying the signal by 1). In other embodiments, such as a 1.5 bit configuration, two current steering MUXes are used to collectively permit the passing of the signal, inverting the signal, or suppressing the signal (multiplying by 1 or 0). In other embodiments, the complexity of the switching network 104 can be extended to any number of bits through thermometric coding.
(33) An example of a schematic diagram of one path for the N path switching network 104 is shown in
(34) Referring back to
(35) At least one advantage of the invention is that the oversampling converter avoids the use of continuous time circuitry, which severely limits the maximum achievable effective number of bits (ENOB) because of the sensitivity to jitter. Furthermore, the invention exploits the inherent speed of differential current steering design technology and is therefore capable of operating at clock speeds in excess of 11 GHz. Yet another advantage of the invention is that the predictive coders 106 can be clocked using the same clock as the switching network 104, a multiple of the clocks, or a submultiple of the clocks used in the switching network discussed above. This programmable ratio is achieved by placing a repeating pattern in the ring counter to be operated at the multiple of the slower frequency.
(36)
(37)
(38) In an embodiment of the invention, the N stage ring counter 102 that drives the N path switching network 104 is/are programmed with a simple 50% duty cycle waveform. However, in other embodiments, the N stage ring counter 102 and the N path switching network 104 can have a duty cycle waveform higher or lower than 50%, and is not intended to be limited to a simple 50% duty cycle waveform. In this embodiment, the N paths of the switching network 104 produce 2N (because both master and slave outputs are used) time shifted (therefore phase shifted) versions of the LO waveform. Although the waveforms are square waves, because the effective LO frequency is so close to the incoming carrier frequency the frequency of the third and higher odd harmonics of the square wave are greatly separated from the fundamental. Thus the effect of these harmonics can be ignored and the system can be analyzed as if the LO signals are sine waves. By the very nature of the ring counter 102, the phases of these signals occur in 360/2N phase increments. For example, an eight stage counter 102 with a 11110000 waveform would produce sixteen outputs separated in phase increments of 22.5. These multiple outputs can be trigonometrically combined to produce conventional I-Q outputs as will be described herein.
(39) The underlying theory of operation for the receiver 100 is that the amplitude and phase information of any incoming waveform can be uniquely extracted from the incoming waveform using two sine waves with any arbitrary phase difference between them. Although the usual case prescribes that the two signals be in perfect phase quadrature (i.e., 90 out of phase with each other), any two arbitrary phases can be used as long as they are not in perfect phase alignment or 180 out of phase with one another.
(40) Since amplitude and phase information can be extracted using any two arbitrary phases, it then necessarily follows that it should be possible to use trigonometric identities to generate the waveforms that would result from the use of waveforms in true quadrature. Let us assume, for example, then that the incoming waveform is one that has been modulated using conventional quadrature modulation, that is
x(t)=I(t)cos t+Q(t)sin t
(41) If we mix this signal (or equivalently multiply it) with a signal cos (t+.sub.1), the mathematical expression for the resulting waveform is as follows:
(42)
(43) Note that the above waveform contains both baseband (or DC) components as well as components that are spectrally centered about twice the carrier frequency. Since the phase and amplitude information is contained in the baseband components, we can discard the higher frequency components by lowpass filtering to reject the components centered about twice the carrier frequency:
(44)
(45) The superscript BB represents just the baseband component (or amplitude and phase information) for the signal under consideration. It also follows that if a second signal (with a phase .sub.2) is additionally mixed with the incoming signal, the resulting baseband waveform would be:
(46)
(47) These two equations can be arranged in matrix form and used to solve for I(t) and Q(t) in terms of the baseband waveforms y.sub.1.sup.BB(t) and y.sub.2.sup.BB(t).
(48)
(49) Since this embodiment of the N path system generates projections from N different phases of the LO it would follow that N2 of these phases are redundant to generate the amplitude and phase information from the incoming signal of interest. Yet these redundant signals can be advantageously used to improve the detection of the amplitude and phase of the incoming signal, resulting in a signal processing gain and commensurate improvement in signal-to-noise ratio (SNR). However, the challenge in using these N outputs is to accomplish the following:
(50) 1. Choose pairs of outputs from which estimates of I(t) and Q(t) can be computed. These estimates are then added together (effectively averaging them together times a scaling factor).
(51) 2. Since there is no canonical way of choosing such pairs we must establish some reasonable criteria in choosing such pairs: a. Every phase will appear in the same number of pairs as every other phase. This keeps the estimates of I(t) and Q(t) from favoring one or more particular phases. b. Each of the pairs must be chosen in such a way as to ensure that (.sub.2.sub.1) will never be 0 or 180. c. To the extent possible, it is important to ensure that the angle between the two phases (.sub.2 and .sub.1) is large enough so that the values of coefficients are not excessively large or small.
(52) At least one methodology for choosing these pairs that satisfies these criteria is to pair off every other phase (i.e., 0 and 2, 1 and 3, 2 and 4, 3 and 5, etc.) so that N pairs are formed. This methodology satisfies all three criteria above provided that N is not excessively large. For example if N=128, then the angle between pairs would be 5.625, which has a sine of 0.098. An example of how this pairing scheme is implemented, wherein Phase k is paired with Phase k+2 and N=7 is shown in
(53) Once the pairs are chosen, the equations for I(t) and Q(t) in terms of y.sub.1.sup.BB(t) and y.sub.2.sup.BB(t) are used to compute the necessary coefficients to multiply y.sub.1.sup.BB(t) and y.sub.2.sup.BB(t). For an N path architecture, there are N pairs of phases, which each produce an estimate of I(t) and Q(t). When these N estimates of I(t) and Q(t) are added together, the net effect is that the N estimates are averaged (with a scaling factor), resulting in a processing gain as stated earlier. The results of a Monte Carlo simulation showing the effect processing gain is shown in Table 1.
(54) TABLE-US-00001 TABLE 1 N Gain Err. [dB] Phase Err. [ ] 8 0.512 2.561 12 0.447 2.034 16 0.368 2.009 24 0.339 1.555 32 0.326 1.6 64 0.189 1.044
(55) Each path was simulated with a uniformly distributed random gain error of 1 dB and phase error of 10. As the number of paths (N) increases, the overall gain and phase error of the recovered I and Q information improves, showing the effect of this processing gain.
(56) The architecture of the invention is ideal for implementation as a highly integrated circuit. Digital filters are not prone to the lot-to-lot variations of passive devices, obviating the need for complex architectures to compensate for these variations in inductor and capacitor values. Since conversion to digital is done in functionally the first stage of the receiver, the receiver is less prone to distortion and therefore is capable of much greater dynamic range performance than a conventional analog architecture.
(57) The invention disclosed herein is an improvement over conventional receivers, in particular, the multipath architecture permits more accurate detection of the phase and amplitude of a received signal, thereby achieving far better signal to noise ratio (SNR) relative to it. In addition, by using independently programmable waveforms for frequency translation and quantization, the invention provides a user much greater flexibility programming the desired bandwidth and carrier frequency of the receiver independently. In contrast, U.S. Pat. No. 6,748,025 could only achieve a bandwidth that scales with carrier frequency.
(58) Lastly, all of the above makes it possible to implement a communication device capable of operating over a very wide range of frequencies using a highly integrated circuit without the need to reprogram the circuit using external passive components (referred to as frequency agility). While previous architectures have claimed such agility, they have generally required the use of external passive devices and/or have achieved such agility at the expense of receiver performance.
(59) Although the invention has been described in considerable detail with reference to certain configurations thereof, other versions are possible, such that the invention may be embodied in other specific forms without departing from its spirit or essential characteristics.
(60) In the preceding discussion, the derivation of the N (N being the number of phases or paths) I(t) and Q(t) estimates was based on the computation of coefficients for N non-quadrature decompositions of an incoming signal. Noting, however, that each of the N phases appears twice in the list of decompositions (once as the first phase in a pair and once as the second phase), it is possible then to compute the coefficients corresponding to the k.sup.th phase directly without having to form the pairs referred to in the discussion above. Thus an alternate realization is possible utilizing half as many coefficients (N of them to be exact) as the preceding discussion (which requires the addition of 2N terms). Reviewing the equations derived above:
(61)
We can rewrite these as:
I(t)=C.sub.1.sup.Iy.sub.1.sup.BB(t)+C.sub.2.sup.Iy.sub.2.sup.BB(t)
Q(t)=C.sub.1.sup.Qy.sub.1.sup.BB(t)+C.sub.2.sup.Qy.sub.2.sup.BB(t)
where:
(62)
(63) (Note that the definitions of .sub.1 and .sub.2 are different between the first and third equations versus the second and fourth equations. A particular phase (say, k) will appear as .sub.1 in the first and third equations and as .sub.2 in the second and fourth equations.
(64) In the N=7 example previously introduced, Phase 0 appears in the list as the first term in the first pair and as the second term in the sixth pair (see
(65)
(with Phase 0 appearing as .sub.1) and in the sixth equation, Phase 0 is combined with Phase
(66)
(with Phase 0 appearing as .sub.2). Thus we can combine the C.sub.1.sup.I and C.sub.1.sup.Q from the first equations with the C.sub.2.sup.I and C.sub.2.sup.Q from the second equations to tabulate an overall coefficient representing the total contribution of Phase 0 to I(t) and Q(t) outputs of the N paths:
(67)
(68) Even though this is a trivial example (it is not a surprise that Phase 0 would have complete contribution to the cosine term and no contribution to the sine term since Phase 0 is itself identical to the cosine term), we can generalize the above to the k.sup.th phase of N total phases:
(69)
where:
k=0 . . . N1
(70) Of course, since the 4 is a scaling factor, it can be dropped from both coefficients yielding a fairly simple result. The implication of this result is that the coefficients corresponding to each of the oversampling converter outputs can be computed without using intermediate pairs.
(71) In the preceding discussion, the derivation of the N (N being the number of phases or paths) I(t) and Q(t) estimates was based on the computation of coefficients for N non-quadrature decompositions of an incoming signal. Noting, however, that each of the N phases appears twice in the list of decompositions (once as the first phase in a pair and once as the second phase), it is possible then to compute the coefficients corresponding to the k.sup.th phase directly without having to form the pairs referred to in the discussion above. Thus an alternate realization is possible utilizing half as many coefficients (N of them to be exact) as the preceding discussion (which requires the addition of 2N terms). Reviewing the equations derived above:
(72)
We can rewrite these as:
I(t)=C.sub.1.sup.Iy.sub.1.sup.BB(t)+C.sub.2.sup.Iy.sub.2.sup.BB(t)
Q(t)=C.sub.1.sup.Qy.sub.1.sup.BB(t)+C.sub.2.sup.Qy.sub.2.sup.BB(t)
where:
(73)
(74) (Note that the definitions of .sub.1 and .sub.2 are different between the first and third equations versus the second and fourth equations. A particular phase (say, k) will appear as .sub.1 in the first and third equations and as .sub.2 in the second and fourth equations.
(75) In the N=7 example previously introduced, Phase 0 appears in the list as the first term in the first pair and as the second term in the sixth pair (see
(76)
(with Phase 0 appearing as .sub.1) and in the sixth equation, Phase 0 is combined with Phase
(77)
(with Phase 0 appearing as .sub.2). Thus we can combine the C.sub.1.sup.I and C.sub.1.sup.Q from the first equations with the C.sub.2.sup.I and C.sub.2.sup.Q from the second equations to tabulate an overall coefficient representing the total contribution of Phase 0 to I(t) and Q(t) outputs of the N paths:
(78)
(79) Even though this is a trivial example (it is not a surprise that Phase 0 would have complete contribution to the cosine term and no contribution to the sine term since Phase 0 is itself identical to the cosine term), we can generalize the above to the k.sup.th phase of N total phases:
(80)
where:
k=0 . . . N1
(81) Of course, since the 4 is a scaling factor, it can be dropped from both coefficients yielding a fairly simple result. The implication of this result is that the coefficients corresponding to each of the oversampling converter outputs can be computed without using intermediate pairs.
(82) In the preceding discussion, the derivation of the N (N being the number of phases or paths) I(t) and Q(t) estimates was based on the computation of coefficients for N non-quadrature decompositions of an incoming signal. Noting, however, that each of the N phases appears twice in the list of decompositions (once as the first phase in a pair and once as the second phase), it is possible then to compute the coefficients corresponding to the k.sup.th phase directly without having to form the pairs referred to in the discussion above. Thus an alternate realization is possible utilizing half as many coefficients (N of them to be exact) as the preceding discussion (which requires the addition of 2N terms). Reviewing the equations derived above:
(83)
We can rewrite these as:
I(t)=C.sub.1.sup.Iy.sub.1.sup.BB(t)+C.sub.2.sup.Iy.sub.2.sup.BB(t)
Q(t)=C.sub.1.sup.Qy.sub.1.sup.BB(t)+C.sub.2.sup.Qy.sub.2.sup.BB(t)
where:
(84)
(85) (Note that the definitions of .sub.1 and .sub.2 are different between the first and third equations versus the second and fourth equations. A particular phase (say, k) will appear as .sub.1 in the first and third equations and as .sub.2 in the second and fourth equations.
(86) In the N=7 example previously introduced, Phase 0 appears in the list as the first term in the first pair and as the second term in the sixth pair (see
(87)
(with Phase 0 appearing as .sub.1) and in the sixth equation, Phase 0 is combined with Phase
(88)
(with Phase 0 appearing as .sub.2). Thus we can combine the C.sub.1.sup.I and C.sub.1.sup.Q from the first equations with the C.sub.2.sup.I and C.sub.2.sup.Q from the second equations to tabulate an overall coefficient representing the total contribution of Phase 0 to I(t) and Q(t) outputs of the N paths:
(89)
(90) Even though this is a trivial example (it is not a surprise that Phase 0 would have complete contribution to the cosine term and no contribution to the sine term since Phase 0 is itself identical to the cosine term), we can generalize the above to the k.sup.th phase of N total phases:
(91)
where: k=0 . . . N1
(92) Of course, since the 4 is a scaling factor, it can be dropped from both coefficients yielding a fairly simple result. The implication of this result is that the coefficients corresponding to each of the oversampling converter outputs can be computed without using intermediate pairs.
(93) The most common method of demodulating signals that are modulated using phase shift keying (i.e., signals in which digital information is encoded by selecting one of M phases of the carrier to convey log.sub.2 (M) bits of data per symbol), is to compare the magnitude (i.e., amplitude) and sign of the I and Q outputs of a conventional demodulator (see
(94) A more direct method of placing the input signal into M phase bins can be developed by exploiting the improved amplitude and timing resolution afforded by the front end of the architecture of
(95) In
(96) A design similar to that of
(97) The components of
(98) Note that the number of phases (or paths), which we will designate as N, can be greater than equal to or less than M (the desired number of phase bins). If N is greater than M, then the redundant phase information results in improving the signal to noise ratio of the detection. If N is less than M, much greater demand is placed on the performance of each path to correctly detect the phase of the incoming signal. Of course, the most trivial example of this principle would be the case where M phase bins are created using N=2 (in other words, conventional I-Q detection). Each of the M phase bins would be produced by the weighted sum of I and Q, where the weights would be dependent on the bin being detected. However, quality of the detection could never exceed the performance of a mathematically ideal detector operating on I and Q outputs that exhibit the gain mismatch and deviation from quadrature of an implementation using imperfect analog circuitry.
(99) The ideal method for detecting whether a signal has a particular phase would be to mix it with a signal that matches that exact phase (for example, to detect an ideal cosine wave one would mix it with a signal that is also a cosine, which would generate a DC component that is maximum). Based on this principle, it can be shown that the coefficient for the n.sup.th path of N total paths corresponding to the m.sup.th bin of M total phase bins would be:
(100)
(101) This is easily checked for the trivial example of QPSK (where N=4 and M=4) . . . note that our notation requires that a conventional IQ detection use four phases.
(102)
(103) The above example demonstrates a simplification that occurs when M is any even number. For the above example (where M=4) the output of the m=2 phase bin is guaranteed mathematically to be the negative of the m=0 phase bin, and the output of the m=3 phase bin is guaranteed to be the negative of the m=1 phase bin. Hence half of these coefficients are redundant. That being said, producing four phase bin outputs permits the user to determine whether the detection is being performed optimally. Detection with suboptimal phasing would produce even bin outputs that do not vanish when the detected phase is odd or vice versa. Furthermore, it may be desirable to implement the detector using N odd, which then avoids the redundancy previously mentioned.
(104) The simulation of a 32 PSK demodulator is shown in
(105) A number of schemes may be employed to determine the maximum likelihood phase bin output (in the above simulation the correct phase bin was determined by observing which phase bin had an output more positive than its two neighbors).
(106) The block diagram of
(107) The analysis of this scheme of
(108)
(109) As we have done with analyses previously in this disclosure, when we pick out the baseband (or in this case DC components) of the above signal:
(110)
(111) Of course, we can see here that if we had an ideal situation (where =1 and =0) the Q output would produce the trivial and expected result. But we can see here that some of I output has, in a sense, crosstalked its way into Q output. It is also easy to show that this crosstalk can be removed as shown below:
(112)
(113) which (if we renormalize the scaling factor of ) leads to the diagram of
(114) The components of
(115) The methodology for measuring the coefficients and (i.e., calibrating the system) is fairly straightforward. Consider a sine wave with a frequency .sub.i slightly offset from .sub.c. Then:
(116)
(117) Once again taking the baseband components only (i.e., the difference frequency):
(118)
(119) Thus the result is a pair of sine waves with the I output assumed to be the reference phase and amplitude and the Q: output scaled (relative to I) in amplitude by and with a phase lead of
(120)
radians. A number of methods may be employed to measure the amplitude and phase of the I and Q outputs directly. One such method is the IEEE-STD-1057 algorithm. Other methods (such as using a digitally synthesized cosine and sine wave to extract the phase and amplitude of y.sub.1.sup.BB(t) and y.sub.Q.sup.BB(t)) may also be employed.
(121) A connection can be explained between this embodiment of
(122)
(123) where PCn is defined as the output of the nth predictive coder and the Q output (116 in
(124)
(125) then the correction for and can be applied by calculating a modified set of coefficients for the Q output as follows:
(126)
(127) where:
(128)
(129) The objective of any direct sampling scheme is to minimize the noise that referred to the input (in this case the wireless transmission being received). At low speeds oversampling converters (such as delta-sigma converters, predictive coders, or noise shaping converters) are capable of achieving exceptionally high signal-to-noise ratios (SNRs) with SNRs in excess of 100 dB being commonplace. Yet, the behavior of high speed semiconductor circuitry operating at clock rates appropriate for oversampling wireless transmissions (in excess of 1 GHz) have comparatively poor SNR (in rough numbers 60-70 dB, or between 10-11 effective bits).
(130) In this embodiment, the input signal is essentially divided into subbands and each subband is quantized using oversampled quantization in a temporally coordinated way that allows the reconstruction of the original baseband signal from the several narrowband pieces. By limiting the bandwidth over which any single quantizer must operate, it is possible to create wideband converter that nevertheless exhibits the same signal-to-noise ratio as the converter for any single subband.
(131) The block diagram of such a receiver is shown in
(132) In this embodiment shown in
(133) While not necessary, in the preferred embodiment all of the subbands are converted to matching intermediate frequencies in order to ensure delay matching between paths. The number of subbands used is chosen by the designer in order to achieve a desired effective resolution (effective number of bits, or ENOB). For a given clock rate of the programmable divider (1620) and order for the predictive coder, a narrower subband will yield a higher ENOB, but a given total bandwidth will then require more subbands. Alternatively, a wider subband will cover a given bandwidth using fewer subbands, but will achieve a lower ENOB (for a given programmable divider clock rate and predictive coder order).
(134) The components of
(135) In one embodiment, a single pair of predictive coders is used to perform the I-Q downconversion and quantization (equivalent to
(136) In the preferred embodiment, an ensemble of subbands are downconverted to a prescribed intermediate frequency. This requires that the following equation be satisfied (assuming low-side injection):
f.sub.IF=f.sub.inf.sub.counter
f.sub.counter=f.sub.inf.sub.IF
(137) In one embodiment the switching waveforms may be generated by digital synthesis. For this embodiment, if we further define f.sub.in f.sub.0+k.Math.f where k is a programmed constant (defining the subband) and arrange it so that f.sub.0f.sub.IFRf where R is a fixed constant, then:
f.sub.counter=f.sub.inf.sub.IF=f.sub.0+k.Math.ff.sub.IF
=f.sub.0f.sub.IF+k.Math.f=(R+k)f
(138) Further arranging it so that the bandwidth is an integer submultiple of a high speed master clock frequency, such that
(139)
The result is simple rational fraction digital synthesis solution:
(140)
which is easily synthesized using the phaselocked loop synthesizer shown in
(141) The components of
(142) The generation of I/Q waveforms through the use of a master-slave flip-flop was already discussed previously (see the discussion on the N stage ring counter on p. 4).
(143) In a variation of this embodiment, a pair of circuits as shown in
(144) A block diagram of this embodiment is shown in
(145) The components of
(146) The fundamental operating principle behind both of these architectures is the image cancelling property of two I-Q mixing operations performed back-to-back. A simplified block diagram is shown in
(147) The components of
(148) Let us assume once again that the input waveform is a modulated carrier waveform represented as: RF(t)I(t)cos .sub.ct+Q(t)sin .sub.ct, Then the signals A(t) and B(t) are calculated as follows:
A(t)=RF(t).Math.cos .sub.Lt=[I(t)cos .sub.ct+Q(t)sin .sub.ct] cos .sub.Lt
=I(t)cos .sub.ct cos .sub.Lt+Q(t)sin .sub.ct cos .sub.Lt
B(t)=RF(t).Math.sin .sub.Lt=[I(t)cos .sub.ct+Q(t)sin .sub.ct] sin .sub.Lt
=I(t)cos .sub.ct sin .sub.Lt+Q(t)sin .sub.ct sin .sub.Lt
(149) A(t) and B(t) are further simplified to:
(150)
(151) C(t) and D(t) are produced by selecting the difference frequency while rejecting the sum frequency:
(152)
(153) E(t), F(t), G(t), and H(t) are defined as follows:
(154)
(155) The above can be simplified as follows:
(156)
(157) When terms are combined as shown:
(158)
(159) To demonstrate the image cancelling properties, consider case where the second IF is zero, i.e., .sub.c.sub.L=.sub.M
(160)
(161) In other words, the signals of interest that are centered about the carrier frequency that is above the local oscillator frequency .sub.c=.sub.L+.sub.M are translated down to baseband (and appearing in the signals F(t)+G(t) and E (t)H(t)). But the image frequency (a carrier frequency located below the local oscillator frequency) where .sub.L=.sub.c+.sub.M are translated up to twice the IF. This implies that in the ideal case, the baseband content must be less in bandwidth than .sub.M. In practice we would want to limit the baseband content to significantly less than this to avoid unrealistic demands on the lowpass filter that passes the baseband content while rejecting signals centered at twice .sub.M.
(162) Alternatively, for the high side injection case where .sub.L.sub.c=.sub.M.fwdarw..sub.c.sub.L=.sub.M:
(163)
(164) Thus we see that signals below the local oscillator frequency .sub.L appear exclusively in the signals E (t)+H(t) and F(t)G(t). In the preferred embodiment, we will choose to downconvert signals that are higher in frequency than .sub.L so that we can avoid spectrum reversal in the first stage (i.e, the highest frequencies translating into the lowest frequencies and vice versa).
(165) For the purpose of explaining how this frequency translation scheme of this embodiment is used to perform wideband quantization, let us represent the wideband modulation of a signal as follows:
I(t)=I.sub.0(t)+I.sub.1(t)+ . . . +I.sub.N.sub.
Q(t)=Q.sub.0(t)+Q.sub.1(t)+ . . . +Q.sub.N.sub.
where:
(166) I.sub.k(t),Q.sub.k(t) represents the information contained in the k.sup.th subband, and
(167) N.sub.B represents the total number of subbands into which the signal is being broken.
(168) Although not required, in the preferred embodiment the width of all the subbands is identical, so that the total bandwidth of the signal being quantized is N.sub.B.Math.f, where (in accordance with the preceding discussion)
(169)
For convenience we will represent the base frequency of the total bandwidth being processed by the receiver as .sub.c even though the complete bandwidth may contain multiple signals and (strictly speaking) the conventional view of a carrier frequency is that it represents the middle of a spectrum (rather than the minimum frequency of an occupied spectrum).
(170) Keeping in mind the assumed relationship between frequency and radian frequency (
(171)
(172) the subbands are thus defined to occupy the frequencies are shown below:
(173)
(174) where:
(175)
(176) In the time domain, RF(t) can be expressed as follows:
(177)
(178) It is also convenient to express RF(t) in terms of baseband versions of the individual subband components. We will represent these with the symbols .sub.k(t),{circumflex over (Q)}.sub.k(t) corresponding to the k.sup.th subband components I.sub.k(t),Q.sub.k(t). The relationship between these components is easily derived as follows:
(179)
(180) This suggests the following correspondences:
I.sub.k(t).sub.k(t)cos kt+{circumflex over (Q)}.sub.k(t)sin kt
Q.sub.k(t){circumflex over (Q)}.sub.k(t)cos kt.sub.k(t)sin kt
or:
.sub.k(t)I.sub.k(t)cos ktQ.sub.k(t)sin kt
{circumflex over (Q)}.sub.k(t)Q.sub.k(t)cos kt+I.sub.k(t)sin kt
(181) In terms of .sub.k(t),{circumflex over (Q)}.sub.k(t), we can express RF(t) thus:
(182)
(183) Note that for the k=0 (baseband) case .sub.k(t),{circumflex over (Q)}.sub.k(t) are identically equal to I.sub.k(t),Q.sub.k(t).
(184) The embodiments shown in
(185) In the embodiment of
(186)
for each of the subbands would be as follows:
I.sub.0(t),Q.sub.0(t):f.sub.L=f.sub.c
I.sub.1(t),Q.sub.1(t):f.sub.L=f.sub.c+f
. . .
I.sub.N.sub.
(187) where the output of each of the downconverters occupies a bandwidth of DC to f. If we consider the .sub.k(t),{circumflex over (Q)}.sub.k(t) based expansion for RF(t), the output of each subband downconverter would be:
(188)
(189) Using the notation BB{ } to indicate extracting the baseband component through lowpass filtering:
(190)
(191) In this configuration the final stage is used to restore each of the subbands to their relative position (in frequency). This is done using .sub.M=k:
(192) If we consider the outputs E(t)+H(t) and F(t)G(t), we can see in accordance to the relationships derived earlier:
(193)
(194) This indicates that the original subband content has been restored. In a final step, we must recombine all of the subband contents into the original wideband content. A network designed to accomplish this is shown in
(195) The components of
CLOSING COMMENTS
(196) Throughout this description, the technologies described and examples shown should be considered as exemplars, rather than limitations on the apparatus and procedures disclosed or claimed. Although many of the examples presented herein involve specific combinations of method acts or system elements, it should be understood that those acts and those elements may be combined in other ways to accomplish the same objectives. With regard to flowcharts, additional and fewer steps may be taken, and the steps as shown may be combined or further refined to achieve the methods described herein. Acts, elements and features discussed only in connection with one technology are not intended to be excluded from a similar role in other technologies.
(197) As used herein, plurality means two or more. As used herein, a set of items may include one or more of such items. As used herein, whether in the written description or the claims, the terms comprising, including, carrying, having, containing, involving, and the like are to be understood to be open-ended, i.e., to mean including but not limited to. Only the transitional phrases consisting of and consisting essentially of, respectively, are closed or semi-closed transitional phrases with respect to claims. Use of ordinal terms such as first, second, third, etc., in the claims to modify a claim element does not by itself connote any priority, precedence, or order of one claim element over another or the temporal order in which acts of a method are performed, but are used merely as labels to distinguish one claim element having a certain name from another element having a same name (but for use of the ordinal term) to distinguish the claim elements. As used herein, and/or means that the listed items are alternatives, but the alternatives also include any combination of the listed items.