CN101471696A - Method, apparatus and system for processing data - Google Patents

Abstract

The invention relates to a data processing method. The method comprises the following steps: acquiring channel-shared data and representing the channel-shared data in the form of a shared channel matrix; decomposing the shared channel matrix to the sum of two matrices, wherein either of the two matrices is a quasi-diagonal matrix; calculating an inverse matrix of the shared channel matrix after decomposition according to the two matrices; and sending the inverse matrix. The invention also relates to a data processing device and a data processing system. The data processing method, the data processing device and the data processing system can greatly reduce the calculation complexity and facilitate the practical application.

Description

Data processing method, Apparatus and system

Technical field

The embodiment of the invention relates to communication technical field, relates in particular to a kind of data processing method, Apparatus and system.

Background technology

Different types of digital subscriber line (X Digital Subscriber Line, XDSL) technology is a kind of at twisted pair telephone, be unshielded twisted pair (Unshielded Twist Pair, UTP) Chuan Shu high speed data transfer technology, digital subscriber line (Digital SubscriberLine except baseband transmission, DSL) outside, the xDSL of passband transmission utilizes frequency multiplexing technique to make xDSL and Plain Old Telephone Service (POTS) coexist as with on a pair of twisted-pair feeder, wherein xDSL occupies high band, POTS takies the following baseband portion of 4KHz, the POTS signal separates by separator with the xDSL signal, and the xDSL of passband transmission adopts Discrete multi-tone modulation (DMT).

Along with the raising of xDSL technology service band, crosstalk (Crosstalk) especially the cross-interference issue of high band show to such an extent that become increasingly conspicuous because xDSL up-downgoing channel adopts frequency division multiplexing, near-end cross (NEXT) is not too big to the harm that the performance of system produces; But far-end cross talk (FEXT) can have a strong impact on the transmission performance of circuit; When there being the multichannel user all to require to open xDSL when professional in a bundle cable, can some line speeds be low because far-end cross talk (FEXT) makes, unstable properties even can not open etc., finally cause the line activation rate of DSL couple in multiplexer (DSLAM) lower.

At present, guiding digital subscriber line (vectored-DSL) technology mainly is to utilize the possibility of carrying out combined transceiving at the DSLAM end, use method for processing signals to offset the interference of FEXT, finally make and do not exist FEXT to disturb in each road signal, as shown in Figure 1, hold the structural representation of synchronized transmission signal for existing DSLAM; As shown in Figure 2, hold the structural representation of synchronous received signal for existing DSLAM.

Fig. 1, shared channel H shown in Figure 2 can be expressed as matrix form on frequency domain k sub-carrier frequency (tone):

Wherein, h _IjBe from line to j to the transmission equation of line to i.Under actual conditions, i, j equal to have mutually in the shared channel channel number of the relation of crosstalking, and are made as M here.H is the Channel Transmission matrix of a M * M so, and establishing x again respectively is the channel input vector of M * 1, and y is the channel output vector of M * 1, and n is the noise vector of M * 1, and then the Channel Transmission equation can be expressed as form:

y＝Hx+n

For up, local side (Central Office, CO) signal is united and receive to be handled, and introduces a crosstalk counteracting device W at receiving terminal, the signal that receives is:

$\tilde{y}=\mathrm{WHx}+\mathrm{Wn}$

When WH is a diagonal matrix, crosstalks and to be eliminated.

For descending, unite transmission at CO end signal and handle, introduce a precoder P at the CO end, the signal of Fa Songing is so:

$\tilde{x}=\mathrm{Px}$

The signal that receiving terminal receives is:

$\tilde{y}=\mathrm{HPx}+n$

When HP is a diagonal matrix, crosstalks and to be eliminated.

Available technology adopting zero setting algorithm is converted into diagonal matrix with WH and HP, and promptly for up direction, the crosstalk counteracting device is:

W＝DH ^-1

Drawing the signal that receiving terminal receives so just can be expressed as with vector:

y＝Dx+Wn

For down direction, the elimination precoder of crosstalking is:

P＝H ^-1D

Drawing the signal that receiving terminal receives so can be with vector representation:

y＝Dx+n

Wherein, D is the diagonal matrix of H.

This shows, adopt the zero setting algorithm to need the calculating channel inverse of a matrix, when number of users more for a long time, the dimension of channel matrix increases thereupon, computation complexity improves greatly, causes application difficulty comparatively in practice.

Summary of the invention

The embodiment of the invention provides a kind of data processing method, Apparatus and system, to reduce computation complexity, disturbs thereby eliminate better, so that use in practice.

The embodiment of the invention provides a kind of method of data processing, and this method specifically comprises:

Obtain the shared channel data, and these shared channel data are represented with shared channel matrix;

Described shared channel matrix is decomposed into two matrix sums, one of them matrix diagonal matrix that is as the criterion;

Inverse matrix according to described two the matrix computations shared channel matrix after decomposing;

Described inverse matrix is sent.

Said method greatly reduces computation complexity, helps using in practice.

The embodiment of the invention also provides a kind of data processing equipment, and this device specifically comprises:

Acquisition module is used to obtain the shared channel data, and these shared channel data are represented with shared channel matrix;

Decomposing module is used for described shared channel matrix is decomposed into two matrix sums, one of them matrix diagonal matrix that is as the criterion;

Computing module is used for the inverse matrix according to described two the matrix computations shared channel matrix after decomposing;

Interface module is used for described inverse matrix is sent to precoder or crosstalk counteracting device.

Said apparatus greatly reduces computation complexity, helps using in practice.

The embodiment of the invention provides a kind of data handling system, this system specifically comprises: transmit leg, precoder, shared channel and recipient, wherein, transmit leg sends signal with desire and is sent to the recipient by precoder and shared channel successively, wherein, described transmit leg comprises data processing equipment, and described data processing equipment comprises:

Acquisition module is used to obtain the shared channel data, and these shared channel data are represented with shared channel matrix;

Decomposing module is used for described shared channel matrix is decomposed into two matrix sums, one of them matrix diagonal matrix that is as the criterion;

Computing module is used for the inverse matrix according to described two the matrix computations shared channel matrix after decomposing;

Interface module is used for before transmit leg is sent to precoder with signal described inverse matrix being sent to precoder.

Said system greatly reduces computation complexity, has eliminated preferably and has crosstalked, and helps using in practice.

The embodiment of the invention provides a kind of data handling system, this system specifically comprises: transmit leg, crosstalk counteracting device, shared channel and recipient, wherein, transmit leg sends signal with desire and is sent to the recipient by shared channel and crosstalk counteracting device successively, described recipient comprises data processing equipment, and described data processing equipment comprises:

Acquisition module is used to obtain the shared channel data, and these shared channel data are represented with shared channel matrix;

Decomposing module is used for described shared channel matrix is decomposed into two matrix sums, one of them matrix diagonal matrix that is as the criterion;

Computing module is used for the inverse matrix according to described two the matrix computations shared channel matrix after decomposing;

Interface module is used for before transmit leg is sent to crosstalk canceller with signal described inverse matrix being sent to the crosstalk counteracting device.

Said system greatly reduces computation complexity, has eliminated preferably and has crosstalked, and helps using in practice.

Below by drawings and Examples, technical scheme of the present invention is described in further detail.

Description of drawings

Fig. 1 is the structural representation of existing DSLAM end synchronized transmission signal;

Fig. 2 holds the structural representation of synchronous received signal for existing DSLAM;

Fig. 3 is the flow chart of data processing method embodiment of the present invention;

Fig. 4 is the structural representation of data processing equipment embodiment of the present invention;

Fig. 5 is the structural representation of data handling system embodiment one of the present invention;

Fig. 6 is the structural representation of data handling system embodiment two of the present invention.

Embodiment

As shown in Figure 3, be the flow chart of data processing method embodiment of the present invention, this method specifically comprises:

Step 101, obtain the shared channel data, and these shared channel data are represented with shared channel matrix;

For example the shared channel data can be represented with shared channel matrix H that its concrete representation is as follows:

Wherein M represents to have mutually in the shared channel channel number of the relation of crosstalking;

Step 102, above-mentioned shared channel matrix is decomposed into two matrix sums, one of them matrix diagonal matrix that is as the criterion;

Above-mentioned accurate diagonal matrix representation is as follows:

Wherein, D ₁₁D _{(N-1) (N-1)}Expression n rank matrix, D _NNExpression n rank, (n-1) rank, (n-2) rank ... last element on 2 rank matrixes or the shared channel matrix diagonal; For example can be with shared channel matrix

Do following decomposition:

H＝D _B+E _B；

When M is even number,

Wherein, $D_{\mathrm{nn}}=\left[\begin{array}{cc}{d}_{11}^n& d_{12}^n\\ d_{21}^n& d_{22}^n\end{array}\right]=\left[\begin{array}{cc}{h}_{(2n-1)(2n-1)}& h_{(2n-1)2n}\\ h_{\left(2n\right)(2n-1)}& h_{\left(2n\right)\left(2n\right)}\end{array}\right],$ (n=1,2 ... N, N=M/2); 0 expression, 2 rank null matrix.

When M is odd number,

Wherein, $D_{\mathrm{nn}}=\left[\begin{array}{cc}{d}_{11}^n& d_{12}^n\\ d_{21}^n& d_{22}^n\end{array}\right]=\left[\begin{array}{cc}{h}_{(2n-1)(2n-1)}& h_{(2n-1)2n}\\ h_{\left(2n\right)(2n-1)}& h_{\left(2n\right)\left(2n\right)}\end{array}\right],$ (n=1,2 ... N-1, N=(M+1)/2); h _MMBe last element on the shared channel matrix diagonal, 0 matrix of 0 expression 2 rank null matrix and above-mentioned matrix last column is 1 * 2 rank null matrix, and last row 0 matrix is 2 * 1 rank null matrix;

Step 103, according to the inverse matrix of above-mentioned two the matrix computations shared channel matrix after decomposing;

According to the D after decomposing _BAnd E _B, H is done inverse operation, according to the diagonal dominance of matrix, $H^{-1}\≈(I-D_B^{-1}{E}_B)D_B^{-1};$

In addition, above-mentioned shared channel matrix can resolve into any two matrix sums, as long as above-mentioned matrix D _BThe form that can be expressed as gets final product:

Be D _Nn2 * 2 rank matrixes can be, also 3 * 3 rank matrixes or the like can be, but because 2 * 2 rank matrix computations amounts are minimum, so the D in the present embodiment _NnAdopt 2 * 2 rank matrixes;

Step 104, above-mentioned inverse matrix is sent.

With operation result be $H^{-1}\≈(I-D_B^{-1}{E}_B)D_B^{-1}$ Be sent to precoder or crosstalk counteracting device, above-mentioned precoder is:

$P=H^{-1}D\≈(I-D_B^{-1}{E}_B)D_B^{-1}D,$

Above-mentioned crosstalk canceller is:

$W={\mathrm{DH}}^{-1}\≈D(I-D_B^{-1}{E}_B)D_B^{-1}$

Wherein, D is the diagonal matrix of matrix H;

In addition, can also comprise after operation result is sent to precoder: the signal x that desire is sent is sent to the recipient by precoder P and shared channel H successively, and the signal that this moment, the recipient received is:

$y=\mathrm{HPx}+n=H(I-D_B^{-1}{E}_B)D_B^{-1}\mathrm{Dx}+n=(D+{\mathrm{\ΔE}}_{\mathrm{TOB}1})x+n$

Wherein, ${\mathrm{\&Delta;<figure-callout\; id="1"\; label="E\; TOB"\; filenames="A200710307040E00191.png"\; state="\{\{state\}\}">E</figure-callout>}}_{\mathrm{TOB}}=-E_B{D}_B^{-1}{E}_B+{\left(E_B{D}_B^{-1}\right)}^2{D}_{B0};$

Can also comprise after operation result is sent to the crosstalk counteracting device: the signal x that desire is sent is sent to the recipient by shared channel H and crosstalk counteracting device W successively, and the signal that this moment, reciever received is:

$y=\mathrm{WHx}+\mathrm{Wn}=(D+{\mathrm{\&Delta;E}}_{\mathrm{TOB}2})x+D(I-D_B^{-1}{E}_B)D_B^{-1}n$

Wherein, ${\mathrm{\&Delta;<figure-callout\; id="2"\; label="E\; TOB"\; filenames="A200710307040E00191.png"\; state="\{\{state\}\}">E</figure-callout>}}_{\mathrm{TOB}}=-E_B{D}_B^{-1}{E}_B+D_{B0}{\left(E_B{D}_B^{-1}\right)}^2;$

And when M is even number,

When M is odd number,

This shows, adopt the main amount of calculation of said method to derive from D _BContrary, and D _BForm by 2 rank diagonal blocks, so it is against being ask 2 rank pieces contrary mainly, below to D _BContrary the analysis:

When M is even number,

When M is odd number,

Because $D_{\mathrm{nn}}=\left[\begin{array}{cc}{d}_{11}^n& d_{12}^n\\ d_{21}^n& d_{22}^n\end{array}\right]$ , according to the method for inverting of the second-order matrix in the matrix operation, can draw:

$D_{\mathrm{nn}}^{-1}={\left[\begin{array}{cc}{d}_{11}^n& d_{12}^n\\ d_{21}^n& d_{22}^n\end{array}\right]}^{-1}=\frac{1}{d_{11}^n{d}_{22}^n-d_{12}^n{d}_{21}^n}\left[\begin{array}{cc}{d}_{22}^n& {-d}_{12}^n\\ {-d}_{21}^n& d_{11}^n\end{array}\right],$

The amount of calculation that second-order matrix is inverted is 6 multiplyings.When M was even number, the amount of calculation that needs was 6N=6 (M/2)=3M multiplying; When M was odd number, the amount of calculation that needs was 6 (N-1)+1=6[(M+1)/2-1] }+1=3M-2 multiplying, therefore adopting the computation complexity of this method is O (M), is O (M and adopt the computation complexity of zero setting algorithm ³).

Said method greatly reduces computation complexity, has eliminated preferably and has crosstalked, and helps using in practice.

As shown in Figure 4, be the structural representation of data processing equipment embodiment of the present invention, this device specifically comprises: acquisition module 111 is used to obtain the shared channel data, and these shared channel data is represented with shared channel matrix; Decomposing module 112 is used for above-mentioned shared channel matrix is decomposed into two matrix sums, one of them matrix diagonal matrix that is as the criterion; Computing module 113 is used for the inverse matrix according to above-mentioned two the matrix computations shared channel matrix after decomposing; Interface module 114 is used for above-mentioned inverse matrix is sent to precoder or crosstalk counteracting device.

The representation of above-mentioned accurate diagonal matrix is as follows:

Wherein, D ₁₁D _{(N-1) (N-1)}Expression n rank matrix, D _NNExpression n rank, (n-1) rank, (n-2) rank ... last element on 2 rank matrixes or the shared channel matrix diagonal; For example the shared channel matrix on one 10 * 10 rank can be converted to the accurate diagonal matrix with 52 rank matrixes, also can be expressed as accurate diagonal matrix, can also be expressed as accurate diagonal matrix with 24 rank matrixes and 12 rank matrix with last element on 33 rank matrixes and the shared channel matrix diagonal.

Said apparatus utilizes acquisition module to obtain the data of shared channel, utilize decomposing module that shared channel matrix is decomposed into two matrix sums, and utilize the inverse matrix of computing module according to above-mentioned matrix computations shared channel matrix, utilize interface module that operation result is taken place to precoder or crosstalk counteracting device at last.

Said apparatus can reduce computation complexity greatly, thereby help using in practice.

As shown in Figure 5, structural representation for data handling system embodiment one of the present invention, this system specifically comprises: transmit leg 2, precoder 1, shared channel 3 and recipient 4, wherein, transmit leg 2 sends signal with desire and is sent to recipient 4 by precoder 1 and shared channel 3 successively, and above-mentioned transmit leg 2 comprises data processing equipment 11, and this data processing equipment 11 comprises: acquisition module 111, be used to obtain the shared channel data, and these shared channel data are represented with shared channel matrix; Decomposing module 112 is used for above-mentioned shared channel matrix is decomposed into two matrix sums, one of them matrix diagonal matrix that is as the criterion; Computing module 113 is used for the inverse matrix according to above-mentioned two the matrix computations shared channel matrix after decomposing; Interface module 114 is used for before transmit leg is sent to precoder with signal above-mentioned inverse matrix being sent to precoder.

Above-mentioned accurate diagonal matrix representation is as follows:

Wherein, D ₁₁D _{(N-1) (N-1)}Expression n rank matrix, D _NNExpression n rank, (n-1) rank, (n-2) rank ... last element on 2 rank matrixes or the shared channel matrix diagonal.

Said system from local side to the user side transmission signals, it is usually said downlink transfer, because each user distribution is in different positions, each circuit channel information can't be shared at receiving terminal, this system is by doing precoding to suppress crosstalking in the circuit at transmitting terminal, promptly pass through the design precoder, the transmission data are carried out preliminary treatment, do not have crosstalk interference thereby guaranteed to be transferred to each user's data at transmitting terminal; Simultaneously because this system adopts data processing to reduce computation complexity greatly.

Said system greatly reduces computation complexity, has eliminated preferably and has crosstalked, and helps using in practice.

As shown in Figure 6, structural representation for data handling system embodiment two of the present invention, this system specifically comprises: transmit leg 2, crosstalk counteracting device 5, shared channel 3 and recipient 4, wherein, transmit leg 2 sends signal with desire and is sent to recipient 4 by shared channel 3 and crosstalk counteracting device 5 successively, above-mentioned recipient 4 comprises data processing equipment 11, this data processing equipment 11 comprises: acquisition module 111, be used to obtain the shared channel data, and these shared channel data are represented with shared channel matrix; Decomposing module 112 is used for above-mentioned shared channel matrix is decomposed into two matrix sums, one of them matrix diagonal matrix that is as the criterion; Computing module 113 is used for the inverse matrix according to above-mentioned two the matrix computations shared channel matrix after decomposing; Interface module 115 is used for before transmit leg is sent to crosstalk canceller with signal above-mentioned inverse matrix being sent to the crosstalk counteracting device.

Above-mentioned diagonal matrix representation is as follows:

Wherein, D ₁₁D _{(N-1) (N-1)}Expression n rank matrix, D _NNExpression n rank, (n-1) rank, (n-2) rank ... last element on 2 rank matrixes or the shared channel matrix diagonal.

Said system from user side to the local side transmission signals, it is usually said uplink, uplink receives processing because each user can unite at local side, therefore uplink is adopted and is united crosstalk counteracting at receiving terminal, promptly do the processing of associating crosstalk counteracting to receiving data by the crosstalk counteracting device, do not have crosstalk interference to guarantee each user data that receives at receiving terminal; Simultaneously because this system adopts data processing to reduce computation complexity greatly.

Said system greatly reduces computation complexity, has eliminated effectively and has crosstalked, and helps using in practice.

It should be noted that at last: above embodiment only in order to technical scheme of the present invention to be described, is not intended to limit; Although with reference to previous embodiment the present invention is had been described in detail, those of ordinary skill in the art is to be understood that: it still can be made amendment to the technical scheme that aforementioned each embodiment put down in writing, and perhaps part technical characterictic wherein is equal to replacement; And these modifications or replacement do not make the essence of appropriate technical solution break away from the spirit and scope of various embodiments of the present invention technical scheme.

Claims (11)

1, a kind of data processing method is characterized in that comprising:

Obtain the shared channel data, and these shared channel data are represented with shared channel matrix;

Described shared channel matrix is decomposed into two matrix sums, one of them matrix diagonal matrix that is as the criterion;

Inverse matrix according to described two the matrix computations shared channel matrix after decomposing;

Described inverse matrix is sent.

2, data processing method according to claim 1 is characterized in that described accurate diagonal matrix representation is as follows:

Wherein, D ₁₁D _{(N-1) (N-1)}Expression n rank matrix, D _NNExpression n rank, (n-1) rank, (n-2) rank ... last element on 2 rank matrixes or the shared channel matrix diagonal.

3, data processing method according to claim 1 and 2 is characterized in that described described inverse matrix is sent specifically comprises: described inverse matrix is sent to precoder or crosstalk counteracting device.

4, data processing method according to claim 3, it is characterized in that described described inverse matrix is sent to also comprises after the precoder: the signal that desire is sent is sent to the recipient by precoder and shared channel successively.

5, data processing method according to claim 3, it is characterized in that described described inverse matrix is sent to also comprises after the crosstalk counteracting device: the signal that desire is sent is sent to the recipient by shared channel and crosstalk counteracting device successively.

6, a kind of data processing equipment is characterized in that comprising:

Acquisition module is used to obtain the shared channel data, and these shared channel data are represented with shared channel matrix;

Decomposing module is used for described shared channel matrix is decomposed into two matrix sums, one of them matrix diagonal matrix that is as the criterion;

Computing module is used for the inverse matrix according to described two the matrix computations shared channel matrix after decomposing;

Interface module is used for described inverse matrix is sent to precoder or crosstalk counteracting device.

7, data processing equipment according to claim 6 is characterized in that described accurate diagonal matrix representation is as follows:

Wherein, D ₁₁D _{(N-1) (N-1)}Expression n rank matrix, D _NNExpression n rank, (n-1) rank, (n-2) rank ... last element on 2 rank matrixes or the shared channel matrix diagonal.

8, a kind of data handling system, comprise transmit leg, precoder, shared channel and recipient, wherein, transmit leg sends signal with desire and is sent to the recipient by precoder and shared channel successively, it is characterized in that described transmit leg comprises data processing equipment, described data processing equipment comprises:

Acquisition module is used to obtain the shared channel data, and these shared channel data are represented with shared channel matrix;

Decomposing module is used for described shared channel matrix is decomposed into two matrix sums, one of them matrix diagonal matrix that is as the criterion;

Computing module is used for the inverse matrix according to described two the matrix computations shared channel matrix after decomposing;

Interface module is used for before transmit leg is sent to precoder with signal described inverse matrix being sent to precoder.

9, data handling system according to claim 8 is characterized in that described accurate diagonal matrix representation is as follows:

Wherein, D ₁₁D _{(N-1) (N-1)}Expression n rank matrix, D _NNExpression n rank, (n-1) rank, (n-2) rank ... last element on 2 rank matrixes or the shared channel matrix diagonal.

10, a kind of data handling system, comprise transmit leg, crosstalk counteracting device, shared channel and recipient, wherein, transmit leg sends signal with desire and is sent to the recipient by shared channel and crosstalk counteracting device successively, it is characterized in that described recipient comprises data processing equipment, described data processing equipment comprises:

Acquisition module is used to obtain the shared channel data, and these shared channel data are represented with shared channel matrix;

Decomposing module is used for described shared channel matrix is decomposed into two matrix sums, one of them matrix diagonal matrix that is as the criterion;

Computing module is used for the inverse matrix according to described two the matrix computations shared channel matrix after decomposing;

Interface module is used for before transmit leg is sent to crosstalk canceller with signal described inverse matrix being sent to the crosstalk counteracting device.

11, data handling system according to claim 10 is characterized in that described accurate diagonal matrix representation is as follows:

Wherein, D ₁₁D _{(N-1) (N-1)}Expression n rank matrix, D _NNExpression n rank, (n-1) rank, (n-2) rank ... last element on 2 rank matrixes or the shared channel matrix diagonal.

Images