Detailed Description
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present invention will be described in detail below with reference to the embodiments with reference to the attached drawings.
In order to make the technical solutions better understood by those skilled in the art, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only partial embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
It should be noted that the terms "first," "second," and the like in the description and claims of this application and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It should be understood that the data so used may be interchanged under appropriate circumstances such that embodiments of the application described herein may be used. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
The embodiment of the invention provides a receiving end signal processing method.
Fig. 1 is a flowchart of an alternative receiving-end signal processing method according to an embodiment of the present invention, as shown in fig. 1, the method includes the following steps:
step S102: for the expanded multiplexing waveform matrix HEPerforming QR decomposition, wherein the expanded multiplexed waveform matrix HEThe multiplexing waveform matrix H is obtained by expanding;
step S104: based on the result of QR decomposition and the extended signal sequence rECalculating a signal sequence y, wherein the extended signal sequence rEThe method comprises the steps of expanding a preprocessed signal sequence r, wherein the preprocessed signal sequence r is obtained by preprocessing a received signal sequence;
step S106: calculating a preliminary estimated value of a sequence X to be transmitted according to the signal sequence y;
step S108: and calculating a secondary estimated value of the sequence X to be transmitted according to the zero setting matrix.
In the embodiment of the present application, the matrix H is a matrix of the expanded multiplexed waveformsEPerforming QR decomposition, and performing QR decomposition according to the result of QR decomposition and the expanded signal sequence rECalculating a signal sequence y, calculating a preliminary pre-evaluation value of a sequence X to be transmitted according to the signal sequence y, calculating a secondary pre-evaluation value of the sequence X to be transmitted according to a zero setting matrix, and correspondingly decoding data according to the OvXDM coding characteristics in an OvXDM system, so that the problem that the signal processing complexity of a receiving end is higher when the overlapping multiplexing coefficient of the OvXDM system is larger in the prior art is avoidedThe effect of reducing the complexity of signal processing at the receiving end is achieved.
Note that: the sequence to be transmitted in the embodiment of the application is an input signal sequence.
The OvXDM system can be expressed as an Overlapped Time Division Multiplexing (OvTDM) system, an Overlapped Frequency Division Multiplexing (OvFDM) system, an Overlapped Code Division Multiplexing (OvCDM) system, an Overlapped Space Division Multiplexing (OvSDM) system, an Overlapped hybrid Division Multiplexing (OvHDM) system, etc., and its system equivalent model is shown in fig. 2. Fig. 3 is a schematic diagram of sequence orthogonalization according to an embodiment of the present invention.
Taking an OvTDM system as an example, the specific processing steps of the sending end coding are as follows:
(1) first, an envelope waveform h (t) for generating a transmission signal is designed.
(2) And (3) after the envelope waveform h (T) designed in the step (1) is subjected to specific time shift, forming the sending signal envelope waveform h (T-i multiplied by △ T) at other various moments.
(3) The envelope waveform H (T-i × △ T) is written in the form of a matrix H and then multiplied by a symbol vector x to be transmitted, forming a transmission signal waveform.
The block diagram of the encoding processing at the transmitting end of the OvTDM system is shown in figure 4, and the overlapping multiplexing method follows the parallelogram rule, as shown in figure 5.
Taking the OvFDM system as an example, the specific processing steps of the end-transmitting system coding are as follows:
(1) first, a spectrum signal h (f) for generating a transmission signal is designed.
(2) The designed spectrum signal H (f) in (1) is shifted by a specific carrier spectrum interval △ B to form other subcarrier spectrum waveforms H (f-i × △ B) with respective spectrum intervals △ B.
(3) The spectrum waveform H (f-i × △ B) is written in the form of a matrix H and then multiplied by a symbol vector X to be transmitted to form a spectrum s (f) of the complex modulated signal.
(4) And (3) performing inverse discrete fourier transform on the frequency spectrum of the generated complex modulation signal to finally form a complex modulation signal in a time domain, wherein the transmission signal can be expressed as:
Signal(t)TX=ifft(S(f))
the transmitting end coding processing block diagram of the OvFDM system is shown in figure 6, and the overlapping multiplexing method follows the parallelogram rule, as shown in figure 7.
OvXDM receiving end processing:
preprocessing a signal received by a receiving end to obtain a preprocessed signal;
and carrying out signal detection on the preprocessed signals in a corresponding domain according to the MMSE-QR decomposition-parallel interference cancellation algorithm to obtain input information flow.
Wherein the pre-treatment process comprises: and carrying out operations such as synchronization, channel estimation, equalization processing and the like on the signals received by the receiving end.
Taking the OvTDM as an example, the processing procedure of the receiving end is as shown in fig. 8, and the specific steps are as follows:
(1) firstly, synchronizing received signals, including carrier synchronization, frame synchronization, symbol time synchronization and the like;
(2) and correspondingly detecting the preprocessed data according to the detection algorithm.
Taking OvFDM as an example, the receiving end processing is as shown in fig. 9, and the specific steps are as follows:
(1) firstly, fft (Fourier transform) operation is carried out on a received signal to convert a time domain signal into a frequency domain;
(2) synchronizing frequency domain signals, including carrier synchronization, frame synchronization, symbol time synchronization and the like;
(3) and correspondingly detecting the preprocessed data according to the detection algorithm.
Optionally, for the expanded multiplexed waveform matrix HEPerforming QR decomposition, and performing QR decomposition according to the result of QR decomposition and the expanded signal sequence rECalculating a signal sequence y, comprising: according to formula HEQR-pair expanded multiplexing waveform matrix HEPerforming QR decomposition, wherein Q is an (N + L) xL matrix, QHQ=ILR is an L × L upper triangular matrix, and the matrix Q is decomposed into N × L Q1And L × L Q2,σIL=Q2R,σ2Is the noise power; the signal sequence y is calculated according to the following formula: y is QHrE=RX-σ2R-HX+Q1 HRX + η, where,is a noise sequence in the signal sequence y.
First, the multiplexing waveform matrix H is expanded to H of (N + L) xLEMatrix (original multiplexing waveform matrix is N × L matrix), and the preprocessed signal sequence r is expanded to be (N + L) × 1 rESequence of
Wherein(σ2As noise power), ILIs an L × L identity matrix, 0L,1Is an L × 1 zero vector.
Then to the expanded HEThe matrix is subjected to QR decomposition, namely:
wherein the matrix Q is an (N + L) xL matrix, and QHQ=ILR is an L × L upper triangular matrix, and the matrix Q is decomposed into N × L Q1And L × L Q2While satisfying σ IL=Q2R, and further obtaining
And is
To rEThe sequence was processed as follows to obtain a processed sequence y
Compared with QR decomposition, the algorithm considers the influence of noise in the expression of y compared with QR decomposition, so that the MMSE-QR detection algorithm can reduce the influence of noise to a certain extent, and the estimation result is more accurate.
Optionally, calculating a preliminary estimate of the sequence X to be transmitted according to the signal sequence y includes: an initial estimate of the kth signal of the sequence X to be transmitted is calculated according to the following formula:wherein, yk=Rk,k·xk+ηk+dk,Rk,kData corresponding to the k-th row and the k-th column in the matrix R, Rk,jData corresponding to the k row and the j column in the matrix R, xjη for the jth element in the sequence X to be transmittedkThe k-th element of the noise sequence η in the signal sequence y.
Further estimation is performed according to the processed sequence y:
kth element y of the processed sequencekCan be expressed as:
yk=Rk,k·xk+ηk+dk
wherein R isk,kThe data corresponding to the k-th row and the k-th column in the matrix R,Rk,jdata corresponding to the k row and j column in the matrix R, xjFor the j-th element, d, in the input sequence X (i.e. the OvXDM-encoded input sequence)kIndependent of the upper layer signal x1,x2,...,xk-1Since R is the upper triangular matrix, the bottom signal (lth signal) can be solved first:
yL=RL,L·xL+ηL
the corresponding estimate is:
corresponding to 1,2, 1 signal, signal interference term dkComprises the following steps:
the corresponding estimate is:
and then, carrying out corresponding demodulation according to the modulation mode adopted by the sending end, and then judging and outputting.
Optionally, calculating a quadratic prediction value of the sequence X to be transmitted according to the zero-setting matrix includes: according toCalculating a quadratic estimate of the sequence X to be transmitted, wherein Gk=(Hk HHk)-1Hk HOr Gk=(Hk HHk+σ2)-1Hk HWherein r iskThe signal sequence r is obtained by carrying out interference suppression on the preprocessed signal sequence r.
Optionally, before calculating the second estimated value of the sequence X to be transmitted according to the zero-setting matrix, the method further includes: according toPerforming interference suppression on the preprocessed signal sequence r, wherein (H)jThe j-th column is denoted by H.
The parallel interference cancellation algorithm adopts a parallel processing mode to eliminate the interference between symbols, recovers each input signal on the basis of the initial estimation value of the input signal X, and directly judges the signals without sequencing in the process of judging the signals. The specific method comprises the following steps: the method comprises the steps of constructing interference signal estimation of a transmitted symbol by using a detection result (initial estimation value), and when a certain input signal is recovered, taking the influence of other input signals as interference cancellation, namely when a kth signal is recovered, taking the 1 st, 2 nd,.. gth.k-1 st, k +1 th,. gth.. ltth signal as interference cancellation to obtain a new receiving vector, and then judging to output the kth signal. The detection algorithm is combined with an SQRD detection algorithm, namely an SQRD-parallel interference cancellation algorithm, and the specific detection steps are as follows:
the first step is as follows: according to the received signal sequence R1Multiplexing waveform matrix H, pair transmissionThe incoming signal X is initially estimated, i.e., MMSE-QR decomposition detection estimation is performed first (as described above), to obtain a corresponding estimateWhereinFor an input signal xkAn estimate of (d). The expression of the received signal after interference suppression is as follows:
wherein (H)jThe j-th column is denoted by H. From the above equation, it can be seen that in the received signal, the interference signals of all other layers are removed, and only the received signal desired to be detected is left.
The second step is that: computing zero matrix GkThe zero setting matrix corresponding to zero forcing detection can be used, and the zero setting matrix corresponding to minimum mean square error detection can also be used, that is:
Gk=(Hk HHk)-1Hk Hor Gk=(Hk HHk+σ2)-1Hk H
Wherein HkExpressed is the k-th column, σ, of the matrix H2For noise power, the resulting detection is:
the detection algorithm replaces the original OvXDM decoding, and the corresponding OvXDM system coding processing process is as follows:
generating an envelope waveform in a modulation domain according to the design parameters;
shifting the envelope waveform in a modulation domain according to the overlapping multiplexing times and a preset shifting interval to obtain each shifting envelope waveform in the modulation domain;
writing the displacement envelope waveform into a matrix form, and multiplying the matrix form by a symbol in a sequence to be modulated to obtain a complex modulation envelope waveform in a modulation domain.
The following is an alternative embodiment of the invention.
According to the system characteristics of OvXDM, first, assuming that the superposition multiplexing coefficient is K, the tap coefficients of the multiplexed waveforms are defined as [ h ], respectively0,h1,…,hK-1]. At this time, according to the convolution characteristic of the superposition multiplexing relationship, if the real information bit sequence length is L and the OvXDM-coded bit sequence length is N, (L + K-1), then the multiplexing waveform can be expressed in a matrix form as
The size is N × L.
Let the output vector after OvXDM coding be Y ═ Y0,…,yN-1]TThe input vector is X ═ X0,…,xL-1]TThe encoding process of OvXDM can be expressed as Y ═ HX, i.e.
Then at this point, the received signal sequence R1Can be expressed as
Wherein [ n ]0,n1,…,nN-1]TIs a white noise sequence.
The receiving end is connected according to the known multiplex waveform matrix HReceived signal sequence R1And correspondingly decoding. The received signal sequence R1Similar to the multi-antenna receiving sequence structure model, all are R1HX + N, where X is the sequence to be transmitted, N is the gaussian noise sequence, R1The difference is that the matrix H represents the difference for the received signal sequence: h denotes a channel parameter matrix in the multi-antenna system, and a multiplexed waveform matrix in the OvXDM system. The multi-antenna detection algorithm comprises traditional detection algorithms, such as a least square detection algorithm, minimum mean square error detection, maximum likelihood detection, QR decomposition, bidirectional QR decomposition, SQRD algorithm, serial interference cancellation detection, parallel interference cancellation detection and the like, and the detection algorithms can be used for correspondingly decoding the OvXDM system data due to the fact that the two algorithms are similar in structure.
The parallel interference cancellation detection can be combined with traditional detection algorithms, such as zero-forcing detection, minimum mean square error detection, QR decomposition, bidirectional QR decomposition, SQRD algorithm, MMSE-QR decomposition and the like, to realize a detection process. The present patent mainly introduces that an MMSE-QR decomposition-parallel interference detection algorithm is used in OvXDM system data detection, and the rest is not described herein.
First, an MMSE-QR decomposition algorithm is introduced:
(1) first, the multiplexing waveform matrix H is expanded to H of (N + L) xLEA matrix (the original multiplexing waveform matrix is an NxL matrix), and the preprocessed signal sequence r is expanded into r of (N + L) x 1ESequence of
Wherein(σ2As noise power), ILIs an L × L identity matrix, 0L,1Is an L × 1 zero vector.
(2) Then to the expanded HEThe matrix is subjected to QR decomposition, namely:
wherein the matrix Q is an (N + L) xL matrix, and QHQ=ILR is an L × L upper triangular matrix, and the matrix Q is decomposed into N × L Q1And L × L Q2While satisfying σ IL=Q2R, and further obtaining
And is
(3) To rEThe sequence was processed as follows to obtain a processed sequence y
As can be seen from the above formula, compared with QR decomposition, the MMSE-QR detection algorithm can reduce the influence of noise to some extent.
(5) Further estimation is performed according to the processed sequence y:
kth element y of the processed sequencekCan be expressed as:
yk=Rk,k·xk+ηk+dk
wherein R iskkThe data corresponding to the k-th row and the k-th column in the matrix R,data corresponding to the k row and j column in the matrix R, xjFor in input sequence X (i.e. OvXDM-encoded input sequence)J element, dkIndependent of the upper layer signal x1,x2,...,xk-1Since the matrix is a triangular matrix on R, the bottom signal (lth signal) can be solved first:
yL=RL,L·xL+ηL
the corresponding estimate is:
corresponding to 1,2, 1 signal, signal interference term dkComprises the following steps:
the corresponding estimate is:
and then, carrying out corresponding demodulation according to the modulation mode adopted by the sending end, and then judging and outputting.
The parallel interference cancellation algorithm adopts a parallel processing mode to eliminate the interference between symbols, recovers each input signal on the basis of the initial estimation value of the input signal X, and directly judges the signal without sequencing in the process of judging the signal. The specific method comprises the following steps: the method comprises the steps of constructing interference signal estimation of a transmitted symbol by using a detection result (initial estimation value), and when a certain input signal is recovered, taking the influence of other input signals as interference cancellation, namely when a kth signal is recovered, taking the 1 st, 2 nd,.. gth.k-1 st, k +1 th,. gth.. ltth signal as interference cancellation to obtain a new receiving vector, and then judging to output the kth signal. The detection algorithm is combined with an SQRD detection algorithm, namely an SQRD-parallel interference cancellation algorithm, and the specific detection steps are as follows:
the first step is as follows: according to the received signal sequence R1Multiplexing the waveform matrix H, performing initial estimation on the input signal X, namely performing MMSE-QR decomposition detection estimation (as described above) to obtain corresponding estimation valueWherein,
for an input signal xkAn estimate of (d). The expression of the received signal after interference suppression is as follows:
wherein (H)jThe j-th column is denoted by H. From the above equation, it can be seen that in the received signal, the interference signals of all other layers are removed, and only the received signal desired to be detected is left.
The second step is that: computing zero matrix GkThe zero setting matrix corresponding to zero forcing detection can be used, and the zero setting matrix corresponding to minimum mean square error detection can also be used, that is:
Gk=(Hk HHk)-1Hk Hor Gk=(Hk HHk+σ2)-1Hk H
Wherein HkExpressed is the k-th column, σ, of the matrix H2For noise power, the resulting detection is:
the detection algorithm replaces the original OvXDM decoding, and the corresponding OvXDM system coding processing process is as follows:
generating an envelope waveform in a modulation domain according to the design parameters;
shifting the envelope waveform in a modulation domain according to the overlapping multiplexing times and a preset shifting interval to obtain each shifting envelope waveform in the modulation domain;
writing the displacement envelope waveform into a matrix form, and multiplying the matrix form by a symbol in a sequence to be modulated to obtain a complex modulation envelope waveform in a modulation domain.
The embodiment of the application also provides a receiving end signal processing device, and the device is used for executing the receiving end signal processing method. As shown in fig. 10, the apparatus includes: QR decomposition unit 10, first calculation unit 20, second calculation unit 30, and third calculation unit 40.
A QR decomposition unit 10 for applying the expanded multiplexed waveform matrix HEPerforming QR decomposition, wherein the expanded multiplexed waveform matrix HEIs obtained by expanding the multiplexing waveform matrix H.
A first calculation unit 20 for calculating a QR decomposition result and an extended signal sequence rECalculating a signal sequence y, wherein the extended signal sequence rEThe signal sequence r is obtained by expanding a preprocessed signal sequence r, and the preprocessed signal sequence r is obtained by preprocessing a received signal sequence.
A second calculating unit 30, configured to calculate a preliminary estimated value of the sequence X to be transmitted according to the signal sequence y.
And a third calculating unit 40, configured to calculate a second estimated value of the sequence X to be transmitted according to the zero-set matrix.
Optionally, the QR decomposition unit follows formula HEQR-pair expanded multiplexing waveform matrix HEPerforming QR decomposition, wherein Q is an (N + L) xL matrix, QHQ=ILR is an L × L upper triangular matrix, and the matrix Q is decomposed into N × L Q1And L × L Q2,σIL=Q2R,σ2Is the noise power; the first calculation unit 20 calculates the signal sequence y according to the following formula: y is QHrE=RX-σ2R-HX+Q1 HRX + η, where,is a noise sequence in the signal sequence y.
Optionally, the second calculation unit 30 calculates a preliminary estimate of the kth signal of the sequence X to be transmitted according to the following formula:wherein, yk=Rk,k·xk+ηk+dk,Rk,kData corresponding to the k-th row and the k-th column in the matrix R, Rk,jData corresponding to the k row and the j column in the matrix R, xjη for the jth element in the sequence X to be transmittedkThe k-th element of the noise sequence η in the signal sequence y.
Optionally, the third calculation unit 40 is based onCalculating a quadratic estimate of the sequence X to be transmitted, wherein Gk=(Hk HHk)-1Hk HOr Gk=(Hk HHk+σ2)-1Hk HWherein r iskThe signal sequence r is obtained by carrying out interference suppression on the preprocessed signal sequence r.
Optionally, the apparatus further comprises: an interference suppression unit. An interference suppressing unit forBefore the third calculation unit 40 calculates the second estimated value of the sequence X to be transmitted according to the zero-setting matrix, it calculates the second estimated value of the sequence X to be transmitted according to the zero-setting matrixPerforming interference suppression on the preprocessed signal sequence r, wherein (H)jThe j-th column is denoted by H.
The receiving-end signal processing device comprises a processor and a memory, wherein the QR decomposition unit 10, the first calculation unit 20, the second calculation unit 30, the third calculation unit 40, and the like are all stored in the memory as program units, and the processor executes the program units stored in the memory to realize corresponding functions.
The processor comprises a kernel, and the kernel calls the corresponding program unit from the memory. The kernel can be set to be one or more, and the receiving end signal processing method is executed by adjusting kernel parameters.
The memory may include volatile memory in a computer readable medium, Random Access Memory (RAM) and/or nonvolatile memory such as Read Only Memory (ROM) or flash memory (flash RAM), and the memory includes at least one memory chip.
An embodiment of the present invention provides a storage medium on which a program is stored, where the program, when executed by a processor, implements the receiving-end signal processing method.
The embodiment of the invention provides a processor, which is used for running a program, wherein the receiving end signal processing method is executed when the program runs.
The embodiment of the invention provides equipment, which comprises a processor, a memory and a program which is stored on the memory and can run on the processor, wherein the processor executes the program and realizes the following steps:
for the expanded multiplexing waveform matrix HEPerforming QR decomposition, wherein the expanded multiplexed waveform matrix HEIs to expand the multiplexing waveform matrix HTo that; based on the result of QR decomposition and the extended signal sequence rECalculating a signal sequence y, wherein the extended signal sequence rEThe method comprises the steps of expanding a preprocessed signal sequence r, wherein the preprocessed signal sequence r is obtained by preprocessing a received signal sequence; calculating a preliminary estimated value of a sequence X to be transmitted according to the signal sequence y; and calculating a secondary estimated value of the sequence X to be transmitted according to the zero setting matrix.
The following steps can be realized when the processor executes the program: according to formula HEQR-pair expanded multiplexing waveform matrix HEPerforming QR decomposition, wherein Q is an (N + L) xL matrix, QHQ=ILR is an L × L upper triangular matrix, and the matrix Q is decomposed into N × L Q1And L × L Q2,σIL=Q2R,σ2Is the noise power; the signal sequence y is calculated according to the following formula: y is QHrE=RX-σ2R-HX+Q1 HRX + η, where,is a noise sequence in the signal sequence y.
The following steps can be realized when the processor executes the program: an initial estimate of the kth signal of the sequence X to be transmitted is calculated according to the following formula:wherein, yk=Rk,k·xk+ηk+dk,Rk,kData corresponding to the k-th row and the k-th column in the matrix R, Rk,jData corresponding to the k row and the j column in the matrix R, xjη for the jth element in the sequence X to be transmittedkIs the second of the noise sequence η in the signal sequence yk elements.
The following steps can be realized when the processor executes the program: according toCalculating a quadratic estimate of the sequence X to be transmitted, wherein Gk=(Hk HHk)-1Hk HOr Gk=(Hk HHk+σ2)-1Hk HWherein r iskThe signal sequence r is obtained by carrying out interference suppression on the preprocessed signal sequence r.
The following steps can be realized when the processor executes the program: before calculating a quadratic estimate of the sequence X to be transmitted on the basis of the zero-setting matrixPerforming interference suppression on the preprocessed signal sequence r, wherein (H)jThe j-th column is denoted by H.
The device herein may be a server, a PC, a PAD, a mobile phone, etc.
The present application further provides a computer program product adapted to perform a program for initializing the following method steps when executed on a data processing device:
for the expanded multiplexing waveform matrix HEPerforming QR decomposition, wherein the expanded multiplexed waveform matrix HEThe multiplexing waveform matrix H is obtained by expanding; based on the result of QR decomposition and the extended signal sequence rECalculating a signal sequence y, wherein the extended signal sequence rEThe method comprises the steps of expanding a preprocessed signal sequence r, wherein the preprocessed signal sequence r is obtained by preprocessing a received signal sequence; calculating a preliminary estimated value of a sequence X to be transmitted according to the signal sequence y; and calculating a secondary estimated value of the sequence X to be transmitted according to the zero setting matrix.
The computer program product furtherA procedure may be performed which initializes the following method steps: according to formula HEQR-pair expanded multiplexing waveform matrix HEPerforming QR decomposition, wherein Q is an (N + L) xL matrix, QHQ=ILR is an L × L upper triangular matrix, and the matrix Q is decomposed into N × L Q1And L × L Q2,σIL=Q2R,σ2Is the noise power; the signal sequence y is calculated according to the following formula: y is QHrE=RX-σ2R-HX+Q1 HRX + η, where,is a noise sequence in the signal sequence y.
The computer program product described above may also execute a program for initializing the following method steps: an initial estimate of the kth signal of the sequence X to be transmitted is calculated according to the following formula:wherein, yk=Rk,k·xk+ηk+dk,Rk,kData corresponding to the k-th row and the k-th column in the matrix R, Rk,jData corresponding to the k row and the j column in the matrix R, xjη for the jth element in the sequence X to be transmittedkThe k-th element of the noise sequence η in the signal sequence y.
The computer program product described above may also execute a program for initializing the following method steps: according toCalculating a quadratic estimate of the sequence X to be transmitted, wherein Gk=(Hk HHk)-1Hk HOr Gk=(Hk HHk+σ2)-1Hk HWherein r iskThe signal sequence r is obtained by carrying out interference suppression on the preprocessed signal sequence r.
The computer program product described above may also execute a program for initializing the following method steps: before calculating a quadratic estimate of the sequence X to be transmitted on the basis of the zero-setting matrixPerforming interference suppression on the preprocessed signal sequence r, wherein (H)jThe j-th column is denoted by H.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). The memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in the process, method, article, or apparatus that comprises the element.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The above are merely examples of the present application and are not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.