Rapid acquisition dispersive channel receiver integrated circuit

[0002] This invention relates generally to an integrated circuit used for receiving communication signals and, in particular, relates to an externally programmable integrated circuit used for acquiring and demodulating radio data communication signals.

[0003] Modern communication systems, such as Code Division Multiple Access and Time Divisional Multiple Access digital radio communication systems, are typically required to maintain low error rates at high data rates through radio paths that are subject to fading, multipath, and other RF impairments. It is also desirable in many applications to provide the radio receiver in a small, possibly portable package, that makes extensive use of integrated circuit technology.

[0004] An ability to provide certain radio receiver components in integrated circuit form is well known in the art. For example, in a data sheet entitled HSP43168 Dual FIR Filter, available from Harris Semiconductor (December 1996), there is described a dual Finite Impulse Response (FIR) filter integrated circuit that is suitable for use in quadrature and complex filtering, adaptive filtering, polyphase filtering and image processing applications. The filter can be connected with a microprocessor and thereby programmed for use in an intended application.

[0005] It is a first object and advantage of this invention to provide an improved integrated circuit that embodies a dispersive channel receiver capable of rapidly acquiring a signal of interest.

[0006] It is a further object and advantage of this invention to provide an integrated circuit that comprises a reconfigurable FIR filter in combination with a coherent signal processor, a multi-ported coherent memory, a sequential weight processor, and a dual ported weight memory, all of which can be programmed during use for operating in one of a plurality of modes, including a received signal acquisition mode, a channel estimator mode, an adaptive equalizer mode, and a channel-wise differential mode.

[0007] The foregoing and other problems are overcome and the objects and advantages are realized by methods and apparatus in accordance with embodiments of this invention.

[0008] An integrated circuit in accordance with this invention includes a reconfigurable FIR filter that has an input port for receiving digital input signals and an output coupled to a coherent signal processor and a multi-ported coherent memory. The FIR filter programmably provides filtered signals to the coherent signal processor for storage in the coherent memory. The integrated circuit further includes a an adaptive sequential weight processor having an input coupled to an output port of the coherent memory. The sequential weight processor includes a weight memory and operates to output symbol soft decision data resulting from processing the digital input signals. The integrated circuit is programmable into one of a plurality of operating modes, including at least one of a received signal acquisition mode, a channel estimator mode, an adaptive equalizer mode, and a channel-wise differential mode. Polyphase operation is also within the capabilities of the integrated circuit. In the acquisition mode the FIR filter can be used, in combination with a weight ring and a weight mask, as a PN correlator.

[0009] The above set forth and other features of the invention are made more apparent in the ensuing Detailed Description of the Invention when read in conjunction with the attached Drawings, wherein:

[0010] FIG. 1A is simplified diagram of a rapid acquisition dispersive channel receiver integrated circuit (hereinafter referred to as RADIS), in particular the various inputs and outputs thereof;

[0011] FIG. 1B is a block diagram of the RADIS of FIG. 1A;

[0012] FIG. 2A is a block diagram of a coherent processor strobe generator that forms a part of the RADIS of FIG. 1B;

[0013] FIGS. 2B-2C depict two exemplary uses of the FIR as a correlator;

[0014] FIG. 3A is a block diagram of a symbol time PN matched filter using the Finite Impulse Response (FIR) block of FIG. 1B;

[0015] FIG. 3B is the corresponding waveform diagram for the symbol time PN matched filter embodiment of FIG. 3A;

[0016] FIG. 4 depicts an example of oversampled dynamic weighting with delayed codes when using the FIR block of FIG. 1B;

[0017] FIG. 5 is a block diagram of the coherent memory address control block of FIG. 1B;

[0018] FIG. 6 is an exemplary memory map of the coherent memory;

[0019] FIG. 7 is a block diagram of the programmable (reconfigurable) FIR filter of FIG. 1B;

[0020] FIG. 8A depicts the FIR input register organization;

[0021] FIG. 8B depicts various examples of input register configurations;

[0022] FIG. 9, shown collectively as FIGS. 9A and 9B, is a diagram that is useful in understanding the various configurations of the FIR input registers shown in FIGS. 8A and 8B;

[0023] FIG. 10 is a schematic diagram of a FIR filter switch matrix;

[0024] FIG. 11 is a diagram that is useful in understanding the operation of the FIR filter switch matrix of FIG. 10;

[0025] FIG. 12 is a block diagram of a FIR filter combiner tree having inputs connected to the outputs of the FIR filter switch matrix of FIG. 10;

[0026] FIG. 13A depicts the weighter and first adder of FIG. 12 in greater detail;

[0027] FIG. 13B is a representation of a 4-bit weight;

[0028] FIG. 13C illustrates an exemplary symbol that is transmitted with three different frequencies with multiple delays for each frequency;

[0029] FIG. 13D shows the contents of the coherent memory when storing three of the symbols of FIG. 13C;

[0030] FIG. 14 is a diagram that illustrates the weight significance for a polyphase embodiment;

[0031] FIG. 15, shown collectively as FIGS. 15A and 15B, is a block diagram of the sequential weight processor of FIG. 1B;

[0032] FIG. 16 is a simplified block diagram of a default configuration for the sequential weight processor of FIG. 15;

[0033] FIG. 17A is a simplified block diagram illustrating a channel estimator weight update configuration for the sequential weight processor of FIG. 15;

[0034] FIG. 17B is a block diagram illustrating an adaptive equalizer weight update configuration for the sequential weight processor of FIG. 15;

[0035] FIG. 17C is a block diagram illustrating a channel-wise differential weight update configuration for the sequential weight processor of FIG. 15; and

[0036] FIG. 17D is a block diagram illustrating a weight initialization configuration for the sequential weight processor of FIG. 15.

[0037] Reference is made to FIGS. 1A and 1B for illustrating a simplified diagram of a rapid acquisition dispersive channel receiver integrated circuit 10 (hereinafter referred to as RADIS 10), in particular the various inputs and outputs thereof, as well as a block diagram of the RADIS 10.

[0038] By way of introduction, in the preferred embodiment of this invention the RADIS 10 is embodied as a high gate count integrated circuit that is used for acquiring and demodulating radio data communications. The RADIS 10 is externally programmable with weight values for receiving and processing widely diverse waveforms. The RADIS 10 provides highly parallel time and frequency searches, it can adapt to changes in multipath and dispersive channels, and it provides optimal demodulation under these conditions. The RADIS 10 is constructed to include a preprocessor that feeds a coherent processor which produces matched filtered symbols for storage into a multi-ported coherent memory. A multi-ported weight processor adapts weights and optimally combines components of the coherent memory to produce symbol soft decisions. The weight processor also provides error signals, time and carrier tracking output signals, and generally controls searching.

[0039] The RADIS 10 may be used as a component in an advanced data communication system of a type that includes, but that is not limited to: spread spectrum systems, including code division multiple access (CDMA) systems; time division multiple access (TDMA) systems; systems operating under adverse channel conditions; as well as heavily filtered systems, i.e., those systems wherein the bandwidth of the channel is on the order of or less than the data rate. One example of a heavily filtered system is a telephone system wherein, by example, a 56 Kb modem operates on a conventional voice line.

[0040] By linking the coherent processor and the weight processor components with the coherent memory, and by providing a wide configurability through a programmable input port, a powerful single chip signal data processor is made available for various digital data reception applications. By example, the digital data could be encoded speech and/or audio data, or it could be computer network data, such as packet switched and Internet traffic, or the digital data could be facsimile data. In general, the RADIS 10 could be used to receive any type of data that one desires to transmit from a first location for reception at a second location through a radio link, or through a cable or other wiring, or through an optical fiber.

[0041] Referring now again to FIGS. 1A and 1B, but in greater detail, the RADIS 10 is assumed to be coupled during operation to an output of a receiver's downconverter, phase detector, and analog-to-digital converter (not shown) that provide digitized In-phase and Quadrature (I/Q) signals obtained from a communication channel, such as but not limited to a radio communication channel. The RADIS 10 is also assumed to be coupled to an external controller or data processor, such as a microprocessor (not shown), and receives programming inputs therefrom (e.g., FIR weights) and outputs status signals thereto. In some embodiments a despreading code, such as a pseudonoise (PN) code from a PN code generator (not shown), is input, and the RADIS 10 is used to despread a received signal using the inputted despreading code. An output of the RADIS 10 is demodulated data (soft decision data) that is input to a suitable data decoder, such as but not limited to a well-known Viterbi decoder (not shown). Another output of the RADIS 10 is a signal timing frequency or advance/slip indication that may be provided to a direct digital synthesizer (DDS, not shown) for controlling the frequency and general timing of the DDS so as to enable the RADIS 10 to lock-on to and track the received signal. These various unillustrated external components may be conventional in construction and operation, and do not form a part of the instant invention.

[0042] The RADIS 10 includes a front end 12 that generally performs DC removal, phase shifting, accumulation and down-sampling of the input IQ signals. The output of the front end 12 is applied to a reconfigurable FIR filter 14. The FIR filter 14, in the presently preferred embodiment of this invention, has 64 stages implemented with 32 1-bit taps. A set of registers forming a weight stack or ring 16 (8×34) is connected to the parallel input port for being programmed from the external processor (not shown). The output of the weight ring 16 is a set of tap weights which are input to the reconfigurable FIR 14. A mask generator 18 also provides an output to the reconfigurable FIR filter 14. For example, the mask generator 18 may be used to set the weights for certain of the 64 FIR filter stages to zero. The weight ring 16 receives an input from a serial buffer 20, which in turn has an input connected to the PN input. The serial buffer 20 could as well be provided off-chip, and is not necessarily provided on-chip in all embodiments of the RADIS 10. The PN input, in combination with the weight ring 16 and FIR filter 14, can be used as a PN despreader at 64 half chip delays of the PN code. In this case the weight ring 16 functions as a 32-bit serial-to-parallel converter for the serially input PN code. Every 32 chips the external circuitry can shift in a new PN code set.

[0043] The output of the reconfigurable FIR filter 14 is applied to a phase adjustment block 22 and thence to a first input of an adder 24 that has a second input coupled to a first output of a coherent memory 26 (e.g., 1024×20) and an output coupled to an input of the coherent memory 26. The phase adjustment block 22 is used for frequency searching and rotates the phase of the FIR output by an appropriate amount on each clock cycle. The coherent memory 26 operates to maintain all phase information partial results from the FIR filter 14, and fu nctions as an interface between the FIR filter 14 and a sequential weight processor 30 that is described below. The coherent memory 26 functions as a symbol matched filter at a frequency offset determined by the phase rotations applied by the phase adjustment block 22 (and can be used in the PN search mode case as well).

[0044] The multi-ported coherent memory 26 has a single input (from the adder 24) and three outputs. The adder 24 receives a partial result (PR) from the first output of the coherent memory 26, adds the output of the FIR filter 14, via the phase adjuster 22, and stores the result back into the coherent memory 26. The addressing of the coherent memory 26 is controlled by a coherent memory address control block 28. The coherent memory 26 provides a second output to a sequential weight processor 30 and a third output to a first input of a multiplier 32. A second input to the multiplier 32 is provided from the output of a squelch block 34. The squelch block 34 operates to set to zero those weights that are below a predetermined level, and to pass the rest unchanged. The output of the multiplier 32 is provided to an input of a one symbol weighted data accumulator 38 which provide s data soft decisions to the external decoder, such as the above-referenced Viterbi decoder (not shown).

[0045] The sequential weight processor 30 functions to adjust the adaptive weight memory in all modes. In essence, the sequential weight processor 30 operates to sequentially adjust weights that are used, for a second FIR example, to enhance multipath operation. The sequential weight processor 30 and the squelch block 34 both receive an input from an adaptive weight memory 36 (256×40, 1024×10). The adaptive weight memory 36 may be considered to produce the weights and to perform sequentially what the first FIR filter 14 does in parallel. The weight s that are output from the sequential weight processor 30 are provided as a status signal output of the RADIS 10. The sequential weight processor 30 also provides error outputs to a timing loop filter 40 and a phase loop filter 42. The timing loop filter 40 provides the RADIS 10 synthesizer frequency or advance and slip output signals, while the phase loop filter 42 provides a phase command signal that is fed back to the front end 12 to maintain carrier phase or frequency lock with the input IQ signals.

[0046] The FIR filter 14, the weight ring 16, the mask generator 18 and the coherent address control 28 are all configured to produce a symbol matched filter with successive delays in successive slots of the coherent memory 26. The same data can be filtered with multiple time invariant matched filters, or possibly with different center frequencies in the oversampled cases, and each output will occupy successive blocks of the coherent memory 26. The same process occurring on successive data symbols fills successive addresses in the coherent memory 26, eventually wrapping around to the first address. The coherent memory data is thus available until overwritten by later data on the next wrap.

[0047] Reference is now made to FIG. 2A for illustrating an embodiment of a coherent processor strobe generator 15 that operates in conjunction with the FIR filter 14 of FIG. 1B. A purpose of the strobe generator 15 is to place the matched filter outputs into the coherent memory 26. The strobe generator 15 has a number of programming inputs, described below, and an output EndSymStb (End Symbol Strobe) to indicate the end of a symbol. The strobe generator 15 operates the FIR filter 14, at any given time, in one of two basic modes. The two basic modes are a fixed tap FIR filter mode and a parallel correlator mode. In the parallel correlator mode the FIR filter 14 is operated as a parallel correlator (e.g., as a PN code correlator). In a simplest configuration for this mode depicted in FIG. 2B, the number of filter taps is greater than the number of chips in a symbol. Each output of the FIR filter 14 during a symbol time corresponds to an increment in signal delay, and the outputs are stored into the coherent memory 26. In a more complex mode, depicted in FIG. 2C, the number of taps is less than the number of chips in a symbol (e.g., 100 chips per symbol). In this case the symbol is divided into a plurality of sub-symbols (e.g., four, 25 chip sub-symbols). The first 25 PN codes or weights are then applied via the weight ring 16 to the first 25 chips of the symbol, and the resulting outputs are stored into the coherent memory 26. A matched filter strobe (MF Strobe) signal is then generated to strobe in the next 25 PN weights to the weight ring 16, and the 25 outputs of the matched filter 14 are added to the first 25 weights (using adder 25) and the 25 partial results are stored back into the coherent memory 26. This process is repeated for the next 25 sub-symbol chips, and then the next 25 sub-symbol chips. At the end of the 100 chip symbol the signal End Symbol Strobe (EndSymStb) is generated by the strobe generator 15 of FIG. 2A, and the contents of the coherent memory 26 represent a symbol matched filter output with 25 delays.

[0048] If the number of the PN code were instead 97, then the partitioning of the filter would be n, n, n and n+1, where n=24. If the number of the PN code were instead 98, then the partitioning of the filter would be n, n, n+1 and n+1, where n=24. It is preferred to make each partition as large as possible. As such, if the number of the PN code was 96, then the filter 14 would preferably be partitioned as three, 32 tap filters. In any of these cases the weight ring or stack 16 basically functions as a register to present the PN code to the FIR filter 14.

[0049] Reference with regard to the foregoing can also be had to FIGS. 3A, 3B and 4, wherein FIG. 3A is a block diagram of the symbol time PN matched filter using the FIR filter 14, and FIG. 3B is an exemplary corresponding waveform diagram for the symbol time PN matched filter embodiment of FIG. 3A, wherein there are two weights per chip (i.e., two times oversampling to double the number of delays covered), and three matched filter cycles per symbol. The arrows and + sign indicate the operation of the adder 24 in adding the content of the coherent memory 26, representing the first FIR output, to the second FIR output, and the subsequent storage of the sum back into the coherent memory 26. It should be noted that the matched filter strobe (MFStb) delays can vary by one chip time to accommodate arbitrary processing gains (number of chips per symbol), providing the (n, n+1) mode referred to above.

[0050] The matched filter (MF) time is the time between matched filter updates in the parallel correlator mode. This time takes on two values during a symbol. The first Nmin are of length NTMin and the rest of the NMFPSym are of length NTMin+1 PN chip times. This allows an integer number of matched filter updates per symbol time, with an arbitrary number of PN chips per symbol.

[0051] The number of delays processed can be increased from NTMin, if multiple clocks per FIR input exist, by using the weight ring 16. After a weight ring update the weight ring 16 contains a stack with the newest weight on the top and successively older weights below. On each clock the weights rotate upward presenting older and older weights to the FIR filter 14 allowing the current FIR input register to correlate with larger delays of PN. When the weight ring 16 is updated, the oldest weight is replaced by the newest. The most recent PN in each of the weights is maintained. This requires that when a long MF time occurs the old weights in the weight ring 16 be shifted to continue to match the input data to the FIR filter 14. The newest PN of a weight becomes the NTMin+1 old Pn of the successive (higher on stack) weight.

[0052] In the MF interval following a long MFtime, the size of the FIR filter 14 is increased by one to match the extra PN produced. An Extra Tap operation causes this to occur by increasing the end of the mask in the mask generator 18 by one. Note that the actual FIR length must be at least NtMin+1. In fact, and due to symbol framing considerations discussed next, the FIR may need to be a few chips larger yet.

[0053] The above technique maintains the weights in the weight ring 16 synchronous with the FIR data, with delays increasing by NTMin for each ring shift. The first PN and final PN of a symbol however become shifted with respect to the most recent PN of a given weight. The Maskend must then be moved on the first FIR time of a symbol and the MaskStart on the final FIR time in order to properly frame the symbol. When the FIR filter 14 is loaded with the final weight for a symbol, the latest PN (start position) corresponds to the last PN of the symbol. As subsequent long MF time updates are made, this start position is shifted, and MaskStart is incremented to accommodate this. Similarly, when the FIR filter 14 is loaded with the first weight of a symbol the first PN of the symbol is at position NTMin. This PN also is shifted on long MF times and Mask End is compensated for this shift.

[0054] The amount of the start and end shifting is computed on each clock. For the first weight in the weight ring 16 it is zero. On subsequent weights it is the number of long MF times that occurred to arrive at that weights' position in the weight ring 16.

[0055] FIG. 4 depicts an example of oversampled dynamic weighting with delayed codes to extend the number of delays processed when using the FIR filter 14. In FIG. 4 the weight stack 16 is rotated using sub-chip strobes through one complete cycle, and the FIR filter 14 output is directed to the proper coherent memory 26 address. The weight stack 16 is of variable length, up to eight in the presently preferred embodiment. On the occurrence of the MFStrobe signal the shift is inhibited and a new PN code segment is loaded from the register (serial buffer 20). Subsequent codes can be optionally right shifted to compensate for long intervals, i.e., to prevent the data from getting ahead when operating in the n, n+1 mode. The shift can be by two when operating with two samples per chip (i.e., two times oversampling). In FIG. 4 the variable J is equal to the effective length of the FIR filter 14.

[0056] As an example of the operation of the RADIS 10: for QPSK spreading each weight is represented by two consecutive bits in the weight ring 16. Mask generator 18 Mask Start and Mask End values are calculate in terms of chips and applied to QPSK spreading. Mask Start is multiplied by 2 to apply to QPSK spreading, and Mask End is multiplied by 2, and 1 is then added to apply to QPSK spreading. As an example, if Mask Start=1 and Mask End=14 are computed for binary spreading, then Mask Start=2 and Mask End=29 for QPSK spreading.

[0057] Referring again to FIG. 2A, the strobe generator 15 is comprised of a plurality of counters 15a-15g, a flip/flop 15h, and various combinatorial logic elements, including logic 15ithat divides its input signal by two when using two times oversampling (i.e., two samples per chip). In general, the down counter 15bis loaded with the number of taps for the matched filter, the downcounter 15cis loaded with the number of matched filters per symbol, the down counter 15dis used in the n, n+1 mode (e.g., 24 taps, 25 taps), the internal WeightStb signal updates the weights, the Ringstb output is used to rotate the weight ring, CMemStb is an internal signal indicating that it is time to write to the coherent memory 26, and the flip/flop 15his employed to inhibit the generation of the MF strobe signal for one clock time when operating in the n, n+1 mode.

[0058] The strobe generator 15 is responsive to the following input configuration command parameters. Note should be made that a Chip or PN in this context refers to an accumulated sample, and would typically be half a PN clock time.

[0059] FIG. 5 is a block diagram of the coherent memory address control 28 of FIG. 1B, while FIG. 6 is an exemplary map of the coherent memory 26. In FIG. 5 the coherent memory address control 28 can be seen to include a plurality of registers and counters 28a-28d, as well as adders and multiplexers. NSymA is a parameter that represents the number of symbol addresses, that is, the total address block size for one symbol (typically less than 1024 to prevent overwriting). The parameter DelAdd (Delay Add) represents the number of addresses within a single matched filter. Referring to the n, n+1 mode example given above, DelAdd would be equal to 24 for the 24, 25 case. Ndelays is a command parameter that indicates a total number of delays associated with a symbol. The signal Acq indicates that the FIR filter 14 is being operated in the acquisition mode. In this mode each symbol overwrites the previous one and is immediately sent to the weight processor. The signals EndSymStb and RingStb are produced by the coherent processor strobe generator 15 as shown in FIG. 2A, and the signal Fixwght is used to indicate that the FIR filter 14 is being used as a tapped delay line with fixed weights, not as a despreader or correlator.

[0060] FIG. 6 gives an example of the operation of the coherent memory address control 28 for a case where Ndelay=9, NSymA=18, DelAdd=3 and NFreq=2. This implies that one is looking at nine delays at each of two frequencies. It is also assumed for this example that there are six clocks per PN symbol. FIG. 6 illustrates the sequence in which a contiguous portion of coherent memory, representing one symbol, is written.

[0061] Reference is now made to FIG. 7 for illustrating a block diagram of the FIR filter 14. In general, the FIR filter 14 is a reconfigurable digital FIR having a fixed number of input bits representing a complex number. The FIR filter 14 can be configured to have one, two, four or eight real or complex weight bits, where filter sections are combined to trade filter length vs. input bits. A programmable number of delays between taps enables polyphase and various extended configurations. The filter length and zero weights are controlled by the external mask generator 18 (FIG. 1B). The number representation (biased twos complement) makes efficient use of the hardware.

[0062] As a quick review, the binary digits 101=5.5 in biased twos complement, 0000=0.5, and 1111=−0.5. A mask bit from the mask generator 18 forces a zero when needed. An advantage of the use of biased twos complement is that all multipliers can be XOR functions, and bit inversion does not require the use of carries.

[0063] In FIG. 7 the FIR filter 14 can be seen to contain two reconfigurable 64×12 bit input registers 14aand 14b, a switch 14c, two switch matrixes 14dand 14e, and a combiner tree and scaler block 14f. The 12-bit input (low data in) is typically encoded as 6 bits of I and 6 bits of Q data. The (optional) switch 14cenables six most significant bits (MSBs) to be entered into the input register 14b, while the six least significant bits (LSBs) are entered into the input register 14a. The input registers 14a, 14bare shown in greater detail in FIGS. 8A and 8B, the switch matrixes 14c, 14dare shown in greater detail in FIG. 10, and the combiner tree and scaler 14fis shown in greater detail in FIG. 12.

[0064] In general, this FIR filter embodiment enables six real and six imaginary, or 12 real and 12 imaginary, input bits to be used in combination with 32 binary real weights, or 1, 2, 4 or 8 bit real or complex weights. A 64 stage alternate zero mode, for half chip rate sampling, is provided, as is a 32-bit zero weight mask. The FIR filter 14 is cascadable, provides a scaled output, and is polyphase compatible.

[0065] Referring to FIG. 8A, the R_oiand R_iblocks each represent one of the 64, 12-bit input data registers. The 6 bits of I data and 6 bits or Q data is applied on the S_iline and is applied to R_oiand selectively to R_i, depending on the state of switch S_ai. The remaining configurations (e.g., A_i, A_i+1) show how the registers are built from lower assemblies, A from R, B from A, C from B, and D from C, where i designates the weight tap location.

[0066] FIG. 8B illustrates four exemplary cases (1,1 2,0 2,1 and 2,2) that are useful in understanding the various input register configurations listed in FIG. 9. Note that, for example, case 2,0 refers to delta taps=2 and N delay=0, case 2,1 refers to delta taps=2 and N delay=1, and case 2,2 refers to delta taps=2 and N delay=2.

[0067] FIG. 10 depicts one switch matrix (either 14dor 14e), and is intended to be read in combination with FIG. 9 for showing the switch states for various modes of Real (R) and Complex (C) operation. The following Table illustrates the various modes of operation as they pertain to the combiner tree and scaler 14f. FIG. 11 shows the corresponding FIR register to combiner tree switching.

[0068] In FIG. 10 the blocks designated with a “j” indicate a complex multiply, which basically swaps I and Q and inverts Q (same as a 90° multiply).

[0069] FIG. 11 shows the inputs to the combiner tree 14f. By example, 1R represents one real bit, 1C represents one complex bit, or ±1, ±j if quadraphase spreading is being used.

[0070] FIGS. 12 and 13A, 13B should be viewed together, as FIG. 13A shows the weight (W) and first adder (A) detail of FIG. 12, while FIG. 13B depicts various 4-bit weight representations. FIG. 14 shows the weight significance for each bit of a weight word. In FIG. 14 BR represents Binary Real (1 bit), LR represents Low Real (4 bits), HR represents High Real (8 bits), BC represents Binary Complex, LC represents Low Complex, and HC represents High Complex. Two bit weights are not shown. R^ijrepresents the j^thbit of the real part of the i^thweight.

[0071] In general, the reconfigurable FIR filter block 14 provides a significant amount of flexibility, and enables a user to programmably trade-off the length of the FIR versus the weight resolution. The output is comprised of samples of the input data stream (contiguous or delayed (polyphase)), that are weighted and added together.

[0072] If a given symbol of interest is longer than 32 chips then multiple additions can be made to the same symbol stored in the coherent memory 26. Each symbol can comprise many words. As an example, consider the case shown in FIG. 13C, wherein a first symbol (Symbol 1) is correlated for three different frequencies with possibly multiple delays for each frequency. FIG. 13D shows the contents of the coherent memory 26, wherein each symbol portion includes the three frequency portions. For example, the coherent memory may store 128 words per symbol. Thus, for the case of a 1024 word deep coherent memory, after the eight symbol is stored the memory will wrap around and begin to store over the first symbol data.

[0073] Reference is now made to FIG. 15 which shows, in greater detail, the sequential weight processor 30, multiplier 32, squelch 34, adaptive weight memory 36, weighted data accumulator 38, the synthesizer loop filter 40 and the carrier loop filter 42 that provides the phase command to the front end 12. All of these components are shown in the block diagram of FIG. 1B. FIG. 15 also depicts the input data paths from the coherent memory 26, specifically a weight update path 26aand a demodulator path 26b.

[0074] In general, these various blocks may be considered to be the adaptive weight processor and signal combiner which is a special purpose digital processor for adaptively weighting and combining multiple samples from a random access memory (i.e., the coherent memory 36) with weights from the adaptive weight memory. The adaptation and weighting are done sequentially over an output sample time. The adaptation algorithms are selectable from least mean square (LMS), channel estimator, and power. Additional processing to allow clump energy searching, weight initialization, and estimation of clump timing error, symbol state, carrier frequency error, and carrier phase error are also provided.

[0075] Scaler blocks 60aand 60bare responsive to a scale value command (q_x) to scale the output from the coherent memory 26 by a power of two. The output of the scaler 60bis 6-bit, twos complement complex data (coherent data samples) that undergoes a complex multiply in data multiplier 32 with processed and scaled data (6-bits from scaler 60c) from the adaptive weight memory 36. The result of the multiply is accumulated over some number of samples in the accumulate and dump block 38, is scaled back to 8-bits in scaler 60dbefore being output as the soft data decisions to, by example, a Viterbi decoder. The soft data is also applied to delay block 62, to a 2, 4, 8 phase symbol processor 64 (hard decision), and to a differential decoder 66. The symbol processor 64 can be trained using a known training sequence to substitute as an estimate of the transmittal symbol data from the soft data. This data estimate ŷ is applied in the channel estimator mode to an error block 68 and passed through to an error buffer 70. In the LMS mode the delayed soft decision data from block 62 is subtracted from the data estimate ŷ and the result placed in the error buffer 70. The error buffer 70 provides an input to a weight multiplier 72. The weight multiplier 72 multiplies the scaled output of the coherent memory 26 by the complex error signal from the error buffer 70, in one mode, or by real data output from a nonlinearity (range limiting) block 74 in another mode. The computation path between the weight multiplier 72 and the dual ported weight memory 36 includes summing blocks 76 and 80, loop gain multiplier 78, delay block 82, and various switches. The operation and various configurations of these various blocks are described in further detail below. A coherent early/late (E/L) error detector is also provided to derive timing loop filter inputs from the coherent memory input and the data estimate when only one coherent delay per symbol is available. A PN search control block 86, slip control block 88, and time error generator 90 are also provided.

[0076] The various operating modes of the sequential weight processor 30 and related components are best understood by referring to FIGS. 16 and 17A-17D, wherein FIG. 16 is a simplified block diagram of a default sequential weight processor configuration, FIG. 17A is a simplified block diagram of a channel estimator (CE) mode weight update configuration, FIG. 17B is a simplified block diagram of an adaptive equalizer (AE) mode weight update configuration, FIG. 17C is a simplified block diagram of a channel-wise differential (CD) mode weight update configuration, and FIG. 17D is a simplified block diagram illustrating a weight initialization configuration (AutoInitW) for the sequential weight processor 30.

[0077] In further detail, FIG. 16 depicts the updated weight (Delta W) condition for each of the acquisition, LMS and channel estimator (CE) modes of operation. FIGS. 17A-17D also indicate the required states of switches S0-S5 shown in FIG. 15 (X indicates “don't care”) in order to place the sequential weight processor 30 into the desired modal configuration. Note that in FIG. 17D the loop gain buffer 78a, which forms a part of the loop gain multiplier 78, is shown for completeness. The weight initialization procedures are described in further detail below.

[0078] Blind equalization modes are implemented by performing a hard symbol estimation, instead of using a training sequence, to rectify weight update samples or produce error signals. As long as reliable symbol decisions can be made the performance is nearly equivalent to that obtained when using a training sequence. The blind equalization however presents difficult acquisition and fade recovery problems. For this reason a weight initialization algorithm is preferred.

[0079] One suitable weight initialization algorithm sets the weights to the conjugate channel levels for a single symbol, weighted by a nonlinear function of the measured power in that channel:

[0080] Wi=NL(Pi)*conj(Xi)

[0081] The nonlinearity NL(x) is implemented as zero below a threshold and sloping from zero with the slope of the input to an upper limit. The upper and lower fixed limits represent theoretical asymptotes. Power below a given level would indicate no signal and thus zero weight, and power above a threshold SNR requires a weight proportional to signal level (Xi) and thus a fixed weight.

[0082] The measured power in each channel is the noncoherent weight value from either acquisition or a pseudo acquisition power measuring pass.

[0083] The initialization procedure occurs in a single symbol time when the noncoherent weights are read from the weight memory 36, nonlinearly multiplied by the data sample in the weight multiplier 72, scaled, and stored back into the weight memory 36 as coherent complex weights.

[0084] After this is accomplished a delay is counted until data decisions from these initial weights are available for a weight update. If the initial weights are sufficiently close that the error probabilities are small, the weights will converge to steady state values.

[0085] If the initial weights are far from correct the convergence can require a considerable time. A failed signal presence detection after a specific time should cause another weight initialization. If sufficient weight memory exists so that the previous power measurements are intact, and they are still valid, the previous power measurements can be used for the reinitialization, otherwise the power measurement must be redone.

[0086] After an acquisition or power measurement, the external controller (e.g., a microprocessor) sets up a weight initialization by specifying parameters, setting AutoInitW, and then asserting Track Mode. The weight processor 30 will initialize the weights, clear AutoInitW, delay a specified number of symbols until decisions on the initialized weights are being made, and then close the weight update loop.

[0087] Note that if training sequences can be used the weights are best initialized to zero and the weight update loop closed. Data decisions cannot be made until the weights grow sufficiently to have an impact on the demodulator multiply.

[0088] One method of tracking a correlation clump at high PN rates without a Direct Digital Synchronizer (DDS) is by a process referred to herein as synchronous slipping. The weight tracking tracks changes in correlation because of Doppler and local oscillator (LO) offsets. When a time error signal builds to more than ½ chip a synchronous slip is performed. The slip must be synchronous so that no data is lost during the slip. This requirement is complicated by the fact that several symbols may be processed in parallel, some at the old slip and some at the new slip.

[0089] Synchronous advancing is much more difficult not only because of PN advance problems but also because time is lost and extra clocks for the advance may not be available. Weight ring compensation for the advance is more difficult because of the sequence in which weights are presented. It is thus preferred to run the local clock at the maximum expected frequency, and to perform only synchronous slips.

[0090] Synchronous slips are initiated when the error signal from the time loop filter 40, configured as a low pass filter, exceeds a threshold value. A signal SSlipCmd synchronous with symbol timing and exactly one symbol long is sent to the coherent processor to initiate a single slip. This command will result in correlations in coherent memory 26 being some number of channels per chip (1 or 2) addresses lower. Synchronous with the SSlipCmd signal a SlipDelay counter is set to a programmable initial value. This counter is counted down at the symbol rate, and when it reaches a programmed threshold the next symbol used for demodulation (xd) has been slipped by the coherent processor.

[0091] When SlipDelay reaches 1 it indicates the next symbol of the coherent memory 26 used for weight update (xw) is slipped, and it is time to update the weight memory 36. The special treatment of xd is stopped. For this symbol time the weight output address is initialized to (Woutaddr)+3 channels per chip instead of Woutaddr0. These weight outputs then match the delayed inputs from xw coherent memory. All that remains is to initialize the weight corresponding to the new channel shifted in. Another counter is needed to count Nwght clocks from woutstb to initialize wout to zero for the new value channel.

[0092] Upon detecting SSlipCmd synchronous with the start of a new symbol, PN and PN-related timing is inhibited for one PN time. The input data is allowed to pass through the FIR filter 14 without interruption. This essentially provides a slip of the PN timing with respect to the input data.

[0093] When extra clock cycles are used to extend the number of channels, some of the weights can correspond to pre-slip time and other weights to post-slip time. This is accommodated by shifting old weights identically to the way they are shifted to accommodate long matched filter (MF) times. Essentially the deleted PN cycle is compensated by shifting the old weights. The mask 18 must also be compensated for this shift. For all weights in the weight ring 16 corresponding to pre-shift PN's the mask start and mask end are incremented by one to follow the compensating shift.

[0094] The RADIS PN search simultaneously searches blocks of delays and frequencies as determined by the coherent processor 26 setup. A sequential search algorithm is employed whereby tests are made after every data symbol. If the test fails the search is stopped with no detect. If it passes the next symbol is processed. This continues until test failure or a preset number of symbols have been processed. If all symbols have been processed with no failure a final, possibly different, test is performed. only if it passes is a detect condition declared and the test ends. The microprocessor/controller will determine the next process (regarding slip, or search, initialize weights, or track.)

[0095] For the case of a single channel sequential search, each coherent symbol correlation is used when completed. For each channel the magnitude squared minus a bias is accumulated, and the accumulation is performed as a real, low resolution weight with an initial bias. If all channels are represented in a symbol time and all channels are less than zero, the test fails and the search stops. If N symbols are counted without a slip a search end command initiates the final test.

[0096] For the final test a multichannel test is performed. The real weights accumulated during the sequential search are used to determine if a correlation has been found. N tests with M channels per test are performed. A test includes passing the weights from M contiguous channels through the nonlinearity block 74 and accumulating the result from an initial bias. If the accumulation is greater than zero a detect condition is declared and the search is stopped. The time error processor 90 contains the detect position (peak, median or mean mode). If no detect occurs the weight address is incremented in block 36aby a commanded amount and another test is performed. If N tests are performed with no detect, a slip is declared by the time loop filter 40.

[0097] A multichannel sequential search can be accomplished if sufficient clock cycles are available. The weight memory 36 is built identically to the single channel sequential search described above. After the weight memory 36 is updated with all symbol data, a strobe initiates a signal detect sequence identical to the multichannel test described above. If the signal detect is true, then the next symbol is identically processed until a search end condition, where passing a final test declares a signal detect condition. If the test is false the search is stopped without detect.

[0098] As with the single channel sequential search, the multichannel search can take the coherent data directly from the coherent memory 26 input. This allows more channels to be searched without data loss from overwriting. The symbol time must be long enough to allow updating of all channels with the symbol data, and then performing the multichannel search. An alternate non-immediate mode is provided that retrieves the symbol data from the coherent memory 26. An overwrite is more likely but the weights can be updated at one clock per channel, reducing the required symbol time to complete the test.

[0099] While described in the context of specific embodiments of memory sizes and storage capacities, numbers of bits and word widths, specific binary representations and the like, those skilled in the art should realize that a number of modifications to these and other parameters could be made without departing from the teachings of this invention. Furthermore, certain of the components shown in FIG. 1B could be provided off-chip, for example the coherent memory 26 and/or the weight memory 36, although at the cost of increased numbers of I/O pins and possible degradation in access time and performance.

[0100] Thus, while the invention has been particularly shown and described with respect to preferred embodiments thereof, it will be understood by those skilled in the art that changes in form and details may be made therein without departing from the scope and spirit of the invention.