USPatent applicationPatented

8-PSK transmit filtering using reduced look up tables

Granted 16 May 2006 · 2 office actions

Current assignee: Ericsson Inc. · originally Ericsson

Law firm: Law firm · Log in to unlock

Attorney: Attorney · Log in to unlock

Inventors: Paul W. Dent · Examiner: Stephen Chin · AU 2634 · TC 2600

Application· this page
9500366
filed 8 Feb 2000
Publication
Not published
not published
Patent
US 7,046,738
granted 16 May 2006

Life of the application

10 dated events
⤢ drag to zoom20002002200420062008201020122014201620182020ProsecutionTerm & fees
ProsecutionTerm & feeshover for detail · click to open

Abstract

A method for generating a premodulation-filtered modulation waveform having a real part and an imaginary part for transmitting octal symbols uses a reduced lookup table. Successive octal symbols, each comprising three information bits, are input to a logic unit. The logic unit forms a first derived bit by combining the first and third information bits and a second derived bit by combining the second and third information bits. The first and second information bits, along with the first and second derived bits, are delayed in respective L-bit shift registers. The bit sequences in the L-bit shift registers are used to determine a corresponding filtered waveform segment for each bit sequence. The waveform segments corresponding to the delayed first information bits and the delayed first derived bits are combined to obtain a segment of said imaginary waveform part. The waveform segments corresponding to the delayed second information bits and delayed second derived bits are combined to obtain a segment of said real waveform part.

Description

8 parts
›FIELD OF THE INVENTION

The present invention relates generally to a method and apparatus to perform phase modulation in a digital communications system, and more particularly, to a method and apparatus to perform phase modulation using reduced look-up tables.

›BACKGROUND OF THE INVENTION

In the prior art of digital radio communication, it is well known that linearly filtered transmissions can achieve superior spectral containment, thus reducing adjacent channel interference. Linearly filtered transmissions may be produced according to the prior art by applying information-symbol-representative impulses to a premodulation filter of desired characteristics. Such impulses, in the case of binary symbols, are impulses of area either + 1 or − 1 . In the case of complex modulation, which produces both variations of the signal phase and amplitude creating a time-varying signal vector in the two-dimensional complex plane, the symbol-representative impulses have both a real (x or In-phase) part usually denoted by I i , and an imaginary (y or Quadrature) part denoted by Q i . The complex symbol S i =I i +jQ i may be filtered by separately filtering the I and Q sequences.

It is also known in the prior art that filtering may be performed using Finite Impulse Response (FIR) filters, which perform a weighted sum over the sliding window of successive symbols. Recent innovations in FIR filters are disclosed in U.S. Pat. No. 5,867,537 to Applicant, which is hereby incorporated by reference.

Also in the prior art, it is known that all possible output values of an FIR filter may be precomputed and stored in a look-up table, providing the number of symbols L over the sliding FIR filter window is not too large. The number of stored output waveforms must be M L when using symbols selected from an alphabet of M possible values. To reduce this number, U.S. Pat. No. 5,867,537 to Applicant splits the look-up table into two tables, each addressed by L/2 symbols. When M is large, for example 8 in an exemplary implementation, the size of the look-up table can nevertheless be excessive. Therefore, there is a need to reduce the size of look-up tables for generating filtered modulation waveforms for 8-PSK and similar modulations.

›SUMMARY OF THE INVENTION

A linearly-filtered 8-PSK signal for transmission is formed by dividing each 8-PSK symbol into its three constituent information bits B 1 , B 2 , and B 3 . Bits B 1 and B 3 are combined to form a first derived bit denoted B 1 ′. Bits B 2 and B 3 are combined to form a second derived bit denoted B 2 ′. All the bit values are regarded as having values of + 1 or − 1 . Successive ones of the B 1 bits are then clocked into a first register of length L bits, the L register bits addressing a look-up table holding filtered signal values based on a length-L impulse-response filter. For each new B 1 bit clocked into the first register, a number of first filtered signal values corresponding to instants within one symbol period are extracted from the look-up table. Similarly, the B 2 , B 1 ′, and B 2 ′ bits are clocked into respective registers and used to address filtered second, third, and fourth signal values respectively. Then the first filtered signal values are combined with the second filtered signal values to form one of the two complex parts of the desired complex filtered signal for transmission. The third filtered signal values are combined with the fourth filtered signal values to form the other of the two complex parts of the desired, filtered, complex signal. The resulting filtered, complex signal values are then used to modulate a linear transmitter.

Thus according to the above embodiment, the look-up table used to represent filtered values is reduced from 8 L values to 2 L values. The look-up table has, moreover, +/− symmetry allowing it to be further reduced by one-half. Thus, when using the invention, look-up tables of reasonable size may be used to generate a filtered 8-PSK signal.

In a preferred implementation, the look-up tables hold single-bit, oversampled sigma-delta representations of the filtered waveforms over each symbol period. These may be converted to analog waveforms by simple low-pass filtering, thus eliminating D-to-A convertors.

›BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a conventional 8-PSK signal constellation;

FIG. 2 is a block diagram of a look-up table waveform generator of the prior art;

FIG. 3 is a rotated 8-PSK signal constellation used in the present invention;

FIG. 4 is a block diagram of a reduced look-up table waveform generator according to the present invention.

FIG. 5 is an second embodiment of the waveform generator according to the present invention.

FIG. 6 is a third embodiment of the waveform generator according to the present invention.

›DETAILED DESCRIPTION OF THE INVENTION · 1 of 4

FIG. 1 shows a conventional 8 point signal constellation used in the prior art for 8-PSK modulation. The signal constellation is a geometric representation of the modulation scheme. Each signal point on the constellation represents a two dimensional vector with I and Q components, where I represents the real part of a complex waveform and Q represents the imaginary part of the complex waveform. According to the prior art, octal symbols comprising three information bits are mapped to points on the signal constellation. The corresponding waveform is then generated and impressed on the phase of the carrier to transmit the octal symbol. There is a one-to one correspondence between possible octal symbols and signal points in the constellation. Thus, a signal constellation includes 2 n signal points, where n equals the number of symbol bits. In 8-PSK modulation, the input symbols have 3 bits, B 1 , B 2 , and B 3 , and the signal constellation has 8 points corresponding to the eight possible symbols. Each signal point in the constellation has one of eight possible values:

+1

−1

+j

−j

(1 + j)/root2

(1 − j)/root 2

(−1 + j)/root2

(−1 − j)/root 2

FIG. 1 shows one mapping used to assign symbols to signal points on the signal constellation. While this mapping may be done in many ways, the preferred assignment is to use Gray encoding. When Gray encoding is used, adjacent signal points differ by only one binary digit. Because the most likely error caused by noise involves the erroneous detection of an adjacent phase at the receiver, only a single bit error occurs in the k-bit sequence with Gray encoding.

During modulation, L successive symbols S 1 , S 2 , S 3 . . . S(L), each having one of these 8 values, are combined in an FIR filter having coefficients C 1 , C 2 , C 3 . . . C(L) to obtain a filtered value V given by the following equation:

V=C 1 .S 1 +C 2 .S 2 +C 3 .S 3 . . . +C ( L ) .S ( L )  Eq. (1)

Since each symbol has one of eight possible values, V may take any one of 8 L or 2 3L possible values. The filter values are pre-computed and stored in a look-up table. For L=7, for example, there would be 2 21 or 2 million complex values for each waveform point, leading to an excessive look-up table size, even after exploiting the 4-fold symmetries that exist.

FIG. 2 illustrates a waveform generator, indicated generally by the numeral 100 , used in the prior art for 8-PSK modulation. The waveform generator 100 includes an input register 102 , a look-up table 106 , a divide by 4 counter 104 for clocking the look-up table 106 , a pair of D/A converters 108 a,b for converting the real and imaginary values output from the look-up table 106 to analog signals, a pair of filters 110 a,b for smoothing output analog signals, and a quadrature modulator 112 for impressing the generated waveforms onto a carrier signal. Octal symbols comprising three information bits each are clocked sequentially into register 102 , which stores the last L symbols. The 3L bits from the register 102 are applied to look-up table 106 , which stores filtered waveform values V representing filtered segments of the modulation waveform. To describe a signal waveform corresponding to the filtered signal, several numerical samples corresponding to a plurality of sampling points on the waveform over each symbol period must be stored, and each numerical sample comprises a real and an imaginary value. The number of sampling points per symbol period is called the oversampling factor, and must be high enough to represent the smoothly changing waveform, thus avoiding the need for stringent additional smoothing filters to take out excessive step-changes. For example, if an oversampling factor of 4 is used, four real and four imaginary values of perhaps 8-bit precision each must be stored for each symbol period, giving a memory size of 2×4×8×2 21 bits, or 128 megabits, which is a very large memory. The 4 successive sampling points within each symbol period are selected by sequencing divide by 4 counter 104 through its four states 11 , 01 , 10 , 11 using a 4× symbol-rate clock. The real and imaginary waveform values output from the look-up table 106 are converted to analog signals by the D/A converters 108 a and 108 b , and then the analog outputs are smoothed to remove the steps at the oversampling rate by filters 110 a and 110 b . The complex analog modulation waveform is then applied to I, Q or quadrature modulator 112 to generate the octal modulated signal at a given radio carrier frequency. Quadrature modulators and improvements thereto are described in U.S. Pat. No. 5,530,722 which is hereby incorporated by reference herein.

One drawback to look-up table waveform generators of the prior art is that the number of filtered waveform values V that must be pre-computed and stored is exponentially related to the number L of consecutive symbols used to generate the filtered waveform values V. Thus, when L becomes large, the number of filtered waveform values V that must be pre-computed and stored quickly becomes unmanageable. In the example given where L=7, there are 2 21 or 8 7 complex values that need to be pre-computed and stored in the look-up table.

It is possible to reduce the number of complex waveform values V that must be pre-computed and stored by rotating the signal constellation 22.5 degrees as shown in FIG. 3 . Using the rotated signal constellation, the real and imaginary parts of the 8 possible constellation points are always one of the four values:

+ sin(22.5°) − sin(22.5°) + sin(67.5°) − sin(67.5°)

These values are related to the three 8-PSK bits by the following linear equations:

I=aB 2 −bB 2 .B 3  Eq. (2) Q=aB 1 +bB 1 .B 3  Eq (3)

where a=0.5[sin(67.5°)+sin(22.5°)] and b=0.5[sin(67.5°)−sin(22.5°)]. B 1 .B 3 is still a binary value, which can be denoted by B 1 ′. Likewise, −B 2 .B 3 is still a binary value, which can be denoted by B 2 ′.

Using the rotated signal constellation, the real or I waveform points become expressible as linear functions of two bits B 1 , B 1 ′ and the imaginary or Q waveform points become expressible as linear functions of B 2 , B 2 ′. Denoting the filtering operation by a function F, then the following relationship exists between the I and Q waveforms and the binary values B 1 , B 1 ′, B 2 , and B 2 ′:

›DETAILED DESCRIPTION OF THE INVENTION · 2 of 4

F ( I )= F ( aB 2 −bB 2 .B 3)= aF ( B 2)+ bF ( B 2′)  Eq (4)

F ( Q )= F ( aB 1 +bB 1 .B 3)= aF ( B 1)+ bF ( B 1′)  Eq (5)

The coefficients a and b are the same as defined above. Of course, using other relations between the three bits and the I and Q values other octal constellations may be produced according to the present invention.

By separately producing filtered waveforms F(B 1 ), F(B 1 ′), F(B 2 ) and F(B 2 ′) from sequences of B 1 , B 1 ′, B 2 and B 2 ′, and post-combining the filtered waveforms using weighting factors a and b as defined above, it is only necessary to construct a look-up table for filtering binary bit sequences.

FIG. 4 illustrates a waveform generator according to the present invention that implements the rotated signal constellation indicated generally by the numeral 200 . The waveform generator 200 includes a logic circuit 202 for combining the bits of the octal symbol, a register 204 , a selector 206 , a look-up table 208 , a divide-by-4 counter 210 , a timing unit 212 , two adders 214 a,b , two D/A converters 216 a,b , two filters 218 a,b , and a quadrature modulator 220 . Look-up table 208 stores filtered waveform segment data which may, for example, contain numerical samples of filtered waveform segments. Logic 202 receives three-bit 8-PSK symbols comprising bits B 1 , B 2 , B 3 at a symbol rate Fs. Bits B 1 , B 2 , B 3 correspond to a segment of a modulation waveform. Logic 202 outputs bits B 1 , B 1 ′, B 2 and B 2 ′ to four registers 204 a , 204 b , 204 c and 204 d at a symbol rate Fs. Registers 204 a – 204 d equate to register 102 of FIG. 2 . Registers 204 a – 204 d contain bit sequences that are used to address look-up table 208 . Registers 204 a – 204 d are selected in turn by selector 206 , which is controlled by counter 210 and timing unit 212 to be the source of the L-bit address for look-up table 208 . Look-up table 208 now stores 2 L real waveform values per oversampling point, as opposed to the 2 3L of the prior art look-up table 106 of FIG. 2 . When L=7, table 208 thus need store only 128 waveform values per oversampling point, or even 64 when +/− symmetry is exploited, making a total of 256 waveform values for four samples per symbol. The waveform values obtained from look-up table 208 when seven successive B 1 bits are selected as the address by selector 206 , representing a segment of waveform F(B 1 ), are loaded into holding register 214 b . The waveform values obtained using seven B 2 bits, representing a segment of waveform F(B 2 ), are loaded into register 214 a . When a waveform value is extracted using seven B 1 ′ bits as the address, which represent a segment of waveform F(B 1 ′), the extracted waveform value is added to register 214 b . When seven B 2 ′ bits are used to address the look-up table 208 which represent a segment of waveform F(B 2 ′), the extracted waveform value is added to register 214 a . The addition in both cases being done with a weighting factor of a:b as shown in Equations 4 and 5. The addition operation is not explicitly shown in FIG. 4 but understood to be incorporated into accumulator registers 214 a,b . Four waveform values are output. Thus a final I-value and a Q-value are obtained in registers 214 b , 214 a which are then latched into D/A converters 216 a,b at an oversampling rate of 4 Fs and converted by D/A converters 216 a , 216 b to analog signals as before. The analog signals are filtered by filters 218 a , 218 b , and modulated by quadrature modulator 220 . Counter 210 is sequenced through its states using a clock of 16 times the symbol rate to generate output values with an oversampling ratio of 16/4.

It is also possible to use the resistive network FIR filter techniques as described in U.S. Pat. No. 5,867,537 or in my co-pending application filed simultaneously herewith entitled “Combined Transmit Filter and D-to-A Conversion”, the latter being also hereby incorporated by reference herein. These disclosures describe how to produce the FIR filtering function for a binary chip or bit sequence using resistive combining networks to implement the weighting coefficients C 1 . . . C(L). Thus, another implementation of the invention uses four filters constructed using any of the incorporated resistive combining network techniques to generate filtered waveforms F(B 1 ), F(B 2 ), F(B 1 ′) and F(B 2 ′) which are then combined in the ratio a:b with a plus and a minus sign respectively to generate the imaginary and the real Q and I modulating waveforms. The weighting ratio a:b may be simply arranged by choosing the impedance levels of the networks producing F(B 1 ) and F(B 2 ) to have the ratio b/a to the impedance level of the networks producing F(B 1 ′) and F(B 2 ′), addition then being achieved by simply wiring the outputs F(B 1 ) and F(B 1 ′) in parallel, and likewise for F(B 2 ) and F(B 2 ′).

FIG. 5 is a block diagram of a waveform generator 300 according to the present invention that uses resistive combining networks to generate the Q and I waveforms. The waveform generator 300 includes a logic unit 302 , shift registers/resistive combining networks 306 , 308 , 310 , 312 , balanced filters 314 , 316 , and a quadrature modulator 318 . Resistive combining networks 306 , 308 , 310 , 312 may, for example, be constructed as shown in my U.S. Pat. No. 5,867,537, or in my co-pending application entitled “Combined Transmit Filter and D-to-A Converter,” filed simultaneously herewith. An 8-PSK symbol stream composed of 3 bit streams B 1 , B 2 , B 3 enters logic unit 302 to form B 1 ′ and B 2 ′ streams as before. Bit streams B 1 , B 1 ′ then drive shift-register/resistive combining networks 306 and 308 , to generate filtered Q waveform values at an oversampling rate of, for example, four waveform values per symbol, as described in the above-incorporated references. The outputs of resistive combining networks 306 , 308 are added in the ratio a:b simply by arranging their relative impedance scalings Za and Zb respectively to be in the ratio Za:Zb=b:a and wiring their outputs in parallel. Bit streams B 2 and B 2 ′ are input to registers/resistive combining networks 310 and 312 respectively to generate filtered I waveform values at the same oversampling rate. The outputs of resistive combining networks 310 , 312 , having impedance scaling Za and Zb respectively, are added in the same a:b ratio. Thus, balanced Q and I signals are generated that can be further filtered using balanced filters 314 and 316 to remove the 4 Fs steps before application to a balanced modulator 318 .

›DETAILED DESCRIPTION OF THE INVENTION · 3 of 4

D/A converters are so-called mixed signal components (part digital, part analog technology) which one would rather avoid in the interests of being able to integrate functions into a digital integrated circuit chip. Likewise, the resistive combining networks of FIG. 5 cannot always be constructed in a particular integrated circuit technology. Therefore, there is a need for an implementation that avoids using analog circuit technology.

In the prior art, a known form of digital representation of analog signals is delta-sigma modulation. Delta sigma modulation represents a signal between 0 and 1 by a fast alternating sequence of 0 's and 1 's that contains a ratio of 1 's to 0 's, such as to give the desired mean value. The sequence can be chosen so that the error waveform, which is the difference between the 1 / 0 waveform and the desired waveform, has reduced low frequency content and mostly high-frequency content that can be easily removed with a simple low-pass filter. Thus, once a delta-sigma representation is generated, it can be converted to an analog waveform with a simple low-pass filter. A bipolar signal can be represented as the difference between two complementary delta-sigma waveforms, which are then filtered by a balanced filter as disclosed in the above-incorporated '722 patent.

In the prior art, it was also known to generate delta-sigma representations of a filtered modulation waveform over a symbol period as a sequence of 1 's and 0 's by using a computer off-line, i.e., during the design process, which sequences could then be remembered in a look-up table. This technique is employed in cellular telephones conforming to the GSM standard manufactured and sold worldwide by L.M. Ericsson since 1992. The current invention allows this economical technique to be extended to higher order constellations such as 8-PSK or 16-QAM without excessively large look-up tables.

When the look-up table stores delta-sigma encoded waveform values, the waveforms can be read one or more bits at a time into a holding register successively for addresses given by L bits of B 1 , B 1 ′, B 2 and B 2 ′. The holding registers for B 1 , B 1 ′ are then clocked out and their outputs are added in the ratio a:b using two resistors, for example. Preferably, the complementary waveforms are generated at the same time and the waveform and its complement form a balanced I-signal which is filtered with a balanced filter to drive a balanced modulator, as described in the above-incorporated '722 patent to Applicant. Likewise, the holding registers for B 2 , B 2 ′ are clocked out to generate a balanced Q-signal.

A waveform generator for generating 8-PSK waveforms using 48 times oversampled delta sigma representations is shown in FIG. 6 and is indicated generally at 400 . The waveform generator 400 includes a logic circuit 402 , shift registers 404 a , 404 b , 404 c , 404 d , selector 406 , look-up table 408 , divide by four counter 410 , timing unit 412 , buffers 414 , 416 , 418 , and 420 , resistive networks 422 , 424 , balanced filters 426 , 428 , and a balanced quadrature modulator 430 . Octal symbols (B 1 , B 2 , B 3 ) enter logic 402 at the symbol rate Fs. Logic 402 outputs B 1 , B 2 , B 1 ′ and B 2 ′ at rate Fs to registers 404 a – 404 d . Selector 406 and counter 410 , which is driven at 4 Fs, select registers 404 a , 404 b , 404 c , and 404 d in proper sequence to be output to the address input of look-up table 408 . Timing generator 412 generates a timing pulse to one of the buffers 414 , 416 , 418 , or 420 respectively to latch the output of table 408 for each address input. In the exemplary implementation of FIG. 6 , look-up table 408 outputs all 48 sigma-delta samples per symbol period at a time, which are latched in one of the four 48-bit buffers 414 , 416 , 418 , or 420 . When all buffers are full, their 48-bit contents are clocked out serially at the rate 48 Fs. It will be appreciated that, in order to be able to load a new 48-bit value while the last 48-bit value is still being clocked out, buffers 414 , 416 , 418 , and 420 should be double-buffers, also known as parallel-to-serial converters.

Buffers 414 , 416 , 418 , and 420 preferably output each bit and its complement in order to generate a balanced, bipolar sigma-delta waveform representation. The outputs of buffers 414 , 416 , which correspond to bitstreams B 2 and B 2 ′ and when added in the ratio a:b by proper choice of Za and Zb, generate the I-part of the desired filtered 8-PSK waveform. Likewise buffers 418 , 420 , which correspond to bitstreams B 1 and B 1 ′ and when added in the ratio a:b, generate the Q-part of the 8-PSK waveform. These balanced I,Q waveforms contain high-frequency sigma-delta quantizing noise due to the 48-times oversampled sigma-delta representation stored in table 408 , which however, is easily removed by simple, balanced low pass filters 426 , 428 before quadrature modulation, as described in the '722 patent. Bus widths other than 48 may be used between table 408 and buffers 414 , 416 , 418 , and 420 if more convenient. For example, table 408 can output the 48 bits as six, 8-bit bytes at a rate of 6 Fs by supplying another three address bits from a divide-by-6 counter clocked at 24 Fs. By suitable design of a divide-by-24 counter to provide both the two register selection bits and the extra three address bits to table 408 , the output bytes can be in the order:

byte 1 for B1 byte 1 for B2 byte 1 for B1′ byte 1 for B2′ byte 2 for B1 byte 2 for B2 byte 2 for B1′ byte 2 for B2′ etc.

allowing buffers 414 , 416 , 418 , and 420 to be reduced to 8-bit parallel to serial convertors which are refilled 6 times over every Fs period.

Using the arrangement of FIG. 6 , a digital interface 432 may be constructed between buffers 414 , 416 , 418 , 420 and resister networks 422 , 424 so that the circuit excluding the resistors may be fabricated as an entirely digital integrated circuit having eight digital outputs. The resistor networks 422 , 424 may be incorporated into an analog integrated circuit comprising the balanced low-pass filters 426 , 428 and the quadrature modulator 430 . The eight-line interface may alternatively be reduced to four by outputting only one polarity of each waveform, the complementary polarity for forming a balanced signal being created on the analog chip.

›DETAILED DESCRIPTION OF THE INVENTION · 4 of 4

The present invention may, of course, be carried out in other specific ways than those herein set forth without departing from the spirit and essential characteristics of the invention. The present embodiments are, therefore, to be considered in all respects as illustrative and not restrictive, and all changes coming within the meaning and equivalency range of the appended claims are intended to be embraced therein.

Claims as granted

75 claims

Log in to read the claims of this application.

Log in to unlock

Classifications

11 codes
IPC · International Patent Classification
Section H — Electricity
  • H04K1/02
  • H04L27/20
  • H04L25/03
USPC · US Patent Classification
375/296375/146375/285375/135375/278332/103332/107375/284

Claim changes

Soon
Coming soonHow the claims changed between publication and grant

See which claims were amended, added or cancelled during examination, with every added and removed word marked.

AmendedAddedCancelledUnchanged

The published claims of this application are not paired with the granted ones in what we hold.

File wrapper

⤢ drag to zoom2000200120022003200420052006USPTOApplicantRequest for continued examinationResponse after non-finalFinal rejection
USPTOApplicanthover for detail · click to open
Pendency
6.3 y
2,289 days filing → grant
Office actions
2
non-final + final
Responses
4
1 RCE
Interviews
1
examiner interview summaries
Examiner
Stephen Chin
art unit 2634 · TC 2600
Citations: 9 back · 8 forward

See the full prosecution history — every USPTO and applicant action on this file, in order.

Log in to unlock

Documents

Log in to open the documents of this file: the application as filed, every office action and response, the notice of allowance.

Log in to unlock

Chain of title

No assignments have been recorded for this application yet.