WO2004110003A1 - A data processing method, receiver and network element for executing a turbo principle - Google Patents

A data processing method, receiver and network element for executing a turbo principle Download PDF

Info

Publication number
WO2004110003A1
WO2004110003A1 PCT/FI2004/000335 FI2004000335W WO2004110003A1 WO 2004110003 A1 WO2004110003 A1 WO 2004110003A1 FI 2004000335 W FI2004000335 W FI 2004000335W WO 2004110003 A1 WO2004110003 A1 WO 2004110003A1
Authority
WO
WIPO (PCT)
Prior art keywords
calculation
interference
matrix
receiver
calculation module
Prior art date
Application number
PCT/FI2004/000335
Other languages
French (fr)
Inventor
Tadashi Matsumoto
Kimmo Kansanen
Mariella SÄRESTÖNIEMI
Original Assignee
Nokia Corporation
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from FI20030845A external-priority patent/FI20030845A0/en
Application filed by Nokia Corporation filed Critical Nokia Corporation
Publication of WO2004110003A1 publication Critical patent/WO2004110003A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L25/03171Arrangements involving maximum a posteriori probability [MAP] detection
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/76Architectures of general purpose stored program computers
    • G06F15/80Architectures of general purpose stored program computers comprising an array of processing units with common control, e.g. single instruction multiple data processors
    • G06F15/8046Systolic arrays
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/0202Channel estimation
    • H04L25/024Channel estimation channel estimation algorithms
    • H04L25/0242Channel estimation channel estimation algorithms using matrix methods
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L25/03178Arrangements involving sequence estimation techniques
    • H04L25/03248Arrangements for operating in conjunction with other apparatus
    • H04L25/0328Arrangements for operating in conjunction with other apparatus with interference cancellation circuitry
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L25/03178Arrangements involving sequence estimation techniques
    • H04L25/03312Arrangements specific to the provision of output signals
    • H04L25/03318Provision of soft decisions
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L25/00Baseband systems
    • H04L25/02Details ; arrangements for supplying electrical power along data transmission lines
    • H04L25/03Shaping networks in transmitter or receiver, e.g. adaptive shaping networks
    • H04L25/03006Arrangements for removing intersymbol interference
    • H04L2025/0335Arrangements for removing intersymbol interference characterised by the type of transmission
    • H04L2025/03426Arrangements for removing intersymbol interference characterised by the type of transmission transmission using multiple-input and multiple-output channels

Definitions

  • the invention relates to a data processing method in a receiver of a communication system, a receiver and a network element.
  • turbo principle soft information is exchanged between different blocks in a communication receiver.
  • a minimum mean-square error (MMSE) algorithm is widely used in prior art equalizers.
  • a MMSE criterion seeks tap weights that minimize the mean-square error between the desired output and actual output of an equalizer.
  • the problem is computational complexity, which typically lies in the computation of MMSE incorporating an inverse covariance matrix.
  • the invention provides an improved method, receiver and a network element.
  • a data processing method in a receiver of a communication system includes: estimating interference from a received signal, formulating components of an interference covariance matrix of the interference cancelled received signal, formulating calculation terms from the components of the interference covariance matrix utilizing a matrix inversion lemma and creating calculation modules using the calculation terms, wherein the calculation modules have the same structure, connecting the calculation modules for generating a systolic array, wherein the systolic array carries out iterative calculation where partial computational results are forwarded from one calculation module to the next calculation module so that the result of the iterative calculation is the inverse matrix of the interference covariance matrix, wherein the inverse matrix is used in channel equalization.
  • a receiver of a communication system including: means for estimating interference from a received signal, means for formulating components of an interference covariance matrix of the received signal, means for carrying out iterative calculation by a systolic array where partial computational results are forwarded from one calculation module to the next calculation module so that the result of the iterative calculation is the inverse matrix of the interference covariance matrix, wherein the inverse matrix is used in channel equalization.
  • a network element of a communication system including: means for estimating interference from a received signal, means for formulating components of an interference covariance matrix of the received signal, means for carrying out iterative calculation by a systolic array where partial computational results are forwarded from one calculation module to the next calculation module so that the result of the iterative calculation is the inverse matrix of the interference covariance matrix, wherein the inverse matrix is used in channel equalization.
  • a receiver of a communication system configured to: estimate interference from a received signal, formulate components of an interference covariance matrix of the received signal, carry out iterative calculation by a systolic array where partial computational results are forwarded from one calculation module to the next calculation module so that the result of the iterative calculation being the inverse matrix of the interference covariance matrix, wherein the inverse matrix is used in channel equalization.
  • a network element of a communication system configured to: estimate interference from a received signal, formulate components of an interference covariance matrix of the received signal, carry out iterative calculation by a systolic array where partial computational results are forwarded from one calculation module to the next calculation module so that the result of the iterative calculation being the inverse matrix of the interference covariance matrix, wherein the inverse matrix is used in channel equalization.
  • the speed of the calculation is higher than in the prior art solutions.
  • Another advantage is that the identical structure of the modules of the systolic array makes the device easier to produce during production.
  • the systolic array is also a flexible structure. Namely, it can be adjusted according to parameters affecting the dimensionality of MMSE calculation, such as the length of a channel response and the number of antennas.
  • Figure 1 shows an example of a communication system which may be employed according to one embodiment in the invention
  • Figure 2 is a flow chart of the method of processing data according to one embodiment of the invention
  • Figure 3 shows an example of a soft interference canceller/Minimum-Mean-Square Equalizer (SC/MMSE) turbo receiver structure according to one embodiment of the invention
  • Figure 4 illustrates an example of a calculation module according to one embodiment of the invention
  • Figure 5 shows an example of a systolic array according to one embodiment of the invention.
  • Figure 6 shows an example of a receiver according to one embodiment of the invention.
  • the invention can be applied to various wireless communication systems.
  • a UMTS (Universal Mobile Telecommunications System) radio access network is a radio access network which includes WCDMA (wideband code division multiple access) technology and can offer also real-time IP-based (Internet Protocol) services, which are, for example, IP telephony (IPT), IP- based streaming and IP -multimedia via a connection to an IP-network.
  • WCDMA wideband code division multiple access
  • IPT IP telephony
  • IP-based streaming IP based streaming
  • IP -multimedia via a connection to an IP-network.
  • Figure 1 is a simplified illustration of a digital data transmission system to which the solution according to the invention is applicable.
  • Figure 1 illustrates a part of a cellular radio system, which includes a base station (or a node B) 100, which has bi-directional radio links 102 and 104 to subscriber terminals 106 and 108.
  • the subscriber terminals may be fixed, vehicle-mounted or portable.
  • the base station includes transmitters, for instance. From the transceivers of the base station there is a connection to an antenna unit, which establishes the bi-directional radio links to the subscriber terminal.
  • the base station is further connected to a radio network controller 110, which transmits the connections of the terminals to the other parts of the network.
  • the base station controller controls in a centralized manner several base stations connected to it.
  • the cellular radio system can also communicate with other networks, such as a public switched telephone network or the Internet.
  • FIG. 2 is a flow chart describing an embodiment of the invention.
  • the invention is related to a method for executing a turbo principle in a receiver of a communication system.
  • the turbo principle means that soft information typically including quality information is exchanged between different blocks in a communication receiver.
  • the turbo principle is an iterative process.
  • the quality information that is also called reliability information may be a posteriori probability information, for instance.
  • the embodiment is used in a channel equalizer.
  • the turbo principle can be applied to many detection/decoding problems such as channel estimation, channel equalization, coded modulation, multi-user detection and channel decoding.
  • the example depicted in Figure 3 relates to equalization. Equalization is required because of inter-symbol interference (ISI) resulting from multi-path propagation.
  • the equalizer depicted in the example shown in Figure 3 includes a soft interference canceller (SC) followed by an MMSE filter (Minimum-Mean-Square Equalizer) optimized with the knowledge of channel decoder feedback, channel response and noise level.
  • SC/MMSE equalizer uses the knowledge of transmitted bits.
  • the principle of turbo equalization applied to the usage of an SC/MMSE algorithm leads to a structure where the likelihood information is exchanged between the SC/MMSE equalizer and a decoder tlirough interleaving/de-interleaving blocks.
  • the SC/MMSE turbo receiver structure can be applied not only to the equalization of inter-symbol interference for single-carrier signaling but also to various other signaling schemes, such as multiple signal detection and detection in multiple-input- multiple-output (MIMO) systems.
  • MIMO multiple-input- multiple-output
  • An example of the SC/MMSE turbo receiver structure is shown in Figure 3.
  • the SC/MMSE equalizer 300 is connected to the decoder 304 via a de-interleaver 302.
  • the decoder feeds back a priori information regarding the value of the symbols transmitted to the SC/MMSE equalizer 300 via an interleaver 306.
  • the method is used in a channel equalizer.
  • the embodiment discussed in Figure 2 begins in block 200.
  • the interference in a radio channel is estimated.
  • the interference estimation is known in the art and it is therefore not explained here in further detail.
  • One method widely used for performing interference estimation is measuring the impulse response of a received signal. If there are several radio channels of interest, interference is usually estimated in these channels. In a multi-user system, the interference can be estimated for every user in a multiuser system or a common interference estimate is used. In the example provided in this description, the received signal is modelled with the linear model:
  • H( «) is a channel response matrix during time n
  • b( ) is a symbol vector containing symbol transmitted during time n and a predetermined number of previous L-l symbols and L-l following symbols, where L is a channel memory length
  • w(n) is a complex noise vector during time n with variance ⁇ .
  • components of an interference covariance matrix of the received signal are formulated. This is typically carried out after partial interference cancellation. This discussion provides an example of an interference covariance matrix for channel coded BPSK-modulated (binary phase shift keying) systems.
  • ⁇ (n) H(»)[ diag(l - b 2 (»))] H ff (n) + ⁇ w 2 l + h(n)(b 2 (n))h H (n) , Equation (2)
  • H is a channel response matrix
  • H means matrix conjugate transpose
  • h( ⁇ ) is the nth column of ⁇ L( )
  • I is an identity matrix
  • is variance of the noise
  • b(n) is the soft symbol estimate of the nth symbol calculated as
  • ⁇ o is the a priori likelihood information on the value of a transmitted symbol, which is the information that a decoder provides for the SC/MMSE equalizer.
  • H is a channel response matrix
  • I is an identity matrix, ⁇ ?.is variance of the noise.
  • b(n) is the soft symbol estimate of the nth symbol calculated as
  • ⁇ o is the a priori likelihood information on the value of a transmitted symbol, which is the information that a decoder provides for the SC/MMSE equalizer.
  • calculation terms are formed from the components of the interference covariance matrix using a matrix inversion lemma, and calculation modules similar to each other are created using the calculation terms.
  • the matrix inversion lemma for a square matrix A is:
  • h /c (n) is the Ath column of H(n), H(n) being a channel response matrix,
  • I is an identity matrix
  • ⁇ 2 is variance of the noise
  • b( t) is a soft symbol estimate of /th symbol
  • h(n) is the nth column of H(n)
  • b(n) is the soft symbol estimate of the nth symbol calculated as
  • ⁇ o is the a priori likelihood information on the value of a transmitted symbol, which is the information that a decoder provides for the SC/MMSE equalizer
  • L is the length of the multi-path channel.
  • over-sampling or multiple antennas are used.
  • the calculation terms may also be referred to as data buses or internal signals.
  • the matrix inversion lemma given by equation (4) can be used when inverting the matrix B.
  • the calculation modules are connected for generating a systolic array and the inversion of the covariance matrix (2) is carried out using iterative calculation, where each covariance matrix component is incorporated into the inverse by one calculation module.
  • the number of modules depends, for instance, on the size of the matrix to be inverted that in turn depends on the length of a channel filter.
  • the length of the channel filter is determined on the basis of the length of a channel response, sample rate and/or the number of antennas.
  • the result of the iterative calculation is the inverse matrix of the interference covariance matrix.
  • the inverse matrix is used in MMSE processing.
  • the inverse can be constructed by applying the matrix inversion lemma equation (4) repeatedly.
  • the calculation terms of equation (5) are calculated for each symbol when the previous cumulative inverse is used for calculating a new outer product.
  • the calculation is implemented as a systolic array, where each calculation module performs one iteration and the last module in the array of the implementation produces the final matrix inverse.
  • the initial value includes the matrix ⁇ A w 2 L that is the inverse of the noise variance matrix of the received signal, the last (nth) value of the impulse response matrix hn and the feedback information delayed by delay elements. This is performed in block 208.
  • the method ends in block 210.
  • Arrow 212 illustrates that the method may be reiterative.
  • the method may be repeated for the next symbol n+1 by defining the partial matrix H(n+1) where the oldest buffered interference component is discarded and a new component is introduced.
  • the channel equalization is made on the basis of the determined inversed covariance matrix.
  • Figure 4 illustrates an example of a calculation module 400 for implementing the calculation of the covariance matrix inversion described above.
  • the letters L and R indicate the left and right side of the multiplications shown in the figure.
  • the terms used are according to equations (4), (5) and (6).
  • the vector value B " is the inverse matrix and the input value h is a channel response vector for a current symbol.
  • the channel response value is conveyed to block 404 where conjugate transpose is calculated.
  • the input matrix B "1 is first transferred to multipliers 402, 406.
  • the multiplier 402 calculates the multiplication of the channel response value and the matrix B " , the result being the calculation term B _1 C, and the multiplier 406 calculates the multiplication of a conjugate transpose of the channel response value and the matrix B "1 , the result being the calculation term C H B _1 .
  • the matrix B "1 is also conveyed to a multiplier 408, and the result of the multiplication is the calculation term C ⁇ C.
  • the calculation term C H B _1 C and the scalar d are added in the adder 410, and the result is then inversed in block 412.
  • the calculation term is conveyed to a multiplier 418 where the multiplication with the matrix B "1 is calculated.
  • the output of the calculation module 400 is the result of adder 420, which is B "1 - B _1 C(d+ CVC) "1 C H B "1 .
  • Figure 5 shows an example of a systolic array 500, which includes a number of calculation modules described above.
  • the number of calculation modules may vary according to the implementation.
  • the number of calculation modules is determined, for example, on the basis of the number of transmission antemias or the number of users. Other parameters that may affect the number of calculation modules are, for instance, the length of the impulse response or the number of simultaneous users.
  • calculation modules 400A- 400D forming a systolic array.
  • the calculation modules are connected to each other for carrying out the iterative calculation explained above.
  • Input information to the first calculation module of the array 400A includes the matrix ⁇ 2 v l which is the inverse of the noise variance matrix of the received signal, the last (nth) vector of the impulse response matrix n and the feedback information from a decoder.
  • a soft symbol estimate of the symbol of interest and a predetermined number of previous symbols and following symbols are delayed by delay elements 502, 504 for synchronizing the symbols with the information processed in each calculation module.
  • the symbols are also inverted in block 516.
  • the information from channel estimation 512 i.e. the impulse response matrix vectors h n , h n-1 ,..., h ls is also delayed for synchronization.
  • delay elements 508, 510 for this purpose. The number of delay elements depends on the length of the array. Delay elements are known in the art and are not explained here in further detail.
  • the input information for the following calculation modules includes the output of the previous calculation module, in other words the term B "1 , the delayed feedback soft information and the impulse response matrix value h which is the first term left in the covariance matrix.
  • FIG 5 there is also depicted an additive structure of a systolic array for multi-user detection or detection of multi-antenna transmissions.
  • the structure of the systolic array is the same for all users or signals (calculation modules 400A and 400B) until the final stage (calculation modules 400C and 400D).
  • the final stage there are as many inversion blocks and last calculation modules as there are signals or users to be detected.
  • one additive final stage as an example (calculation modules 400C and 400D).
  • the feedback information, b 2 (n) regarding the first user or signal and b 2 ( ⁇ ) regarding the second user or signal, for the last calculation modules 400C and 400D is a priori likelihood information regarding the value of the transmitted symbol that the decoder provides for the SC/MMSE equalizer.
  • the value b 2 (n) is inverted in block 506 and the value b 2 (n) is inverted in block 514.
  • Channel estimates hi and h 2 as well as the symbol (or bit) estimates b 2 (n) and b 2 (n) stand for the desired interference, being situated in the middle of the period of interest.
  • the input values of the inverters 506, 514, 516 of the systolic array may be limited from the process discussed below with regard to Figure 6, and the input inverters 506, 514, 516 may also be limited by a given threshold.
  • the threshold is determined in such a way that the numerical stability is guaranteed.
  • FIG. 6 shows an example of a receiver of a network element.
  • the receiver uses in this example the same antenna 600 as a transmitter and therefore there is also a duplex filter 602 to separate transmission and reception.
  • the antenna may be an antenna array or a single antenna.
  • RF parts 604 in this example also include a power amplifier, which amplifies the received signal attenuated on a radio path. Typically, RF parts down-convert a signal to an intermediate frequency and then to a base band frequency or straight to a base band frequency.
  • An analog-to-digital converter 606 converts an analog signal to digital form by sampling and quantizing.
  • a channel estimator 608 estimates interference from a received signal and formulates components of an interference covariance matrix of the interference cancelled received signal.
  • the interference estimation is known in the prior art.
  • the systolic array described above is shown in block 500 in Figures 5 and 6.
  • the implementation solution of the systolic array 500 may, for instance, be an ASIC (Application Specific Integrated Circuit) component.
  • the Digital Signal Processing (DSP) unit is block 610.
  • Typical functions of a DSP block include de-scrambling, decoding, de-interleaving etc.
  • the basics of the digital signal processing are known in the art.

Landscapes

  • Engineering & Computer Science (AREA)
  • Power Engineering (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Computing Systems (AREA)
  • Probability & Statistics with Applications (AREA)
  • Mathematical Physics (AREA)
  • Cable Transmission Systems, Equalization Of Radio And Reduction Of Echo (AREA)

Abstract

A data processing method in a receiver of a communication system, a receiver and a network element is provided. A receiver of a communication system includes: means for estimating interference of a received signal, means for formulating components of an interference covariance matrix from the received signal, means for carrying out iterative calculation by a systolic array where partial computational results are forwarded from one calculation module to the next calculation module so that the result of the iterative calculation being the inverse matrix of the interference covariance matrix, wherein the inverse matrix is used in channel equalization.

Description

TITLE OF THE INVENTION:
A DATA PROCESSING METHOD, RECEIVER AND NETWORK
ELEMENT FOR EXECUTING A TURBO PRINCIPLE
BACKGROUND OF THE INVENTION:
Field of the Invention:
[0001] The invention relates to a data processing method in a receiver of a communication system, a receiver and a network element.
Description of the Related Art:
[0002] Since the beginning of information and coding theory, the objective has been to come as close as possible to the Shannon limit performance. Iterative processing techniques, usually called the turbo principle, have lead to improvement in signal processing in receivers so that the Shannon capacity has effectively been achieved. In the turbo principle, soft information is exchanged between different blocks in a communication receiver.
[0003] It is possible to apply the turbo principle to many detection/decoding problems, such as channel estimation, channel equalization, coded modulation, multi-user detection and channel decoding.
[0004] A minimum mean-square error (MMSE) algorithm is widely used in prior art equalizers. A MMSE criterion seeks tap weights that minimize the mean-square error between the desired output and actual output of an equalizer.
[0005] The problem is computational complexity, which typically lies in the computation of MMSE incorporating an inverse covariance matrix.
SUMMARY OF THE INVENTION:
[0006] The invention provides an improved method, receiver and a network element. According to an embodiment of the invention, there is provided a data processing method in a receiver of a communication system. The method includes: estimating interference from a received signal, formulating components of an interference covariance matrix of the interference cancelled received signal, formulating calculation terms from the components of the interference covariance matrix utilizing a matrix inversion lemma and creating calculation modules using the calculation terms, wherein the calculation modules have the same structure, connecting the calculation modules for generating a systolic array, wherein the systolic array carries out iterative calculation where partial computational results are forwarded from one calculation module to the next calculation module so that the result of the iterative calculation is the inverse matrix of the interference covariance matrix, wherein the inverse matrix is used in channel equalization.
[0007] According to another embodiment of the invention, there is provided a receiver of a communication system including: means for estimating interference from a received signal, means for formulating components of an interference covariance matrix of the received signal, means for carrying out iterative calculation by a systolic array where partial computational results are forwarded from one calculation module to the next calculation module so that the result of the iterative calculation is the inverse matrix of the interference covariance matrix, wherein the inverse matrix is used in channel equalization.
[0008] According to another embodiment of the invention, there is provided a network element of a communication system including: means for estimating interference from a received signal, means for formulating components of an interference covariance matrix of the received signal, means for carrying out iterative calculation by a systolic array where partial computational results are forwarded from one calculation module to the next calculation module so that the result of the iterative calculation is the inverse matrix of the interference covariance matrix, wherein the inverse matrix is used in channel equalization.
[0009] According to another embodiment of the invention, there is provided a receiver of a communication system, configured to: estimate interference from a received signal, formulate components of an interference covariance matrix of the received signal, carry out iterative calculation by a systolic array where partial computational results are forwarded from one calculation module to the next calculation module so that the result of the iterative calculation being the inverse matrix of the interference covariance matrix, wherein the inverse matrix is used in channel equalization.
[0010] According to another embodiment of the invention, there is provided a network element of a communication system, configured to: estimate interference from a received signal, formulate components of an interference covariance matrix of the received signal, carry out iterative calculation by a systolic array where partial computational results are forwarded from one calculation module to the next calculation module so that the result of the iterative calculation being the inverse matrix of the interference covariance matrix, wherein the inverse matrix is used in channel equalization.
[0011] The method and system of the invention provide several advantages. In one embodiment of the invention, the speed of the calculation is higher than in the prior art solutions. Another advantage is that the identical structure of the modules of the systolic array makes the device easier to produce during production. The systolic array is also a flexible structure. Namely, it can be adjusted according to parameters affecting the dimensionality of MMSE calculation, such as the length of a channel response and the number of antennas.
BRIEF DESCRIPTION OF THE DRAWINGS:
[0012] In the following, the invention will be described in greater detail with reference to the preferred embodiments and the accompanying drawings, in which
[0013] Figure 1 shows an example of a communication system which may be employed according to one embodiment in the invention; [0014] Figure 2 is a flow chart of the method of processing data according to one embodiment of the invention;
[0015] Figure 3 shows an example of a soft interference canceller/Minimum-Mean-Square Equalizer (SC/MMSE) turbo receiver structure according to one embodiment of the invention;
[0016] Figure 4 illustrates an example of a calculation module according to one embodiment of the invention;
[0017] Figure 5 shows an example of a systolic array according to one embodiment of the invention; and
[0018] Figure 6 shows an example of a receiver according to one embodiment of the invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS: [0019] With reference to Figure 1, an example of a data transmission system to which the embodiments of the invention can be applied is shown. The invention can be applied to various wireless communication systems. One example of such a communication system is a UMTS (Universal Mobile Telecommunications System) radio access network. The UMTS radio access network is a radio access network which includes WCDMA (wideband code division multiple access) technology and can offer also real-time IP-based (Internet Protocol) services, which are, for example, IP telephony (IPT), IP- based streaming and IP -multimedia via a connection to an IP-network. The embodiments are not, however, restricted to the system given as an example but one skilled in the art may apply the solution to other radio systems provided with the necessary properties.
[0020] It is clear to one skilled in the art that the method according to the invention can be applied to systems utilizing different modulation methods or air interface standards. Figure 1 is a simplified illustration of a digital data transmission system to which the solution according to the invention is applicable. Figure 1 illustrates a part of a cellular radio system, which includes a base station (or a node B) 100, which has bi-directional radio links 102 and 104 to subscriber terminals 106 and 108. The subscriber terminals may be fixed, vehicle-mounted or portable. The base station includes transmitters, for instance. From the transceivers of the base station there is a connection to an antenna unit, which establishes the bi-directional radio links to the subscriber terminal. The base station is further connected to a radio network controller 110, which transmits the connections of the terminals to the other parts of the network. The base station controller controls in a centralized manner several base stations connected to it.
[0021] The cellular radio system can also communicate with other networks, such as a public switched telephone network or the Internet.
[0022] Figure 2 is a flow chart describing an embodiment of the invention. The invention is related to a method for executing a turbo principle in a receiver of a communication system. Briefly, the turbo principle means that soft information typically including quality information is exchanged between different blocks in a communication receiver. Thus, the turbo principle is an iterative process. The quality information that is also called reliability information may be a posteriori probability information, for instance. The embodiment is used in a channel equalizer.
[0023] It is possible to apply the turbo principle to many detection/decoding problems such as channel estimation, channel equalization, coded modulation, multi-user detection and channel decoding. The example depicted in Figure 3 relates to equalization. Equalization is required because of inter-symbol interference (ISI) resulting from multi-path propagation. The equalizer depicted in the example shown in Figure 3 includes a soft interference canceller (SC) followed by an MMSE filter (Minimum-Mean-Square Equalizer) optimized with the knowledge of channel decoder feedback, channel response and noise level. The SC/MMSE equalizer uses the knowledge of transmitted bits. The principle of turbo equalization applied to the usage of an SC/MMSE algorithm leads to a structure where the likelihood information is exchanged between the SC/MMSE equalizer and a decoder tlirough interleaving/de-interleaving blocks. The SC/MMSE turbo receiver structure can be applied not only to the equalization of inter-symbol interference for single-carrier signaling but also to various other signaling schemes, such as multiple signal detection and detection in multiple-input- multiple-output (MIMO) systems. An example of the SC/MMSE turbo receiver structure is shown in Figure 3. The SC/MMSE equalizer 300 is connected to the decoder 304 via a de-interleaver 302. The decoder feeds back a priori information regarding the value of the symbols transmitted to the SC/MMSE equalizer 300 via an interleaver 306. The method is used in a channel equalizer.
[0024] The embodiment discussed in Figure 2 begins in block 200. In block 202 the interference in a radio channel is estimated. The interference estimation is known in the art and it is therefore not explained here in further detail. One method widely used for performing interference estimation is measuring the impulse response of a received signal. If there are several radio channels of interest, interference is usually estimated in these channels. In a multi-user system, the interference can be estimated for every user in a multiuser system or a common interference estimate is used. In the example provided in this description, the received signal is modelled with the linear model:
γ( ) = ΕL(ή)b(ή) + v( ) , Equation (1) where
H(«) is a channel response matrix during time n, b( ) is a symbol vector containing symbol transmitted during time n and a predetermined number of previous L-l symbols and L-l following symbols, where L is a channel memory length, w(n) is a complex noise vector during time n with variance σ . [0025] In block 204, components of an interference covariance matrix of the received signal are formulated. This is typically carried out after partial interference cancellation. This discussion provides an example of an interference covariance matrix for channel coded BPSK-modulated (binary phase shift keying) systems. The exemplary covariance matrix of the received signal after the cancellation of interference components is: θ (n) = H(»)[ diag(l - b2 (»))] Hff (n) + σw 2l + h(n)(b2 (n))hH (n) , Equation (2) where
H is a channel response matrix, H means matrix conjugate transpose, h(ή) is the nth column of ΕL( ),
I is an identity matrix, σ is variance of the noise, b(n)is the soft symbol estimate of the nth symbol calculated as
(λ Λ b(7i) = tanh — , Equation (3)
V. 2 ) where λo is the a priori likelihood information on the value of a transmitted symbol, which is the information that a decoder provides for the SC/MMSE equalizer. The exemplary covariance matrix of the interference component of the received signal after cancellation is: θ(n) = H(n)[
Figure imgf000009_0001
Hff (n) + σw 2ϊ , Equation (4) where
H is a channel response matrix,
(.)H means a matrix conjugate transpose,
I is an identity matrix, σ?.is variance of the noise. b(n)is the soft symbol estimate of the nth symbol calculated as
Figure imgf000009_0002
where λo is the a priori likelihood information on the value of a transmitted symbol, which is the information that a decoder provides for the SC/MMSE equalizer.
[0026] As can be seen from equation (4), the inversion of the matrix θ(n) is complicated and, therefore, requires a lot of calculation capacity, because the matrix explicit inversion is of a cubical order.
[0027] Therefore, in block 206 in Figure 2, calculation terms are formed from the components of the interference covariance matrix using a matrix inversion lemma, and calculation modules similar to each other are created using the calculation terms. The matrix inversion lemma for a square matrix A is:
A'1 ={p + Cd-1CHY ' „ Equat .i.on ( .5..)
= B"1 - B~'C(d + C*B-1Cf ' CH B_1
[0028] The matrix inversion lemma is expressed in Adaptive Filter Theory, Haykin Simon , 3rd edition, Prentice Hall, 1996, page 565, which is incorporated herein by reference.
[0029] The adaptation of equation (5) to equation (4) produces the following calculation terms:
B = σw 2l+ £/7,(n)(l-b,2 (n) Equation (6) k=n-lΛl
ΓH = hH(ή)
<τ = ι-£2
C = hk(n) , where
(.) means a matrix conjugate transpose, h/c(n) is the Ath column of H(n), H(n) being a channel response matrix,
I is an identity matrix, σ2 is variance of the noise, b( t)is a soft symbol estimate of /th symbol, h(n) is the nth column of H(n), b(n)is the soft symbol estimate of the nth symbol calculated as
Figure imgf000011_0001
λo is the a priori likelihood information on the value of a transmitted symbol, which is the information that a decoder provides for the SC/MMSE equalizer, L is the length of the multi-path channel. Typically, over-sampling or multiple antennas are used.
[0030] It is also possible to take the desired information h(n)ψ2 (n)fιH (n) into consideration when the calculation term B is determined, in which case the calculation term B of equation (6) will become:
σ2I + H %k («)(l - b(k) ιξ (n) + h( )(b2 (n)}ιH (ή) Equation (7)
[0031] The calculation terms may also be referred to as data buses or internal signals.
[0032] The matrix inversion lemma given by equation (4) can be used when inverting the matrix B. Thus, the calculation modules are connected for generating a systolic array and the inversion of the covariance matrix (2) is carried out using iterative calculation, where each covariance matrix component is incorporated into the inverse by one calculation module. The number of modules depends, for instance, on the size of the matrix to be inverted that in turn depends on the length of a channel filter. The length of the channel filter is determined on the basis of the length of a channel response, sample rate and/or the number of antennas. The result of the iterative calculation is the inverse matrix of the interference covariance matrix. The inverse matrix is used in MMSE processing.
[0033] Since the matrix B" s the inverse of a sum of vector outer products, the inverse can be constructed by applying the matrix inversion lemma equation (4) repeatedly. The calculation terms of equation (5) are calculated for each symbol when the previous cumulative inverse is used for calculating a new outer product. The calculation is implemented as a systolic array, where each calculation module performs one iteration and the last module in the array of the implementation produces the final matrix inverse. The initial value includes the matrix σA w2L that is the inverse of the noise variance matrix of the received signal, the last (nth) value of the impulse response matrix hn and the feedback information delayed by delay elements. This is performed in block 208.
[0034] The method ends in block 210. Arrow 212 illustrates that the method may be reiterative. The method may be repeated for the next symbol n+1 by defining the partial matrix H(n+1) where the oldest buffered interference component is discarded and a new component is introduced. The channel equalization is made on the basis of the determined inversed covariance matrix.
[0035] Figure 4 illustrates an example of a calculation module 400 for implementing the calculation of the covariance matrix inversion described above. The letters L and R indicate the left and right side of the multiplications shown in the figure. The terms used are according to equations (4), (5) and (6).
[0036] The vector value B" is the inverse matrix and the input value h is a channel response vector for a current symbol. The channel response value is conveyed to block 404 where conjugate transpose is calculated. The input matrix B"1 is first transferred to multipliers 402, 406. The multiplier 402 calculates the multiplication of the channel response value and the matrix B" , the result being the calculation term B_1C, and the multiplier 406 calculates the multiplication of a conjugate transpose of the channel response value and the matrix B"1, the result being the calculation term CHB_1.
[0037] The matrix B"1 is also conveyed to a multiplier 408, and the result of the multiplication is the calculation term C^^C. The calculation term CHB_1C and the scalar d are added in the adder 410, and the result is then inversed in block 412.
[0038] The output of block 412 and the output of block 402 are conveyed to a multiplier 414. The result of the multiplication calculated in block 414 is then conveyed to a multiplier 416 where the multiplication with the output of block 404 is calculated, the result being the calculation term B_1C(d+ C^B^C)"
1 CH
[0039] The calculation term is conveyed to a multiplier 418 where the multiplication with the matrix B"1 is calculated. The output of the calculation module 400 is the result of adder 420, which is B"1- B_1C(d+ CVC)"1 CH B"1.
[0040] Figure 5 shows an example of a systolic array 500, which includes a number of calculation modules described above. The number of calculation modules may vary according to the implementation. The number of calculation modules is determined, for example, on the basis of the number of transmission antemias or the number of users. Other parameters that may affect the number of calculation modules are, for instance, the length of the impulse response or the number of simultaneous users.
[0041] In this embodiment, there are depicted calculation modules 400A- 400D forming a systolic array. The calculation modules are connected to each other for carrying out the iterative calculation explained above.
[0042] Input information to the first calculation module of the array 400A includes the matrix σ2 vl which is the inverse of the noise variance matrix of the received signal, the last (nth) vector of the impulse response matrix n and the feedback information from a decoder. A soft symbol estimate of the symbol of interest and a predetermined number of previous symbols and following symbols are delayed by delay elements 502, 504 for synchronizing the symbols with the information processed in each calculation module. The symbols are also inverted in block 516. The information from channel estimation 512, i.e. the impulse response matrix vectors hn , hn-1,..., hls is also delayed for synchronization. In the embodiment of Figure 5, there are depicted delay elements 508, 510 for this purpose. The number of delay elements depends on the length of the array. Delay elements are known in the art and are not explained here in further detail.
[0043] The input information for the following calculation modules includes the output of the previous calculation module, in other words the term B"1, the delayed feedback soft information and the impulse response matrix value h which is the first term left in the covariance matrix.
[0044] In Figure 5, there is also depicted an additive structure of a systolic array for multi-user detection or detection of multi-antenna transmissions. In a preferred embodiment, the structure of the systolic array is the same for all users or signals (calculation modules 400A and 400B) until the final stage (calculation modules 400C and 400D). In the final stage, there are as many inversion blocks and last calculation modules as there are signals or users to be detected. In Figure 5, there is shown one additive final stage as an example (calculation modules 400C and 400D). The feedback information, b2(n) regarding the first user or signal and b2 (ή) regarding the second user or signal, for the last calculation modules 400C and 400D is a priori likelihood information regarding the value of the transmitted symbol that the decoder provides for the SC/MMSE equalizer. The value b2(n) is inverted in block 506 and the value b2(n) is inverted in block 514. [0045] Channel estimates hi and h2 as well as the symbol (or bit) estimates b2(n) and b2 (n) stand for the desired interference, being situated in the middle of the period of interest.
[0046] The input values of the inverters 506, 514, 516 of the systolic array may be limited from the process discussed below with regard to Figure 6, and the input inverters 506, 514, 516 may also be limited by a given threshold. The threshold is determined in such a way that the numerical stability is guaranteed.
[0047] Figure 6 shows an example of a receiver of a network element. The receiver uses in this example the same antenna 600 as a transmitter and therefore there is also a duplex filter 602 to separate transmission and reception. The antenna may be an antenna array or a single antenna. In a receiver, RF parts 604 in this example also include a power amplifier, which amplifies the received signal attenuated on a radio path. Typically, RF parts down-convert a signal to an intermediate frequency and then to a base band frequency or straight to a base band frequency. An analog-to-digital converter 606 converts an analog signal to digital form by sampling and quantizing.
[0048] A channel estimator 608 estimates interference from a received signal and formulates components of an interference covariance matrix of the interference cancelled received signal. The interference estimation is known in the prior art.
[0049] The systolic array described above is shown in block 500 in Figures 5 and 6. The implementation solution of the systolic array 500 may, for instance, be an ASIC (Application Specific Integrated Circuit) component.
[0050] The Digital Signal Processing (DSP) unit is block 610. Typical functions of a DSP block include de-scrambling, decoding, de-interleaving etc. The basics of the digital signal processing are known in the art. [0051] Even though the invention has been described above with reference to an example according to the accompanying drawings, it is clear that the invention is not restricted thereto but can be modified in several ways within the scope of the appended claims.

Claims

CLAIMS:
1. A data processing method in a receiver of a communication system, the method comprising: estimating interference from a received signal; formulating components of an interference covariance matrix of an interference cancelled received signal; formulating calculation terms from the components of the interference covariance matrix utilizing a matrix inversion lemma; creating calculation modules using the calculation terms, wherein the calculation modules have a same structure; and connecting the calculation modules for generating a systolic array, wherein the systolic array performs iterative calculation where partial computational results are forwarded from one calculation module to the next calculation module, the partial computational results of the iterative calculation being an inverse matrix of the interference covariance matrix, wherein the inverse matrix is used in channel equalization.
2. The method of claim 1, wherein the connecting step comprises connecting the calculation modules for generating the systolic array, wherein the inverse matrix uses a soft interference canceller minimum mean-square equalizer to perform the channel equalization.
3. The method of claim 1, wherein the creating step comprises creating a number of the calculation modules based on at least one of a number of antennas, a number of samples, a length of the impulse response and a number of simultaneous users.
4. The method of claim 1, wherein the estimating step comprises estimating the interference for at least one user of a multi-user system.
5. The method of claim 1, wherein the estimating step comprises estimating a common interference estimate which is used in a multi-user system.
6. The method of claim 1, wherein the connecting step comprises connecting the calculation modules for generating the systolic array, wherein the systolic array performs the iterative calculation so that data fed back from the one calculation module to the next calculation module comprises soft information.
7. A receiver of a communication system comprising: estimating means for estimating interference from a received signal; formulating means for formulating components of an interference covariance matrix of the received signal; and performing means for performing iterative calculation by a systolic array where partial computational results are forwarded from one calculation module to a next calculation module, the partial computational results of the iterative calculation being an inverse matrix of the interference covariance matrix, wherein the inverse matrix is used in channel equalization.
8. The receiver of claim 7, wherein the performing means further comprises a soft interference canceller minimum mean-square equalizer used in performing the channel equalization.
9. The receiver of claim 7, wherein a number of the calculation modules is determined based on at least one of a number of antennas, a number of samples, a length of the impulse response and a number of simultaneous users.
10. The receiver of claim 7, wherein the estimating means estimates the interference for at least one user in a multi-user system.
11. The receiver of claim 7, wherein the estimating means estimates a common interference estimate which is used in a multi-user system.
12. The receiver of claim 7, wherein the performing means performs the iterative calculation so that data fed back from the one calculation module to the next calculation module comprises soft information.
13. The receiver of claim 7, further comprising: a number of inversion blocks and last calculation modules which corresponds to a number of signals or a number of users to be detected.
14. A network element of a communication system comprising: estimating means for estimating interference from a received signal, formulating means for formulating components of an interference covariance matrix of the received signal, and performing means for performing iterative calculation by a systolic array where partial computational results are forwarded from one calculation module to a next calculation module, the partial computational results of the iterative calculation being an inverse matrix of the interference covariance matrix, wherein the inverse matrix is used in channel equalization.
15. The network element of claim 14, wherein the performing means further comprises a soft interference canceller minimum mean-square equalizer used in performing the channel equalization.
16. The network element of claim 14, wherein a number of the calculation modules is determined based on at least one of a number of antennas, a number of samples, a length of the impulse response and a number of simultaneous users.
17. The network element of claim 14, wherein the estimating means estimates the interference for at least one user in a multi-user system.
18. The network element of claim 14, wherein the estimating means estimates a common interference estimate which is used in a multi-user system.
19. The network element of claim 14, wherein the performing means performs the iterative calculation so that data fed back from the one calculation module to the next calculation module comprises soft information.
20. The network element of claim 14, further comprising: a receiver comprising a number of inversion blocks and last calculation modules which corresponds to a number of signals or a number of users to be detected.
21. A receiver of a communication system, configured to: estimate interference from a received signal; formulate components of an interference covariance matrix of the received signal; and perform iterative calculation by a systolic array where partial computational results are forwarded from one calculation module to a next calculation module, the partial computational results of the iterative calculation being an inverse matrix of the interference covariance matrix, wherein the inverse matrix is used in channel equalization.
22. A network element of a communication system, configured to: estimate interference from a received signal; formulate components of an interference covariance matrix of the received signal; and perform iterative calculation by a systolic array where partial computational results are forwarded from one calculation module to a next calculation module, the partial computational results of the iterative calculation being an inverse matrix of the interference covariance matrix, wherein the inverse matrix is used in channel equalization.
PCT/FI2004/000335 2003-06-05 2004-06-01 A data processing method, receiver and network element for executing a turbo principle WO2004110003A1 (en)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
FI20030845A FI20030845A0 (en) 2003-06-05 2003-06-05 Data processing method, receiver and network device
FI20030845 2003-06-05
US10/640,566 2003-08-14
US10/640,566 US7447285B2 (en) 2003-06-05 2003-08-14 Data processing method, receiver and network element for executing a turbo principle

Publications (1)

Publication Number Publication Date
WO2004110003A1 true WO2004110003A1 (en) 2004-12-16

Family

ID=33512581

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/FI2004/000335 WO2004110003A1 (en) 2003-06-05 2004-06-01 A data processing method, receiver and network element for executing a turbo principle

Country Status (1)

Country Link
WO (1) WO2004110003A1 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005076556A1 (en) * 2004-02-06 2005-08-18 Nokia Corporation Data processing method, equalizer and receiver
WO2007125170A1 (en) * 2006-04-28 2007-11-08 Nokia Corporation Signal processing method, receiver and equalizing method in receiver
CN114337604A (en) * 2021-12-28 2022-04-12 重庆邮电大学 Fine-grained two-parallel Systolic FxLMS filter design method based on FPGA

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
KANSANEN K. ET AL.: "A computationally efficient MIMO turbo-equaliser", THE 57TH IEEE SEMIANNUAL. VEHICULAR TECHNOLOGY CONFERENCE, vol. 1, 22 April 2003 (2003-04-22) - 25 April 2003 (2003-04-25), pages 277 - 281, XP002982210 *
SHADAFAN R.S. ET AL.: "A dynamic neural network architecture by sequential partitioning of the input space", 1993, pages 1 - 17, XP002982211, Retrieved from the Internet <URL:www.mi.eng.cam.ac.uk/reports/sur-ftp/Shadafan_tr157.ps.z> [retrieved on 19930513] *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2005076556A1 (en) * 2004-02-06 2005-08-18 Nokia Corporation Data processing method, equalizer and receiver
WO2007125170A1 (en) * 2006-04-28 2007-11-08 Nokia Corporation Signal processing method, receiver and equalizing method in receiver
US7720140B2 (en) 2006-04-28 2010-05-18 Nokia Corporation Signal processing method, receiver and equalizing method in receiver
CN114337604A (en) * 2021-12-28 2022-04-12 重庆邮电大学 Fine-grained two-parallel Systolic FxLMS filter design method based on FPGA

Similar Documents

Publication Publication Date Title
JP4412926B2 (en) Adaptive equalization apparatus and program thereof
US7359466B2 (en) Signal detection by a receiver in a multiple antenna time-dispersive system
US20070248151A1 (en) Inter-carrier interference cancellation method and receiver using the same in a MIMO-OFDM system
WO2005076556A1 (en) Data processing method, equalizer and receiver
EP1183840A1 (en) Optimization of channel equalizer
US20040081263A1 (en) Method and apparatus for receiving diversity transmissions
JP2000349691A (en) Method for detecting connection of a pair of cdma codes
US8111742B2 (en) Data processing method, equalizer, receiver, communication system, network element, and terminal using simplified channel matrix inversion
GB2414147A (en) Equaliser comprising a first filter for adapting filter coefficients and a second filter for equalising data using the adapted coefficients
US7447285B2 (en) Data processing method, receiver and network element for executing a turbo principle
CN100542146C (en) By Interference Estimation repeatedly and when empty albefaction realize the single antenna anti-interference
US8175135B1 (en) Equalizer with adaptive noise loading
KR20010013294A (en) Time variable adaptation method and data receiver
WO2004110003A1 (en) A data processing method, receiver and network element for executing a turbo principle
JP4401048B2 (en) Method for estimating impulse response of an information transmission channel
KR101035307B1 (en) Joint space-time optimum filtersjstof with at least one antenna, at least one channel, and joint filter weight and cir estimation
KR20080036223A (en) Wireless communications device including a joint space-time optimum filter(jstof) using cholesky and eigenvalue decompositions
JP2009505528A (en) Wireless communication device including an integrated space-time optimal filter (JSTOF) using QR decomposition and eigenvalue decomposition
JP2002204192A (en) Method and apparatus for receiving
CN101199125B (en) Joint space-time optimum filters (JSTOF) for interference cancellation
JP2009505523A (en) Integrated space-time optimal filter (JSTOF) for interference cancellation
JP4560088B2 (en) Joint detection method and base station for wireless communication system having antenna array
US20040120431A1 (en) Wireless receiver and method for determining a representation of noise level of a signal
EP1584154A2 (en) Wireless receiver using noise levels for combining signals having spatial diversity
JP2009505529A (en) Integrated space-time optimal filter (JSTOF) using singular value decomposition (SVD)

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
122 Ep: pct application non-entry in european phase