CN110971556B - Signal processing method of wireless communication system, terminal equipment and network equipment - Google Patents

Abstract

The invention discloses a signal processing method of a wireless communication system, terminal equipment and network equipment, which are based on DFT-s-OFDMA and used for optimizing detection performance. The signal processing method of the wireless communication system comprises the following steps: spreading the modulated signal, and performing Discrete Fourier Transform (DFT) processing on the spread signal; and mapping the signal after DFT processing to the input of discrete inverse Fourier transform expansion, performing Inverse Fast Fourier Transform (IFFT) processing, and sending the processed signal to a receiving end.

Description

Signal processing method of wireless communication system, terminal equipment and network equipment

The present application claims priority of chinese patent application entitled "a signal processing method for a wireless communication system, a terminal device, and a network device" filed by chinese patent office on 28/9/2018 with application number 201811143468.0, the entire contents of which are incorporated herein by reference.

Technical Field

The present invention relates to the field of communications technologies, and in particular, to a signal processing method, a terminal device, and a network device for a wireless communication system.

Background

An Orthogonal Frequency Division Multiplexing (OFDM) scheme or an Orthogonal Frequency Division Multiple Access (OFDMA) scheme is used to transmit data in a wired and/or wireless channel.

The OFDMA transmitting end maps data streams using a modulation technique, maps the data streams from M subcarriers to N subcarriers, performs, for example, zero padding on the remaining (M-N) subcarriers, and then performs Inverse Fast Fourier Transform (IFFT) on the data streams. To mitigate Peak to Average Power Ratio (RAPR), a Discrete Fourier Transform (DFT) spread OFDMA scheme is proposed, which performs DFT on a data stream first, and then maps to M subcarriers.

The receiving end carries out Fast Fourier Transform (FFT) processing on the received signal, constructs a vector by the symbol multiplied by the same signal of the spreading code of the transmitting end, and inputs the vector into a detector for detection so as to identify the corresponding user signal in the received signal. Due to the influence of a wireless channel, the processing in a Frequency domain has lower complexity, and in a Discrete Fourier Transform-Spread Orthogonal Frequency Division Multiple Access (DFT-s-OFDMA) system, the processing complexity of signals after FFT transformation is lower at a receiving end. However, it is known that, after DFT processing is performed on a transmission symbol at an input end of DFT, each DFT output end contains information of all DFT input ends, which makes it impossible to construct only a transmission data signal corresponding to the same transmission data signal into a vector to be detected, and thus, detection based on block or code cannot be implemented.

Disclosure of Invention

The embodiment of the invention provides a signal processing method of a wireless communication system, terminal equipment and network equipment, which are used for optimizing detection performance based on DFT-s-OFDMA.

In a first aspect, a signal processing method of a wireless communication system is provided, where the signal processing method includes:

spreading the modulated signal, and performing Discrete Fourier Transform (DFT) processing on the spread signal;

and mapping the signal after DFT processing to the input of discrete inverse Fourier transform expansion, performing Inverse Fast Fourier Transform (IFFT) processing, and sending the processed signal to a receiving end.

Optionally, spreading the modulated signal includes:

and performing time domain non-sparse spreading on the received signal.

Optionally, mapping the DFT-processed signal to an input of a discrete inverse fourier transform includes:

interweaving the signals processed by DFT;

and performing resource RE sparse mapping on the interleaved signal to the input of the IFFT.

Optionally, interleaving the signal after DFT processing includes:

performing point-by-point interleaving on the signals subjected to DFT processing; or the like, or, alternatively,

and interleaving the signals subjected to DFT processing according to blocks.

Optionally, the point-by-point interleaving the DFT-processed signal includes:

mapping an element D (u + (i-1) N) in the DFT processed signal to the Mu + t of an IFFT transform input end_i+ B elements, where N is the number of modulation symbols, and the ith non-sparse element of the spreading code corresponds to the tth element of the spreading code_iPosition, M is the number of spreading code elements, u is used to indicate frequency points, u is 0,1,. N-1, and B is the starting frequency point of the transmission bandwidth.

Optionally, interleaving the signal subjected to DFT processing according to blocks includes:

mapping the DFT processed signal from (i-1) N +1 to iN elements to (t) of IFFT input end_i-1) N +1+ B to t_iThe N + B position; wherein N is the number of modulation symbols, and the ith non-sparse element of the spreading code corresponds to the tth element of the spreading code_iPosition, M is spread spectrumThe number of the code elements, u, is used to indicate frequency points, u is 0,1,. N-1, and B is the starting frequency point of the transmission bandwidth.

In a second aspect, a signal processing method of a wireless communication system is provided, the signal processing method including:

carrying out Fast Fourier Transform (FFT) processing on the received signals; the signal is obtained by processing a transmitting end through spread spectrum and discrete Fourier transform spread orthogonal frequency division multiple access DFT-s-OFDM;

extracting frequency points with the same modulation symbol frequency domain signals from the signals after FFT processing;

constructing the decimated signals into a vector;

and detecting the vector according to a preset detection algorithm so as to identify the signal sent by the sending end.

Optionally, extracting frequency points with the same modulation symbol frequency domain signal from the FFT-processed signal includes:

and if each period of the signals obtained by the DFT processing at the sending end comprises N frequency points, extracting the signals at intervals of N.

Optionally, extracting signals with the same frequency point from the FFT-processed signals includes:

if the sending end carries out point-to-point interleaving on the signals after DFT processing, extracting signals from (i-1) M +1 to iM, wherein i is less than or equal to N, N is the number of modulation symbols, and M is the number of elements in the spread spectrum code;

and if each period of the signals processed by the DFT at the sending end comprises N frequency points and interleaving is carried out according to blocks, extracting the signals at intervals of N.

Optionally, constructing the decimated signals into a vector, including:

constructing an equivalent channel for the frequency domain channel according to the extracted signal; or the like, or, alternatively,

and constructing an equivalent channel for the frequency domain channel according to the extracted signal and the spread spectrum sequence.

In a third aspect, a terminal device is provided, which includes:

a memory to store instructions;

a processor for reading the instructions in the memory, performing the following processes:

spreading the modulated signal, and performing Discrete Fourier Transform (DFT) processing on the spread signal;

mapping the signal after DFT processing to the input of discrete inverse Fourier transform expansion, performing Inverse Fast Fourier Transform (IFFT) processing, and sending the processed signal to a receiving end;

a transceiver for transceiving data under control of the processor.

Optionally, the processor is specifically configured to:

and performing time domain non-sparse spreading on the received signal.

Optionally, the processor is specifically configured to:

interweaving the signals processed by DFT;

and performing resource RE sparse mapping on the interleaved signal to the input of the IFFT.

Optionally, the processor is specifically configured to:

performing point-by-point interleaving on the signals subjected to DFT processing; or the like, or, alternatively,

and interleaving the signals subjected to DFT processing according to blocks.

Optionally, the processor is specifically configured to:

mapping an element D (u + (i-1) N) in the DFT processed signal to the Mu + t of an IFFT transform input end_i+ B elements, where N is the number of modulation symbols, and the ith non-sparse element of the spreading code corresponds to the tth element of the spreading code_iPosition, M is the number of spreading code elements, u is used to indicate frequency points, u is 0,1,. N-1, and B is the starting frequency point of the transmission bandwidth.

Optionally, the processor is specifically configured to:

mapping the DFT processed signal from (i-1) N +1 to iN elements to (t) of IFFT input end_i-1) N +1+ B to t_iThe N + B position; wherein N is the number of modulation symbols, and the ith non-sparse element of the spreading code corresponds toT-th of spreading code_iPosition, M is the number of spreading code elements, u is used to indicate frequency points, u is 0,1,. N-1, and B is the starting frequency point of the transmission bandwidth.

In a fourth aspect, a network device is provided, the network device comprising:

a memory to store instructions;

a processor for reading the instructions in the memory, performing the following processes:

carrying out Fast Fourier Transform (FFT) processing on the received signals; the signal is obtained by processing a transmitting end through spread spectrum and discrete Fourier transform spread orthogonal frequency division multiple access DFT-s-OFDM;

extracting frequency points with the same modulation symbol frequency domain signals from the signals after FFT processing;

constructing the decimated signals into a vector;

detecting the vector according to a preset detection algorithm to identify a signal sent by a sending end;

a transceiver for transceiving data under control of the processor.

Optionally, the processor is specifically configured to:

and if each period of the signals obtained by the DFT processing at the sending end comprises N frequency points, extracting the signals at intervals of N.

Optionally, the processor is specifically configured to:

if the sending end carries out point-to-point interleaving on the signals after DFT processing, extracting signals from (i-1) M +1 to iM, wherein i is less than or equal to N, N is the number of modulation symbols, and M is the number of elements in the spread spectrum code;

and if each period of the signals processed by the DFT at the sending end comprises N frequency points and interleaving is carried out according to blocks, extracting the signals at intervals of N.

Optionally, the processor is specifically configured to:

constructing an equivalent channel for the frequency domain channel according to the extracted signal; or the like, or, alternatively,

and constructing an equivalent channel for the frequency domain channel according to the extracted signal and the spread spectrum sequence.

In a fifth aspect, a terminal device is provided, which includes:

the processing unit is used for spreading the modulated signal and performing Discrete Fourier Transform (DFT) processing on the spread signal;

and the mapping unit is used for mapping the signal after DFT processing to the input of discrete inverse Fourier transform expansion, performing Inverse Fast Fourier Transform (IFFT) processing and sending the processed signal to a receiving end.

Optionally, the processing unit is specifically configured to:

and performing time domain non-sparse spreading on the received signal.

Optionally, the mapping unit is specifically configured to:

interweaving the signals processed by DFT;

and performing resource RE sparse mapping on the interleaved signal to the input of the IFFT.

Optionally, the mapping unit is specifically configured to:

performing point-by-point interleaving on the signals subjected to DFT processing; or the like, or, alternatively,

and interleaving the signals subjected to DFT processing according to blocks.

Optionally, the mapping unit is specifically configured to:

mapping an element D (u + (i-1) N) in the DFT processed signal to the Mu + t of an IFFT transform input end_i+ B elements, where N is the number of modulation symbols, and the ith non-sparse element of the spreading code corresponds to the tth element of the spreading code_iPosition, M is the number of spreading code elements, u is used to indicate frequency points, u is 0,1,. N-1, and B is the starting frequency point of the transmission bandwidth.

Optionally, the mapping unit is specifically configured to:

mapping the DFT processed signal from (i-1) N +1 to iN elements to (t) of IFFT input end_i-1) N +1+ B to t_iThe N + B position; wherein N is the number of modulation symbols, and the ith non-sparse element of the spreading code corresponds to the tth element of the spreading code_iPosition, M being the number of spreading code elementsThe number u is used to indicate the frequency point, and u is 0,1,. N-1, and B is the starting frequency point of the transmission bandwidth.

In a sixth aspect, a network device is provided, which includes:

the processing unit is used for carrying out Fast Fourier Transform (FFT) processing on the received signals; the signal is obtained by processing a transmitting end through spread spectrum and discrete Fourier transform spread orthogonal frequency division multiple access DFT-s-OFDM;

the extracting unit is used for extracting frequency points with the same modulation symbol frequency domain signals from the signals after FFT processing;

a construction unit for constructing the extracted signal into a vector;

and the detection unit is used for detecting the vector according to a preset detection algorithm so as to identify the signal sent by the sending end.

Optionally, the extracting unit is specifically configured to:

and if each period of the signals obtained by the DFT processing at the sending end comprises N frequency points, extracting the signals at intervals of N.

Optionally, the extracting unit is specifically configured to:

if the sending end carries out point-to-point interleaving on the signals after DFT processing, extracting signals from (i-1) M +1 to iM, wherein i is less than or equal to N, N is the number of modulation symbols, and M is the number of elements in the spread spectrum code;

and if each period of the signals processed by the DFT at the sending end comprises N frequency points and interleaving is carried out according to blocks, extracting the signals at intervals of N.

Optionally, the extracting unit is specifically configured to:

constructing an equivalent channel for the frequency domain channel according to the extracted signal; or the like, or, alternatively,

and constructing an equivalent channel for the frequency domain channel according to the extracted signal and the spread spectrum sequence.

In a seventh aspect, a computer storage medium is provided, on which a computer program is stored, which, when executed by a processor, implements the method according to any of the first or second aspects.

The embodiment of the invention provides a signal processing method of a wireless communication system, which is applied to a DFT-s-OFDMA system, can realize the joint detection of signals on a plurality of frequency points in a frequency domain when the time domain expansion is carried out at the DFT input end, namely a detection method of blockwise (codewise), namely, a receiving end carries out FFT (fast Fourier transform) to obtain a frequency domain signal, the signals of a plurality of frequency points in the frequency domain signal are constructed into a vector, the vector comprises at least two elements, when a detector carries out detection, the elements in the vector are required to be used for detection, and one element is not used in each detection. The detection method can be an MMSE or non-MMSE detection method. And constructing signals of different frequency points into a vector, and detecting the signals of each user by using a detection algorithm so as to optimize the detection performance.

Drawings

Fig. 1 is a flowchart illustrating a signal processing method of a wireless communication system according to an embodiment of the present invention;

fig. 2 is a flowchart illustrating a signal processing method of a wireless communication system according to an embodiment of the present invention;

fig. 3 is a flowchart illustrating a signal processing method of a wireless communication system according to an embodiment of the present invention;

fig. 4 is a flowchart illustrating a signal processing method of a wireless communication system according to an embodiment of the present invention;

fig. 5 is a schematic structural diagram of a terminal device according to an embodiment of the present invention;

fig. 6 is a schematic structural diagram of a terminal device according to an embodiment of the present invention;

fig. 7 is a schematic structural diagram of a network device according to an embodiment of the present invention;

fig. 8 is a schematic structural diagram of a network device according to an embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the present invention more clearly and completely understood, the technical solutions in the embodiments of the present invention will be described below with reference to the accompanying drawings in the embodiments of the present invention.

The following describes background art for embodiments of the present invention.

Spreading is performed at the transmitting end under Cyclic Prefix (CP-OFDM) waveform, that is, at the input end of IFFT, one symbol (e.g., modulation symbol) multiplied by one spreading code becomes several symbols, which are mapped to the input end of IFFT. In the detection, after FFT is performed on the received signal, the same signal multiplied by the spreading code is constructed into a vector, and the vector is input to the detector (e.g., MMSE), which greatly improves the performance compared with the received signal having only one frequency point in the input vector of the detector each time. For example, the spreading factor is 4, the receiving antennas are two antennas, signals received by the two antennas and corresponding to a frequency point are constructed into a 2-dimensional vector, and the 2-dimensional vector is input to an MMSE detector to obtain an MMSE weighting vector. The detection performance for constructing MMSE weights using 8-dimensional vectors is better than that of 2-dimensional vectors constructed from received signals.

Due to the influence of a wireless channel, the processing in a Frequency domain has lower complexity, and in a Discrete Fourier Transform-Spread Orthogonal Frequency Division Multiple Access (DFT-s-OFDMA) system, the processing complexity of signals after FFT conversion is lower at a receiving end. However, it is known that, after DFT processing is performed on a transmission symbol at an input end of DFT, each DFT output end contains information of all DFT input ends, which makes it impossible to construct only a transmission data signal corresponding to the same transmission data signal into a vector to be detected, and thus, block-based detection or code-based detection cannot be implemented.

In view of this, the embodiment of the present invention provides a signal processing method for a wireless communication system, which is applied to a DFT-s-OFDMA system, and when a DFT input end is spread, a method for jointly detecting signals on multiple frequency points in a frequency domain, that is, a detection method of blockwise (codewise) can be implemented, that is, after a receiving end performs FFT, a frequency domain signal is obtained, signals of multiple frequency points in the frequency domain signal are configured into a vector, and when a detector performs detection, at least two or more elements in the vector need to be jointly detected, and each detection is not only one. The detection method can be an MMSE or non-MMSE detection method. And constructing signals of different frequency points into a vector, and detecting the signals of each user by using a detection algorithm so as to optimize the detection performance.

The technical scheme provided by the embodiment of the invention is described in the following with the accompanying drawings of the specification.

Referring to fig. 1, a signal processing method of a wireless communication system according to an embodiment of the present invention is described as follows. Since the signal processing method of the wireless communication system involves an interaction process between the transmitting end and the receiving end of the wireless communication system, in the following description of the flow, the processes performed by the transmitting end and the receiving end will be described together.

S101, spreading the received signal, and performing DFT processing on the spread signal.

In the embodiment of the present invention, when a sending end sends a signal (modulated coincidence), the signal is spread, and the spreading mode may include the following two modes:

the first method comprises the following steps: let s (m) be the symbol transmitted by the user₀,s₁,…,s_N-1]The spreading code (spreading sequence) is P ═ P₀,p₁,…,p_M-1]Then, after spreading the symbol, x (n) kron (s, P) s₀*P,s₁*P,…,s_N-1*P]I.e. s₀p₀，s₀p₁，……,s₀p_M-1，s₁p₂,s₁p₁，……,s₁p_M-1，…,s_N-1p₀,s_N-1p₁，……,s_N-1p_M-1。

That is, the signal x (n) is at the input end of DFT, and the DFT processing is performed on the spread signal, that is, x (n), so as to obtain d (k) as follows:

in the present embodiment, when x (Mm + q) ═ s (M) p (q), (M ═ 0,1, …, N-1, q ═ 0,1, … …, M-1), then:

and the second method comprises the following steps: and performing non-sparse frequency spreading on the signal.

The sparse spread spectrum code means that the spread spectrum sequence contains 0, if the original spread spectrum code is sparse, the non-zero elements in the spread spectrum code are extracted, a new spread spectrum sequence is constructed according to the sequence of the elements in the original spread spectrum code, and the sequence is corresponding non-sparse spread spectrum. For example, the spreading sequence is [ 1010 ]]Then its corresponding non-sparse spreading is [ 11 ]]. Let the original signal be s₀，s₁,…,s_N-1The non-sparse spreading code is q₀，q₁,…,q_M-1The spread signal is s₀q₀，s₀q₁，……,s₀q_M-1，s₁q₀，s₁q₁，……,s₁q_M-1，…,s_N-1q₀,s_N-1q₁，……,s_N-1q_M-1。

S102, mapping the signal after DFT processing to the input of the DFT-S-OFDMA system.

Referring to fig. 2, if the transmitting end spreads the signal in the first manner, the DFT processed signal may be mapped to the IFFT input in a resource RE mapping manner. Referring to fig. 3, if the transmitting end performs spreading on the signal in the second manner, the DFT-processed signal may be interleaved, and then the resource RE of the interleaved signal is sparsely mapped to the IFFT input.

Sparse mapping is carried out on the signals after DFT conversion, the sparse mapping modes of different users are different, in order to map elements with the interval of N of different users to the same position so as to facilitate detection of blockwise, interleaving processing needs to be carried out on DFT according to the sparse mapping mode. In a possible implementation, interleaving is performed on the signal subjected to DFT processing, and the interleaving may be performed in a point-by-point manner or in a block-by-block manner.

Let the non-sparse spreading sequence be q₀，q₂,…,q_M-1Wherein q is_iIs t of sparse spreading code_iPosition by point interleaving, mapping element D (u + (i-1) N) to the Mu + t of IFFT transform input_iOn each element. For example, the spreading code is [ 1010 ]]The non-sparse spreading code is [ 11 ]]The positions of 0 and 2 correspond to the spread spectrum respectively, and the interleaving is to map the 0 th and N th elements after DFT transformation to the positions of 0 and 2 of the IFFT. Block-wise interleaving is to take D (u + (i-1) N) from (i-1) N +1 to iN (where u takes a value within a block, u ═ 0,1>0) Construct a block, map the block to (t) of IFFT_i-1) N +1 to t_iN position.

For example, let the original signal be s₀，s₁,…,s_N-1The non-sparse spreading code is q₀，q₁,…,q_M-1The spread signal is s₀q₀，s₀q₁，……,s₀q_M-1，s₁q₀，s₁q₁，……,s₁q_M-1，…,s_N-1q₀,s_N-1q₁，……,s_N-1q_M-1After going through DFT conversion, there are

Where M is the number of non-zero elements of the spreading sequence, and g (k) is periodic, repeating every N points, as in the first embodiment.

If the signal after DFT transform is directly subjected to sparse mapping, the block constructed for user 1 contains the content of only user 1 symbol, but contains the content of a plurality of symbols of other users. For example, user 1 uses a pattern with column weight of 2, if N is 18, for user 1, point 1 and point 19 of DFT transform correspond to the same g (k), if the pattern of user 1 is [ 1010 ], point 1 and point 19 of DFT transform are mapped to point 37 and point 1 of IFFT input, assuming that multiple users use PDMA mapping mode, the column weights of user 2 and user 1 are different, user 2 uses a pattern with column weight of 3, and assuming that the pattern of user 2 is [ 1110 ], point 1 and point 19 of user 2DFT transform also correspond to the same g (k), but are mapped to point 1 and point 25.

In order to ensure block-wise detection, at the transmitting end, signals after DFT conversion of different users are rearranged in a non-sparse spread spectrum mode.

S103, performing IFFT processing on the mapped signal, and sending the processed signal to a receiving end.

The receiving end receives the signal after the IFFT processing, and can detect the signal to determine the modulated symbol sent by the sending end.

Specifically, S104, the receiving end performs FFT processing on the received signal.

After FFT transformation of the received signal, a frequency domain received signal y (k) k is 0,1, …, L, where L is the number of points of one IFFT transformation in DFT-s-OFDMA. Wherein the content of the first and second substances,

Y(k)＝H(k)D(k)+N(k) (4)

where H (k) is the channel and N (k) is noise, the noise portion is ignored herein.

And S105, extracting signals with the same frequency point from the signals after the FFT processing.

In order to detect blockwise, the FFT-transformed received signal needs to be decimated (or rearranged or reconstructed) so that signals with the same information are constructed into a vector. To explain the reconstruction method, the feature after DFT conversion of the spread (spreading) signal is explained, and signal reconstruction is performed based on the feature.

From the above equation (2), it can be seen that the signal after DFT is the product of the transmission symbol s (m) which is transformed into g (k) and the spreading sequence p (q) which is transformed into f (k). g (k) is a periodic signal, each period containing N points. f (k) is obtained by performing DFT conversion on p (q), and in many cases, the detection end knows the spreading sequence and accordingly obtains the information of f (k).

By substituting formula (2) for formula (4), there are

Y(k)＝H(k)g(k)f(k) (5)

The receiving end may divide the FFT-transformed received signal y (k) by f (k), so that only g (k) needs to be detected, and the signal model becomes:

Y'(k)＝Y(k)/f(k)＝H(k)g(k) (6)

the receiving end may combine f (k) and h (k) to construct an equivalent channel hf (k), and then detect g (k), as follows:

Y(k)＝H(k)f(k)g(k)+N(k)＝H_f(k)g(k) (7)

the relationship between g (k) and f (k) can be seen schematically in FIG. 4. And if each period of the signals obtained by the DFT processing at the sending end comprises N frequency points, extracting the signals at intervals of N. It can also be seen from equation (2) that g (k) is periodic, and is repeated every N points, and block wise detection can be performed by using the periodic characteristic of g (k). And extracting the same frequency points in the middle phase after DFT conversion to form a block, and then carrying out corresponding detection. The specific extraction process is as follows: setting a received signal to obtain a signal Y (k) after FFT conversion, and constructing Y (k) with an interval of N as a vector:

r(u)＝[Y(u),Y(u+N),…,,Y(u+(M-1)N)] (8)

where u is 0,1, ….. N-1, y (u) may include a vector corresponding to the u-th frequency point of different antennas, or y (u) may include a signal of only one antenna, and r (u) of different antennas is expanded according to a Multiple Input Multiple Output (MIMO) processing method.

Of course, if the sending end performs point-to-point interleaving on the signals processed by DFT, the receiving end may extract signals from (i-1) M +1 to iM, where i is less than or equal to N, N is the number of frequency points after DFT conversion of Y, and M is the number of spreading codes. I.e. from (i-1) M +1 to iM corresponding Y into one vector. If the sending end interleaves the signal processed by DFT according to the block, the elements with the interval of N are constructed into a vector, and the extraction of the signal at each interval of N is also rejected.

S106, constructing the extracted signals into a vector;

multiplying the frequency domain channel h (k) by f (k), the equivalent channel hf (k), as shown in the following equation

And extracting points with the interval of N to form a vector, and detecting by using a corresponding channel hf (k), thereby realizing MMSE detection of block wise.

In the embodiment of the present invention, corresponding f (k) may also be removed from the received signal y (k), and then a channel vector may be constructed by using the channel h (k). The discussion will not be expanded here again,

and S107, the receiving end detects the vector according to a preset detection algorithm, for example, the receiving end can detect according to an MMSE algorithm and an MPA algorithm so as to identify the signal sent by the sending end.

For example, the transmitting end performs point-by-point interleaving on the signals after DFT processing, and the receiving end constructs h _ f corresponding to (i-1) M +1 to iM into a vector as a corresponding channel vector for detection. Alternatively, the corresponding f (k) may be removed from the received signal y (k), and then a channel vector may be constructed using the channel h (k).

To sum up, in the DFT-s-OFDMA system, when time domain spreading is performed at the DFT input end, the embodiment of the present invention can implement joint detection of signals at multiple frequency points in a frequency domain, that is, a detection method of blockwise (codewise), that is, after FFT transformation is performed at the receiving end, a frequency domain signal is obtained, signals of multiple frequency points in the frequency domain signal are constructed into one vector, and when a detector performs detection, at least more than two elements in the vector are required to be used for detection, and one element in the vector is not used for detection. The detection method can be an MMSE or non-MMSE detection method. And constructing signals of different frequency points into a vector, and detecting the signals of each user by using a detection algorithm so as to optimize the detection performance.

The device provided by the embodiment of the invention is described in the following with the attached drawings of the specification.

Referring to fig. 5, based on the same inventive concept, an embodiment of the present invention provides a terminal device, where the terminal device includes: a memory 501, a processor 502, and a transceiver 503. The memory 501 and the transceiver 503 may be connected to the processor 502 through a bus interface (fig. 5 is taken as an example), or may be connected to the processor 502 through a dedicated connection line.

The memory 501 may be used to store programs, among other things. A transceiver 503 for transceiving data under the control of the processor 502. The processor 502 may be configured to read the program in the memory 501 and execute the following processes: spreading the modulated signal, and performing Discrete Fourier Transform (DFT) processing on the spread signal; and mapping the signal after DFT processing to the input of discrete inverse Fourier transform expansion, performing Inverse Fast Fourier Transform (IFFT) processing, and sending the processed signal to a receiving end.

Optionally, the processor 502 is specifically configured to:

and performing time domain non-sparse spreading on the received signal.

Optionally, the processor 502 is specifically configured to:

interweaving the signals processed by DFT;

and performing resource RE sparse mapping on the interleaved signal to the input of the IFFT.

Optionally, the processor 502 is specifically configured to:

performing point-by-point interleaving on the signals subjected to DFT processing; or the like, or, alternatively,

and interleaving the signals subjected to DFT processing according to blocks.

Optionally, the processor 502 is specifically configured to:

mapping an element D (u + (i-1) N) in the DFT processed signal to the Mu + t of the IFFT transform input end_iAnd on + B elements, wherein N is the number of modulation symbols, the ith non-sparse element of the spreading code corresponds to the position ti of the spreading code, M is the number of the spreading code elements, u is used for indicating a frequency point, u is 0,1,. N-1, and B is an initial frequency point of the transmission bandwidth.

Optionally, the processor 502 is specifically configured to:

mapping the DFT processed signals from (i-1) N +1 to iN elements to (t) at the input end of IFFT_i-1) N +1+ B to t_iThe N + B position; wherein N is a modulation symbolNumber, i-th non-sparse element of spreading code corresponds to t-th element of spreading code_iPosition, M is the number of spreading code elements, u is used to indicate frequency points, u is 0,1,. N-1, and B is the starting frequency point of the transmission bandwidth.

Where in fig. 5 the bus architecture may include any number of interconnected buses and bridges, in particular one or more processors represented by processor 502 and various circuits of memory represented by memory 501 are linked together. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. The bus interface provides an interface. The transceiver 503 may be a number of elements, including a transmitter and a transceiver, providing a means for communicating with various other apparatus over a transmission medium. The processor 502 is responsible for managing the bus architecture and general processing, and the memory 501 may store data used by the processor 502 in performing operations.

Alternatively, the Memory 501 may include a Read Only Memory (ROM), a Random Access Memory (RAM), and a disk Memory. The memory 501 is used for storing data required by the processor 502 during operation, that is, storing instructions executable by the at least one processor 505, and the at least one processor 502 executes the instructions stored in the memory 501 to perform the signal processing method of the wireless communication system provided in the embodiment shown in fig. 1. The number of the memories 501 is one or more. The memory 501 is shown in fig. 5, but it should be noted that the memory 501 is not an optional functional block, and is shown by a dotted line in fig. 5.

Referring to fig. 6, based on the same inventive concept, an embodiment of the present invention provides a terminal device, which includes a processing unit 601 and a mapping unit 602.

The processing unit 601 is configured to perform spread spectrum on the modulated signal, and perform discrete fourier transform DFT processing on the spread signal. The mapping unit 602 is configured to map the DFT-processed signal to an input of a discrete inverse fourier transform spread, perform an inverse fast fourier transform IFFT process, and send the processed signal to a receiving end.

Optionally, the processing unit 601 is specifically configured to:

and performing time domain non-sparse spreading on the received signal.

Optionally, the mapping unit 602 is specifically configured to:

interweaving the signals processed by DFT;

and performing resource RE sparse mapping on the interleaved signal to the input of the IFFT.

Optionally, the mapping unit 602 is specifically configured to:

performing point-by-point interleaving on the signals subjected to DFT processing; or the like, or, alternatively,

and interleaving the signals subjected to DFT processing according to blocks.

Optionally, the mapping unit 602 is specifically configured to:

mapping an element D (u + (i-1) N) in the DFT processed signal to the Mu + t of the IFFT transform input end_i+ B elements, where N is the number of modulation symbols, and the ith non-sparse element of the spreading code corresponds to the tth element of the spreading code_iPosition, M is the number of spreading code elements, u is used to indicate frequency points, u is 0,1,. N-1, and B is the starting frequency point of the transmission bandwidth.

Optionally, the mapping unit 602 is specifically configured to:

mapping the DFT processed signals from (i-1) N +1 to iN elements to (t) at the input end of IFFT_i-1) N +1+ B to t_iThe N + B position; wherein N is the number of modulation symbols, and the ith non-sparse element of the spreading code corresponds to the tth element of the spreading code_iPosition, M is the number of spreading code elements, u is used to indicate frequency points, u is 0,1,. N-1, and B is the starting frequency point of the transmission bandwidth.

The physical devices corresponding to the processing unit 601 and the mapping unit 602 may be the aforementioned processor 502 or the transceiver 503. The terminal device may be configured to perform the signal processing method of the wireless communication system provided by the embodiment shown in fig. 1. Therefore, regarding the functions that can be realized by each functional module in the device, reference may be made to the corresponding description in the embodiment shown in fig. 1, which is not repeated herein.

Referring to fig. 7, based on the same inventive concept, an embodiment of the present invention provides a terminal device, where the terminal device includes: a memory 701, a processor 702, and a transceiver 703. The memory 701 and the transceiver 703 may be connected to the processor 702 through a bus interface (as shown in fig. 7 for example), or may be connected to the processor 702 through a dedicated connection line.

Memory 701 may be used to store programs, among other things. A transceiver 703 for transceiving data under the control of the processor 702. The processor 702 may be configured to read the program in the memory 701 and execute the following processes: carrying out Fast Fourier Transform (FFT) processing on the received signals; the signal is obtained by the transmitting end after spread spectrum and discrete Fourier transform spread orthogonal frequency division multiple access DFT-s-OFDM processing;

extracting frequency points with the same modulation symbol frequency domain signals from the signals after FFT processing;

constructing the decimated signals into a vector;

and detecting the vector according to a preset detection algorithm so as to identify the signal sent by the sending end.

Optionally, the processor 702 is specifically configured to:

and if each period of the signals obtained by the DFT processing at the sending end comprises N frequency points, extracting the signals at intervals of N.

Optionally, the processor 702 is specifically configured to:

if the sending end carries out point-to-point interleaving on the signals after DFT processing, extracting signals from (i-1) M +1 to iM, wherein i is less than or equal to N, N is the number of modulation symbols, and M is the number of elements in the spread spectrum code;

and if each period of the signals processed by the DFT at the sending end comprises N frequency points and interleaving is carried out according to blocks, extracting the signals at intervals of N.

Optionally, the processor 702 is specifically configured to:

constructing an equivalent channel for the frequency domain channel according to the extracted signal; or the like, or, alternatively,

and constructing an equivalent channel for the frequency domain channel according to the extracted signal and the spread spectrum sequence.

Wherein in fig. 7, the bus architecture may include any number of interconnected buses and bridges, with one or more processors, represented by processor 702, and various circuits, represented by memory 701, being linked together. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any further herein. The bus interface provides an interface. The transceiver 703 may be a number of elements, including a transmitter and a transceiver, providing a means for communicating with various other apparatus over a transmission medium. The processor 702 is responsible for managing the bus architecture and general processing, and the memory 701 may store data used by the processor 702 in performing operations.

Optionally, the Memory 701 may include a Read Only Memory (ROM), a Random Access Memory (RAM), and a disk Memory. The memory 701 is used for storing data required by the processor 702 during operation, that is, storing instructions executable by the at least one processor 702, and the at least one processor 702 executes the instructions stored in the memory 701 to perform the signal processing method of the wireless communication system according to the embodiment shown in fig. 1. The number of the memories 701 is one or more. The memory 701 is shown in fig. 7, but it should be noted that the memory 701 is not an optional functional block, and is shown by a dotted line in fig. 7.

Referring to fig. 8, based on the same inventive concept, an embodiment of the present invention provides a terminal device, which includes a processing unit 801, an extracting unit 802, a constructing unit 803, and a detecting unit 804.

The processing unit 801 is configured to perform Fast Fourier Transform (FFT) processing on the received signal; the signal is obtained by processing the transmitting end through spread spectrum and discrete Fourier transform spread orthogonal frequency division multiple access DFT-s-OFDM. The extracting unit 802 is configured to extract frequency points of frequency domain signals with the same modulation symbol from the FFT-processed signals. The constructing unit 803 is configured to construct the extracted signal into a vector. The detecting unit 804 is configured to detect the vector according to a preset detection algorithm, so as to identify a signal sent by a sending end.

Optionally, the extracting unit 802 is specifically configured to:

and if each period of the signals obtained by the DFT processing at the sending end comprises N frequency points, extracting the signals at intervals of N.

Optionally, the extracting unit 802 is specifically configured to:

if the sending end carries out point-to-point interleaving on the signals after DFT processing, extracting signals from (i-1) M +1 to iM, wherein i is less than or equal to N, N is the number of modulation symbols, and M is the number of elements in the spread spectrum code;

and if each period of the signals processed by the DFT at the sending end comprises N frequency points and interleaving is carried out according to blocks, extracting the signals at intervals of N.

Optionally, the extracting unit 802 is specifically configured to:

constructing an equivalent channel for the frequency domain channel according to the extracted signal; or the like, or, alternatively,

and constructing an equivalent channel for the frequency domain channel according to the extracted signal and the spread spectrum sequence.

The physical devices corresponding to the processing unit 801, the extracting unit 802, the constructing unit 803, and the detecting unit 804 may be the processor 702 or the transceiver 703. The terminal device may be configured to perform the signal processing method of the wireless communication system provided by the embodiment shown in fig. 1. Therefore, regarding the functions that can be realized by each functional module in the device, reference may be made to the corresponding description in the embodiment shown in fig. 1, which is not repeated herein.

Based on the same inventive concept, an embodiment of the present invention further provides a computer storage medium, where the computer storage medium stores computer instructions, and when the computer instructions run on a computer, the method for processing a signal in a wireless communication system provided in the embodiment shown in fig. 1 is performed.

The signal processing method, the terminal device and the network device of the wireless communication system provided by the embodiment of the invention can be applied to the wireless communication system, such as a 5G system. However, suitable communication systems include, but are not limited to, a 5G system or an Evolved system thereof, other Orthogonal Frequency Division Multiplexing (OFDM) based systems, DFT-S-OFDM (DFT-Spread OFDM) based systems, Evolved Long Term Evolution (lte) based systems, new network equipment systems, and the like. In practical applications, the connection between the above devices may be a wireless connection or a wired connection.

It should be noted that the communication system may include a plurality of terminal devices, and the network device may communicate (transmit signaling or transmit data) with the plurality of terminal devices. The terminal device according to the embodiments of the present invention may be a device providing voice and/or data connectivity to a user, a handheld device having a wireless connection function, or another processing device connected to a wireless modem. Wireless user equipment, which may be mobile terminals such as mobile telephones (or "cellular" telephones) and computers having mobile terminals, for example, portable, pocket, hand-held, computer-included, or vehicle-mounted mobile devices, may communicate with one or more core networks via a Radio Access Network (RAN). Examples of such devices include Personal Communication Service (PCS) phones, cordless phones, Session Initiation Protocol (SIP) phones, Wireless Local Loop (WLL) stations, Personal Digital Assistants (PDAs), and the like. A Terminal may also be referred to as a system, a Subscriber Unit (Subscriber Unit), a Subscriber Station (Subscriber Station), a Mobile Station (Mobile), a Remote Station (Remote Station), an Access Point (Access Point), a Remote Terminal (Remote Terminal), an Access Terminal (Access Terminal), a User Terminal (User Terminal), a User Agent (User Agent), a User Device (User Device), and a wireless Device (wireless Device).

The network device provided by the embodiments of the present invention may be a base station or may be configured to interconvert received air frames and IP packets as a router between the wireless terminal device and the rest of the access network, where the rest of the access network may include Internet Protocol (IP) network devices. The network device may also be a device that coordinates management of attributes for the air interface. For example, the network device may be a network device in a 5G System, such as a Next generation Base Station (Next generation Node B, gNB), a Base Transceiver Station (BTS) in a Global System for Mobile Communication (GSM) or Code Division Multiple Access (CDMA), a Base Station (NodeB) in a Wideband Code Division Multiple Access (WCDMA), or an evolved Node B (eNB or e-NodeB) in LTE, which is not limited in the embodiments of the present invention.

It is to be understood that the terms first, second, and the like in the description of the embodiments of the invention are used for distinguishing between the descriptions and not necessarily for describing a sequential or chronological order. "plurality" in the description of the embodiments of the present invention means two or more.

In some possible embodiments, the aspects of the serving cell setting method, the network device and the terminal device provided by the present invention may also be implemented in the form of a program product, which includes program codes for causing a computer device to execute the steps in the configuration information selection method according to various exemplary embodiments of the present invention described above in this specification when the program product runs on the computer device, for example, the computer device may execute the signal processing method of the wireless communication system provided by the embodiment shown in fig. 1.

The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

A program product of a signal processing method for a wireless communication system of an embodiment of the present invention may employ a portable compact disc read only memory (CD-ROM) and include program codes, and may be run on a computing device. However, the program product of the present invention is not limited in this regard and, in the present document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

It should be noted that although several units or sub-units of the apparatus are mentioned in the above detailed description, such division is merely exemplary and not mandatory. Indeed, the features and functions of two or more of the units described above may be embodied in one unit, according to embodiments of the invention. Conversely, the features and functions of one unit described above may be further divided into embodiments by a plurality of units.

Moreover, while the operations of the method of the invention are depicted in the drawings in a particular order, this does not require or imply that the operations must be performed in this particular order, or that all of the illustrated operations must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions.

As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention 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 invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. 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.

While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.

It will be apparent to those skilled in the art that various changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.

Claims (7)

1. A signal processing method for a wireless communication system, comprising:

performing time domain non-sparse spectrum spreading on the modulated signal, and performing Discrete Fourier Transform (DFT) processing on the spread signal;

performing point-by-point interleaving on the signal subjected to the DFT processing to obtain an interleaved signal, specifically comprising: mapping an element D (u + (i-1) N) in the signal after DFT processing to the Mu + t of the IFFT transform input end_iAnd obtaining the interleaved signal on + B elements, wherein N is the number of modulation symbols, and the ith non-sparse element of the spread spectrum code corresponds to the tth element of the spread spectrum code_iPosition, M is the number of spreading code elements, u is used to indicate frequency points, u is 0,1,. N-1, and B is the initial frequency point of the transmission bandwidth; alternatively, the first and second electrodes may be,

interleaving the signal subjected to DFT processing block by block to obtain an interleaved signal, specifically comprising: mapping the DFT processed signal from (i-1) N +1 to iN elements to (t) of IFFT input end_i-1) N +1+ B to t_iN + B position, obtaining the interleaved signal, wherein N is the number of modulation symbols, and the ith non-sparse element of the spread spectrum code corresponds to the tth of the spread spectrum code_iPosition, M is the number of spreading code elements, u is used to indicate frequency points, u is 0,1,. N-1, and B is the initial frequency point of the transmission bandwidth;

and performing resource RE sparse mapping on the interleaved signal to the input of discrete inverse Fourier transform expansion, performing Inverse Fast Fourier Transform (IFFT) processing, and sending the processed signal to a receiving end.

2. A signal processing method for a wireless communication system, comprising:

carrying out Fast Fourier Transform (FFT) processing on the received signals; the signal is obtained by the transmitting end through spread spectrum and DFT processing on the spread spectrum signal, interleaving the DFT processed signal, performing resource RE sparse mapping on the interleaved signal to the input of discrete inverse Fourier transform expansion, and performing inverse fast Fourier transform IFFT processing;

extracting frequency points with the same modulation symbol frequency domain signals from the signals after FFT processing; the extracting frequency points with the same modulation symbol frequency domain signals from the signals after the FFT processing comprises: if each period of the signals obtained by the sending end through DFT processing comprises N frequency points, extracting the signals at intervals of N; or if the sending end carries out point-to-point interleaving on the signals after DFT processing, extracting signals from (i-1) M +1 to iM, wherein i is less than or equal to N, N is the number of modulation symbols, and M is the number of elements in the spread spectrum code; if each period of the signal processed by DFT at the sending end comprises N frequency points and interleaving is carried out according to blocks, extracting the signal at intervals of N;

constructing the decimated signals into a vector comprising: constructing an equivalent channel for the frequency domain channel according to the extracted signal; or, constructing an equivalent channel for the frequency domain channel according to the extracted signal and the spread spectrum sequence;

and detecting the vector according to a preset detection algorithm so as to identify the signal sent by the sending end.

3. A terminal device, comprising:

a memory to store instructions;

a processor for reading the instructions in the memory, performing the following processes:

performing time domain non-sparse spectrum spreading on the modulated signal, and performing Discrete Fourier Transform (DFT) processing on the spread signal;

performing point-by-point interleaving on the signal subjected to the DFT processing to obtain an interleaved signal, specifically comprising: mapping an element D (u + (i-1) N) in the signal after DFT processing to the Mu + t of the IFFT transform input end_iAnd obtaining the interleaved signal on + B elements, wherein N is the number of modulation symbols and the spreading codeThe ith non-sparse element corresponds to the tth of the spreading code_iPosition, M is the number of spreading code elements, u is used to indicate frequency points, u is 0,1,. N-1, and B is the initial frequency point of the transmission bandwidth; alternatively, the first and second electrodes may be,

interleaving the signal subjected to DFT processing block by block to obtain an interleaved signal, specifically comprising: mapping the DFT processed signal from (i-1) N +1 to iN elements to (t) of IFFT input end_i-1) N +1+ B to t_iN + B position, obtaining the interleaved signal, wherein N is the number of modulation symbols, and the ith non-sparse element of the spread spectrum code corresponds to the tth of the spread spectrum code_iPosition, M is the number of spreading code elements, u is used to indicate frequency points, u is 0,1,. N-1, and B is the initial frequency point of the transmission bandwidth;

performing resource RE sparse mapping on the interleaved signal to input of discrete inverse Fourier transform expansion, performing Inverse Fast Fourier Transform (IFFT) processing, and sending the processed signal to a receiving end;

a transceiver for transceiving data under control of the processor.

4. A network device, comprising:

a memory to store instructions;

a processor for reading the instructions in the memory, performing the following processes:

carrying out Fast Fourier Transform (FFT) processing on the received signals; the signal is obtained by processing a transmitting end through spread spectrum and discrete Fourier transform spread orthogonal frequency division multiple access DFT-s-OFDM;

extracting frequency points with the same modulation symbol frequency domain signals from the signals after FFT processing; the extracting frequency points with the same modulation symbol frequency domain signals from the signals after the FFT processing comprises: if each period of the signals obtained by the sending end through DFT processing comprises N frequency points, extracting the signals at intervals of N; or if the sending end carries out point-to-point interleaving on the signals after DFT processing, extracting signals from (i-1) M +1 to iM, wherein i is less than or equal to N, N is the number of modulation symbols, and M is the number of elements in the spread spectrum code; if each period of the signal processed by DFT at the sending end comprises N frequency points and interleaving is carried out according to blocks, extracting the signal at intervals of N;

constructing the decimated signals into a vector comprising: constructing an equivalent channel for the frequency domain channel according to the extracted signal; or, constructing an equivalent channel for the frequency domain channel according to the extracted signal and the spread spectrum sequence;

detecting the vector according to a preset detection algorithm to identify a signal sent by a sending end;

a transceiver for transceiving data under control of the processor.

5. A terminal device, comprising:

the processing unit is used for performing time domain non-sparse spectrum spreading on the modulated signal and performing Discrete Fourier Transform (DFT) processing on the spread signal;

the mapping unit is configured to perform point-to-point interleaving on the DFT-processed signal to obtain an interleaved signal, and specifically includes: mapping an element D (u + (i-1) N) in the signal after DFT processing to the Mu + t of the IFFT transform input end_iAnd obtaining the interleaved signal on + B elements, wherein N is the number of modulation symbols, and the ith non-sparse element of the spread spectrum code corresponds to the tth element of the spread spectrum code_iPosition, M is the number of spreading code elements, u is used to indicate frequency points, u is 0,1,. N-1, and B is the initial frequency point of the transmission bandwidth; alternatively, the first and second electrodes may be,

interleaving the signal subjected to DFT processing block by block to obtain an interleaved signal, specifically comprising: mapping the DFT processed signal from (i-1) N +1 to iN elements to (t) of IFFT input end_i-1) N +1+ B to t_iN + B position, obtaining the interleaved signal, wherein N is the number of modulation symbols, and the ith non-sparse element of the spread spectrum code corresponds to the tth of the spread spectrum code_iPosition, M is the number of spreading code elements, u is used to indicate frequency points, u is 0,1,. N-1, and B is the initial frequency point of the transmission bandwidth;

and performing resource RE sparse mapping on the interleaved signal to the input of discrete inverse Fourier transform expansion, performing Inverse Fast Fourier Transform (IFFT) processing, and sending the processed signal to a receiving end.

6. A network device, comprising:

the processing unit is used for carrying out Fast Fourier Transform (FFT) processing on the received signals; the signal is obtained by the transmitting end through spread spectrum and DFT processing on the spread spectrum signal, interleaving the DFT processed signal, performing resource RE sparse mapping on the interleaved signal to the input of discrete inverse Fourier transform expansion, and performing inverse fast Fourier transform IFFT processing;

the extracting unit is used for extracting frequency points with the same modulation symbol frequency domain signals from the signals after FFT processing; the extracting frequency points with the same modulation symbol frequency domain signals from the signals after the FFT processing comprises: if each period of the signals obtained by the sending end through DFT processing comprises N frequency points, extracting the signals at intervals of N; or if the sending end carries out point-to-point interleaving on the signals after DFT processing, extracting signals from (i-1) M +1 to iM, wherein i is less than or equal to N, N is the number of modulation symbols, and M is the number of elements in the spread spectrum code; if each period of the signal processed by DFT at the sending end comprises N frequency points and interleaving is carried out according to blocks, extracting the signal at intervals of N;

a construction unit for constructing the decimated signals into a vector, comprising: constructing an equivalent channel for the frequency domain channel according to the extracted signal; or, constructing an equivalent channel for the frequency domain channel according to the extracted signal and the spread spectrum sequence;

and the detection unit is used for detecting the vector according to a preset detection algorithm so as to identify the signal sent by the sending end.

7. A computer storage medium on which a computer program is stored, which computer program, when being executed by a processor, carries out the method of claim 1 or 2.

Images