WO2023213962A1 - Continuous phase modulation receiver - Google Patents
Continuous phase modulation receiver Download PDFInfo
- Publication number
- WO2023213962A1 WO2023213962A1 PCT/EP2023/061836 EP2023061836W WO2023213962A1 WO 2023213962 A1 WO2023213962 A1 WO 2023213962A1 EP 2023061836 W EP2023061836 W EP 2023061836W WO 2023213962 A1 WO2023213962 A1 WO 2023213962A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- cpm
- channel
- output
- signal
- soft
- Prior art date
Links
- 239000002243 precursor Substances 0.000 claims abstract description 4
- 238000000034 method Methods 0.000 claims description 22
- 239000000654 additive Substances 0.000 claims description 3
- 230000000996 additive effect Effects 0.000 claims description 3
- URWAJWIAIPFPJE-YFMIWBNJSA-N sisomycin Chemical compound O1C[C@@](O)(C)[C@H](NC)[C@@H](O)[C@H]1O[C@@H]1[C@@H](O)[C@H](O[C@@H]2[C@@H](CC=C(CN)O2)N)[C@@H](N)C[C@H]1N URWAJWIAIPFPJE-YFMIWBNJSA-N 0.000 abstract 5
- 239000011159 matrix material Substances 0.000 description 19
- 230000004044 response Effects 0.000 description 13
- 239000013598 vector Substances 0.000 description 11
- 238000005094 computer simulation Methods 0.000 description 10
- 230000000875 corresponding effect Effects 0.000 description 10
- 238000005070 sampling Methods 0.000 description 7
- 238000012549 training Methods 0.000 description 7
- 238000004891 communication Methods 0.000 description 6
- 230000008901 benefit Effects 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000003595 spectral effect Effects 0.000 description 4
- 238000013459 approach Methods 0.000 description 3
- 238000000354 decomposition reaction Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000008030 elimination Effects 0.000 description 3
- 238000003379 elimination reaction Methods 0.000 description 3
- 238000012804 iterative process Methods 0.000 description 3
- 230000011664 signaling Effects 0.000 description 3
- 108010074864 Factor XI Proteins 0.000 description 2
- 238000005311 autocorrelation function Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 230000015556 catabolic process Effects 0.000 description 2
- 238000012937 correction Methods 0.000 description 2
- 238000001914 filtration Methods 0.000 description 2
- 238000010606 normalization Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000002301 combined effect Effects 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 230000006735 deficit Effects 0.000 description 1
- 238000006731 degradation reaction Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000010363 phase shift Effects 0.000 description 1
- 230000001902 propagating effect Effects 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
- 230000017105 transposition Effects 0.000 description 1
- 230000003245 working effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
- H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
- H04L25/03006—Arrangements for removing intersymbol interference
- H04L25/03012—Arrangements for removing intersymbol interference operating in the time domain
- H04L25/03019—Arrangements for removing intersymbol interference operating in the time domain adaptive, i.e. capable of adjustment during data reception
- H04L25/03057—Arrangements for removing intersymbol interference operating in the time domain adaptive, i.e. capable of adjustment during data reception with a recursive structure
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/18—Phase-modulated carrier systems, i.e. using phase-shift keying
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
- H04L25/0202—Channel estimation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
- H04L25/0202—Channel estimation
- H04L25/0204—Channel estimation of multiple channels
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
- H04L25/0202—Channel estimation
- H04L25/0212—Channel estimation of impulse response
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
- H04L25/0202—Channel estimation
- H04L25/0224—Channel estimation using sounding signals
- H04L25/0228—Channel estimation using sounding signals with direct estimation from sounding signals
- H04L25/023—Channel estimation using sounding signals with direct estimation from sounding signals with extension to other symbols
- H04L25/0236—Channel estimation using sounding signals with direct estimation from sounding signals with extension to other symbols using estimation of the other symbols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
- H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
- H04L25/03006—Arrangements for removing intersymbol interference
- H04L25/03178—Arrangements involving sequence estimation techniques
- H04L25/03248—Arrangements for operating in conjunction with other apparatus
- H04L25/03254—Operation with other circuitry for removing intersymbol interference
- H04L25/03267—Operation with other circuitry for removing intersymbol interference with decision feedback equalisers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
- H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
- H04L25/03006—Arrangements for removing intersymbol interference
- H04L25/03178—Arrangements involving sequence estimation techniques
- H04L25/03248—Arrangements for operating in conjunction with other apparatus
- H04L25/03292—Arrangements for operating in conjunction with other apparatus with channel estimation circuitry
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
- H04L25/03—Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
- H04L25/03006—Arrangements for removing intersymbol interference
- H04L25/03178—Arrangements involving sequence estimation techniques
- H04L25/03312—Arrangements specific to the provision of output signals
- H04L25/03318—Provision of soft decisions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/18—Phase-modulated carrier systems, i.e. using phase-shift keying
- H04L27/20—Modulator circuits; Transmitter circuits
- H04L27/2003—Modulator circuits; Transmitter circuits for continuous phase modulation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/18—Phase-modulated carrier systems, i.e. using phase-shift keying
- H04L27/22—Demodulator circuits; Receiver circuits
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/18—Phase-modulated carrier systems, i.e. using phase-shift keying
- H04L27/22—Demodulator circuits; Receiver circuits
- H04L27/233—Demodulator circuits; Receiver circuits using non-coherent demodulation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/18—Phase-modulated carrier systems, i.e. using phase-shift keying
- H04L27/22—Demodulator circuits; Receiver circuits
- H04L27/233—Demodulator circuits; Receiver circuits using non-coherent demodulation
- H04L27/2331—Demodulator circuits; Receiver circuits using non-coherent demodulation wherein the received signal is demodulated using one or more delayed versions of itself
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/18—Phase-modulated carrier systems, i.e. using phase-shift keying
- H04L27/22—Demodulator circuits; Receiver circuits
- H04L27/233—Demodulator circuits; Receiver circuits using non-coherent demodulation
- H04L27/2332—Demodulator circuits; Receiver circuits using non-coherent demodulation using a non-coherent carrier
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L27/00—Modulated-carrier systems
- H04L27/18—Phase-modulated carrier systems, i.e. using phase-shift keying
- H04L27/22—Demodulator circuits; Receiver circuits
- H04L27/233—Demodulator circuits; Receiver circuits using non-coherent demodulation
- H04L27/2334—Demodulator circuits; Receiver circuits using non-coherent demodulation using filters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2201/00—Algorithms used for the adjustment of time-domain equalizers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2201/00—Algorithms used for the adjustment of time-domain equalizers
- H04L2201/02—Algorithms used for the adjustment of time-domain equalizers minimizing an error signal, e.g. least squares, minimum square error
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2201/00—Algorithms used for the adjustment of time-domain equalizers
- H04L2201/06—Algorithms used for the adjustment of time-domain equalizers using the output of a maximum likelihood decoder (Viterbi detector)
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2201/00—Algorithms used for the adjustment of time-domain equalizers
- H04L2201/08—Algorithms not covered by groups H04L2201/02 - H04L2201/06
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L25/00—Baseband systems
- H04L25/02—Details ; arrangements for supplying electrical power along data transmission lines
- H04L25/0202—Channel estimation
- H04L25/024—Channel estimation channel estimation algorithms
- H04L25/025—Channel estimation channel estimation algorithms using least-mean-square [LMS] method
Definitions
- the present invention relates to a Continuous Phase Modulation (CPM) receiver, and more specifically to a CPM receiver for use in a scenario with multipath propagation.
- CPM Continuous Phase Modulation
- Continuous Phase Modulation (CPM) techniques are well known in digital communications as they offer good spectral and power efficiency properties.
- CPM In state-of-the-art CPM communication systems, CPM is typically used together with convolutional error-correcting codes and decoded iteratively via the so-called turbo-principle, where soft information (involving probabilities that a transmitted bit be 0 or 1 rather than hard decisions on the values of those bits) is exchanged between two component Soft-Input Soft-Output (SISO) decoders / demodulators.
- SISO Soft-Input Soft-Output
- the first CPM receiver 100 comprises a Soft-Input Soft-Output (SISO) demodulator 101, a de-interleaver 102, a Soft-Input Soft-Output (SISO) decoder 103, an interleaver 104, a signal input 105 and a signal output 106.
- SISO Soft-Input Soft-Output
- Multipath propagation a phenomenon that results in radio signals propagating from a transmitting to a receiving antenna via two or more paths due e.g. to terrain, often creates challenges for wireless communication systems. For example, in Norwegian terrain, multipath delay spreads of ⁇ 50 ⁇ s in 30-1000 MHz range are common. The multipath arrivals combine at the receiving antenna in different ways, leading to a resultant signal which can vary widely in amplitude and phase. Waveform and receiver design must therefore take multipath propagation into account.
- An exemplary technical background publication is US 2002034264 A1.
- a channel equalizer 207 is provided in front of a second CPM receiver 200 similar to the first CPM receiver 100.
- the second CPM receiver 200 comprises a Soft-Input Soft-Output (SISO) demodulator 201, a de -interleaver 202, a Soft-Input Soft-Output (SISO) decoder 203, an interleaver 204, a signal input 205 and a signal output 206.
- the channel equalizer 207 addresses the complexity problem in the presence of multipath propagation. It compensates for the effects of multipath propagation and outputs an approximately multipath-free equalized signal 205. Since the second CPM receiver 200 experiences little or no multipath propagation, the second CPM receiver 200 may be implemented as a standard AWGN CPM receiver. The second CPM receiver 200 will in the following be referred to as an AWGN CPM receiver 200.
- CPM receivers with the structure of Fig. 2 have been considered in prior art, such as for instance in technical background documents KOCA M., DELI ⁇ H. Doubly Iterative Equalization of Continuous -Phase Modulation, IEEE Transactions on Communications, December 2007, DOI: 10.1109/TCOMM.2007.908550, and KOCA M., DELI ⁇ H. Double Turbo Equalization of Continuous Phase Modulation with Frequency Domain Processing, IEEE Transactions on Communications, March 2009, DOI: 10.1109/TCOMM.2009.02.060674.
- the proposed channel equalizers have been relatively simple, leading to CPM receivers with manageable complexity at the expense of a performance degradation in comparison to the first CPM receiver 100 where the SISO demodulator is based on a trellis with states. In other instances, the proposed equalizers were deemed too complex to be attractive.
- Frequency -domain equalization (FDE) is proposed in the above referred 2009 publication. Its major drawback is that it requires the addition of a cyclic prefix, which in the case of short dwells can drastically increase the pay load -to-overhead ratio.
- the invention relates to a Continuous Phase Modulation (CPM) receiver, comprising a channel estimator adapted to perform channel estimation based on a multipath channel input signal, wherein a first channel estimate is obtained using a pseudo-inverse (PINV) method and subsequent channel estimates are obtained using a least mean squares (EMS) or expectation -maximization (EM) algorithm, where the LMS or the EM estimation is adapted to receive soft input information from a first log -likelihood adder, a channel equalizer adapted to receive the multipath channel input signal, the channel estimates and soft information from a Soft-Input Soft-Output (SISO) CPM Demodulator and the first log-likelihood adder and output an equalized channel signal, an Additive White Gaussian Noise (AWGN) CPM receiver adapted to demodulate and decode the equalized channel signal from the channel equalizer, the AWGN CPM receiver comprising the Soft-Input Soft-Output (SISO) demodulator, a de-interleaver,
- CPM signal reconstructors ⁇ 1 and ⁇ 2 adapted to reconstruct a CPM signal sample j based on the soft information on CPM signal sample j, where for permitted values for a sample j with probabilities the reconstruction is either a soft reconstruction or a hard reconstruction a i with where the lowest value of i' is selected if the maximum is attained for more than one i', the feedback filter g 1 adapted to produce estimates for precursor inter - symbol interference (ISI) remaining in sample j of an output of the filter f based on the reconstructed samples (j + 1, j + 2, . . .
- ISI precursor inter - symbol interference
- the feedback filter g 2 adapted to produce estimates for postcursor ISI remaining in sample j of an output of the filter f, based on the reconstructed samples (..., j - 2,j — 1), and an adder (312) adapted to subtract the ISI estimates received from the filters g 1 and g 2 from the output of filter f, such as to output the equalized signal 305.
- the first log -likelihood adder may provide the soft information to the channel estimator and the CPM signal reconstructors ⁇ 1 and ⁇ 2 at iteration n based on a-priori log-likelihood information from a first correlation bank and scaling (CB+S) block, the CB+S block comprising a correlator bank (CB) followed by multiplicative scaling (S), in the SISO demodulator at turbo iteration n — 1 and extrinsic log-likelihood information from the SISO demodulator output at turbo iteration n — 1.
- CB+S correlator bank
- S multiplicative scaling
- the equalizer may comprise a second log -likelihood adder and a second correlation bank and scaling block comprising a correlator bank (CB) followed by multiplicative scaling (S) provided at the adder output, wherein the first log-likelihood adder provides soft information to the channel estimator and the CPM signal reconstructor ⁇ 1 at iteration n based on the a-priori log-likelihood information 317 from the first CB+S block of the SISO demodulator at turbo iteration n — 1 and the extrinsic log-likelihood information from the SISO demodulator output at turbo iteration n — 1, and the second log-likelihood adder adapted to provide soft information to the CPM signal reconstructor ⁇ 2 at iteration n based on a-priori log-likelihood information from the second CB+S block of the equalizer at iteration n and the extrinsic log-likelihood information 315 from the SI
- the CPM receiver may further comprise a low-pass filter adapted to receive a digital input signal and output a low-pass filtered digital signal.
- the EMS or the EM estimation is either a soft or a hard estimation.
- the EM estimation is based either on a full or reduced-complexity EM algorithm.
- Fig. 1 is a schematic illustration of a prior art CPM receiver.
- Fig. 2 is a schematic illustration of another prior art CPM receiver.
- Fig. 3 is a schematic illustration of an exemplary CPM receiver according to the present invention.
- Fig. 4 is a schematic illustration of a prior art CPM transmitter.
- Fig. 5 shows exemplary structures for data frames transmitted by a system using a CPM receiver of the present invention.
- Fig. 6 shows exemplary CPM autocorrelation functions.
- Fig. 7 shows, for a synthetic example, the magnitudes of the true channel impulse response h true , the convolution h of h true and the impulse response of the low-pass filter 313 of Fig. 3, and channel estimates obtained respectively via the pseudo-inverse method and reduced-complexity soft EM channel estimator.
- Fig. 8 shows the magnitudes of example filters f from channel equalizer 307 for a synthetic example.
- Fig. 9 compares for a synthetic example.
- Fig. 10 compares for a synthetic example.
- Fig. 11 shows the magnitudes of filters g 1 and g 2 after turbo iteration 10 in a synthetic example.
- Fig. 12 compares the frame-error rate (FER) vs E s /N 0 performance of a receiver from this invention to that of a simple CPM receiver for a synthetic example.
- FER frame-error rate
- the CPM transmitter illustrated in Fig. 4, is taken from prior art and comprises the concatenation of a binary information source 401, a convolutional encoder 402, an interleaver 403, an M-ary mapper 404, and a CPM modulator 405, and produces the baseband waveform 406
- Equation (3) denotes the information-bearing phase, E s is the symbol energy and T s is the symbol period.
- g(t) is the CPM phase pulse
- ⁇ (t) is the CPM frequency pulse
- L is the CPM memory
- h. p/q is the CPM modulation index with p and q relatively prime integers.
- the values a_ 1 , ••• , ⁇ - (L-1) are known at the transmitter and the receiver, and are present in summation (2) to ensure the CPM modulator 405 starts in a valid state.
- the received multipath channel input signal can be written
- h (t) denotes the multipath channel
- * is the convolution operator
- v(t) is AWGN with double-sided power spectral density N 0 /2.
- the signal r(t) is processed by an anti-aliasing filter to avoid noise folding and sampled at the receiver to obtain
- the sampling frequency at the receiver is chosen so as to obtain p samples per CPM symbol period where p is the receiver oversampling factor.
- the approximation in equation (5) is a consequence of the infinite bandwidth of CPM, and would hold with equality if it were possible to sample at frequencies greater than or equal to the Nyquist frequency. As most of the CPM signal power is contained within a limited band this is a good approximation for sufficiently large ⁇ .
- the low-pass filter 313 it is standard practice to apply a low-pass filter 313 to the received discrete-time signal r k from equation (5) to remove out-of-band noise. This will also filter out a small portion of the CPM signal as CPM has infinite bandwidth.
- the low-pass filter can be setup to have a cut-off frequency equal to 99% of the bandwidth of the CPM signal. For ease of understanding, the effect of this filter is omitted from the equations in the description.
- CPM signals with Rimoldi’s decomposition where CPM is considered as a concatenation of a continuous -phase encoder (CPE) and a memoryless modulator (MM).
- CPE continuous -phase encoder
- MM memoryless modulator
- the CPE is based on a so-called tilted-phase trellis with M input symbols, qM L output symbols and qM L-1 states.
- the output of the CPE is presented to the MM, which then outputs one of qM L possible waveforms.
- the relation between the transmitted waveform s(t, ⁇ ) and the MM output stil(t, ⁇ ) is then
- Fig. 5 Possible structures for the frames transmitted by the system are illustrated in Fig. 5, where T corresponds to known training symbols, FEC Term denotes termination symbols for the forward-error correction (FEC) convolutional encoder, and CPM Term denotes termination symbols for the CPM tilted-phase trellis.
- FEC forward-error correction
- CPM Term termination symbols for the CPM tilted-phase trellis.
- T corresponds to known training symbols
- FEC Term termination symbols for the forward-error correction (FEC) convolutional encoder
- CPM Term denotes termination symbols for the CPM tilted-phase trellis.
- the frames may look as in Fig. 5a, with only one CPM frame per FEC frame.
- a FEC frame may consist of many shorter frequency dwells, each one of which may correspond to one CPM frame, such as illustrated in see Fig. 5b.
- Other exemplary variants are possible, such as using training midambles instead of preambles as
- Channel equalizer 307 filters f, g 1 , g 2
- a channel estimate consisting of I taps is assumed to be available. Procedures to obtain and update such estimates are described in the section describing the channel estimator.
- the sampling frequency in the equalizer is ⁇ /T s , i.e. the channel equalizer 307 works with ⁇ samples per CPM symbol and is therefore fractionally spaced for ⁇ > 1.
- ⁇ ⁇ 2 the channel equalizer 307 works with ⁇ samples per CPM symbol and is therefore fractionally spaced for ⁇ > 1.
- ⁇ ⁇ 2 the channel equalizer 307 works with ⁇ samples per CPM symbol and is therefore fractionally spaced for ⁇ > 1.
- ⁇ ⁇ 2 1 is within the scope of the invention.
- the received low-passed filtered signal r k sampled at frequency p/T s is first processed by a linear equalization filter f. Thereafter, in a feedback-equalization section, the outputs of filters g 1 and g 2 are subtracted away to cancel out residual inter-symbol interference (ISI) in the output of f.
- the feedback equalizer cancels interference arising from M 1 future symbols and M 2 past symbols via filters g 1 and g 2 , where M 1 and M 2 are design parameters.
- Estimates for pM t future samples s k are provided by CPM signal reconstructor ⁇ 1 to g 1 , which then outputs an estimate for the precursor inter-symbol interference.
- the reconstructors are discussed further below.
- BPSK binary phase shift keying
- QAM quadrature amplitude modulation
- ⁇ 1, i.e. they are symbol spaced instead of fractionally spaced.
- the elements of the sequence s k can then be assumed to be mutually independent - and hence also uncorrelated - and for zero-mean signals ; for j ⁇ 0. This is not the case here due to high CPM signal autocorrelations both within a symbol period for which are relevant to us whenever ⁇ > 1) and across CPM symbols for
- R be a Toeplitz square matrix of dimension n(M1 + M 2 +1) + ⁇ of CPM autocorrelation values, i.e. entry (i,j) of R is This matrix is only a function of the CPM modulation parameters.
- R 1 be the matrix of the first n g1 columns of R and R 2 be the matrix of the last n g2 columns of R.
- R 11 be the matrix of the first n g1 rows of R 1 and R 22 be the matrix of the last n g2 rows of R 2 .
- R[ ⁇ M1+1] be the
- the system of equations (14) then becomes
- the linear equalization filter f is preferably obtained via expression (17). Thereafter, and , and therefore also feedback equalizer filters g 1 and g 2 , are obtained via (15).
- CPM signal reconstructors ⁇ 1 and ⁇ 2 shown in Fig. 3 The task of CPM signal reconstructors ⁇ 1 and ⁇ 2 shown in Fig. 3 is to reconstruct CPM signal samples based on soft information. The reconstructed CPM signals are then respectively input to filters g 1 and g 2 as shown in Fig. 3.
- Every waveform is associated with a set of Q 0 probabilities
- the signal reconstructors’ task is to provide reconstructions of the original sequence based on the probabilities and knowledge of the fixed waveforms .
- the signal reconstruction may be soft or hard.
- the soft reconstruction of sample s k is obtained as whereas the hard reconstruction is obtained as
- the soft reconstruction (18) is simply a weighted average of the Q 0 possible waveforms in each signaling interval, the weights being given by the probabilities of each waveform.
- the hard reconstruction (19) the most likely waveform in each signalling interval is selected.
- computer simulations show best performance is at times achieved with and at other times with
- the equalizer output z k , k 0, ••• , ⁇ N — 1 from equation (9), a sequence of ⁇ samples per CPM symbol, is provided to a prior art AWGN iterative CPM receiver 300.
- this receiver consists of a soft-input soft-output (SISO) CPM demodulator 301, an interleaver 304 and de-interleaver 302, an outer SISO decoder 303, and an output 306 of the CPM receiver 300.
- SISO CPM demodulator 301 is described in more detail.
- the block labelled CB+S (correlation bank and scaling) in the SISO CPM demodulator 301 performs the following standard operations: the sequence z k is first converted to the tilted-phase representation z til,k by element-wise multiplication with following equatio (7), in view of later processing by a SISO decoder based on a tilted-phase trellis; second, the sequence ztil,k is split into sections n of ⁇ samples each corresponding to each CPM symbol; and third the a-priori probabilities are obtained via the expression denotes the mth of ⁇ ] samples in .
- ⁇ is set to 2.6; for E s /N 0 > 1 dB, ⁇ is set to 1.0; and for —3 dB ⁇ E s /N 0 ⁇ 1 dB the value of ⁇ is obtained via linear interpolation using the entries from the following table:
- the inner SISO decoder which operates with the logarithms of these probabilities for enhanced numerical stability, then uses the structure of the tilted-phase trellis to output the extrinsic probabilities and
- the probabilities provided to the CPM signal reconstructors ⁇ 1 and ⁇ 2 are computed by combining a-priori and extrinsic probabilities and - In typical prior art iterative AWGN CPM receivers the CPM SISO demodulator output is not used.
- the input to reconstructor ⁇ 1 is obtained by combining the probabilities 317 and 315, respectively produced by the CB+S and inner SISO decoder blocks in the SISO CPM demodulator 301. Since and are assumed to be independent in a turbo receiver,
- log-likelihood adder A1 arises from the SISO demodulator outputs at the (n — l)th turbo iteration.
- the output of log-likelihood adder A1 is provided to reconstructor ⁇ 1 Note therefore that at the beginning of the iterative process (before the first turbo iteration), no information is available at log-likelihood adder A1, and the output of reconstructor ⁇ 1 is set to zero.
- log-likelihood adder A1 can also be provided to signal reconstructor ⁇ 2 , in which case switch B from Fig. 3 is set to position 1.
- switch B from Fig. 3 is set to position 1.
- this information may already be used for reconstruction of past signal samples, which takes place at reconstructor ⁇ 2 and is provided to filter g 2 for estimating postcursor 1ST Hence it is possible to combine with 315 when computing at ⁇ 2 .
- switch B shown in Fig. 3 is in position 2. This requires a second CB+S block 314 in the channel equalizer 307, which processes one symbol at a time rather than one frame at a time.
- the second CB+S block 314 is identical to the first CB+S block of the SISO CPM demodulator 301.
- This also requires a second log-likelihood adder A2 in the channel equalizer 307.
- the second log-likelihood adder A2 is identical to the first log-likelihood adder A1.
- the first channel estimate is obtained via the well-known pseudo-inverse method, implemented in the block labelled PINV in Fig. 3.
- the superscript (1) indicates this is the first such estimate, necessary for the computation of the channel equalizer output used in the first turbo iteration.
- the pseudo-inverse estimate is then the least-squares solution to the system or with the definitions for and r tr following from (23).
- the least-squares solution is Computer simulations show that ill-conditioning of the matrix S for CPM signals often leads to solutions with undesirable properties. This problem is remedied with Tikhonov regularization, leading to where ⁇ > 0 is a regularization parameter determined via standard prior art methods and I l is an I X I identity matrix. This is the procedure that is used in the invention. Since the training sequences are known in advance at both the transmitter and the receiver, the matrices corresponding to the different training sequences can be precomputed and stored in memory to avoid expensive on-the-fly matrix inversions.
- the output of log-likelihood adder A1 after the (n)th turbo iteration, ( ) 316 may be used to refine yielding estimates is a refinement of where is used as a starting point.
- the computation of is performed via the least mean square (LMS) or expectation-maximization (EM) algorithms. This is the function of the block labelled LMS or EM shown in Fig. 3. As discussed further below, both algorithms can be used either with soft or hard information.
- the output 316 of log-likelihood adder A1 is first used to obtain CPM signal reconstructions or via equations (18) or (19). These reconstructions may be directly provided to prior art LMS algorithms developed for updating channel estimates in the presence of linear modulations such as BPSK.
- LMS algorithms developed for updating channel estimates in the presence of linear modulations such as BPSK.
- Using or combination with the LMS algorithm leads to what here is respectively referred to as the soft LMS and hard LMS algorithms. Channel estimation via the soft or hard LMS algorithms in combination with the remaining components of the invention is deemed to be within the scope of the invention.
- the set of valid vectors appearing in equation (38) is obtained by appropriately rotating the vectors of the set of allowed tilted-phase vectors Any vector is obtained by sampling a sequence of tilted waveforms where is one of the allowed tilted- phase waveforms in a CPM symbol interval. If in the tilted-phase domain the relationship between the (k + 1)th element is s of is
- Equation (38) Let the quantities be such that The probabilities in equation (40) can be decomposed into a product and each term evaluated using the probabilities provided by log-likelihood adder A1. This leads to what is referred to as the full EM algorithm.
- an alternative is to limit the summation over in equation (39) to the sequences leading to the most likely sequences for each possible combination of index j and c k , assuming The most likely sequence for each combination of j and c k can be obtained from the inner SISO decoder. This is done as follows: first fix j and and then recursively obtain c m for m ⁇ k CPM symbol by CPM symbol from the inner SISO decoder forward recursion, by only allowing the most probable trellis transition, defined to have probability one for the purpose of the current approximation, at each step of the forward recursion.
- c m for m > k is obtained in the same fashion from the inner SISO decoder backward recursion.
- This implementation leads to what is referred to as the reduced-complexity EM algorithm.
- Both the reduced complexity and full EM algorithms may be used with soft and hard information.
- the probabilities provided by log-likelihood adder A1 after the (n)th turbo iteration are directly used by the EM algorithm.
- the hard variant is computed for each n, after which is obtained as
- channel estimates are provided by the channel estimator 310 to the channel equalizer 307.
- filter f In order to obtain the equalizer output 305 that is provided to the SISO CPM Demodulator 301 for the (n)th turbo iteration, filter f must first be obtained by solving the system of equations
- Af b, (44) with the system matrix and the right-hand side (see equation (17)) based on the latest estimate Computing f - and thereafter also filters g 1 and g 2 which is easy once f is known - is the task of the linear equation solver in the channel equalizer (block labelled LES in Fig. 3).
- the system matrix A would be Toeplitz if the terms and were excluded.
- the Levinson-Durbin recursion is typically portrayed as the method of choice for solving Toeplitz systems. This allows savings in comparison to methods for general A such as Gaussian elimination.
- A is not Toeplitz, though close to being so, and hence the Levinson-Durbin recursion cannot be used.
- implementation of the Levinson-Durbin recursion would present a significant obstacle if e.g. an FPGA-implementation is desired.
- the preconditioning matrix can be forced to be positive definite by taking the absolute value of its eigenvalues.
- a good initial guess can help reduce the number of iterations required for convergence of iterative solvers.
- the norms of the updates to the channel estimates carried out by the LMS or EM algorithms in the channel estimator will typically be small in the sense that Hence for (n) > 1 a good initial guess for the solution vector f for turbo iteration (n) is the value of f from turbo-iteration (n — 1).
- Computer simulations show that for (n) > 1 it is sufficient to carry out one iteration of the preconditioned CG solver to update f, thereby allowing for significant computational savings. For the purposes of the invention a small residual error in f should not lead to any trouble and hence the iterative process can be stopped early.
- an iterative CG solver is used in combination with Strang’s preconditioner and starting from turbo iteration (n) only one CG update to f is carried out.
- the advantages of this approach over the much- discussed Levinson-Durbin recursion in the context of prior art equalization methods are (1) applicability to quasi-Toeplitz A; (2) ease of implementation in e.g. FPGAs; (3) computational savings via re-use of previous solution vectors starting at the second turbo iteration; and (4) possibility to stop the CG iterations before convergence to achieve computational savings.
- the receiver oversampling factor ⁇ is set to 4.
- the frames consist of 4 dwells (see Fig. 5b), each one of which is 92 CPM symbols long, the first 14 symbols of each dwell being reserved to training.
- Let h - the magnitude of which is also plotted in Fig. 7 - denote the result of the convolution of h true and the impulse response of the low-pass filter from Fig. 3 (EPF block).
- the channel estimator is set up to produce channel estimates with a length of 20 taps.
- the magnitudes of the pseudo-inverse estimate (before the beginning of the turbo iterations) and estimate after 10 soft EM channel updates following 10 turbo iterations are shown in Fig. 7 .
- the corresponding filters f for the channel equalizer obtained by solving system (44) with H, Hi and H 2 obtained either from (see equation (13) and the explanations thereafter for details) are shown in Fig. 8.
- the length of the filters f was set to 101 taps.
- An ideal equalizing filter would satisfy with ⁇ (k) a discrete time Dirac pulse.
- filter g 1 is 52 taps long and is aligned with the first 52 taps of (h * f), while filter g 2 is 67 taps long and is aligned with the last 67 taps of (h * f), which is 120 taps long.
- a possible approach for a simple CPM receiver would be to use a linear equalizing filter f without any feedback-equalization (i.e. no filters g 1 or g 2 ).
- the estimation of h may be completely bypassed, and estimates for f directly updated via e.g. the soft LMS algorithm after every turbo iteration.
- This has the advantage of avoiding difficulties related to the solution of system (44) but precludes ISI cancellation via feedback equalization, as for the latter knowledge of both h (or an estimate and f are required.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Power Engineering (AREA)
- Cable Transmission Systems, Equalization Of Radio And Reduction Of Echo (AREA)
- Digital Transmission Methods That Use Modulated Carrier Waves (AREA)
Abstract
The present invention relates to a Continuous Phase Modulation (CPM) receiver. The CPM receiver comprising a channel estimator performing channel estimation based on a multipath channel input signal, a channel equalizer receiving the multipath channel input signal, channel estimates and soft information from a SISO CPM Demodulator and a log-likelihood adder and output an equalized channel signal, an AWGN CPM receiver to demodulate and decode the equalized channel signal from the channel equalizer, the AWGN CPM comprising the SISO demodulator, a SISO decoder, and output to output the demodulated and decoded channel signal from the SISO decoder. The log-likelihood adder computes soft information based on extrinsic and a-priori soft information from the SISO demodulator. The equalizer comprises a linear equation solver to determine filters f, g1 and g2 based on the channel estimates, a equalizing filter f to perform linear equalization of the multipath channel input signal, CPM signal reconstructors ρ1 and ρ2 to reconstruct a CPM signal sample j based on the soft information, the feedback filter g1 to produce estimates for precursor inter-symbol interference (ISI) remaining in sample j of an output of the filter f based on the reconstructed samples, the feedback filter g2 to produce estimates for postcursor ISI remaining in sample j of an output of the filter f, based on the reconstructed samples and an adder adapted to subtract the ISI estimates received from the filters g1 and g2 from the output of filter f, such as to output the equalized channel signal.
Description
CONTINUOUS PHASE MODULATION RECEIVER
FIELD OF THE INVENTION
The present invention relates to a Continuous Phase Modulation (CPM) receiver, and more specifically to a CPM receiver for use in a scenario with multipath propagation.
BACKGROUND AND PRIOR ART
Continuous Phase Modulation (CPM) techniques are well known in digital communications as they offer good spectral and power efficiency properties.
In state-of-the-art CPM communication systems, CPM is typically used together with convolutional error-correcting codes and decoded iteratively via the so-called turbo-principle, where soft information (involving probabilities that a transmitted bit be 0 or 1 rather than hard decisions on the values of those bits) is exchanged between two component Soft-Input Soft-Output (SISO) decoders / demodulators. Fig. 1 schematically illustrates a first prior art CPM receiver 100. The first CPM receiver 100 comprises a Soft-Input Soft-Output (SISO) demodulator 101, a de-interleaver 102, a Soft-Input Soft-Output (SISO) decoder 103, an interleaver 104, a signal input 105 and a signal output 106.
Multipath propagation, a phenomenon that results in radio signals propagating from a transmitting to a receiving antenna via two or more paths due e.g. to terrain, often creates challenges for wireless communication systems. For example, in Norwegian terrain, multipath delay spreads of ~50 μs in 30-1000 MHz range are common. The multipath arrivals combine at the receiving antenna in different ways, leading to a resultant signal which can vary widely in amplitude and phase. Waveform and receiver design must therefore take multipath propagation into account. An exemplary technical background publication is US 2002034264 A1.
In the absence of multipath propagation, i.e. with only one path from the transmitting to the receiving antenna, a scenario which is typically modelled via the so-called Additive White Gaussian Noise (AWGN) channel model, the computational complexity of the prior art CPM receiver 100 is manageable. Specifically, for a CPM modulation with M-ary alphabet, memory L and CPM modulation index h = μ/q the number of states in the SISO CPM demodulator - which often bears the brunt of the receiver’s computational burden - is This
is if the CPM demodulator is based on Rimoldi’s tilted-phase trellis, in which case CPM demodulator 101 is optimum. If most of the total CPM signal energy is contained in the so-called principal components, which is the case for many relevant
CPM schemes, the number of states in the SISO CPM demodulator can be reduced from to q with at worst a small performance loss.
A scenario with CPM receiver 100 in the presence of multipath propagation is now considered. In a situation where the channel impulse response is perfectly known, if most of the total CPM signal energy is contained in the principal components, a quasi-optimum CPM receiver can be obtained with a bank of filters (correlator bank) matched to the convolutions of the CPM principal components and the channel impulse response, followed by a SISO CPM demodulator 101 operating in a turbo loop. Such solutions have been examined in prior art. However, if the channel impulse response is nc CPM symbols long, the number of states in the SISO CPM demodulator is
. This represents an increase by a factor of at least Mnc in comparison to the AWGN case. In this situation, the computational complexity of the first CPM receiver 100 then increases exponentially with delay spread. In addition, scenarios with a perfectly known channel impulse response almost never arise in practice. If the channel is unknown it typically needs to be estimated and the performance is limited by the quality of the channel estimate. To avoid significant performance impairments, advanced channel estimation schemes have been proposed for use in combination with the quasi-optimum CPM receiver described above. However, these channel estimation schemes may also dramatically exacerbate the receiver’s computational burden. Hence, for many real multipath propagation scenarios and reasonably sized Field Programmable Gate Arrays (FPGAs), many such solutions are too computationally intensive for practical use. Fess computationally intensive designs have therefore also been proposed, as described in US 2012069936 A1, but at the expense of a performance penalty with respect to the quasi-optimum CPM receiver described above.
As an alternative, multipath CPM receivers with the structure from Fig. 2 can be used. Here, a channel equalizer 207 is provided in front of a second CPM receiver 200 similar to the first CPM receiver 100. The second CPM receiver 200 comprises a Soft-Input Soft-Output (SISO) demodulator 201, a de -interleaver 202, a Soft-Input Soft-Output (SISO) decoder 203, an interleaver 204, a signal input 205 and a signal output 206. The channel equalizer 207 addresses the complexity problem in the presence of multipath propagation. It compensates for the effects of multipath propagation and outputs an approximately multipath-free equalized signal 205. Since the second CPM receiver 200 experiences little or no multipath propagation, the second CPM receiver 200 may be implemented as a standard AWGN CPM receiver. The second CPM receiver 200 will in the following be referred to as an AWGN CPM receiver 200.
CPM receivers with the structure of Fig. 2 have been considered in prior art, such as for instance in technical background documents KOCA M., DELIÇ H. Doubly
Iterative Equalization of Continuous -Phase Modulation, IEEE Transactions on Communications, December 2007, DOI: 10.1109/TCOMM.2007.908550, and KOCA M., DELIÇ H. Double Turbo Equalization of Continuous Phase Modulation with Frequency Domain Processing, IEEE Transactions on Communications, March 2009, DOI: 10.1109/TCOMM.2009.02.060674.
In some instances the proposed channel equalizers have been relatively simple, leading to CPM receivers with manageable complexity at the expense of a performance degradation in comparison to the first CPM receiver 100 where the SISO demodulator is based on a trellis with states. In other instances, the
proposed equalizers were deemed too complex to be attractive. Frequency -domain equalization (FDE) is proposed in the above referred 2009 publication. Its major drawback is that it requires the addition of a cyclic prefix, which in the case of short dwells can drastically increase the pay load -to-overhead ratio.
There is thus a need in the art for a CPM receiver that keeps the receiver complexity sufficiently low in the presence of multipath propagation, whilst at the same time reducing the performance penalty.
SUMMARY OF THE INVENTION
The present invention is set forth and characterized in the independent claims, while the dependent claims describe other characteristics of the invention.
In one aspect the invention relates to a Continuous Phase Modulation (CPM) receiver, comprising a channel estimator adapted to perform channel estimation based on a multipath channel input signal, wherein a first channel estimate
is obtained using a pseudo-inverse (PINV) method and subsequent channel estimates
are obtained using a least mean squares (EMS) or expectation -maximization (EM) algorithm, where the LMS or the EM estimation is adapted to receive soft input information from a first log -likelihood adder, a channel equalizer adapted to receive the multipath channel input signal, the channel estimates and soft information from a Soft-Input Soft-Output (SISO)
CPM Demodulator and the first log-likelihood adder and output an equalized channel signal, an Additive White Gaussian Noise (AWGN) CPM receiver adapted to demodulate and decode the equalized channel signal from the channel equalizer, the AWGN CPM receiver comprising the Soft-Input Soft-Output (SISO) demodulator, a de-interleaver, an interleaver, a Soft-Input Soft-Output (SISO) decoder, and an output adapted to output the demodulated and decoded channel signal from the SISO decoder,
the first log-likelihood adder adapted to compute soft information based on extrinsic and a-priori soft information from the SISO CPM demodulator, wherein, the equalizer comprising: a linear equation solver adapted to determine filters f, g1 and g2 based on the channel estimates
an equalizing filter f adapted to perform linear equalization of the multipath channel input signal,
CPM signal reconstructors ρ1 and ρ2 adapted to reconstruct a CPM signal sample j based on the soft information on CPM signal sample j, where for permitted values for a sample j with probabilities the
reconstruction is either a soft reconstruction or a hard
reconstruction ai with where the lowest value of i' is selected
if the maximum is attained for more than one i', the feedback filter g1 adapted to produce estimates for precursor inter - symbol interference (ISI) remaining in sample j of an output of the filter f based on the reconstructed samples (j + 1, j + 2, . . . ), the feedback filter g2 adapted to produce estimates for postcursor ISI remaining in sample j of an output of the filter f, based on the reconstructed samples (..., j - 2,j — 1), and an adder (312) adapted to subtract the ISI estimates received from the filters g1 and g2 from the output of filter f, such as to output the equalized signal 305.
Computer simulations show that the new CPM receiver allows to reduce the performance penalty observed with simple equalizers whilst keeping computational complexity reasonable.
In one embodiment, the first log -likelihood adder may provide the soft information to the channel estimator and the CPM signal reconstructors ρ1 and ρ2 at iteration n based on a-priori log-likelihood information from a first correlation bank and scaling (CB+S) block, the CB+S block comprising a correlator bank (CB) followed by multiplicative scaling (S), in the SISO demodulator at turbo iteration n — 1 and extrinsic log-likelihood information from the SISO demodulator output at turbo iteration n — 1.
In one embodiment, the equalizer may comprise a second log -likelihood adder and a second correlation bank and scaling block comprising a correlator bank (CB) followed by multiplicative scaling (S) provided at the adder output, wherein the first log-likelihood adder provides soft information to the channel estimator and the CPM signal reconstructor ρ1 at iteration n based on the a-priori log-likelihood information 317 from the first CB+S block of the SISO demodulator
at turbo iteration n — 1 and the extrinsic log-likelihood information from the SISO demodulator output at turbo iteration n — 1, and the second log-likelihood adder adapted to provide soft information to the CPM signal reconstructor ρ2 at iteration n based on a-priori log-likelihood information from the second CB+S block of the equalizer at iteration n and the extrinsic log-likelihood information 315 from the SISO demodulator output 301 at turbo iteration (n — 1).
In one embodiment that may be combined with any of the above embodiments, the CPM receiver may further comprise a low-pass filter adapted to receive a digital input signal and output a low-pass filtered digital signal.
In one embodiment that may be combined with any of the above embodiments, the EMS or the EM estimation is either a soft or a hard estimation.
In one embodiment that may be combined with any of the above embodiments, the EM estimation is based either on a full or reduced-complexity EM algorithm.
BRIEF DESCRIPTION OF THE FIGURES
The following figures are appended to facilitate the understanding of the invention. Some of these figures are drawings showing embodiments of the invention. The figures are now described by way of example only:
Fig. 1 is a schematic illustration of a prior art CPM receiver.
Fig. 2 is a schematic illustration of another prior art CPM receiver.
Fig. 3 is a schematic illustration of an exemplary CPM receiver according to the present invention.
Fig. 4 is a schematic illustration of a prior art CPM transmitter.
Fig. 5 shows exemplary structures for data frames transmitted by a system using a CPM receiver of the present invention.
Fig. 6 shows exemplary CPM autocorrelation functions.
Fig. 7 shows, for a synthetic example, the magnitudes of the true channel impulse response h true, the convolution h of htrue and the impulse response of the low-pass filter 313 of Fig. 3, and channel estimates obtained respectively via the
pseudo-inverse method and reduced-complexity soft EM channel estimator.
Fig. 8 shows the magnitudes of example filters f from channel equalizer 307 for a synthetic example.
Fig. 11 shows the magnitudes of filters g1 and g2 after turbo iteration 10 in a synthetic example.
Fig. 12 compares the frame-error rate (FER) vs Es/N0 performance of a receiver from this invention to that of a simple CPM receiver for a synthetic example.
DETAILED DESCRIPTION OF THE INVENTION
In the following, embodiments of the invention will be discussed in more detail with reference to the appended figures. It should be understood, however, that the figures are not intended to limit the invention to the subject-matter depicted in the figures.
The CPM transmitter, illustrated in Fig. 4, is taken from prior art and comprises the concatenation of a binary information source 401, a convolutional encoder 402, an interleaver 403, an M-ary mapper 404, and a CPM modulator 405, and produces the baseband waveform 406
(3)
denotes the information-bearing phase, Es is the symbol energy and Ts is the symbol period. In equations (2) and (3) above, g(t) is the CPM phase pulse, ω(t) is the CPM frequency pulse, L is the CPM memory, and h. = p/q is the CPM modulation
index with p and q relatively prime integers. The values a_1, ••• ,α-(L-1) are known at the transmitter and the receiver, and are present in summation (2) to ensure the CPM modulator 405 starts in a valid state.
The received multipath channel input signal can be written
(4)
where h (t) denotes the multipath channel, * is the convolution operator, and v(t) is AWGN with double-sided power spectral density N0/2. The signal r(t) is processed by an anti-aliasing filter to avoid noise folding and sampled at the receiver to obtain
(5)
where all discrete-time signals in (5) are obtained by sampling the corresponding continuous-time signals in (4); e.g. rk = r(t = tk)
The sampling frequency at the receiver is chosen so as to obtain p samples per CPM symbol period where p is the receiver oversampling factor. The approximation in equation (5) is a consequence of the infinite bandwidth of CPM, and would hold with equality if it were possible to sample at frequencies greater than or equal to the Nyquist frequency. As most of the CPM signal power is contained within a limited band this is a good approximation for sufficiently large η.
It is standard practice to apply a low-pass filter 313 to the received discrete-time signal rk from equation (5) to remove out-of-band noise. This will also filter out a small portion of the CPM signal as CPM has infinite bandwidth. For example, the low-pass filter can be setup to have a cut-off frequency equal to 99% of the bandwidth of the CPM signal. For ease of understanding, the effect of this filter is omitted from the equations in the description.
It is sometimes convenient to describe CPM signals with Rimoldi’s decomposition, where CPM is considered as a concatenation of a continuous -phase encoder (CPE) and a memoryless modulator (MM). In this decomposition, the CPE is based on a so-called tilted-phase trellis with M input symbols, qML output symbols and qML-1 states. The output of the CPE is presented to the MM, which then outputs one of qML possible waveforms. The relation between the transmitted waveform s(t,α) and the MM output stil(t,α) is then
Note that combining equations (1) and (6) gives
Possible structures for the frames transmitted by the system are illustrated in Fig. 5, where T corresponds to known training symbols, FEC Term denotes termination symbols for the forward-error correction (FEC) convolutional encoder, and CPM Term denotes termination symbols for the CPM tilted-phase trellis. In a system which is meant for continuous transmission the frames may look as in Fig. 5a, with only one CPM frame per FEC frame. In case of a system meant for sporadic transmissions, which may additionally include frequency -hopping for e.g. protection against jamming, a FEC frame may consist of many shorter frequency dwells, each one of which may correspond to one CPM frame, such as illustrated in see Fig. 5b. Other exemplary variants are possible, such as using training midambles instead of preambles as illustrated in Fig. 5 or splitting the training preamble into a pre- and postamble.
Now, each component of the invention will be described in detail.
Channel equalizer 307 filters f, g1 , g2
A channel estimate
consisting of I taps is assumed to be available. Procedures to obtain and update such estimates are described in the section describing the channel estimator.
The sampling frequency in the equalizer is η/Ts, i.e. the channel equalizer 307 works with η samples per CPM symbol and is therefore fractionally spaced for η > 1. In the following description η ≥ 2, however, η = 1 is within the scope of the invention.
With reference to Fig. 3, in the channel equalizer 307, the received low-passed filtered signal rk sampled at frequency p/Ts is first processed by a linear equalization filter f. Thereafter, in a feedback-equalization section, the outputs of filters g1 and g2 are subtracted away to cancel out residual inter-symbol interference (ISI) in the output of f. The feedback equalizer cancels interference arising from M1 future symbols and M2 past symbols via filters g1 and g2, where M1 and M2 are design parameters. Estimates for pMt future samples sk are provided by CPM signal reconstructor ρ1 to g1, which then outputs an estimate for the precursor inter-symbol interference. Likewise, estimates sk for ηM2 + μ past samples sk, with μ = I — 1, are provided by CPM signal reconstructor ρ2 to g2,
which then outputs an estimate for the postcursor inter-symbol interference. The reconstructors are discussed further below.
For filter coefficients
t and
and vectors
the equalizer output (305)
that is provided to the SISO CPM Demodulator (301) is then
(9)
where † denotes complex conjugate transposition. A reasonable choice for M = M1 + M2, the length of filter f in units of Ts, could be a number of times - e
.g.
between four and ten - the length of the channel impulse response in units of Ts, though other choices are also possible.
To obtain f, g1 and g2 the idea is to minimize the expectation
Introducing
it can be shown that
is minimized if x is the solution of
Prior art feedback equalizers typically consider linear modulations such as binary phase shift keying (BPSK) or quadrature amplitude modulation (QAM) and deal with the case η = 1, i.e. they are symbol spaced instead of fractionally spaced. The elements of the sequence sk can then be assumed to be mutually independent - and hence also uncorrelated - and for zero-mean signals
; for j ≠ 0. This is not the case here due to high CPM signal autocorrelations both within a symbol period
for
which are relevant to us whenever η > 1) and across CPM symbols for |j| > η ) which are a consequence of the CPM signal
memory. Fig. 6 illustrates two plots of example CPM signal autocorrelation functions If samples Sy and sk are highly correlated,
attempting to cancel out interference due to Sj in via feedback equalization
will do more harm than good, as this actually removes a contribution that is close to the desired signal. In an ideal case, would be either zero or one, and
feedback equalization would only be performed for samples Sj corresponding to lags T such that
We therefore introduce a cut-off value
and exclude samples in the range (k — c, ••• , k — 1, k + 1, ••• , k + c) from feedback equalization on
where c ≥ 0 is the lowest integer such that
. Interference cancellation is thus carried out for ng1 = η M1 — c future samples and ng2 = η M2 + μ — c past samples; and both the last c entries of g1 and the first c entries of g2 are set to zero.
For ease of exposition let
and
. Omitting equations
corresponding to the entries of g1 and g2 that have been set to zero, the system of equations (11) becomes
The remaining hurdles to obtain f, g1 and g2 are evaluating the expectations in equation (12) and solving the system of equations. This is not straightforward due to expectations involving estimates
or
and ill-conditioning of the system matrix. A number of different approximations can be made, many of which do not lead to satisfactory performance. A few such approximations are now described, the last of which is used in the channel equalizer 307 of this invention.
Let the matrix
(13)
with η (M1 + M2 + 1) + μ columns and η (M1 + M2 + 1) rows. Furthermore, let R be a Toeplitz square matrix of dimension n(M1 + M2 +1) + μ of CPM autocorrelation values, i.e. entry (i,j) of R is This matrix is only a function of the CPM
modulation parameters. Let R1 be the matrix of the first ng1 columns of R and R2 be the matrix of the last ng2 columns of R. In addition, let R11 be the matrix of the first ng1rows of R1 and R22 be the matrix of the last ng2 rows of R2.Let R[ηM1+1] be the
The expectations appearing in equation (12) are evaluated by making the following approximations: all entries of ,
and are zero; and
when computing the remaining expectations from equation (12), correlations with estimates or are replaced by correlations with actual sample values
Specifically, in the computation of
it is assumed that and
and in that of
and the
complex conjugate transposed of these two matrices it is assumed that
and This gives
(14)
where is the variance of the discrete AWGN signal Vj and I is an identity matrix of size
Whilst the system matrix and right-hand side of equation (14) can be easily assembled, computer simulations show that performance of CPM receivers based on such a channel equalizer is not satisfactory among others due to the ill-conditioning of matrices R11 and R22. Therefore the following additional approximations are introduced: R11 and R22 are replaced by identity matrices and of sizes respectively ng1 X ng1 and ng2 X ng2, and the
remaining entries of R1 and R2 are set to zero, leading to H R1 = H 1 and H R2 = H2, where H 1 contains the first ng1 columns of H and H2 the last ng2 columns of H. The system of equations (14) then becomes
Note that while the effect of CPM signal autocorrelation has been neglected in some entries of (14), it is still present in equation (15) via the products H R H † and
where the definition of R has not changed (entry (i,j) of R is and Is the (η 1 1)th column of R). It is possible to eliminate
M + and from (15) to obtain f as
Once f is known, and
can be trivially obtained via (15). Computer
simulations show that calculating f,
and
in this fashion leads to good performance for low signal-to-noise ratio (SNR) values; however for high SNR values the matrix
may be ill-conditioned due to the low value of
. Therefore, a threshold is introduced and f is obtained as
(17)
which amounts to Tikhonov regularization for high SNR values, and leaves (16) unchanged for low SNR values.
In this invention, the linear equalization filter f is preferably obtained via expression (17). Thereafter,
and
, and therefore also feedback equalizer filters g1 and g2, are obtained via (15).
CPM signal reconstructors ρ1 , ρ2
The task of CPM signal reconstructors ρ1 and ρ2 shown in Fig. 3 is to reconstruct CPM signal samples based on soft information. The reconstructed CPM signals are then respectively input to filters g1 and g2 as shown in Fig. 3.
Concretely, for a CPM modulation with parameters h = p/q , M-ary alphabet and memory L, there is a total of Q0 = qML possible tilted-phase waveforms in
the signal interval corresponding to each CPM symbol, the jth of which is represented by p samples denoted Let the transmitter send a
sequence of N CPM symbols α0, ••• , αN_1, which are mapped to a sequence of tilted- phase waveforms by the CPM modulator. Note that
corresponds to the restriction of Stil(t, a) from equation (8) to the interval
Sampling of equation (1) with p samples per symbol leads to a sequence Consider a sample sk of this sequence. Note that each index 0 ≤ k ≤
ηN — 1 is uniquely associated with a pair where 0 ≤ n ≤ N — 1 is the
CPM symbol index and 0 ≤ m ≤ η — 1 is the sample index within each symbol.
1 ≤ j ≤ Q0 discussed in more detail below. The signal reconstructors’ task is to provide reconstructions of the original sequence based
on the probabilities and knowledge of the
fixed waveforms
. The signal reconstruction may be soft or hard. The soft reconstruction of sample sk is obtained as
whereas the hard reconstruction
is obtained as
In the unlikely event that the maximum in (19) is attained for more than one value j the lowest j' is arbitrarily selected. Note that the constant magnitude property of
CPM is not preserved in
and is typically lost unless reconstruction is perfect. Moreover, independently estimating the signals in each CPM symbol signalling interval means the continuous phase property of CPM is not enforced in
or , and is typically also lost unless reconstruction is perfect.
Intuitively, the soft reconstruction (18) is simply a weighted average of the Q0 possible waveforms in each signaling interval, the weights being given by the probabilities of each waveform. In the hard reconstruction (19) the most likely waveform in each signalling interval is selected. Depending on system parameters such as SNR, computer simulations show best performance is at times achieved with and at other times with
AWGN iterative CPM receiver 300
The equalizer output zk, k = 0, ••• , ηN — 1 from equation (9), a sequence of η samples per CPM symbol, is provided to a prior art AWGN iterative CPM receiver 300. As shown in Fig. 3, this receiver consists of a soft-input soft-output (SISO) CPM demodulator 301, an interleaver 304 and de-interleaver 302, an outer SISO decoder 303, and an output 306 of the CPM receiver 300. Now the SISO CPM demodulator 301 is described in more detail.
The block labelled CB+S (correlation bank and scaling) in the SISO CPM demodulator 301 performs the following standard operations: the sequence zk is first converted to the tilted-phase representation ztil,k by element-wise multiplication with following equatio (7), in view of later
processing by a SISO decoder based on a tilted-phase trellis; second, the sequence ztil,k is split into sections n of η samples each corresponding to each CPM
symbol; and third the a-priori probabilities are obtained via the
expression
denotes the mth of η] samples in . The sum over terms
corresponds to the correlation between each signal section and
the complex conjugates of the Q0 possible waveforms γj (this operation is represented by CB in the CB+S block), and the multiplication by is a scaling
operation (represented by S in the CB+S block). If the sequence zk were the output of an AWGN channel, the noise affecting zk would be i.i.d. Gaussian, and in
equation (20) would be chosen equal to the variance of this noise process. However, due to the presence of the channel equalizer 307, the noise process affecting zk is
coloured, leading to suboptimal performance of the AWGN iterative CPM receiver. If it were possible to introduce an interleaver between the channel equalizer and the inner SISO decoder - with a corresponding block at the transmitter - the noise samples affecting neighbouring CPM symbols could be assumed to be approximately independent. Such an approach is usually followed in related prior art on turbo-equalization with linear modulations. However, such an interleaver would destroy the continuous -phase property of CPM and is thus not suitable for the present invention.
Experiments involving various strategies for setting in equation (20) have been
carried out. For low Es/N0 ratios, computer simulations for several different multipath channels show that the AWGN value No based on the spectral density of the noise process v(t) from equation (4) is too high a value for . As attempts to
analytically obtain an improved value for q have not been successful, in this
invention an empirical correction factor ξ based on computer simulations is introduced. In equation (20), let , where the factor ξ is a function of the
Es/N0 ratio in dB. For Es/N0 ≤ —3 dB, ξ is set to 2.6; for Es/N0 > 1 dB, ξ is set to 1.0; and for —3 dB < Es/N0 < 1 dB the value of ξ is obtained via linear interpolation using the entries from the following table:
Reference is now made to the inner SISO decoder block in the SISO CPM demodulator 301. In addition to the a-priori probabilities discussed
above, related to the output symbols of the tilted-phase trellis, the inner SISO decoder is also provided with a-priori probabilities Pα(αn = a) on the tilted-phase trellis input symbols αn, for all a from the M-ary CPM modulation input alphabet. The probabilities Pα(αn = a) are obtained from the output of the outer SISO decoder block 303. The inner SISO decoder, which operates with the logarithms of these probabilities for enhanced numerical stability, then uses the structure of the tilted-phase trellis to output the extrinsic probabilities and
Following prior art, the serially concatenated SISO CPM demodulator and outer SISO decoder illustrated in Fig. 3 iteratively exchange extrinsic information on the symbols αn. At the end of the iterative process, hard decisions on the transmitted information bits bk are made based on the output of the outer SISO decoder.
Computation of CPM signal reconstructor input probabilities
The probabilities
provided to the CPM signal reconstructors ρ1 and ρ2 are computed by combining a-priori and extrinsic probabilities
and
- In typical prior art iterative AWGN CPM receivers the CPM SISO demodulator output is not used.
The input to reconstructor ρ1 is obtained by combining the probabilities
317 and
315, respectively produced by the CB+S and inner SISO decoder blocks in the SISO CPM demodulator 301. Since
and are assumed to be independent in a turbo
receiver,
(21)
where is a normalization constant
which ensures that Z In the logarithmic domain equation (21)
becomes
Now examining in more detail the assembly of prior to the (n)th
turbo iteration, where parentheses in the superscript are used to distinguish the turbo iteration number (n) from the symbol index n. The information received by log-likelihood adder A1 arises from the SISO demodulator outputs
at the (n — l)th turbo iteration. The output
of log-likelihood adder A1 is provided to reconstructor ρ1 Note therefore that at the beginning of the iterative process (before the first turbo iteration), no information is available at log-likelihood adder A1, and the output of reconstructor ρ1 is set to zero.
The output of log-likelihood adder A1 can also be provided to signal reconstructor ρ2, in which case switch B from Fig. 3 is set to position 1. However, the necessary information to compute becomes available as soon as the channel
equalizer outputs have been computed. Therefore, this
information may already be used for reconstruction of past signal samples, which takes place at reconstructor ρ2 and is provided to filter g2 for estimating postcursor 1ST Hence it is possible to combine with
315 when computing at ρ2. In this case switch B shown in Fig. 3 is
in position 2. This requires a second CB+S block 314 in the channel equalizer 307, which processes one symbol at a time rather than one frame at a time. In all other respects the second CB+S block 314 is identical to the first CB+S block of the SISO CPM demodulator 301. This also requires a second log-likelihood adder A2 in the channel equalizer 307. The second log-likelihood adder A2 is identical to the first log-likelihood adder A1.
Channel estimator 310
In order to compute the channel equalizer filters f, g1 and g2 via equation (15), knowledge of the channel impulse response hk, 0 ≤ k ≤ I — 1, assumed to consist of I taps, is required. In practice I is unknown and may be set to η·τmax/TS, where Tmax is the maximum delay spread the system is designed to support. The role of the channel estimator 310 is to provide estimates for the channel impulse response.
The first channel estimate is obtained via the well-known
pseudo-inverse method, implemented in the block labelled PINV in Fig. 3. The superscript (1) indicates this is the first such estimate, necessary for the computation of the channel equalizer output used in the first turbo iteration. To obtain a known training signal of length Ntr CPM
symbols is sent by the transmitter, which after oversampling leads to the sequence Sampling and low-pass filtering the corresponding signal rtr(t) =
(see equation (4)) at the receiver leads to the sequence
The pseudo-inverse estimate is then the least-squares
solution to the system
or
with the definitions for and rtr following from (23). The least-squares
solution is
Computer simulations show that ill-conditioning of the matrix S for CPM signals often leads to solutions
with undesirable properties. This problem is remedied with Tikhonov regularization, leading to
where λ > 0 is a regularization parameter determined via standard prior art methods and Il is an I X I identity matrix. This is the procedure that is used in the invention. Since the training sequences are known in advance at both the transmitter and the receiver, the matrices
corresponding to the different training sequences can be precomputed and stored in memory to avoid expensive on-the-fly matrix inversions.
Once the turbo iterations have started, the output of log-likelihood adder A1, after the (n)th turbo iteration,
( ) 316 may be used to refine
yielding estimates
is a refinement of
where
is used as a starting point. In the invention, the computation of
is performed via the least mean square (LMS) or expectation-maximization (EM) algorithms. This is the function of the block labelled LMS or EM shown in Fig. 3. As discussed further below, both algorithms can be used either with soft or hard information.
In case the LMS algorithm is used for updating the channel estimates, the output 316 of log-likelihood adder A1 is first used to obtain CPM signal reconstructions or via equations (18) or (19). These reconstructions may be directly
provided to prior art LMS algorithms developed for updating channel estimates in the presence of linear modulations such as BPSK. The extension of these algorithms to the CPM case is relatively straightforward - both when η = 1 and when η > 1 - and requires no further discussion for the skilled person to perform the invention. Using or combination with the LMS algorithm leads to what here is
respectively referred to as the soft LMS and hard LMS algorithms. Channel estimation via the soft or hard LMS algorithms in combination with the remaining components of the invention is deemed to be within the scope of the invention.
Examples of use of the EM algorithm for updating channel estimates based on soft or hard information can be found in prior art for linear modulations; however, adapting the EM algorithm to the CPM case is not straightforward. The procedures used in the invention for updating
via the EM algorithm, which include novel and inventive steps, are now described.
Let the transmitter send a waveform consisting of N CPM symbols with index 0 ≤ n ≤ N — 1, which are mapped to a sequence of tilted-phase waveforms by the CPM modulator. After mapping to s(t, α) via equation (6),
sampling of equation (1) with η samples per symbol leads to the length b = ηN sequence s = (s0, s1, .. , sb- 1) (27)
Bearing in mind equation (5), the received sequence sampled at η samples per symbol becomes after convolution with the l-tap channel and low-pass filtering r = (r0, r1, .. , rb+l_1). (28)
Let the so-called complete data w discussed in prior art literature on the EM algorithm be defined as w = (Θ, s), (29) where 0 is a random matrix with entry (j, k) equal to
Here, follows from a decomposition of the noise component vj affecting rj into I independent noise components such that
(35)
It is assumed without loss of generality that the transmitter sends a CPM signal with unit magnitude, hence
. If instead it is still legitimate for the
receiver to assume that
and that it is instead the channel impulse response that has been scaled. The denominator of (34) is thus equal to By
inserting (35) into (34), the numerator of (34) can be shown to be equal to
and
The set of valid vectors appearing in equation (38) is obtained by appropriately
rotating the vectors of the set of allowed tilted-phase vectors Any vector
is obtained by sampling a sequence of tilted waveforms
where is one of the
allowed tilted-
phase waveforms in a CPM symbol interval. If in the tilted-phase domain
the relationship between the (k + 1)th element is
s of is
It is possible to evaluate and N2 without any particular difficulties by using the information consisting of the Q0 probabilities
associated with each one of the N transmitted CPM symbols.
Referring to equation (38), let the quantities
be such that The probabilities
in
equation (40) can be decomposed into a product
and each term evaluated using the probabilities
provided by log-likelihood adder A1. This leads to what is referred to as the full EM algorithm.
To reduce the computational burden in the computation of the Aj,ks, an alternative is to limit the summation over
in equation (39) to the sequences
leading to the most likely sequences
for each possible combination of index j and ck, assuming The most
likely sequence for each combination of j and ck can be obtained from the
inner SISO decoder. This is done as follows: first fix j and and then recursively obtain cm for m < k CPM symbol by CPM symbol from the inner SISO decoder forward recursion, by only allowing the most probable trellis transition, defined to have probability one for the purpose of the current approximation, at each step of the forward recursion. Similarly, cm for m > k is obtained in the same fashion from the inner SISO decoder backward recursion. This leads to one unique sequence for each combination of j and and yields the
approximation
where the notation has been used to denote the values of c. m ≠ k in the most likely sequence
for each j and ck (obtained as described above), and the probabilities
are obtained from the output of log-likelihood adder A1. This implementation leads to what is referred to as the reduced-complexity EM algorithm.
Both the reduced complexity and full EM algorithms may be used with soft and hard information. In the soft variant of the EM algorithm, the probabilities
provided by log-likelihood adder A1 after the (n)th turbo iteration are directly used by the EM algorithm. In the hard variant,
is computed for each n, after which is obtained as
The probabilities
are then used in the EM algorithm. In the unlikely event that the maximum in (42) is attained for more than one i' the lowest index i' for which the maximum is attained is arbitrarily selected.
Linear equations solver 311
As discussed above, channel estimates are provided by the channel estimator
310 to the channel equalizer 307. In order to obtain the equalizer output 305 that is provided to the SISO CPM Demodulator 301 for the (n)th turbo iteration, filter f must first be obtained by solving the system of equations
Af = b, (44) with the system matrix and the
right-hand side
(see equation (17)) based on the latest estimate
Computing f - and thereafter also filters g1 and g2 which is easy once f is known - is the task of the linear equation solver in the channel equalizer (block labelled LES in Fig. 3).
This is both computationally intensive and difficult to achieve in e.g. FPGA -based implementations. Hence a new method, considering the structure of the receiver 308 presented in the invention is now described.
First, it is observed that the system matrix A would be Toeplitz if the terms
and were excluded. In prior art literature on equalization for linear
modulations, the Levinson-Durbin recursion is typically portrayed as the method of choice for solving Toeplitz systems. This allows savings in comparison to methods for general A such as Gaussian elimination. However, in the present case A is not Toeplitz, though close to being so, and hence the Levinson-Durbin recursion cannot be used. In addition, even if the latter problem could be overcome, implementation of the Levinson-Durbin recursion would present a significant obstacle if e.g. an FPGA-implementation is desired.
An iterative solver is therefore utilized in this invention, which as will be discussed leads to several advantages. However, the use of other linear solvers such as Gaussian elimination is still deemed to lie within the scope of the invention.
Iterative solvers for Toeplitz systems have received significant attention as the latter arise in a wide number of applications, also outside the field of wireless communications. For Hermitian positive definite A the conjugate gradient (CG)
algorithm is guaranteed to converge. For Hermitian indefinite A the more complex minimum residual (MINRES) method can be used.
To achieve rapid convergence of the iterative solver (e.g. CG or MINRES), a good preconditioner is essential. For Toeplitz systems, excellent convergence rates can be achieved with Strang’s or T. Chan’s circulant preconditioners. If desired, the preconditioning matrix can be forced to be positive definite by taking the absolute value of its eigenvalues.
In the present case, A is neither positive definite nor Toeplitz. It is however close to being both. Computer simulations show that for typical cases of interest, laudable convergence properties can be achieved by simply using the CG algorithm in combination with Strang’s circulant preconditioner. Breakdowns were occasionally observed with T. Chan’s preconditioner. Further, whilst the MINRES method together with a modified positive-definite version of Strang’s preconditioner guarantees convergence, this adds complexity to each iteration, and hence setting in motion the heavier machinery does not seem worthwhile.
Most of the computational burden in an iterative solver lies in the evaluation of matrix-vector products A • x. As documented in prior art, for Toeplitz A this can be efficiently done via a combination of two Fast Fourier Transforms (FFTs) and one inverse Fast Fourier Transform (IFFT). This is not only computationally efficient but can also be easily implemented in FPGAs by making use of extensively researched and optimized FFT implementations for FPGAs. In the present case, whilst A itself is not Toeplitz, the matrices H, R, H1 and H2 are all Toeplitz, hence a matrix-vector product A • x can be obtained from a sequence of Toeplitz matrix - vector products.
A good initial guess can help reduce the number of iterations required for convergence of iterative solvers. The norms of the updates to the channel estimates carried out by the LMS or EM algorithms in the channel estimator will
typically be small in the sense that Hence for (n) > 1 a
good initial guess for the solution vector f for turbo iteration (n) is the value of f from turbo-iteration (n — 1). Computer simulations show that for (n) > 1 it is sufficient to carry out one iteration of the preconditioned CG solver to update f, thereby allowing for significant computational savings. For the purposes of the invention a small residual error in f should not lead to any trouble and hence the iterative process can be stopped early.
According to an embodiment of the invention an iterative CG solver is used in combination with Strang’s preconditioner and starting from turbo iteration (n) only one CG update to f is carried out. The advantages of this approach over the much- discussed Levinson-Durbin recursion in the context of prior art equalization
methods are (1) applicability to quasi-Toeplitz A; (2) ease of implementation in e.g. FPGAs; (3) computational savings via re-use of previous solution vectors starting at the second turbo iteration; and (4) possibility to stop the CG iterations before convergence to achieve computational savings.
The above procedure for obtaining a solution to system of equations (44), or a reasonably accurate approximation to such a solution, at each iteration is an important aspect of this invention. Indeed, the procedure can easily be implemented in FPGAs and the computational complexity is reasonable. On the other hand, general-purpose solvers such as Gaussian elimination not only are difficult to implement in FPGAs but would also lead to large computational complexity increases.
Example
Now some of the topics discussed above are illustrated with a synthetic example based on the reduced-complexity soft EM channel estimator and 10 turbo iterations. The receiver oversampling factor η is set to 4. The frames consist of 4 dwells (see Fig. 5b), each one of which is 92 CPM symbols long, the first 14 symbols of each dwell being reserved to training. For each dwell, the true channel impulse response htrue consists of equal-magnitude, equal-phase arrivals at taps 1, 11 and 20, i.e. arrivals in the first, third and fifth CPM symbols since η = 4. Its magnitude is plotted in Fig. 7. Let h - the magnitude of which is also plotted in Fig. 7 - denote the result of the convolution of htrue and the impulse response of the low-pass filter from Fig. 3 (EPF block).
The channel estimator is set up to produce channel estimates
with a length of 20 taps. The magnitudes of the pseudo-inverse estimate
(before the beginning of the turbo iterations) and estimate after 10 soft EM channel updates
following 10 turbo iterations are shown in Fig. 7 .
The corresponding filters f for the channel equalizer, obtained by solving system (44) with H, Hi and H2 obtained either from
(see equation (13) and the explanations thereafter for details) are shown in Fig. 8. The length of the filters f was set to 101 taps. An ideal equalizing filter would satisfy
with φ (k) a discrete time Dirac pulse.
The smaller the difference between (h * f*) and the better the cancellation
of interference- symbol interference via feedback filters g1 and g2 can be expected to perform. The quantities
are compared to
respectively in Figs. 9 and 10. As the figures show, is closer to
than which illustrates the benefit of updating the channel estimate after
each turbo iteration.
The magnitudes of filters g1 and g2 after turbo iteration 10 are shown in Fig. 11. Comparing Figs. 10 and 11, it can be seen that g1 and g2 attempt to cancel out the portions of (h * f*) respectively before and after main lobe in order for the combined effect of h,f g1 and g2 to be closer to that of a dirac pulse. In this example filter g1 is 52 taps long and is aligned with the first 52 taps of (h * f), while filter g2 is 67 taps long and is aligned with the last 67 taps of (h * f), which is 120 taps long. To avoid canceling out portions of the main lobe of (h * f), which as previously discussed would do more harm than good due to high CPM signal autocorrelation values, a cut-off value Rcut-off was introduced which in this example ensures the last c = 4 entries of g1 and the first c = 4 entries of g2 vanish.
The frame-error rate (FER) vs Es/N0 (ratio between signal energy and noise-power spectral density) performance of the claimed CPM receiver, with reduced- complexity soft EM channel estimation, soft signal reconstruction and switch B from Fig. 3 in position 2, is compared to that of a simple CPM receiver in Fig. 12, for the three-tap impulse response h true and frame parameters discussed above. A gap of approximately 4 dB is observed for FER = 10-2.
A possible approach for a simple CPM receiver would be to use a linear equalizing filter f without any feedback-equalization (i.e. no filters g1 or g2). In such a receiver, the estimation of h may be completely bypassed, and estimates for f directly updated via e.g. the soft LMS algorithm after every turbo iteration. This has the advantage of avoiding difficulties related to the solution of system (44) but precludes ISI cancellation via feedback equalization, as for the latter knowledge of both h (or an estimate and f are required.
Computer simulations for the simple CPM receiver described above have not been carried out, but instead for a receiver where
is obtained via the pseudo-inverse method, updates are obtained via the soft LMS algorithm, g1 and g2 are
identically zero, and f is obtained as
the minimum mean-square error (MMSE) solution in the absence of feedback filters g1 and g2. The behaviour of this receiver is expected to be similar to that of the simple CPM receiver described above. Indeed, both are based on a linear equalizing filter f, the coefficients of which attempt to minimize (refer to
equation (9) and the discussion on the equalizer filters in that section).
In the preceding description, various aspects of the CPM receiver according to the invention have been described with reference to the illustrative embodiment. For purposes of explanation, specific numbers, systems, and configurations were set forth in order to provide a thorough understanding of the system and its workings. However, this description is not intended to be construed in a limiting sense.
Various modifications and variations of the illustrative embodiment, as well as other embodiments of the system, which are apparent to persons skilled in the art to which the disclosed subject matter pertains, are deemed to lie within the scope of the claims.
Claims
1. Continuous Phase Modulation (CPM) receiver (308), comprising a channel estimator (310) adapted to perform channel estimation based on a multipath channel input signal (309), wherein a first channel estimate is
obtained using a pseudo-inverse (PINV) method and subsequent channel estimates
are obtained using a least mean squares (LMS) or expectation-maximization (EM) algorithm, where the LMS or the EM estimation is adapted to receive soft input information (316) from a first log-likelihood adder (A1), a channel equalizer (307) adapted to receive the multipath channel input signal (309), the channel estimates
and soft information (315, 316) from a Soft-Input Soft-Output (SISO) CPM Demodulator (301) and the first log-likelihood adder (A1) and output an equalized channel signal (305), an Additive White Gaussian Noise (AWGN) CPM receiver (300) adapted to demodulate and decode the equalized channel signal (305) from the channel equalizer (307), the AWGN CPM receiver (300) comprising the Soft-Input Soft- Output (SISO) demodulator (301), a de-interleaver (302), an interleaver (304), a Soft-Input Soft-Output (SISO) decoder (303), and an output (306) adapted to output the demodulated and decoded channel signal from the SISO decoder (303), the first log-likelihood adder (A1) adapted to compute soft information (316) based on extrinsic (315) and a-priori (317) soft information from the SISO CPM demodulator (301); wherein, the equalizer (307) comprising: a linear equation solver (311) adapted to determine filters f, g1 and g2 based on the channel estimates
an equalizing filter f adapted to perform linear equalization of the multipath channel input signal (309),
CPM signal reconstructors ρ1 and ρ2 adapted to reconstruct a CPM signal sample j based on the soft information on CPM signal sample j, where for permitted values for a sample j with probabilities
the
reconstruction is either a soft reconstruction or a hard
reconstruction ai with where the lowest value of i’ is selected
if the maximum is attained for more than one i’,
the feedback filter g1 adapted to produce estimates for precursor inter - symbol interference (ISI) remaining in sample j of an output of the filter f based on the reconstructed samples (j + 1, j + 2, . . . ), the feedback filter g2 adapted to produce estimates for postcursor ISI remaining in sample j of an output of the filter f, based on the reconstructed samples and
an adder (312) adapted to subtract the ISI estimates received from the filters g1 and g2 from the output of filter f, such as to output the equalized channel signal (305).
2. CPM-receiver (308) according to claim 1, wherein the first log-likelihood adder (A1) provides the soft information (316) to the channel estimator (310) and the CPM signal reconstructors ρ1 and ρ2 at iteration (n) based on a-priori log- likelihood information (317) from a first correlation bank and scaling (CB+S) block, the CB+S comprising a correlator bank (CB) followed by multiplicative scaling (S), in the SISO demodulator (301) at turbo iteration (n — 1) and extrinsic log-likelihood information (315) from the SISO demodulator (301) output at turbo iteration (n — 1).
3. CPM-receiver (308) according to claim 1, wherein the equalizer (307) comprises a second log-likelihood adder (A2) and a second correlation bank and scaling block (314) comprising a correlator bank (CB) followed by multiplicative scaling (S) provided at the adder (312) output, wherein the first log-likelihood adder (A1) provides soft information (316) to the channel estimator (310) and the CPM signal reconstructor ρ1 at itration (n) based on the a-priori log-likelihood information (317) from the first CB+S block of the SISO demodulator (301) at turbo iteration (n — 1) and the extrinsic log-likelihood information (315) from the SISO demodulator (301) output at turbo iteration (n — 1), and the second log-likelihood adder (A2) adapted to provide soft information to the CPM signal reconstructor ρ2 at iteration (n) based on a-priori log-likelihood information (318) from the second CB+S block (314) of the equalizer (307) at iteration (n) and the extrinsic log-likelihood information (315) from the SISO demodulator (301) output at turbo iteration (n — 1).
4. CPM receiver (308) of any of the preceding claims, further comprising a low-pass filter (313) adapted to receive a digital input signal and output a low -pass filtered digital signal (309).
5. CPM receiver (308) of any of the preceding claims, wherein the EMS or the EM estimation is either a soft or a hard estimation.
6. CPM receiver (308) of any of the preceding claims, wherein the EM estimation is based either on a full or reduced -complexity EM algorithm.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
NO20220514 | 2022-05-04 | ||
NO20220514A NO347523B1 (en) | 2022-05-04 | 2022-05-04 | Continuous phase modulation receiver |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2023213962A1 true WO2023213962A1 (en) | 2023-11-09 |
Family
ID=86424897
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/EP2023/061836 WO2023213962A1 (en) | 2022-05-04 | 2023-05-04 | Continuous phase modulation receiver |
Country Status (2)
Country | Link |
---|---|
NO (1) | NO347523B1 (en) |
WO (1) | WO2023213962A1 (en) |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020034264A1 (en) | 2000-05-25 | 2002-03-21 | Vigil Armando J. | Method for demodulating a digital signal subjected to multipath propagation impairment and an associated receiver |
US20120069936A1 (en) | 2010-09-17 | 2012-03-22 | Harris Corporation, Corporation Of The State Of Delaware | Mobile wireless communications device and receiver with demodulation and related methods |
-
2022
- 2022-05-04 NO NO20220514A patent/NO347523B1/en unknown
-
2023
- 2023-05-04 WO PCT/EP2023/061836 patent/WO2023213962A1/en unknown
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20020034264A1 (en) | 2000-05-25 | 2002-03-21 | Vigil Armando J. | Method for demodulating a digital signal subjected to multipath propagation impairment and an associated receiver |
US20120069936A1 (en) | 2010-09-17 | 2012-03-22 | Harris Corporation, Corporation Of The State Of Delaware | Mobile wireless communications device and receiver with demodulation and related methods |
Non-Patent Citations (5)
Title |
---|
EL CHAMAA MAKRAM ET AL: "Turbo-Estimation for CPM Over Frequency-Selective Fast Fading Channels", IEEE TRANSACTIONS ON COMMUNICATIONS, IEEE SERVICE CENTER, PISCATAWAY, NJ. USA, vol. 68, no. 4, 19 March 2019 (2019-03-19), pages 2538 - 2550, XP011783263, ISSN: 0090-6778, [retrieved on 20200415], DOI: 10.1109/TCOMM.2019.2906231 * |
KOCA M., DELIC H.: "Doubly Iterative Equalization of Continuous-Phase Modulation", IEEE TRANSACTIONS ON COMMUNICATIONS, December 2007 (2007-12-01) |
KOCA M.DELIC H: "Double Turbo Equalization of Continuous Phase Modulation with Frequency Domain Processing", IEEE TRANSACTIONS ON COMMUNICATIONS, March 2009 (2009-03-01) |
OZGUL B ET AL: "Double turbo equalization of continuous phase modulation with frequency domain processing", IEEE TRANSACTIONS ON COMMUNICATIONS, IEEE SERVICE CENTER, PISCATAWAY, NJ. USA, vol. 57, no. 2, 1 February 2009 (2009-02-01), pages 423 - 429, XP011267520, ISSN: 0090-6778, DOI: 10.1109/TCOMM.2009.02.060674 * |
OZGUL B ET AL: "Doubly Iterative Equalization of Continuous-Phase Modulation", IEEE TRANSACTIONS ON COMMUNICATIONS, IEEE SERVICE CENTER, PISCATAWAY, NJ. USA, vol. 55, no. 11, 1 November 2007 (2007-11-01), pages 2114 - 2124, XP011197232, ISSN: 0090-6778, DOI: 10.1109/TCOMM.2007.908550 * |
Also Published As
Publication number | Publication date |
---|---|
NO20220514A1 (en) | 2023-11-06 |
NO347523B1 (en) | 2023-12-11 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6862326B1 (en) | Whitening matched filter for use in a communications receiver | |
EP2947799B1 (en) | Method of widely linear turbo-equalisation in a multi-user system and for a multi-antenna receiver | |
WO2007112489A1 (en) | Channel estimation for rapid dispersive fading channels | |
CA2596183A1 (en) | Wireless communications device performing block equalization based upon prior, current and/or future autocorrelation matrix estimates and related methods | |
FR2915840A1 (en) | DECODING SYMBOLS OF A SIGNAL DISTRIBUTED FOLLOWING FREQUENCY AND TIME DIMENSIONS | |
WO2005114887A1 (en) | Disjoint iterative chip equalisation and multi-user detection for cdma communication systems on a mimo channel | |
Ishihara et al. | Frequency-domain equalization aided iterative detection of faster-than-Nyquist signaling with noise whitening | |
KR100816032B1 (en) | Method of data transmission with iterative multi-user detection, and aparatus using the same | |
Romano et al. | Non-data aided adaptive channel shortening for efficient multi-carrier systems | |
Schniter et al. | Equalization of time-varying channels | |
Liu et al. | Iterative frequency-domain channel estimation and equalization for single-carrier transmissions without cyclic-prefix | |
Dinis et al. | IB‐DFE receivers with space diversity for CP‐assisted DS‐CDMA and MC‐CDMA systems | |
Choi | Low density spreading for multicarrier systems | |
WO2023213962A1 (en) | Continuous phase modulation receiver | |
Hong et al. | Performance enhancement of faster-than-Nyquist signaling based single-carrier frequency-domain equalization systems | |
EP3528443B1 (en) | Method for calculating an estimate of a modulated digital signal and its reliability | |
Wang et al. | Channel estimation and equalization for SS-OOFDM system with high mobility | |
Yang et al. | A factor graph approach to exploiting cyclic prefix for equalization in OFDM systems | |
Haselmayr et al. | Iterative detection for unique word OFDM | |
Guo et al. | Single‐and multi‐carrier IDMA schemes with cyclic prefixing and zero padding techniques | |
Chen et al. | A turbo FDE technique for OFDM system without cyclic prefix | |
Ravaei et al. | Low‐complexity frequency‐domain turbo equalisation for doubly‐selective HF channel on GPP‐based SDR platform | |
EP1589673A1 (en) | Iterative multiuser detection for CDMA communications systems on MIMO canal | |
Li et al. | Low Complexity Turbo SIC-MMSE Detection for Orthogonal Time Frequency Space Modulation | |
Peng et al. | An improved iterative channel estimation based LTE downlink |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 23724793 Country of ref document: EP Kind code of ref document: A1 |