High-frequency anti-jam communication system terminal

Abstract: There is disclosed a high frequency communication system of the type employing a high frequency terminal which terminal can transmit a processed signal in a transmitting mode or process a received signal in a receiving mode which terminal includes a first subsystem for voice processing, including a processor responsive to voice signals to provide a linear predictive coded voice signal at a given data rate which signal is coupled to a data modem subsystem that digitally encrypts said voice signal which data modem subsystem is coupled to a modem processor subsystem capable of processing said encrypted signal for providing frequency hopping, feedback equalization, intersymbol interference cancellation, error correction and interleaving to provide a transmitted signal which is relatively immune to jamming during said transmitting mode which includes a convolutional encoder means included in said modem processor subsystem responsive to said encrypted signal to provide a convoluted signal at a higher data rate than said encrypted signal at an output. There is an interleave buffer having an input coupled to said encoder outputs for interleaving said higher data rate signal according to an interleaving algorithm, a symbol encoder having one input responsive to said interleave signal and one input coupled to a source of PN training signals as stored to provide at an output an encoded signal encoded according to said PN signal which PN training signal differs for each transmitting frequency. This signal is then converted to an analog signal and eventually coupled to a transmitting means for transmitting said signal. The apparatus also contains receiver means which operate to employ improved equalization for a received signal according to said PN training signal blocks.

Description: The present invention relates to a data communication system, particularly a high-frequency communication system employing a high frequency terminal, and more particularly to a modem employed in such a system and used to transmit and receive compressed speech data. Generally, high frequency (HF), radio voice and data communications have increased in importance in recent years, especially for military applications. As the HF band (2 to 30 MHz) is more widely used, the need for reliable HF communication links increases. To improve the performance of voice and data modems in terms of bit error rates and immunity to interference and intercept, state of the art equalization, error correction and spread spectrum signal processing techniques must be employed. Spread spectrum operation can be achieved by pseudo noise (PN) spreading in the modem or by frequency hopping (FH) the radio transmitter and receiver. Frequency hopping operation provides anti-jam or electronic counter counter measure operation (ECCM) capability while frequency hopping, pseudo noise spreading and the use of secure modem systems insure a low probability of intercept and a low probability of exploitation. Essentially, reference is made to an application entitled "A High Frequency Spread Spectrum Communication System Terminal", publication US-A-4,761,796, filed on January 24, 1985 for J.G. Dunn et al. This application describes in detail a spread spectrum communication system or a modem terminal which essentially consists of a voice subsystem coupled to a modem subsystmen which is coupled to an RF subsystem. The modem subsystem uses state of the art equalization techniques and spread spectrum signal processing. The terminal of the communication system provides for 4800 bits per second and 2400 bits per second data communication on 6 kHz and 3 kHz high frequency channels with frequency hopping by the radio frequency RF transmitter/receiver contained in the RF subsystem. Frequency hopping combined with decision feedback equalization, linear intersymbol interference cancellation, error correction and interleaving in the modem subsystem gives frequency diversity and anti-jam capability. Very low bit rate voice communication in the voice subsystem is also provided by the high frequency communication system terminal. In this mode of operation the modem subsystem uses PN spreading to employ the full bandwidth that is available and to provide additional anti-jam capability. The frequency hopping/PN technique also gives low probability of intercept capability if low transmission powers are used. As one can ascertain from reference to the above-noted application, spread spectrum communication systems have been used in a variety of fields. In such a communication system the transmitted bandwidth is much greater than the bandwidth or rate of the information to be transmitted. The carrier signal is modulated by some other function to widen or spread the bandwidth for transmission. The receive signal is remapped into the original information bandwidth to reproduce a desired signal. The spread spectrum communication system has many useful advantages, as is well known in the prior art. Such systems can be categorized into a direct sequence system, a frequency hopping system, a time hopping system and a hybrid system which is a proper combination of the systems just mentioned. Of these systems the frequency hopping system is frequently used in the field of mobile communication systems with a low traffic volume for a number of stations. Frequency hopping systems can be employed in satellite communication systems and scatter-type communication systems where a fading environment is present. In the frequency hopping system a carrier frequency is shifted or jumped in discrete increments in a pattern dictated by a prepared code or sequence, for instance, a PN code (pseudo noise), M sequence codes, Gold codes and the like in synchronism with a change in the state of the codes. The resulting consecutive and time sequential frequency pattern is called a hopping pattern and the duration of each hopping frequency is called a chip. The transmitted information is embedded in the codes or embedded in each frequency of the carrier wave by a so-called FSK (frequency shift keyed) or PSK (phase shift keyed) modulation. The information signal thus spread spectrum modulated can be reproduced at the receiver. Generally speaking, in reproducing the information signal at the receiver a synchronization acquisition process is first performed in which the code pattern provided in the receiver is made accurately coincident with the code pattern generated in the transmitter in time position. Then the spread spectrum signal is despread and thereafter a well known demodulation is performed to extract the desired information. More particularly, a local reference signal of a frequency correspondingly determined by the same code pattern as that in the transmiter for every chip and the received signals are mixed in a mixer in order to perform a correlation (despreading) process for converting the spread spectrum signal into the signal having a frequency bandwidth wide enough to extract the information. This system is decribed in detail in "Spread Spectrum Systems" by R. C. Dixon published by John Wiley and Sons, Inc. (1976). Following this spreading process the desired information is extracted by usual demodulation techniques. In general, in order to implement a frequency hopping communication system the terminal to be decribed is interfaced to a radio that is capable of frequency hopping the packets provided by the terminal. Many examples of such radios exist. As will be explained, the system according to this invention employs two types of frequency hopping modes. The first type is a Slow Hopping or High Data Rate (HDR) mode, which operates in 2400 bps voice, 2400 bps data or rekey modes. A Fast Hopping, or Low Data Rate (LDR) mode operates in 400 bps voice or rekey modes. The 2400 bps Voice Mode operates in conjunction with a standard voice processor utilizing linear predictive coding (LPC) which is well known in the prior art. The 400 bps Voice Mode has an additional voice processor function which converts standard 2400 LPC to 400 bits per second voice data. As indicated, the modem to be described is a secure digital voice and data terminal. It is designed to interface with HF radios to provide a complete communication system. The terminal is particularly designed to interface with various military receivers, such as those manufactured by the Hughes Aircraft Company of California. Such radios implement frequency hopping modes which are compatible with the enhanced modes, as will be further described and which are available by the use of this terminal. The radio provides for the generation of the frequency hopping pattern and the actual shift in the carrier frequency. It also provides for the initial synchronization acquisition processes. In any event, as one can further understand, jammer resistance is improved by increasing the rate of frequency hopping. A method of jamming when the frequency hopping is slow is for the jammer to repeat back the communication systems own signal. Thus, as one can ascertain, the jammer may be a communication transmitter and receiver combination whereby it is capable of repeating back the generated signal from the communication systems. If the delay of the repeat back interference is short compared to the packet duration, it will interfere with the communication signal. Thus, it is desirable to use as high a rate of frequency hopping as feasible to minimize the possibility of this type of jamming. In any event, higher data rates can be transmitted by coherent, multiphase modulation but reception from an HF channel requires equalization to remove intersymbol interference caused by multi-path spread of the received data symbols. Equalization, in turn, requires measurement of the channel response by means of a transmitted training signal. In a frequency hopping system each packet experiences a different channel response because it is at a different carrier frequency. This means that a training signal must be transmitted during each packet. The duration of the training signal must be greater than the duration of the mulit-path spread. The efficiency of the overall data signal is determined by the fraction of the packet which is used for training data. Thus, for good efficiency, the packet duration for a high data rate system must be much longer than the multi-path spread. Thus a high data rate system, using slow frequency hopping, is more susceptible to jamming. On the other hand, fast frequency hopping systems are limited to incoherent modulation without any training signals which inherently provide a lower date rate. In a system which uses a training signal it is desirable that the data pattern be randomized by PN coding or the like so that it is different for each frequency hop. If it is the same for every frequency hop the system is easier to jam because the fixed training sequence can be transmitted as a jamming signal. However, it is more difficult to use a training signal which is different for each frequency hop. From the article Torrieri, Don J.: "Frequency hopping with multiple frequency-shift keying and hard decisions", IEEE Transactions on Communications, Vol. COM-32, No. 5, May 1984, pages 574-582, the use of a convolutional encoder means in the context of frequency hopping communication systems has come to be known. It is, therefore, an object of the present invention to provide an improved high frequency communication system, which system employs improved anti-jamming techniques. It is a further object of the present invention to provide a high frequency anti-jam communication system which provides anti-jam protection by means of frequency hopping and error correction coding. It is a further object of the present invention to provide a high frequency anti-jam communication system terminal which provides unique frequency hopping modes. These objects are solved for a high frequency communication system as it has come to be known from said document US-A-4,761,796 disclosing features according to the pre-characterizing part of claim 1 by the features as set out in the characterizing part thereof. The dependent claims 2 to 21 exhibit non-trivial improvements of the subject-matter of the claims they refer to, respectively. In a high frequency communication system, a high frequency terminal is provided, which terminal can transmit a processed signal in a transmitting mode or process a received signal in a receiving mode, which terminal includes a first subsystem for voice processing including a processor responsive to voice signals to provide a linear predictive coded voice signal at a given data rate, which signal is coupled to a data modem subsystem to digitally encrypt said voice signal, which data modem subsystem is coupled to a modem processor subsystem capable of processing said encrypted signal. This high-frequency communication system is provided for providing frequency hopping, feedback equalization, intersymbol interference cancellation, error correction and interleaving to provide a transmitted signal which is relatively immune to jamming during said transmitting mode.This high-frequency communication system is further made for providing an improved transmitting operation. Said high-frequency communication system comprises a convolutional encoder means included in said modem processor subsystem and responsive to said encrypted signal to provide a convoluted signal at a higher data rate than said encrypted signal at an output, an interleave buffer having an input coupled to said encoder output for interleaving said higher data rate signal according to an interleaving algorithm; a symbol encoder having one input responsive to said interleaved signal and one input coupled to a source of PN training signal as stored to provide at an output an encoded signal encoded according to said PN signal which PN training signal differs for each transmitting frequency, a transmitting filter means responsive to said encoded signal and operative to limit the bandwidth of said signal, and a digital to analog-converter-means coupled to said transmitting filter means and operative to convert said limited bandwidth to an analog signal. The invention will now be described by non-limiting embodiments illustrated in Figs. 1-13: Fig.1 is a basic block diagram of a communication system terminal in accordance with the principles of this invention; Fig. 2 illustrates the packet format for each of the two modes of operation of the communication system terminal of Fig. 1; Fig. 3 is a block diagram illustrating the algorithm for the high data rate (HDR) transmission function of the terminal of Fig. 1; Fig. 4 is a block diagram illustrating the algorithm for the HDR mode for the receiving operation of the terminal of Fig. 1; Fig. 5 is a series of timing diagrams illustrating the function of the precancellation algorithm according to this invention; Fig. 6 is a block diagram illustrating the transmit algorithm for the LDR or low data rate mode of operation of the terminal of Fig. 1; Fig. 7 is a block diagram illustrating the algorithm for the LDR receive mode of operation of the terminal of Fig. 1; Fig. 8 is a series of timing diagrams illustrating the timing error estimation algorithm; Fig. 9 is a block diagram illustrating the Doppler estimation and correction loop employed for Doppler estimation according to this invention; Fig. 10 is a block diagram of the modem processor subsystem of Fig. 1; Fig. 11 is a block diagram of the LDR transmit functions in the voice processor algorithm; Fig. 12 illustrates the vector quantizer function whithin the LDR function in the voice processor; and Fig. 13 is a block diagram of the LDR receive functions in the voice processor algorithm. Referring to Fig. 1 there is illustrated a general block diagram of a terminal for a high frequency frequency hopping communication system in accordance with the principles of the present invention. As shown in Fig. 1, there is a first subsystem generally designated by the reference numeral 10. The first subsystem 10 is a voice processing system which typically includes a handset 13 which is coupled to an input/output device 11. The input/output device 11 is bidirectionally coupled to a voice processor 12. The voice processor 12 utilizes linear predictive coding (LPC) to provide voice communication at 2400 bits per second. The processor also provides state of the art low bit rate voice communications at 400 bits per second. Coupled to the subsystem 10, as indicated briefly above, is a modem system 20. The modem system 20 is also well known and provides for digital encryption of the 2400 and 400 bits per second data signal. The modem 20 thus enables the system to provide secure communication of voice and data. Also shown is a subsystem 30. Subsystem 30 contains two modem processors, namely 15 and 17. As will be explained, the modem processors operate to control the modem 14 and to also interface with an input/output device 16 which interfaces directly with a radio transceiver 18 for the transmission or reception of radio signals via the antenna 19. The subsystem 30 essentially is a modem processor system which employs state of the art equalization techniques and signal processing. It provides for 2400 and 400 bits per second data communication on 3 kHz high frequency channels with frequency hopping by the external HF radio 18. Frequency hopping, combined with decision feedback equalization, linear intersymbol interference cancellation, error correction and interleaving in the modem subsystem 30 gives frequency diversity and anti-jam capability. As will be further explained, the high frequency communication system provides the following capabilities. 1. 2400 bits per second and 400 bits per second voice and data communication and a 3 kHz bandwidth high frequency channel. 2. Frequency hopping operation during communications at the above-noted data rates. Operation of the frequency communication system shown in Fig. 1 will now be briefly given. Essentially data flow through the terminal is shown in Fig. 1 and operates as follows. First assume that a voice mode has been selected. For a voice mode the handset 13 signal is digitized by means of the input/output device 11 which essentially contains an 8.0 kHz Codec and this digital information is sent to the voice processor unit 12 for rate reduction to 2400 bits per second or according to a 400 bit per second algorithm. The output signal from the voice processor 12 is coupled to the modem 14 where it is encrypted and passed to the modem processor module 30. The encrypted signal is encoded, modulated and filtered by the modem processors 15 and 17 before it is sent to the I/O device 16. The I/O device 16 operates to convert the digital signal to an analog signal by the use of a D/A converter which is performed by a 7.2 kHz Codec. The analog signal is then coupled to the external radio 18 where it is transmitted. On the receiver end the radio 18 acquires synchronization and sends the audio signal to the I/O device 16 for processing. This audio signal is digitized by the I/O device and passed to modem processor 15 and modem processor 17 where it is demodulated and decoded. The decoded data are sent to the modem 14 for decryption and then to the voice processor 12 where the compressed voice is restored to full rate. The full date rate is then converted by means of a digital to analog converter by the codec contained in the I/O device 11 and then sent to the handset 13 for the listener to respond to. As will be explained, in circumstances where jamming is not a threat, terminal non-hopping modes can be selected and configured with a corresponding non-hopping modem. In is manner the entire function of the modem 14 is bypassed and voice data, which is digitized by the input/output device 11, is passed to the modem processor where it is then converted to analog information by input/output device 16 and transmitted directly by the radio transceiver 18. As will be explained, the present system utilizes an anti-jamming technique where either of the above-described hopping modes can be selected and configured with a corresponding hopping radio depending upon the nature of the threat. The system, as shown generally in Fig. 1, employs many of the same components and subsystems as shown and completely described in the above-noted co-pending application US-A-4,761,796. As will be further explained, the signal processing in a modem subsystem 30 can be described by two different sets of algorithm. The high data rate (HDR) algorithms are used when the date rates are 2400 bits per second. These algorithms are used when the frequency hopping rate is slow. These algorithms, as will be explained, are similar to those described in the above-noted co-pending application. The difference between the algorithms employed according to this invention will be described below. The low data rate (LDR) algorithms are used when the data rates are 400 bits per second. The LDR algorithms are used when the frequency hopping rate is fast. As will be explained, the modem subsystem 30 processes data separately during each frequency hop. The data transmitted during one frequency hop is called a packet. The packet formats for the two modes of operation are shown in Fig. 2. Referring to Fig. 2A there is shown the packet format for the high data rate (HDR) mode. As seen, an idle time during which no signal is transmitted is provided between each packet to allow the HF radio time to switch to a new frequency. The packet in the HDR mode is divided into blocks of PN training symbols, T 0 .., to T s and blocks of data symbols D 1 ... to D 5 . Each data block is short relative to the fading rate of the HF channel so that the channel impulse response does not change appreciably during a block. The duration of the training blocks is greater than the duration of the expected multipath spread. Referring to Fig. 2B, there is shown the packet format for the LDR mode or the low data rate mode. Essentially, as one can see from Fig. 2B, data is separated by idle time. During a data interval the first portion of the data interval is designated as a guard interval while the second portion is a DFT integration interval where DFT stand for Discrete Fourier Transform. This transform is employed by the system to implement operation as will be explained. Referring to Fig. 3 there is shown the algorithm for the transmitter function for the HDR mode. A difference between this algorithm and the algorithms contained in the above-noted US-A-4,761,796 is that a randomized PN training signal indicated by module 39 is used such that it is different for each and every frequency hop. This is done to make the system harder to jam. The interleave buffer 32 is coupled to the input of an 8 PSK symbol encoder which phase shift key modulates the data symbols and the output of the encoder 33 is coupled to the transmit filter 34 (TX) which serves to filter the encoded symbols. The symbol encoder 33 is operated on by the pseudo noise training signal module 39. The output of the transmit shaping filter 34 is applied to a multiplier 35 which takes the symbol output from the filter 34, which is at a sample rate of 7200 Hz, and multiplies the symbols by an exponential function, as indicated in the figure where fc equals 1800. The output of the multiplier is sent to a sample buffer 36 whereby the samples of buffer 36 are converted to analog signals in the digital to analog converter 37. This digital to analog converter 37 operates at a 7200 Hz sampling rate to provide the analog transmit signal which is the signal coupled to the radio transceiver 18 and transmitted via antenna 19. It is of course understood that the modules contained in Fig. 3 are implemented by means of the modem A processor 15 and the modem B processor 17 of Fig. 1. These processors, as will be further explained, operate in conjunction with one another and modem B processor 17 operates to exchange data and control signals with the modem A processor 15. The digital to analog converter 37 is contained in the input/output module 16 of Fig. 1 which is coupled to the modem A processor 15 and modem B processor 17. Essentially, as shown in Fig. 3, the convolutional encoder 31 operates on the 2400 bit per second input which is obtained from the output of the modem 14 of Fig. 1 and operates according to a fixed coefficient K to multiply the effective bit rate by 3/2 to obtain a 3600 bits per second signal at the output. The function of the convolution encoder is to essentially scramble the bits to insure randomness over a packet interval. The interleave buffer 32 contains an interleaving algorithm which is implemented by the modem A processor. The PSK encoder 33 modulates the output data from the interleave buffer into a phase shift key signal which is then operated on by a randomized PN training signal 39 which is stored in the modem processor. The PN training signal as stored is a block of known PN training signals. The filter characteristics of filter 34 are chosen to limit the peak to RMS (root mean square) power ratio of the transmitted signal to less than 2 dB and to restrict the bandwidth of the transmitted signal. The filter impulse response is given by the following expression: h(k) = sin (πkb) · cos (πakb) πkb·[1-(2akb) 2 ] k is the sample index a is a constant between 0 and 1 b is a constant related to the product of the sampling interval and the filter 3 db bandwidth. The complete operating details for the filter are described in the co-pending application. The algorithm for the receiving function in the HDR mode is shown in Fig. 4. The main difference between this algorithm and that of the previous invention is the means for making the HF channel impulse response estimate, the precanceller 46 and the algorithm for calculating the equalizer coefficients and for performing equalization. The other algorithms in the receiver, which are the same as in the previous co-pending application, are the analytic filter 43 which generates a complex form of the receive signal, the matched filter 48, which minimizes the effect of noise, the decision feedback filter 53, the de-interleave buffer 55, and the Viterbi decoder 56. The channel estimate algorithm uses the blocks of known PN training symbols to make an initial estimate of the HF channel impulse response and to update this estimate during the packet. The estimate used to calculate the matched filter and equalizer parameters for data block D k uses training blocks T 0 ..., T k (Fig. 2). A least squares algorithm is used to estimate the channel impulse response based on observations of the channel output in response to a known training sequence as channel input. Let M be the maximum number of symbols duration of the channel impulse response and N+M be the number of training symbols in a training block. The received signal at 2400 Hz is converted to a digital signal by the A/D converter 40 which is sampled at 7200 Hz or at three times the input data rate. The receive signal is sampled at three times the symbol rate, that is, there are three channel output samples for every input symbol. The output bits of A/D converter 40 are stored in buffer 41 and are scaled accordingly by scaling module 42 to provide 3 samples for each input symbol. The unknown channel impulse response is denoted h' j' , j'=0, 3M-1, and the channel output by y' n ., n'=0, ..., 3(N+M)-1. The channel output which is observed is: That is, the observation samples y' n' , are not necessarily just the ideal response of the channel impulse response to the training sequence. The channel impulse response samples can be grouped into three sets as follows: h (0) = (h' 0 ,h' 3 ,h' 6 , ...) h (1) = (h' 1 ,h' 4 ,h' 7 ,...) h (2) = (h' 2 ,h' 5 ,h' 8 , ...) and similarly for y' n' , Specifically, we set h j (v) = h' 3j+v ,j=0, ..., M-1, and v = 0, 1, 2 and similarly for y n (v) The reason for this grouping is that the estimate for each group is independent of the other groups. The algorithm is applied three times to each group v separately. The algorithm makes an estimate, w j (v) , j=0 ..., M-1, of the unknown channel impulse response given these possibly noisy samples of the channel output. The covariance matrix and cross-correlation vector used to make the estimate for data block D k are defined as where the bar denotes complex conjugate, 0<pw<1 and the summations are over the last N symbols in the training block T k . R ji (k) and Qi1 (v,k) are zero for k<0. These quantities are used in the normal equations The normal equations are a set of M linear, simultaneous equations which are solved for each v separately to give the estimate w j (v) used to calculate the matched filter 48 and equalizer parameters for data block D k . A Choleski decomposition algorithm is used for this solution. The decision feedback equalization algorithm processes each data block independently. For each symbol decision, via module 54, the intersymbol interference due to two sets of known symbols are cancelled. This is accomplished by the pre-canceller 46 and feedback filter 53 using the canceller coefficients 52. The coefficients 52 are applied to convolution with canceller module 49. The convolution module 49 has the output coupled to a long division module 50 which receives an input from autocorrelation module 51 which also supplies an input to canceller coefficient module 52. The module 49 and the long division module 50 perform an equalizer function. The cancelled symbols are symbols previous to the present data symbol and symbols which follow the present symbol. Previous known symbols can be either training symbols or data symbols already decided. These are cancelled by the feedback canceller in module 49. Intersymbol interference due to data symbols which follow the present data symbol is minimized by the equalizer of modules 49 and 50. The known symbols which follow the present data symbol are the training symbols in the training block immediately following the present data block. These are cancelled by the pre-canceller 46. The pre-canceller 46 uses cancellation prior to the matched filter 48 and equalizer and allows the receive samples to be separated into blocks for independent processing. This, in turn, allows the use of the long division equalizer algorithm discussed below. Fig. 5 illustrates the pre-cancellation algorithm. The first figure A shows the present data block of K symbols, M known "guard" (training) symbols and subsequent data (or training) symbols. The pre-cancellation algorithm removes the effect on the receive samples of both the guard and subsequent data symbols. The result is as if nothing follows the present transmitted data block. The second diagram B illustrates the channel impulse response. The channel output, shown in C, is the result of convolving this impulse response with the transmit symbols. The channel response causes the present data block to be spread out to cover K+M symbol intervals. In addition, it causes response due to the guard symbols to overlap the last M symbol intervals. The pre-canceller 46 generates this overlapping response by convolving the known guard symbols with the channel estimate and substracting it from the receive samples. This removes the effect of the guard symbols from the M overlapping symbol intervals. The receive samples beyond these overlapping smybols are zeroed. The result is a block of 3(K+M) receive samples which are passed through the matched filter 48. The decision feedback filter 53 is initialized with the M known training symbols immediately prior to the present data block. In this way, their intersymbol interference is cancelled from the beginning of the present data block. Thus, the receive samples due to the present block of data symbols are isolated for subsequent processing by the matched filter and equalizer. In the previous invention, the equalizer was a feedforward transversal filter with K taps. The transfer function of this filter can be written as The processing is on stored blocks of data so that even though this transfer function is of an anti-causal filter, it is realizable in the modem application. Thus, G(z) is a finite polynomial in z with K non-zero coefficients. In the previous invention, the filter coefficients were obtained by solving a set of K linear equations. These equations will now be expressed in the form M(z) G(z) = C(z) where M(z) is the z-transform of the autocorrelation function of the estimated channel impulse response. Since the channel impulse response is limited to M symbols duration, M(z) is also a finite polynomial with 2M-1 non-zero coefficients in the range of Z -(M-1) to 3 (M-1) . The coefficient of z k is the complex conjugate of the coefficient of z -k . C(z) is a finite polynomial with non-zero coefficients in the range of z -(m-1) to z (m+k-2) . The linear equations in the previous invention served to constrain the coefficients of C(z) in the range z° to z K-1 ; the coefficient of z 0 being 1 and the others 0. The remaining coefficients represent the canceller coefficients. The coefficients of z -1 to z -(M-1) are the coefficients of the decision feedback filter. The coefficients of z K to z K+M-2 are the coefficients of a feedforward canceller filter which is not needed because its function is performed by the pre-canceller. Instead of using the feedforward equalizer G(z), the present invention uses a long division algorithm based on the representation G(z) = C(z) M(z) . In this algorithm the output of the matched filter 48 and T sampler switch (T sampling) is first convolved with the coefficients of C(z). Then the result is divided by the polynomial M(z). This has significant processing advantage when the length of the data block K is relatively long compared with the duration of the maximum multipath spread M. Instead of solving a set of linear equations of large order, K, a recursion for C(z) involving only 2M-1 non-zero coefficients is used. Similarly, instead of the equalizer filter of length K, convolution with the 2M-1 coefficients of C(z) and division by the 2M-1 coefficients of M(z) is used. The recursion for the canceller polynomial is D m (z) = D m-1 (z) - k m z -m D m-1 (1/z) C m (z) = C m-1 (z) + h m z m D m (z) where D m (z) is an auxiliary polynomial. Initially, D 0 (z)=M(z), C 0 (z)=h 0 M(z) and h 0 =1/M 0 . Then the recursion is repeated for m=1, ..., K-1 finally giving C(z)=C K-1 (z). It has already been noted that C m (z) has only 2M-1 non-zero coefficients of which the coefficient of z 0 is unity. The coefficients of (z m ..., z) are constrained to be zero by the recursion. Similarly, D m (z) also has only 2M-1 non-zero coefficients of which the coefficient of z M-1 is M M-1 and the coefficients of (z -1 , ..., z -m ) are constrained to be zero by the recursion. Thus, the recursions for C m (z) and D m (z) require only 4(M-1) coefficient updates per iteration. Additional equations used with the recursion are k m = d m (m-1) d o (m-1) , h m = -c -m (m-1) d 0 (m) where c k (m) and d k (m) are the coefficients of z -k in the polynomials C m (z) and D m (z), respectively. The algorithm and functional data flow for the transmitter functions of the modem subsystem operation in the LDR mode is shown in Fig. 6. In this mode of operation the input data rate is 400 bits per second. These data bits are encoded by the rate 2/3 Reed-Solomon (RS) error correction coder 60 to give 600 bits per second in the form of 6 bit groups, each group corresponding to a RS codeword symbol. Prior to sending data symbols, a sequence of eigth known PN symbols are transmitted to allow the receiver to make an initial Doppler frequency estimate. This is done via module 66 coupled to symbol encoder 61. Each 6 bit symbol is transmitted as a different frequency hopping packet. This gives the system a form of diversity which minimizes the effect of fading on the HF channel. Since each symbol is on a different frequency, it fades independently of the other symbols in a 63 symbol RS codeword. The code has a 21 symbol redundancy which means that up to 10 symbols can fade without causing a decoding error. The transmitter uses a Discrete Fourier Transform (DFT) 62 to generate 24 tone slots spaced by 150 Hz. The tone map function selects 2 tone frequencies out of 12 of these tone slots which may be used for a transmit signal. There are 66 such combinations possible of which only 64 are needed for a 6 bit symbol. The functional flow and algorithm for the receiver functions in the LDR mode of operation is shown in Fig. 7. A DFT 70 is used to measure the complex amplitude of receive tones in the 12 tone slots. Doppler correction 71 of the receive signal is provided to ensure that the receive tones are properly centered in their tone slots. This is accomplished by providing a Doppler estimate in module 77 by comparing the output of the DFT 70 whith the detected symbols from module 72 to arrive at an error signal used to compensate the input signals to the DFT 70 via the Doppler correction 71. Symbol detection 72 is done by determining the two tone slots which have the greatest receive energy, i.e., have the greatest magnitude. This form of incoherent detection does not require any training and is independent for each frequency hop. The RS decoding 73 provides protection against fading and jamming of some of the symbols in a codeword. The packet format provides for a guard interval before the samples are processed by the DFT 70. This interval is greater than the expected multipath duration so that the tone signals settle to a steady state before the DFT operation. This provides the system with immunity to multipath spread of the HF channel. In addition, the symbol duration is very short with this fast frequency hopping mode so that the system is not affected by fading rated normally experienced on a HF channel. The receive samples for each packet are stored in the receive sample buffer 74. The packet boundaries are determined by the frequency hopping clock from the HF radio. The modem uses a further timing estimate of the position of the receive data baud within this buffer. This is done by scaling the received samples in module 75 and using a baud sync tracking module 76 for control of the receive sample buffer 74. This is necessary to properly position the DFT integration window to follow the multipath guard interval and to track any drift in the HF radio clock. As shown in Fig. 8, this function uses early and late windows at the edges of the Rx baud. The window positions selected are at the beginning and end of the expected baud position in the receive sample buffer. The sum of the squares of the receive samples within the early and late windows, respectively, are accumulated. The output timing error estimate is the difference between these two energies. This estimate is accumulated in a register which is monitored on each baud. If the accumulated timing error becomes too large or too small, the pointer to the DFT window within the receive sample buffer is decremented or incremented and the corresponding correction made to the accumulated timing eror. The Doppler acquisition function uses the first eight known transmitted symbols to make an initial estimate of the Doppler frequency offset of the receive signal. During these receive symbols, this function updates the tone slot energies low, center, and high. These are averages of the energies in the two expected tone slots (center), the tones slotes below the expected tone slots (low) and the tones slots above the expected tone slots (high). These energies are used to compute the initial estimate of the Doppler frequency error. In this computation, it is first necessary to determine whether the low or high energy is greater. If the low energy is greater than the high, then the sign of the frequency estimate is negative. Otherwise it is positive. The frequency estimate depends on the energy ratio z=B/A, where A is the center energy and B is greater of the low or high energies. An exact formula for the frequency estimate is freq = 150 b a+b where, a = √A and b = √B. This formula is only exact when the additive noise is zero. When noise is present, the formula is still quite accurate for large frequency offsets, i.e., 30 to 75 Hz. However, the accuracy deteriorates for small frequency offsets and is extremely sensitive to small noise errors at zero frequency offset. These errors are not too serious because the symbol detection is not sensitive to frequency offsets below about 30 Hz. A modification of the exact formula is used for values of z less than 1/8. This is to make it less sensitive to noise at small frequency offsets. The formula is: freq = 150 (3.65413z - 12.51599z 2 ). The Doppler frequency offset in the receive signal is compensated for with a Doppler correction operation using an estimated Doppler frequency. Following symbol detection, the known tone sequence is used with the receive tone amplitudes to estimate the residual frequency error after Doppler comection. The error signal is used in a feedback loop to correct the estimated Doppler frequency (Fig. 9). A loop filter is used to give a second order loop response. The receive tone amplitudes are used by the symbol detection function to determine the two tones with the largest amplitude. This determines the receive symbol and also an array itones which is for use in estimating the residual Doppler error. This array has a one in the two locations corresponding to the largest receive tones and zeros otherwise. The Doppler estimate function uses the actual receive tone amplitudes and the itones array. The discrete Fourier transform determines the complex amplitude in each of 24 tone slots. However, due to its finite time window, the equivalent response of each tone slot has a sin(x) x characteristic. This causes significant sidelobes in the raw tone amplitudes. These sidelobes are reduced and the tone slot width is broadened in the subroutine by a Hanning operation. This convolves the complex tone amplitudes with the sequence (.5, 1, .5). Since the tones are not coherent, it is necessary to use their energies in measuring the frequency error with respect to their nominal locations in the center of each tone slot. This is done by computing a low and a high energy and the resulting residual frequency error estimate is the difference between these two energies. The low energy is the sum of the energies in the two slots just below the slots indicated by itones and similarly for the high energy. The frequency estimate freq is made by a feedback loop in which the estimate is corrected by the Doppler error signal. One way of doing this is to accumulate the error signal derr to give said frequency estimate freq. However, this results in a first order loop which has a sluggish response to a frequency error. The figure shows the loop filter which gives a second order response. FIG. 10 is a more detailed diagram of the modem subsystem 1. A pair of TMS320C25 digital signal processor devices are used to implement the above signal processing algorithms. The processing algorithms are divided between the two processors, DSP1 and DSP2. DSP1 is the modem A processor 15 of FIG. 1 and DSP2 is the modem B processor. The hardware provides effective communication between the two processors and the I/O 16. This is accomplished using the TMS320C25 serial ports, supplemented with extra control circuitry. The serials ports of DSP1 and DSP2 are used in a time multiplexed fashion. FIG. 11 is a block diagram of the LDR functions in the transmit mode in the voice subsystem 1. The low rate coding algorithms are implemented in a postprocessing to the standard LPC analysis. The unquantized reflection coefficients, pitch, gain and voicing parameters from LPC are compressed and formatted into a 400 bits per second data signal. Decode and VQXMT form an interface function which obtains the pitch and gain parameters produced by the LPC analysis and formats them for input to the low rate processing. The trellis coder performs a lookahead search to find the optimal bit sequence to encode the pitch and gain information. EXXMT is a two-word array containing the trellis coder output symbols, delayed relative to the input. The buffering and bit mapping function delays the 400 bits per second parameters as required to maintain synchronization, formats them into a bit stream and writes the stream into an output buffer. FIG. 12 illustrates the vector quantizing function applied to the reflection coefficients. The input to the RC2R function is the set of 10 reflection coefficients computed using a step-up procedure which is a modification of the Levinson recursion. The coefficients are sent to the vector quantizer which implements a tree search with a split voiced/unvoiced codebook. For voiced frames, a comparison is made against 31 reference vectors, then a second level search is made against a block of 31 vectors. For unvoiced frames, a single search of 32 reference vectors is used. The frame repeat function then determines the state of the frame repeat bit for each repeated frame which is passed to the buffering and bit mapping function. A one frame delay is produced. FIG. 13 is a block diagram of the LDR receive voice algorithm. The bit unmapping and frame repeat functions accept as input a block of 18 bits and decodes them into parameters for two LPC frames. The first of these two frames is always a repeat frame. A modulo 2 count is maintained. If the count is zero, a block of 18 bits is read, the LPC parameters for the repeat frame are generated and the non-repeat values are stored until the next frame. If the count is one, the stored non-repeat values are used to generate the LPC parameters. The vector table lookup converts vector quantization values back to the LPC compatible reflection coefficients while the trellis decoder performs the same function for pitch and gain parameters. Reflection coefficients, pitch and gain parameters are then properly formatted for input to the LPC synthesis function.

Claims: High frequency communication system of the type employing a high frequency terminal which terminal can transmit a processed signal in a transmitting mode or process a received signal in a receiving mode, which terminal includes a) a first subsystem (10) for voice processing including a processor (12) responsive to voice signals to provide a linear predictive coded voice signal at a given data rate, which signal is coupled to b) a data modem subsystem (20) to digitally encrypt said voice signal; c) said data modem subsystem (20) being coupled to a modem processor subsystem (30) capable of processing said encrypted signal for providing frequency hopping, feedback equalization, intersymbol interference cancellation, error correction and interleaving to provide a transmitted signal which is relatively immune to jamming during said transmitting mode, the modem processor subsystem (30) comprising an interleave buffer (32), a source (39) of pseudo noise training signals, a transmitting filter means (34), and a digital-to-analog-converter means (37), the communication system being characterized by d) a convolutional encoder means (31) included in said modem processor subsystem (30) and responsive to said encrypted signal to provide, at an output line of the convolutional encoder means (31), a convoluted signal at a higher data rate than said encrypted signal; e) said interleave buffer (32) having an input coupled to the output line of said convolutional encoder means (31) for interleaving said higher data rate signal according to an interleaving algorithm; and by f) a symbol encoder (33) having a first input responsive to said interleaved signal and a second input coupled to said source (39) of pseudo noise training signals to provide at an output line of the symbol encoder (33) an encoded signal encoded according to said pseudo noise training signal which pseudo noise training signal differs for each transmitting frequency; g) said transmitting filter means (34) being responsive to said encoded signal on said output line of said symbol encoder (33) and operative to limit the bandwidth of said signal; h) said digital-to-analog-converter-means (37) being coupled to the output line of said transmitting filter means (34). High frequency communication system according to claim 1, characterized in that said transmitting filter means (34) includes a multiplier (35) for multiplying said filtered signal by an exponential function and buffer means (36) for storing said multiplied signal prior to application of said signal to said digital-to-analog converter means (37). High frequency communication system according to claim 1 or 2, characterized further by equalization means located in said modem processor subsystem (30) and operative to improve equalization during said receiving mode, comprising: a) channel estimate means (45) responsive to known pseudo noise training signal blocks (47) to provide at an output line an estimate of the received channel response; said estimate implemented by a least squares algorithm means in response to said known pseudo noise training signal blocks (47) to provide said estimate for a given received data block; b) precancellation means (46) responsive to said estimate for separating data into predetermined blocks of data; c) matched filter means (48) coupled to said precancellation means (46) and responsive to said blocks of data for sampling of said blocks of data at a given rate; d) convolution means (49) coupled to said matched filter means (48) and having an output line coupled to means (50) for performing a long division to provide at said output line of said long division means (50) equalization to said data blocks according to G(z) = C(z) M(z) where G(z) is a feed forward equalizer transfer function and is a finite polynominal with K non zero coefficients; C(z) is a finite polynomial with non zero coefficients; M(z) is a finite polynomial and is the Z transform of the autocorrelation function of said estimated channel response. High frequency communication system according to claim 3, characterized in that said estimated channel response is limited to M symbols and wherein M(z) has 2M-1 non-zero coefficients in the range of z -(M-1) to z (M-1). High frequency communication system according to claim 4, characterized in that C(z) has 2m-1 non-zero coefficients in the range z -(M-1) to z (M+K-2) where K is a constant. High frequency communication system according to any of claims 3 to 5, characterized in that said convolution means (49) includes canceller means for providing a recursion canceller polynomial according to: D m (z) = D m-1 (z) - k m z -m D m-1 (1/z) C m (z)= C m-1 (z) + h m z m D m (z) where D m (z) is an auxiliary polynomial; initially, D 0 (z)=M(z), C 0 (z)=h 0 M(z) and h 0 =1/M 0 ; then the recursion is repeated for m=1 ..., K-1 finally giving C(z)=C K-1 (z). High frequency communication system according to claim 6, characterized in that the following equations are also employed with said recursion: k m = d (m-1) m d (m-1) 0 and h m = -c (m-1) -m d (m) 0 High frequency communication system according to any of claims 3 to 7, characterized in that said least squares algorithm means estimates said channel impulse response based on observations of a channel output in response to said known pseudo noise training signal blocks (47) according to n' = 3 M, ..., 3N + 3M-1 h' j' = unknown channel response; M = maximum number of symbols duration of the channel impulse response; N+M= number of pseudo noise training signals in a pseudo noise training block (47). High frequency communication system according to claim 8, characterized in that it includes three sets of channel impulse responses for providing said response according to h (0) = (h' 0 , h' 3 , h' 6 , ...) h (1) = (h' 1 , h' 4 , h' 7 , ...) h (2) = (h' 2 , h' 5 , h' 8 , ...). High frequency communication system according to any of claims 1 to 9, further characterized by a) low data rate transmitting means located in said modem processor subsystem (30) and operative to provide an input data rate of 400 bits per second; b) encoding means including discrete Fourier transform means (62) responsive to said input data to encode said data in the form of 6-bit-groups and means for transmitting each of said 6-bit-groups at a different frequency. High frequency communication system according to claim 10, characterized by means (66) operative in said transmitting mode to transmit a sequence of eight known pseudo noise training signals prior to transmitting data. High frequency communication system according to claim 10 or 11, characterized by Doppler estimation and correction means (70, 71, 72, 77) responsive in the receiving mode for receiving said known pseudo noise training signal blocks (47) to provide therefrom a Doppler frequency estimate indicative of the quality of the transmission path. High frequency communication system according to claim 12, characterized by a) a low data rate receiving means located in said modem processor subsystem (30) and including discrete Fourier transform means (70) for measuring the amplitudes of received tones in a plurality of time slots; b) said Doppler correction means (71) coupled to the input of said discrete Fourier transform means (70) to position said received tones in said slots according to the Doppler characteristics of said transmission path; c) storage means (74) for storing said received tones; d) data boundary means coupled to said storage means (74) to determine data boundaries for said received tones; and e) decoder means (73) coupled to said Doppler estimation and correction means (70,71,72,77) for providing a decoded output signal. High frequency communication system according to claim 12 or 13, characterized in that said discrete Fourier transform means (70) is operative to generate 24 tone slots each spaced by 150 Hz. High frequency communication system according to any of claims 12 to 14, further characterized by tone map function means included in said discrete Fourier transform means (70) for selecting two slots out of 12 slots which are used for a transmitted signal. High frequency communication system according to claim 13, characterized in that said discrete Fourier transform means (70) in said receiving means operates to measure amplitude of received tones in 12 tone slots. High frequency communication system according to claim 16, characterized by symbol detection means (72) responsive to said 12 tone slots to measure the receive energy related to said slots and to select 2 slots having the largest receive energy. High frequency communication system according to any of claims 13 to 17 including means for accumulating the squares of receive samples within first and second time slots to provide an output timing error estimate indicative of the differences between received energy and means for storing said estimate wherein if said stored estimate is greater than a given number said first and second time slots are changed accordingly. High frequency communication system according to any of claims 1 to 18, characterized in that said modem processor subsystem (30) includes first (15) and second (17) processor modules with said first processor module (15) coupled to said data modem subsystem (20) and said second processor module (17) coupled to said first processor module (15) to exchange data and control information therewith. High frequency communication system according to any of claims 3 to 19, characterized in that said modem processor subsystem (30) includes analog-to-digital-conversion means (40) operative in said receiving mode to convert received analog data to digital data. High frequency communication system according to claim 20, characterized in that said analog-to-digital-conversion means (40) performs sampling at a rate at least 3 times greater than said received data rate.

Inventors: DUNN JAMES G, LAGER BRUCE, MCCRADY DENNIS, DUNN, JAMES G., LAGER, BRUCE, MCCRADY, DENNIS
Applicants: INT STANDARD ELECTRIC CORP, INTERNATIONAL STANDARD ELECTRIC CORPORATION
Application year: 1989
Main classification: H04B1
IPC codes: H04B1, H04K3