WO2024051242A1 - 数据传输方法、设备及存储介质 - Google Patents

数据传输方法、设备及存储介质 Download PDF

Info

Publication number
WO2024051242A1
WO2024051242A1 PCT/CN2023/099777 CN2023099777W WO2024051242A1 WO 2024051242 A1 WO2024051242 A1 WO 2024051242A1 CN 2023099777 W CN2023099777 W CN 2023099777W WO 2024051242 A1 WO2024051242 A1 WO 2024051242A1
Authority
WO
WIPO (PCT)
Prior art keywords
data sequence
data
sequence
raised cosine
cosine function
Prior art date
Application number
PCT/CN2023/099777
Other languages
English (en)
French (fr)
Inventor
辛雨
暴桐
华健
郁光辉
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2024051242A1 publication Critical patent/WO2024051242A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes

Definitions

  • This application relates to the field of wireless communications, such as data transmission methods, equipment and storage media.
  • the fifth generation mobile communications (5th Generation, 5G) technology can be divided into two frequency bands: high frequency and low frequency.
  • the high frequency band is the millimeter wave band
  • the low frequency band is closely related to the fourth generation mobile communications (4th Generation, 4G) technology.
  • the frequency bands used overlap.
  • the low-frequency band is mainly used for Massive Machine Type Communication (mMTC) services
  • the high-frequency band is mainly used for enhanced mobile broadband (Enhanced Mobile Broadband, eMBB) and ultra-reliable low-latency communication (Ultra-Reliable Low- Latency Communications, URLLC) and other services.
  • mMTC Massive Machine Type Communication
  • eMBB enhanced mobile broadband
  • Ultra-Reliable Low- Latency Communications, URLLC Ultra-Reliable Low- Latency Communications
  • the path loss and shadow attenuation in high-frequency bands are large, so the signal-to-noise ratio in some areas at the edge of the cell will be very low. Moreover, in high-frequency scenarios, the efficiency of the power amplifier (Power Amplifier, PA) is low. In order to improve the signal-to-interference plus Noise Ratio (SINR), it is also necessary to save the power of the user equipment (User Equipment, UE) battery. To reduce power consumption, the peak average power ratio (PAPR, peak-to-average ratio) of the UE transmitted signal needs to be low.
  • PAPR peak average power ratio
  • the PAPR of the signal transmitted by the UE also needs to be low.
  • the SINR will be very low. Therefore, there is a need to use a low-order modulation and coding scheme (Modulation and Coding Scheme, MCS) and low PAPR signal modulation method.
  • MCS Modulation and Coding Scheme
  • the signal PAPR using the Discrete Fourier transform-spread orthogonal frequency-division multiplexing (DFT-s-OFDM) modulation method is relatively low. Low, but it is still difficult to meet application scenarios with lower PAPR requirements for Beyond 5G (Beyond 5G, B5G) or sixth generation mobile communications (6th Generation, 6G) technology.
  • DFT-s-OFDM Discrete Fourier transform-spread orthogonal frequency-division multiplexing
  • Embodiments of the present application provide data transmission methods, devices and storage media.
  • the embodiment of the present application is expected to provide a data transmission method, including:
  • the third data sequence is obtained by dot multiplying the first data sequence and the second data sequence, where the first number
  • the data sequence and the second data sequence are frequency domain data sequences; perform reverse Fourier transformation on the third data sequence to obtain a fourth data sequence; and carry the fourth data sequence on physical time-frequency resources for transmission.
  • a data transmission device including:
  • the memory is configured to store the program; the processor is configured to execute the program.
  • the program When the program is executed, the first data sequence and the second data sequence are dot-multiplied to obtain a third data sequence, wherein the first data sequence and the The second data sequence is a frequency domain data sequence; the third data sequence is subjected to reverse Fourier transformation to obtain the fourth data sequence; the fourth data sequence is carried and transmitted on physical time-frequency resources.
  • embodiments of the present application provide a storage medium.
  • the storage medium includes a stored program. When the program is run, the data transmission method provided by the embodiment of the present application is executed.
  • Figure 1 is a flow chart of a data transmission method provided by an embodiment of the present application.
  • Figure 2 is a schematic diagram of inserting one data between two adjacent data
  • Figure 3 is a schematic diagram of inserting two data between two adjacent data
  • Figure 4 is a schematic diagram of the waveform of the root raised cosine function in the embodiment of the present application.
  • Figure 5 is a schematic diagram of a data sequence in this embodiment
  • Figure 6 is a schematic diagram of another data sequence in this embodiment.
  • Figure 7 is a schematic structural diagram of a data processing network for data modulation in the data transmission method provided by the embodiment of the present application.
  • Figure 8 is a schematic structural diagram of a data transmission device provided by an embodiment of the present application.
  • Figure 1 is a flow chart of a data transmission method provided by an embodiment of the present application. As shown in Figure 1, the data transmission method provided by this embodiment includes:
  • Step S110 Dot-multiply the first data sequence and the second data sequence to obtain a third data sequence, where the first data sequence and the second data sequence are frequency domain data sequences.
  • the data transmission method provided in this embodiment can be applied to any node in the wireless communication system.
  • It can be applied to UEs in wireless communication systems.
  • embodiments of this application propose a new signal modulation method. Using this signal modulation method for modulation and then transmission can achieve lower PAPR.
  • the first data sequence and the second data sequence are dot-multiplied to obtain the third data sequence.
  • the first data sequence is the data sequence to be transmitted, and the second data sequence is the preset data sequence.
  • the first data sequence and the second data sequence are both frequency domain data sequences.
  • Dot multiplying the first data sequence and the second data sequence can also be referred to as performing a frequency domain shaping operation on the first data sequence, where the frequency domain shaping function is the second data sequence.
  • the dot product operation may also be called a filtering operation, where the filtering function is the second data sequence.
  • the first data sequence is recorded as [X(j)]
  • the second data sequence is recorded as [Z(j)]
  • the third data sequence is recorded as [S(j)].
  • the third data sequence [S(j)] [x(1) ⁇ z(1), x(2) ⁇ z(2),...,x( J) ⁇ z(J)]
  • ⁇ represents the multiplication operation.
  • the length of the first data sequence and the length of the second data sequence may be the same or different. That is to say, the length J of the first data sequence [X(j)] and the second data sequence [Z(j)] may be the same or different. different.
  • the second data sequence may be generated by a root raised cosine function.
  • the root raised cosine function may be a frequency domain compressed root raised cosine function.
  • the value range of the roll-off factor of the root raised cosine function is [0.7, 1]
  • the ratio of the half-value bandwidth of the root raised cosine function to the bandwidth occupied by the first data sequence is P/2
  • the value range of P is [0.9, 1.1].
  • the roll-off factor of the root raised cosine function is 1.
  • the second data sequence is generated by discrete sampling of a root raised cosine function.
  • the length of the argument corresponding to the non-zero function value of the root raised cosine function is less than or equal to the bandwidth occupied by the first data sequence.
  • the root raised cosine function is the root raised cosine function
  • A is a constant
  • ⁇ is the roll-off factor
  • 2f 0 is the half-value bandwidth of the root raised cosine function
  • 2f 0 (1+ ⁇ ) is the length of the argument corresponding to a non-zero function value.
  • the first data sequence is generated by Fourier transform from the fifth data sequence, wherein the fifth data sequence is a time domain data sequence.
  • the fifth data sequence can be generated from the sixth data sequence
  • the sixth data sequence is formed by constellation point modulation and the seventh data sequence composed of 0 and 1.
  • the constellation point modulation of the sixth data sequence is ⁇ /2-binary phase.
  • BPSK Binary Phase Shift Keying
  • the sixth data sequence is a reference sequence, and the constellation point modulation of the reference sequence is ⁇ /2-BPSK.
  • the sixth data sequence also contains L reference sequence data, where L ⁇ 0.
  • the fifth data sequence is recorded as [x(j)]
  • the sixth data sequence is recorded as [d(i)]
  • the seventh data sequence is recorded as [b(m)].
  • the fifth data sequence is generated from the sixth data sequence.
  • N new data can be inserted between each two adjacent data in the sixth data sequence.
  • the new data is the sum of the two adjacent data multiplied by N is a non-negative integer.
  • N is 0 or 1.
  • N is 0, that is, the sixth data sequence is directly used as the fifth data sequence.
  • N 1, one new data is inserted between every two data in the sixth data sequence, and the new data is the sum of two adjacent data multiplied by Alternatively, N pieces of new data can be inserted between each two adjacent pieces of data in the sixth data sequence.
  • the modulus of the new data is the same as the modulus of the two adjacent pieces of data. After inserting the new data, the phase difference between the adjacent data is: where N is a non-negative integer.
  • the modulus of each data in a data sequence is the same, and the phase difference of each adjacent data after insertion is The larger N is, the smaller the phase difference between adjacent data is and the lower the PAPR of time domain data is.
  • Step S120 Perform inverse Fourier transformation on the third data sequence to obtain a fourth data sequence.
  • the fourth data sequence After obtaining the third data sequence, perform an inverse Fourier transform on the third data sequence to generate a fourth data sequence.
  • the inverse Fourier transform can be directly performed on the third data sequence, that is, no oversampling process is required.
  • zeros can be padded in the third data sequence to form a new data sequence, and then the fourth data sequence can be generated after performing inverse Fourier transform on the new data sequence.
  • the fourth data sequence is recorded as [s(k)].
  • Step S130 The fourth data sequence is carried and transmitted on physical time-frequency resources.
  • the fourth data sequence can be carried on the physical time-frequency resource for transmission, which can effectively reduce the PAPR of transmitting the fourth data sequence.
  • the frequency domain data point product Equivalent to time domain data convolution the time domain discrete data of a reasonably designed frequency domain data sequence is a set of designed weight coefficient sequences. After a set of discrete time domain data is convolved with a set of designed discrete data, The correlation between adjacent data will be better, so the PAPR of the transmitted data sequence can be effectively reduced.
  • the frequency domain data sequence corresponding to a set of time domain discrete data is generated by the root raised cosine function, its data correlation will be better.
  • the fourth data sequence Before carrying and transmitting the fourth data sequence on the physical time-frequency resource, the fourth data sequence may also be filtered.
  • the data transmission method provided in this embodiment performs an inverse Fourier transform on the data sequence generated by the dot multiplication of two frequency domain data sequences, and then transmits the generated new sequence on physical time-frequency resources, which can effectively reduce the transmission cost. PAPR of the data sequence.
  • the fifth data sequence is ⁇ /2-BPSK modulated data
  • ⁇ /2-BPSK modulated data has lower PAPR.
  • the half-value bandwidth of the root raised cosine function is half of the bandwidth occupied by the first data sequence, and the roll-off factor of the root raised cosine function is 1.
  • the advantage is that no additional frequency domain bandwidth is occupied, the transmitted data sequence has low PAPR, and the reception Demodulation at the end is not affected. This is because when the roll-off factor of the root raised cosine function is 1, the bandwidth of the root raised cosine function is the same as the bandwidth occupied by the first data sequence, which is equivalent to 50% compression in the frequency domain, which is expressed as the root raised cosine function after frequency domain compression.
  • the zero point position of the side lobe of the time domain waveform of the cosine function is different from the zero point position of the side lobe of the Singer function (Sinc function), but the time domain data is ⁇ /2-BPSK constellation point modulated data or by ⁇ /2-BPSK constellation point
  • the modulated data is then interpolated so that adjacent data are on different directional axes, so the demodulation at the receiving end is not affected.
  • the sixth data sequence is a reference sequence.
  • the constellation point modulation of the reference sequence is ⁇ /2-BPSK, so that the reference sequence also has low PAPR.
  • N is 1, this reference sequence is used for channel estimation, and the receiving end performance is better. good.
  • the second data sequence can also be generated by a raised cosine function.
  • the raised cosine function may be a frequency domain compressed raised cosine function.
  • the value range of the roll-off factor of the raised cosine function is [0.7, 1]
  • the ratio of the half-value bandwidth of the raised cosine function to the bandwidth occupied by the first data sequence is P/2
  • the value range of P is [0.9 ,1.1].
  • the roll-off factor of the raised cosine function is 1.
  • the second data sequence is a The cosine function is generated by discrete sampling. In one embodiment, the length of the argument corresponding to the non-zero function value of the raised cosine function is less than or equal to the bandwidth occupied by the first data sequence.
  • A is a constant
  • ⁇ is the roll-off factor
  • 2f 0 is the half-value bandwidth of the raised cosine function
  • 2f 0 (1+ ⁇ ) is the independent variable length corresponding to the non-zero function value.
  • a data sequence [S(j)] is formed.
  • the expression of data sequence [S(j)] is as follows:
  • [S(j)] [x(1) ⁇ z(1), x(2) ⁇ z(2),..., x(J) ⁇ z(J)], where “ ⁇ ” represents multiplication operation.
  • the data sequence [s(k)] is carried on physical time-frequency resources for transmission.
  • the frequency domain data sequence [X(j)] is formed by the time domain data sequence [x(j)] through Fourier transform.
  • the time domain data sequence [x(j)] is generated from the data sequence [d(i)], and the constellation point modulation of the data sequence [d(i)] is ⁇ /2-BPSK.
  • the data sequence [d(i)] is directly the data sequence [X(j)].
  • the data sequence [d(i)] is straight Connected to the data sequence [x(j)]
  • the frequency domain data sequence [X(j)] is formed by the time domain data sequence [x(j)] through Fourier transform.
  • the time domain data sequence [x(j)] is generated from the data sequence [d(i)], and the constellation point modulation of the data sequence [d(i)] is ⁇ /2-BPSK.
  • the data sequence [d(i)] one data is inserted between each two adjacent data.
  • the inserted data is the sum of the two adjacent data and multiplied by Form the time domain data sequence [x(j)].
  • the frequency domain data sequence [X(j)] is formed by the time domain data sequence [x(j)] through Fourier transform.
  • the time domain data sequence [x(j)] is generated from the data sequence [d(i)].
  • the constellation point modulation of the data sequence [d(i)] is ⁇ /2-BPSK.
  • the frequency domain data sequence [X(j)] is formed by the time domain data sequence [x(j)] through Fourier transform.
  • the time domain data sequence [x(j)] is generated from the data sequence [d(i)].
  • the constellation point modulation of the data sequence [d(i)] is ⁇ /2-BPSK.
  • N data is inserted between every two adjacent data in the data sequence [d(i)], and the value of N is 1, that is, the data sequence [d( i)] Insert 1 data between every 2 adjacent data, the data is the sum of the 2 adjacent data and multiplied by Then the time domain data sequence [x(j)] is formed.
  • the frequency domain data sequence [X(j)] is formed by the time domain data sequence [x(j)] through Fourier transform.
  • the time domain data sequence [x(j)] is generated from the data sequence [d(i)].
  • the method is: insert N data between each two adjacent data in the data sequence [d(i)].
  • the module of the inserted N data is the same as the module of the two adjacent data. After insertion, each two adjacent data
  • the phase difference between where N is a non-negative integer.
  • the constellation point modulation of the data sequence [d(i)] is ⁇ /2-BPSK.
  • the modulus of each data is the same as the modulus of two adjacent data.
  • the phase difference between each two adjacent data is where N is a non-negative integer.
  • FIG. 2 is a schematic diagram of inserting one data between two adjacent data.
  • the abscissa in Figure 2 is the real part of the data, and the ordinate is the imaginary part of the data.
  • the data sequence d(0) is the time domain data sequence x(0)
  • the data sequence d(0) is related to the One piece of data inserted between the data sequence d(1) is the time domain data sequence x(1)
  • the data sequence d(1) is the time domain data sequence x(2)
  • One piece of data inserted between (1) and the data sequence d(2) is the time domain data sequence x(3)
  • the data sequence d(2) is the time domain data sequence x(4)
  • One piece of data inserted between the data sequence d(2) and the data sequence d(3) is the time domain data sequence x(5)
  • the data sequence d(3) is the time domain data sequence x(6)
  • one piece of data inserted between the data sequence d(3) and the data sequence d(4) is the time domain data sequence x(7)
  • the data sequence d(4) is the Describe the time domain data sequence x(8).
  • the modulus values of the data sequence [x(j)] are: [1,1,1,1,1,1,1], and the inserted data [x(1),x(3 ),x(5),x(7)] is the same as the modulus value of two adjacent data [x(0)x(2),x(2)x(4),x(4)x(6),x (6)x(8)] have the same modulus values; the phases of [x(x0)x, (x 1)x, x() are respectively: The phase value of the inserted data [x(1),x(3),x(5),x(7)] is the same as the phase value of the two adjacent data [x(0)x(2),x(2)x (4),x(4)x(6),x(6)x(8)] The phase difference is
  • the data sequence d(0) is the time domain data sequence x(0)
  • two data inserted between the data sequence d(0) and the data sequence d(1) are the time domain data sequence.
  • x(1), x(2), the data sequence d(1) is the time domain data sequence x(3), and is inserted between the data sequence d(1) and the data sequence d(2)
  • the two data are the time domain data sequences x(4), x(5), the data sequence d(2) is the time domain data sequence x(6), and the data sequence d(2) is the same as the time domain data sequence x(6).
  • Two data inserted between the data sequence d(3) are the time domain data sequences x(7), x(8), and the data sequence d(3) is the time domain data sequence x(9)
  • Two data inserted between the data sequence d(3) and the data sequence d(4) are the time domain data sequences x(10), x(11)
  • the data sequence d(4) is the time domain data sequence x(10), x(11). Describe the time domain data sequence x(12).
  • the modulus values of the data sequence [x(j)] are: [1,1,1,1,1,1,1,1,1,1,1], and the inserted data [
  • the modulus value of x(1),x(2),x(4),x(5),x(7),x(8),x(10),x(11)] is the same as the two adjacent data [ x(0)x(2),x(1)x(3),x(3)x(5),x(4)x(6),x(6)x(8),x(7)x (9), x(9)x(11), x(10)x(12)] have the same modulus values;
  • the phases of x(4),x(5),x(6),x(7),x(8),x(9),x(10),x(11),x(12)] are:
  • the phase value of the inserted data [x(1),x(2),x(4),x(5),x(7),x(8),x(10),x(11)] is the same as Two adjacent data [x(0)x(2),x(1)x(3),x(3)x(5),x
  • the advantage of this embodiment is that the modules of each data in a data sequence are the same, and the phase difference of each adjacent data after insertion is The larger N is, the smaller the phase difference between adjacent data is and the lower the PAPR of time domain data is.
  • the predefined frequency domain data sequence [Z(j)] is generated by the root raised cosine function.
  • the root raised cosine function is discretely sampled to obtain the frequency domain data sequence [Z(j)].
  • the sampling interval of the discrete sampling is the same as the frequency domain
  • the adjacent data frequency domain intervals of the data sequence [X(j)] are the same, that is, the sampling interval of discrete sampling is the same as the subcarrier interval.
  • the root raised cosine function in the frequency domain (the root raised cosine function is the square root of the raised cosine function) sry(f) is:
  • A is a constant
  • ⁇ is the roll-off factor
  • 2f 0 is the half-width of the frequency domain raised cosine function in the frequency domain.
  • 2f 0 is also defined as the half width of the frequency domain root raised cosine function.
  • Value bandwidth define 2f 0 (1+ ⁇ ) as the length of the root raised cosine function (that is, the length of the independent variable corresponding to the non-zero function value).
  • the values of the roll-off factor ⁇ of the root raised cosine function are [0.7, 0.8, 0.9, 1] respectively.
  • Figure 4 is a schematic diagram of the waveform of the root raised cosine function in this embodiment of the application. As shown in Figure 4, when When ⁇ takes a value of 0.7, the length of the root raised cosine function is 3.4f 0 ; when ⁇ takes a value of 0.8, the length of the root raised cosine function is 3.6f 0 ; when ⁇ takes a value of 0.9, the length of the root raised cosine function The length is 3.8f 0 ; when ⁇ is 1, the length of the root raised cosine function is 4f 0 .
  • the length of the root raised cosine function is also the length of the independent variable corresponding to the non-zero function value of the root raised cosine function.
  • the predefined frequency domain data sequence [Z(j)] is generated by the root raised cosine function, where the roll-off factor ⁇ of the root raised cosine function ranges from [0.7,1], and the half-value bandwidth is the same as the frequency domain data sequence [X (j)] Ratio of bandwidth occupied is P/2, and the value range of P is [0.9,1.1].
  • This application defines 2f 0 as the half-value broadband of the root raised cosine function in the frequency domain, and 2f 0 (1+ ⁇ ) is the length of the root raised cosine function in the frequency domain.
  • the predefined frequency domain data sequence [Z(j)] is generated by the root raised cosine function, where the roll-off factor ⁇ of the root raised cosine function ranges from [0.7,1], and the half-value bandwidth is the same as the frequency domain data sequence [X (j)]
  • the ratio of the bandwidth occupied is P/2, and the value range of P is [0.9,1.1].
  • This application defines 2f 0 as the half-value broadband of the root raised cosine function in the frequency domain, and 2f 0 (1+ ⁇ ) is the length of the root raised cosine function in the frequency domain.
  • the predefined frequency domain data sequence [Z(j)] is generated by the root raised cosine function, where the roll-off factor ⁇ of the root raised cosine function ranges from [0.7,1], and the half-value bandwidth is the same as the frequency domain data sequence [X (j)]
  • the ratio of the bandwidth occupied is P/2, and the value range of P is [0.9,1.1].
  • This application defines 2f 0 as the half-value broadband of the root raised cosine function in the frequency domain.
  • the predefined frequency domain data sequence [Z(j)] is generated by the root raised cosine function, where the roll-off factor ⁇ of the root raised cosine function ranges from [0.7,1], and the half-value bandwidth is the same as the frequency domain data sequence [X (j)]
  • the ratio of the bandwidth occupied is P/2, and the value range of P is [0.9,1.1].
  • This application defines 2f 0 as the half-value broadband of the root raised cosine function in the frequency domain.
  • Figure 5 is a schematic diagram of a data sequence in this embodiment.
  • the data sequence [b(m)] composed of 0 and 1 is modulated by the constellation point to form the data sequence [d(i)].
  • the data sequence [d(i)] modulated by the constellation point is preceded by 1 reference sequence data L 1.
  • the data sequence [d(i)] includes constellation point modulated data and L reference sequence data, forming one data block.
  • the length of the data block is the length of one Orthogonal Frequency-Division Multiplexing (OFDM) symbol, and the length of the data block is also the length of one Fast Fourier Transform (Fast Fourier Transform, FFT) window.
  • OFDM Orthogonal Frequency-Division Multiplexing
  • FFT Fast Fourier Transform
  • the constellation point modulation of the reference sequence [d(i)] is ⁇ /2-BPSK.
  • N 1
  • one piece of data is inserted between every two adjacent pieces of data in the reference sequence [d(i)].
  • the data is the sum of two adjacent data and multiplied by Then the time domain reference sequence [x(j)] is formed.
  • the time domain reference sequence [x(j)] is transformed into a frequency domain reference sequence [X(j)] through Fourier transform, and the frequency domain reference sequence [X(j)] is combined with the predefined frequency domain data sequence [Z(j) )]
  • the reference sequence [S(j)] is formed.
  • the predefined frequency domain data sequence [Z(j)] is generated by the root raised cosine function, where the roll-off factor ⁇ of the root raised cosine function ranges from [0.7,1], and the half-value bandwidth is the same as the frequency domain reference sequence [X (j)]
  • the ratio of the bandwidth occupied is P/2, and the value range of P is [0.9,1.1].
  • the data sequence [s(k)] is carried on physical time-frequency resources for transmission.
  • Figure 6 is a schematic diagram of another data sequence in this embodiment.
  • Figure 6 there is one reference sequence [d 0 (i)] and two data sequences [d 1 (i)], [d 2 (i)].
  • the first data sequence [d 1 (i)] also contains two reference sequence data L 1,1 , L 1,2 ; the second data sequence [d 2 (i) )]
  • L 2,1 , L 2,2 In addition to the constellation point modulation data, it also contains two reference sequence data L 2,1 , L 2,2 .
  • the first reference sequence data L 1,1 contained in the first data sequence [d 1 (i)] is the same as the reference sequence data corresponding to the L 0,1 position of the reference sequence [d 0 ( i )].
  • the second The first reference sequence data L 2,1 contained in the data sequence [d 2 (i)] is the same as the reference sequence data corresponding to the L 0,1 position of the reference sequence [d 0 (i)];
  • the first data sequence [ The second reference sequence data L 1,2 contained in d 1 (i)] is the same as the reference sequence data corresponding to the L 0,2 position of the reference sequence [d 0 (i)], and the second data sequence [d 2 (
  • the second reference sequence data L 2,2 included in i)] is the same as the reference sequence data corresponding to the L 0,2 position of the reference sequence [d 0 (i)].
  • a data sequence [S(j)] is formed.
  • the expression of data sequence [S(j)] is as follows:
  • [S(j)] [x(1) ⁇ z(1), x(2) ⁇ z(2),..., x(J) ⁇ z(J)], where “ ⁇ ” represents multiplication operation.
  • the data sequence [s(k)] is filtered and carried on physical time-frequency resources for transmission.
  • Figure 7 is a schematic structural diagram of a data processing network for data modulation in the data transmission method provided by the embodiment of the present application.
  • the data sequence [b(m)] composed of 0 and 1 is modulated by the constellation point to form the data sequence [d(i)].
  • [S(j)] [x(1) ⁇ z(1), x(2) ⁇ z(2),..., x(J) ⁇ z(J)], where “ ⁇ ” represents multiplication operation.
  • the frequency domain data sequence [Z(j)] is generated by the root raised cosine function.
  • the frequency domain data sequence [Z(j)] is obtained by discrete sampling of the root raised cosine function.
  • the sampling interval of discrete sampling is the same as the frequency domain interval of adjacent data in the frequency domain data sequence [X(j)], that is, the sampling interval of discrete sampling is the same as the subcarrier interval.
  • IFFT inverse Fourier transform
  • An embodiment of the present application also provides a data transmission device, including:
  • the memory is configured to store the program; the processor is configured to execute the program.
  • the program is executed, the first data sequence and the second data sequence are dot-multiplied to obtain a third data sequence, wherein the first data sequence and the second data sequence are dot-multiplied.
  • the second data sequence is a frequency domain data sequence; the third data sequence is subjected to reverse Fourier transformation to obtain the fourth data sequence; the fourth data sequence is carried and transmitted on physical time-frequency resources.
  • Figure 8 is a schematic structural diagram of a data transmission device provided by an embodiment of the present application.
  • the data transmission device includes a processor 81, a memory 82, a receiver 83 and a transmitter 84; the processor in the data transmission device
  • the number of 81 can be one or more.
  • one processor 81 is taken as an example; the processor 81, memory 82, receiver 83 and transmitter 84 in the data transmission device can be connected through a bus or other means, Figure 8 In the example, connection via bus is used.
  • the memory 82 can be used to store software programs, computer-executable programs and modules, such as program instructions/modules corresponding to the data transmission method in the embodiment of FIG. 1 of this application.
  • the processor 81 executes software programs, instructions and modules stored in the memory 82 to apply various functions of the data transmission device and data processing, that is, to implement the above-mentioned data transmission method.
  • the memory 82 may mainly include a stored program area and a stored data area, wherein the stored program area may store an operating system and at least one application program required for a function; the stored data area may store data created according to the use of a data transmission device, etc.
  • memory 82 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid-state storage device.
  • the receiver 83 is a combination of any one or more devices or modules with wireless signal receiving capabilities
  • the transmitter 84 is a combination of any one or more devices or modules with a wireless signal sending capability.
  • Embodiments of the present application also provide a storage medium containing computer-executable instructions.
  • the computer-executable instructions When executed by a computer processor, the computer-executable instructions are used to perform a data transmission method.
  • the method includes: converting the first data sequence and the second data After the sequence dot multiplication, the third data sequence is obtained, in which the first data sequence and the second data sequence are frequency domain data sequences; the third data sequence is subjected to reverse Fourier transformation to obtain the fourth data sequence; the fourth data sequence is The sequence bearer is transmitted on physical time-frequency resources.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Digital Transmission Methods That Use Modulated Carrier Waves (AREA)

Abstract

数据传输方法、设备及存储介质。数据传输方法包括：将第一数据序列和第二数据序列点乘后得到第三数据序列，其中，第一数据序列和第二数据序列为频域数据序列(S110)；对第三数据序列进行反向傅里叶变化，得到第四数据序列(S120)；将第四数据序列承载在物理时频资源上传输(S130)。

Description

数据传输方法、设备及存储介质 技术领域
本申请涉及无线通信领域，例如涉及数据传输方法、设备及存储介质。
背景技术
第五代移动通信(5th Generation，5G)技术中，可以分为高频和低频两种频段，其中高频频段为毫米波频段，低频频段与第四代移动通信(4th Generation，4G)技术所使用的频段重叠。其中，低频频段主要供海量机器类终端通信(Massive Machine Type Communication，mMTC)业务使用，高频频段主要供增强移动宽带(Enhanced Mobile Broadband，eMBB)、超可靠的低延迟通信(Ultra-Reliable Low-Latency Communications，URLLC)等业务使用。
高频频段的路径损耗和阴影衰弱较大，因此在小区边缘有些区域的信噪比会非常低。而且高频场景中，功率放大器(Power Amplifier，PA)的效率较低，为了提高信噪比(Signal to Interference plus Noise Ratio，SINR)，同时也要节省用户设备(User Equipment，UE)电池的功耗，就需要UE发射信号的峰值平均功率比(Peak Average Power Ratio，PAPR，峰均比)较低。
在mMTC场景中，有些UE希望大幅节省功耗，例如希望电池寿命达到十年以上，因此，为了提高该UE的PA效率，同样需要UE发射信号的PAPR较低。特别是当大量用户非正交接入时，SINR会很低，因此，就有需求使用一种低阶调制编码方案(Modulation and Coding Scheme，MCS)且低PAPR的信号调制方式。
在5G新空口(New Radio，NR)标准中，采用离散傅里叶变换扩展正交频分复用(Discrete Fourier transform-spread orthogonal frequency-division multiplexing，DFT-s-OFDM)调制方式的信号PAPR较低，但仍然难以满足超5G(Beyond 5G，B5G)或第六代移动通信(6th Generation，6G)技术更低PAPR需求的应用场景。
发明内容
本申请实施例提供数据传输方法、设备及存储介质。
第一方面，本申请实施例期望提供一种数据传输方法，包括：
将第一数据序列和第二数据序列点乘后得到第三数据序列，其中，第一数 据序列和第二数据序列为频域数据序列；对第三数据序列进行反向傅里叶变化，得到第四数据序列；将第四数据序列承载在物理时频资源上传输。
第二方面，本申请实施例提供一种数据传输设备，包括：
存储器，被配置为存储程序；处理器，被配置为执行程序，当程序被执行时，将第一数据序列和第二数据序列点乘后得到第三数据序列，其中，第一数据序列和第二数据序列为频域数据序列；对第三数据序列进行反向傅里叶变化，得到第四数据序列；将第四数据序列承载在物理时频资源上传输。
第三方面，本申请实施例提供一种存储介质，存储介质包括存储的程序，其中，程序运行时执行本申请实施例提供的数据传输方法。
应用本申请的实施例提供的数据传输方法、设备及存储介质，将两个频域数据序列点乘后生成的数据序列进行反向傅里叶变换后，将生成的新的序列在物理时频资源上传输，可以有效降低传输数据序列的PAPR。
附图说明
图1为本申请实施例提供的一种数据传输方法的流程图；
图2为相邻两个数据之间插入1个数据的示意图；
图3为相邻两个数据之间插入2个数据的示意图；
图4为本申请实施例中根升余弦函数的波形示意图；
图5为本实施例中一种数据序列示意图；
图6为本实施例中另一种数据序列示意图；
图7为本申请实施例提供的数据传输方法中进行数据调制的数据处理网络结构示意图；
图8为本申请实施例提供的一种数据传输设备的结构示意图。
具体实施方式
下面结合附图对本申请的实施例进行说明。
图1为本申请实施例提供的一种数据传输方法的流程图，如图1所示，本实施例提供的数据传输方法包括：
步骤S110，将第一数据序列和第二数据序列点乘后得到第三数据序列，其中，第一数据序列和第二数据序列为频域数据序列。
本实施例提供的数据传输方法应用于无线通信系统中的任一节点，特别的， 可以应用于无线通信系统中的UE。为了解决无线通信中的节点发射信号的PAPR仍然较高的问题，本申请实施例提出一种新的信号调制方式，采用该信号调制方式进行调制后再传输，能够实现更低的PAPR。
首先，本实施例中将第一数据序列和第二数据序列进行点乘后得到第三数据序列，第一数据序列为待传输的数据序列，第二数据序列为预设的数据序列。其中第一数据序列和第二数据序列均为频域数据序列。将第一数据序列和第二数据序列点乘，也可以称为对第一数据序列进行频域赋形操作，其中频域赋形函数为第二数据序列。点乘操作也可以称为滤波操作，其中滤波函数为第二数据序列。
在申请实施例中，将第一数据序列记为[X(j)]，将第二数据序列记为[Z(j)]，将第三数据序列记为[S(j)]。
例如，第一数据序列为[X(j)]＝[x(1)，x(2)，…，x(J)]，第二数据序列为[Z(j)]＝[z(1)，z(2)，…，z(J)]，第三数据序列[S(j)]＝[x(1)·z(1)，x(2)·z(2)，…，x(J)·z(J)]，其中，·表示乘运算。第一数据序列的长度和第二数据序列的长度可以相同也可以不同，也就是说第一数据序列[X(j)]和第二数据序列[Z(j)]的长度J可以相同也可以不同。
在一实施例中，第二数据序列可以由根升余弦函数生成。该根升余弦函数可以为频域压缩的根升余弦函数。该根升余弦函数的滚降因子的取值范围为[0.7，1]，该根升余弦函数的半值带宽与第一数据序列所占带宽的比值为P/2，P的取值范围为[0.9，1.1]。在一种实现方式中，根升余弦函数的半值带宽为第一数据序列所占带宽的一半，即P＝1，也就是说，压缩率为50％。在一实施例中，根升余弦函数的滚降因子为1。
在一实施例中，第二数据序列是对根升余弦函数进行离散采样生成的。
在一实施例中，根升余弦函数非零函数值所对应的自变量长度小于或等于第一数据序列所占带宽。
在一实施例中，根升余弦函数
其中y(f)为升余弦函数
其中，A为常数，α为滚降因子，2f0为根升余弦函数的半值带宽，2f0(1+α) 为非零函数值所对应的自变量长度。
在一实施例中，第一数据序列由第五数据序列通过傅里叶变换生成，其中，第五数据序列为时域数据序列。其中，第五数据序列可以由第六数据序列生成，第六数据序列由0和1组成的第七数据序列经过星座点调制后形成，第六数据序列的星座点调制为π/2-二进制相移键控(Binary Phase Shift Keying，BPSK)。在一种实现方式中，第六数据序列为参考序列，参考序列的星座点调制为π/2-BPSK。其中，第六数据序列除了包含星座点调制的数据之外，还包含L个参考序列数据，其中L≥0。在本申请实施例中，将第五数据序列记为[x(j)]，将第六数据序列记为[d(i)]，将第七数据序列记为[b(m)]。
第五数据序列是由第六数据序列生成的，可以在第六数据序列的每相邻两个数据之间插入N个新数据，新数据为相邻两个数据之和乘N为非负整数。N为0或者1。当N为0时，也就是直接将第六数据序列作为第五数据序列。当N为1时，就是在第六数据序列的每两个数据之间插入1个新的数据，且该新的数据为相邻两个数据之和乘或者可以在所述第六数据序列的每相邻两个数据之间插入N个新数据，新数据的模与相邻两个数据的模相同，插入新数据后相邻数据的相位差为其中N为非负整数。一个数据序列中各数据的模相同，插入后每相邻数据的相位差为N越大，相邻数据的相位差越小，时域数据的PAPR越低。
步骤S120，对第三数据序列进行反向傅里叶变化，得到第四数据序列。
在得到第三数据序列后，对第三数据序列进行反向傅里叶变换，生成第四数据序列。在生成第四数据序列时，可以直接对第三数据序列进行反向傅里叶变换，也就是不需要进行过采样处理。另外，当需要进行过采样处理时，可以先在第三数据序列中补零后，形成新的数据序列后，在对新的数据序列进行反向傅里叶变换后，生成第四数据序列。在本申请实施例中，将第四数据序列记为[s(k)]。
在不需要进行过采样处理时，第四数据序列例如为[s(k)]，其中，k＝1,2，…，K，此时J＝K。在需要进行过采样处理时，第四数据序列例如为[s(k)]，其中，k＝1,2，…，K，此时J＜K。
步骤S130，将第四数据序列承载在物理时频资源上传输。
在生成第四数据序列后，即可将第四数据序列承载在物理时频资源上进行传输，这样可以有效降低传输第四数据序列的PAPR。这是因为，频域数据点乘 等价于时域数据卷积，经过合理设计的频域数据序列的时域离散数据为一组设计好的权重系数序列，一组离散时域数据与设计好的一组离散数据卷积后，相邻数据之间的相关性会更好，因此可以有效降低传输数据序列的PAPR。当一组时域离散数据对应的频域数据序列由根升余弦函数生成时，其数据相关性会更优。
在将第四数据序列承载在物理时频资源上传输之前，还可以对第四数据序列进行滤波处理。
本实施例提供的数据传输方法，将两个频域数据序列点乘后生成的数据序列进行反向傅里叶变换后，将生成的新的序列在物理时频资源上传输，可以有效降低传输数据序列的PAPR。
在上述实施例中，当在第六数据序列中不插入数据，即N为0时，也就是将第六数据序列作为第五数据序列，那么第五数据序列为π/2-BPSK调制数据，π/2-BPSK调制数据的PAPR较低。当N＝1时，即第六数据序列中每两个相邻数据之间插入1个数据，插入数据后使相邻两个数据之间的相位差由π/2变为π/4，因此可以降低传输数据序列的PAPR，比π/2-BPSK星座点调制的PAPR还要低。
根升余弦函数的半值带宽为第一数据序列所占带宽的一半，根升余弦函数的滚降因子为1，优点在于没有占用额外的频域带宽，传输的数据序列具有低PAPR，且接收端的解调不受影响。这是因为根升余弦函数的滚降因子为1时，根升余弦函数的带宽与第一数据序列所占带宽相同，等价于频域压缩了50％，表现为频域压缩后的根升余弦函数的时域波形旁瓣的零点位置与辛格函数(Sinc函数)波形旁瓣零点位置不相同，但是时域数据是π/2-BPSK星座点调制数据或者由π/2-BPSK星座点调制数据然后插值生成，这样的相邻数据为不同方向轴上的数据，因此接收端的解调不受影响。通过这种合理的频域根升余弦函数参数设计，不但可以很好地降低时域信号的PAPR，还能使得时域数据的解调不受影响，并且不占用额外的频域带宽。
第六数据序列为参考序列，参考序列的星座点调制为π/2-BPSK，使得参考序列也有低PAPR，并且当N取值为1时，这个参考序列用来做信道估计，接收端性能更好。
在图1所示实施例的另一种实现方式中，第二数据序列还可以由升余弦函数生成。该升余弦函数可以为频域压缩的升余弦函数。该升余弦函数的滚降因子的取值范围为[0.7，1]，该升余弦函数的半值带宽与第一数据序列所占带宽的比值为P/2，P的取值范围为[0.9，1.1]。在一种实现方式中，升余弦函数的半值带宽为第一数据序列所占带宽的一半，即P＝1，也就是说，压缩率为50％。在一实施例中，升余弦函数的滚降因子为1。在一实施例中，第二数据序列是对升 余弦函数进行离散采样生成的。在一实施例中，升余弦函数非零函数值所对应的自变量长度小于或等于第一数据序列所占带宽。
所述升余弦函数y(f)为
其中，A为常数，α为滚降因子，2f0为升余弦函数的半值带宽，2f0(1+α)为非零函数值所对应的自变量长度。
下面以几个具体实施例对本申请提供的数据传输方法进行说明。
实施例一
频域数据序列[X(j)]＝[x(1)，x(2)，…，x(J)]，预定义的频域数据序列[Z(j)]＝[z(1)，z(2)，…，z(J)]。频域数据序列[X(j)]与预定义的频域数据序列[Z(j)]点乘后，形成数据序列[S(j)]。数据序列[S(j)]的表达式如下：
[S(j)]＝[x(1)·z(1)，x(2)·z(2)，…，x(J)·z(J)]，其中“·”表示乘运算。
如果不需要进行过采样，则直接将数据序列[S(j)]进行反向傅里叶变换后，形成数据序列[s(k)]，其中k＝1,2，…，K，这时，J＝K。
如果需要进行过采样，则在数据序列[S(j)]中补零，形成数据序列[S(k)]，然后将数据序列[S(k)]进行反向傅里叶变换后，形成数据序列[s(k)]，其中k＝1,2，…，K，这时，J＜K。
数据序列[s(k)]承载在物理时频资源上进行传输。
实施例二
频域数据序列[X(j)]，预定义的频域数据序列[Z(j)]，频域数据序列[X(j)]与预定义的频域数据序列[Z(j)]点乘后，形成数据序列[S(j)]。
频域数据序列[X(j)]由时域数据序列[x(j)]通过傅里叶变换形成。时域数据序列[x(j)]由数据序列[d(i)]生成，数据序列[d(i)]的星座点调制为π/2-BPSK。数据序列[d(i)]直接为数据序列[X(j)]。
本实施例中，数据序列[d(i)＝[d(0),d(1),d(2),d(3),d(4)＝[1,1j,-1,-j,1],i＝0,1,2,3,4]，数据序列[d(i)]直 接为数据序列[x(j)]，序列[x(j)＝[x(0),x(1),x(2),x(3),x(4)]＝[d(0),d(1),d(2),d(3),d(4)]＝[1,1j,-1,-j,1],j＝0,1,2,3,4]。
实施例三
频域数据序列[X(j)]，预定义的频域数据序列[Z(j)]，频域数据序列[X(j)]与预定义的频域数据序列[Z(j)]点乘后，形成数据序列[S(j)]。
频域数据序列[X(j)]由时域数据序列[x(j)]通过傅里叶变换形成。时域数据序列[x(j)]由数据序列[d(i)]生成，数据序列[d(i)]的星座点调制为π/2-BPSK。数据序列[d(i)]中每相邻2个数据之间插入一个数据，插入的数据为相邻2个数据之和并乘以形成时域数据序列[x(j)]。
本实施例中，数据序列[d(i)＝[d(0),d(1),d(2),d(3),d(4)＝[1,1j,-1,-j,1],i＝0,1,2,3,4]，时域数据序列
实施例四
频域数据序列[X(j)]，预定义的频域数据序列[Z(j)]，频域数据序列[X(j)]与预定义的频域数据序列[Z(j)]点乘后，形成数据序列[S(j)]。
频域数据序列[X(j)]由时域数据序列[x(j)]通过傅里叶变换形成。时域数据序列[x(j)]由数据序列[d(i)]生成。方法为：数据序列[d(i)]中每相邻2个数据之间插入N个数据，插入的数据为相邻2个数据之和并乘以然后形成时域数据序列[x(j)]，其中，N＝0或1。数据序列[d(i)]的星座点调制为π/2-BPSK。
本实施例中，数据序列[d(i)＝[d(0),d(1),d(2),d(3),d(4)＝[1,1j,-1,-j,1],i＝0,1,2,3,4]，数据序列[d(i)]中每相邻2个数据之间插入N个数据，N取值为0，即数据序列[d(i)]中每相邻2个数据之间不插入数据。数据序列[d(i)]直接为数据序列[x(j)]，序列 [x(j)＝[x(0),x(1),x(2),x(3),x(4)]＝[d(0),d(1),d(2),d(3),d(4)]＝[1,1j,-1,-j,1],j＝0,1,2,3,4]。
。
实施例五
频域数据序列[X(j)]，预定义的频域数据序列[Z(j)]，频域数据序列[X(j)]与预定义的频域数据序列[Z(j)]点乘后，形成数据序列[S(j)]。
频域数据序列[X(j)]由时域数据序列[x(j)]通过傅里叶变换形成。时域数据序列[x(j)]由数据序列[d(i)]生成。方法为：数据序列]d(i)]中每相邻2个数据之间插入N个数据，插入的数据为相邻2个数据之和并乘以然后形成时域数据序列[x(j)]，其中，N＝0或1。数据序列[d(i)]的星座点调制为π/2-BPSK。
本实施例中，数据序列[d(i)＝[d(0),d(1),d(2),d(3),d(4)＝[1,1j,-1,-j,1],i＝0,1,2,3,4]，数据序列[d(i)]中每相邻2个数据之间插入N个数据，N取值为1，即数据序列[d(i)]中每相邻2个数据之间插入1个数据，数据为相邻2个数据之和并乘以然后形成时域数据序列[x(j)]。时域数据序列
其中，数据序列d(0)为时域数据序列x(0)，即x(0)＝d(0)＝1；数据序列d(0)与数据序列d(1)之间插入1个数据为时域数据序列x(1)，时域数据序列x(1)为数据序列d(0)与数据序列d(1)之和并乘以即数据序列d(1)为时域数据序列x(2)，即x(2)＝d(1)＝1j；数据序列d(1)与数据序列d(2)之间插入1个数据为时域数据序列x(3)，时域数据序列x(3)为数据序列d(1)与数据序列d(2)之和并乘以即数据序列d(2)为时域数据序列x(4)，即x(4)＝d(2)＝-1；数据序列d(2)与数据序列d(3)之间插入1个数据为时域数据序列x(5)，时域数据序列x(5)为数据序列d(2)与数据序列d(3)之 和并乘以即数据序列d(3)为时域数据序列x(6)，即x(6)＝d(3)＝-j；数据序列d(3)与数据序列d(4)之间插入1个数据为时域数据序列x(7)，时域数据序列x(7)为数据序列d(3)与数据序列d(4)之和并乘以即数据序列d(4)为时域数据序列x(8)，即x(8)＝d(4)＝1。
实施例六
频域数据序列[X(j)]，预定义的频域数据序列[Z(j)]，频域数据序列[X(j)]与预定义的频域数据序列[Z(j)]点乘后，形成数据序列[S(j)]。
频域数据序列[X(j)]由时域数据序列[x(j)]通过傅里叶变换形成。时域数据序列[x(j)]由数据序列[d(i)]生成。方法为：数据序列[d(i)]中每相邻2个数据之间插入N个数据，插入的N个数据的模与相邻2个数据的模相同，插入后每相邻两个数据之间的相位差为其中N为非负整数。数据序列[d(i)]的星座点调制为π/2-BPSK。
本实施例中，数据序列[d(i)＝[d(0),d(1),d(2),d(3),d(4)＝[1,1j,-1,-j,1],i＝0,1,2,3,4]，数据序列[d(i)]中每相邻2个数据之间插入N个数据形成数据序列[x(j)]，插入的N个数据的模与相邻2个数据的模相同，插入后每相邻两个数据之间的相位差为其中N为非负整数。
所述N取值为0时，即所述数据序列[d(i)]中每相邻2个数据之间不插入数据。所述数据序列[d(i)]的星座点调制为π/2-BPSK，所述数据序列[d(i)]直接为数据序列[x(j)]，则所述数据序列[x(j)]为π/2-BPSK星座点调制序列。所述数据序列[x(j)]的模值相同，相邻数据的相位差为
所述N取值为1时，即数据序列[d(i)]中每相邻2个数据之间插入1个数据形成时域数据序列[x(j)]。所述时域数据序列[x(j)＝[x(0),x(1),x(2),x(3),x(4),x(5),x(6),x(7),x(8)]如图2所示，图2为相邻两个数据之间插入1个数据的示意图，图2中横坐标为数据的实部，纵坐标为数据的虚部。所述数据序列d(0)为所述时域数据序列x(0)，所述数据序列d(0)与所 述数据序列d(1)之间插入1个数据为所述时域数据序列x(1)，所述数据序列d(1)为所述时域数据序列x(2)，所述数据序列d(1)与所述数据序列d(2)之间插入1个数据为所述时域数据序列x(3)，所述数据序列d(2)为所述时域数据序列x(4)，所述数据序列d(2)与所述数据序列d(3)之间插入1个数据为所述时域数据序列x(5)，所述数据序列d(3)为所述时域数据序列x(6)，所述数据序列d(3)与所述数据序列d(4)之间插入1个数据为所述时域数据序列x(7)，所述数据序列d(4)为所述时域数据序列x(8)。所述数据序列[x(j)]的模值分别为：[1,1,1,1,1,1,1,1,1]，所述插入的数据[x(1),x(3),x(5),x(7)]的模值与相邻2个数据[x(0)x(2),x(2)x(4),x(4)x(6),x(6)x(8)]的模值相同；所述[x(x0)x,(x 1)x,x(的相位分别为：所述插入的数据[x(1),x(3),x(5),x(7)]的相位值与相邻2个数据[x(0)x(2),x(2)x(4),x(4)x(6),x(6)x(8)]的相位差为
所述N取值为2时，即数据序列[d(i)]中每相邻2个数据之间插入2个数据形成时域数据序列[x(j)]。所述时域数据序列[x(j)＝[x(0),x(1),x(2),x(3),x(4),x(5),x(6),x(7),x(8),x(9),x(10),x(11),x(12)]如图3所示，图3为相邻两个数据之间插入2个数据的示意图，图3中横坐标为数据的实部，纵坐标为数据的虚部。所述数据序列d(0)为所述时域数据序列x(0)，所述数据序列d(0)与所述数据序列d(1)之间插入2个数据为所述时域数据序列x(1)，x(2)，所述数据序列d(1)为所述时域数据序列x(3)，所述数据序列d(1)与所述数据序列d(2)之间插入2个数据为所述时域数据序列x(4)，x(5)，所述数据序列d(2)为所述时域数据序列x(6)，所述数据序列d(2)与所述数据序列d(3)之间插入2个数据为所述时域数据序列x(7)，x(8)，所述数据序列d(3)为所述时域数据序列x(9)，所述数据序列d(3)与所述数据序列d(4)之间插入2个数据为所述时域数据序列x(10)，x(11)，所述数据序列d(4)为所述时域数据序列x(12)。所述数据序列[x(j)]的模值分别为：[1,1,1,1,1,1,1,1,1,1,1,1,1]，所述插入的数据[x(1),x(2),x(4),x(5),x(7),x(8),x(10),x(11)]的模值与相邻2个数据[x(0)x(2),x(1)x(3),x(3)x(5),x(4)x(6),x(6)x(8),x(7)x(9),x(9)x(11),x(10)x(12)]的模值相同；所述[x(0),x(1),x(2),x(3),x(4),x(5),x(6),x(7),x(8),x(9),x(10),x(11),x(12)]的相位分别为：所述插入的数据[x(1),x(2),x(4),x(5),x(7),x(8),x(10),x(11)]的相位值与相邻2个数据[x(0)x(2),x(1)x(3),x(3)x(5),x(4)x(6),x(6)x(8),x(7)x(9),x(9)x(11),x(10)x(12)]的相位差为
本实施例的优点在于，一个数据序列中各数据的模相同，插入后每相邻数据的相位差为N越大，相邻数据的相位差越小，时域数据的PAPR越低。
实施例七
频域数据序列[X(j)]，预定义的频域数据序列[Z(j)]，频域数据序列[X(j)]与预定义的频域数据序列[Z(j)]点乘后，形成数据序列[S(j)]。
预定义的频域数据序列[Z(j)]由根升余弦函数生成，例如，对根升余弦函数进行离散采样获得频域数据序列[Z(j)]，离散采样的采样间隔与频域数据序列[X(j)]的相邻数据频域间隔相同，即离散采样的采样间隔与子载波间隔相同。
设频域上的升余弦函数y(f)表达式如下：
则：频域根升余弦函数(根升余弦函数即为升余弦函数的平方根)sry(f)为：
其中，A为常数，α为滚降因子，2f0为频域升余弦函数在频域上的半值宽度，在本申请实施例中，也将2f0定义为频域根升余弦函数的半值带宽，将2f0(1+α)定义为根升余弦函数的长度(即非零函数值所对应的自变量长度)。
本实施例中，根升余弦函数的滚降因子α取值分别为[0.7,0.8,0.9,1]，图4为本申请实施例中根升余弦函数的波形示意图，如图4所示，当α取值为0.7时，根升余弦函数的长度为3.4f0；当α取值为0.8时，根升余弦函数的长度为3.6f0；当α取值为0.9时，根升余弦函数的长度为3.8f0；当α取值为1时，根升余弦函数的长度为4f0。根升余弦函数的长度也是根升余弦函数非零函数值所对应的自变量长度。
实施例八
频域数据序列[X(j)]，预定义的频域数据序列[Z(j)]，频域数据序列[X(j)]与预定义的频域数据序列[Z(j)]点乘后，形成数据序列[S(j)]。
预定义的频域数据序列[Z(j)]由根升余弦函数生成，其中根升余弦函数的滚降因子α取值范围为[0.7,1]，半值带宽与频域数据序列[X(j)]所占带宽的比值 为P/2，P的取值范围为[0.9,1.1]。
本申请将2f0定义为频域根升余弦函数的半值宽带，2f0(1+α)为频域根升余弦函数的长度。本实施例中，根升余弦函数滚降因子α取值为1，即频域根升余弦函数的长度为2f0(1+α)＝4f0。频域数据序列[X(j)]所占带宽也为4f0，即根升余弦函数的半值带宽2f0为频域数据序列[X(j)]所占带宽4f0的一半，P＝1；频域根升余弦函数的长度与频域数据序列[X(j)]所占带宽相等。
实施例九
频域数据序列[X(j)]，预定义的频域数据序列[Z(j)]，频域数据序列[X(j)]与预定义的频域数据序列[Z(j)]点乘后，形成数据序列[S(j)]。
预定义的频域数据序列[Z(j)]由根升余弦函数生成，其中根升余弦函数的滚降因子α取值范围为[0.7,1]，半值带宽与频域数据序列[X(j)]所占带宽的比值为P/2，P的取值范围为[0.9,1.1]。
本申请将2f0定义为频域根升余弦函数的半值宽带，2f0(1+α)为频域根升余弦函数的长度。本实施例中，根升余弦函数滚降因子a取值为0.7，即频域根升余弦函数的长度为2f0(1+α)＝3.4f0。频域数据序列[X(j)]所占带宽为4f0，即根升余弦函数的半值带宽2f0为频域数据序列[X(j)]所占带宽4f0的一半，P＝1；频域根升余弦函数的长度小于频域数据序列[X(j)]所占带宽。
实施例十
频域数据序列[X(j)]，预定义的频域数据序列[Z(j)]，频域数据序列[X(j)]与预定义的频域数据序列[Z(j)]点乘后，形成数据序列[S(j)]。
预定义的频域数据序列[Z(j)]由根升余弦函数生成，其中根升余弦函数的滚降因子α取值范围为[0.7,1]，半值带宽与频域数据序列[X(j)]所占带宽的比值为P/2，P的取值范围为[0.9,1.1]。
本申请将2f0定义为频域根升余弦函数的半值宽带。本实施例中，频域数据序列[X(j)]所占带宽为即根升余弦函数的半值带宽2f0为频域数据序列[X(j)]所占带宽4f0的P＝0.9。
实施例十一
频域数据序列[X(j)]，预定义的频域数据序列[Z(j)]，频域数据序列[X(j)]与预定义的频域数据序列[Z(j)]点乘后，形成数据序列[S(j)]。
预定义的频域数据序列[Z(j)]由根升余弦函数生成，其中根升余弦函数的滚降因子α取值范围为[0.7,1]，半值带宽与频域数据序列[X(j)]所占带宽的比值为P/2，P的取值范围为[0.9,1.1]。
本申请将2f0定义为频域根升余弦函数的半值宽带。本实施例中，频域数据序列[X(j)]所占带宽为即根升余弦函数的半值带宽2f0为频域数据序列[X(j)]所占带宽4f0的P＝1.1。
实施例十二
图5为本实施例中一种数据序列示意图，图5为数据序列[d(i)]除了包含星座点调制的数据之外，还包含有L个参考序列数据的一个例子，其中L>＝0。
图5中，由0和1组成的数据序列[b(m)]经过星座点调制后形成数据序列[d(i)]，星座点调制为π/2-BPSK；数据序列[d(i)]除了包含星座点调制的数据之外，还包含有L个参考序列数据，本实施例中L＝2，经过星座点调制后的数据序列[d(i)]前面有1个参考序列数据L1，经过星座点调制后的数据序列[d(i)]后面有1个参考序列数据L2。数据序列[d(i)]包含星座点调制的数据与L个参考序列数据，形成1个数据块。该数据块长度为1个正交频分复用(Orthogonal Frequency-Division Multiplexing，OFDM)符号的长度，该数据块长度也为1个快速傅里叶变换(Fast Fourier Transform，FFT)窗口的长度。
实施例十三
本实施例中，数据序列[d(i)]为参考序列，参考序列[d(i)]中每相邻2个数据之间插入N个数据，数据为相邻2个数据之和并乘以然后形成时域参考序列[x(j)]，其中，N＝0或1。参考序列[d(i)]的星座点调制为π/2-BPSK。
当N取值为0时，参考序列[d(i)]中每相邻2个数据之间不插入数据。参考序列[d(i)]直接为时域参考序列[x(j)]。
当N取值为1时，参考序列[d(i)]中每相邻2个数据之间插入1个数据， 数据为相邻2个数据之和并乘以然后形成时域参考序列[x(j)]。
然后时域参考序列[x(j)]通过傅里叶变换形成频域参考序列[X(j)]，频域参考序列[X(j)]与预定义的频域数据序列[Z(j)]点乘后，形成参考序列[S(j)]。其中，j＝1,2，…，J，k＝1,2，…，K，J和K都为正整数，J≤K
预定义的频域数据序列[Z(j)]由根升余弦函数生成，其中根升余弦函数的滚降因子α取值范围为[0.7,1]，半值带宽与频域参考序列[X(j)]所占带宽的比值为P/2，P的取值范围为[0.9,1.1]。
当J＝K时，则直接将参考序列[S(j)]进行反向傅里叶变换后，形成参考序列[s(k)]。
当J＜K时，则在参考序列[S(j)]中补零，形成数据序列[S(k)]，然后将数据序列[S(k)]进行反向傅里叶变换后，形成数据序列[s(k)]。
数据序列[s(k)]承载在物理时频资源上进行传输。
实施例十四
图6为本实施例中另一种数据序列示意图，图6中有1个参考序列[d0(i)]和2个数据序列[d1(i)]，[d2(i)]。
数据序列[d1(i)]，[d2(i)]除了包含星座点调制的数据之外，还包含有L个参考序列数据，本实施例中L＝2。第1个数据序列[d1(i)]除了包含星座点调制的数据之外，还包含有2个参考序列数据L1,1，L1,2；第2个数据序列[d2(i)]除了包含星座点调制的数据之外，还包含有2个参考序列数据L2,1，L2,2。
第1个数据序列[d1(i)]包含的第1个参考序列数据L1,1与参考序列[d0(i)]的L0,1位置对应的参考序列数据相同，第2个数据序列[d2(i)]包含的第1个参考序列数据L2,1与参考序列[d0(i)]的L0,1位置对应的参考序列数据相同；第1个数据序列[d1(i)]包含的第2个参考序列数据L1,2与参考序列[d0(i)]的L0,2位置对应的参考序列数据相同，第2个数据序列[d2(i)]包含的第2个参考序列数据L2,2与参考序列[d0(i)]的L0,2位置对应的参考序列数据相同。
实施例十五
频域数据序列[X(j)]＝[x(1)，x(2)，…，x(J)]，预定义的频域数据序列 [Z(j)]＝[z(1)，z(2)，…，z(J)]。频域数据序列[X(j)]与预定义的频域数据序列[Z(j)]点乘后，形成数据序列[S(j)]。数据序列[S(j)]的表达式如下：
[S(j)]＝[x(1)·z(1)，x(2)·z(2)，…，x(J)·z(J)]，其中“·”表示乘运算。
如果不需要进行过采样，则直接将数据序列[S(j)]进行反向傅里叶变换后，形成数据序列[s(k)]，其中k＝1,2，…，K，这时，J＝K。
如果需要进行过采样，则在数据序列[S(j)]中补零，形成数据序列[S(k)]，然后将数据序列[S(k)]进行反向傅里叶变换后，形成数据序列[s(k)]，其中k＝1,2，…，K，这时，J＜K。
数据序列[s(k)]进行滤波操作后承载在物理时频资源上进行传输。
实施例十六
图7为本申请实施例提供的数据传输方法中进行数据调制的数据处理网络结构示意图。如图7所示，由0和1组成的数据序列[b(m)]经过星座点调制后形成数据序列[d(i)]，星座点调制为π/2-BPSK；然后数据序列[d(i)]中每相邻2个数据之间插入N个数据(N＝0，或者1)，数据为相邻2个数据之和并乘以然后形成时域数据序列[x(j)]，其中j＝1,2,...,J。
当N取值为0时，即数据序列[d(i)]中每相邻2个数据之间不插入数据，数据序列[d(i)]直接为时域数据序列[x(j)]，数据序列[d(i)]为π/2-BPSK，即时域数据序列[x(j)]也为π/2-BPSK；当N取值为1时，即数据序列[d(i)]中每相邻2个数据之间插入1个数据，数据为相邻2个数据之和并乘以然后形成时域数据序列[x(j)]；然后时域数据序列[x(j)]经过傅里叶变换(FFT)后，形成频域数据序列[X(j)]；然后频域数据序列[X(j)]经过根升余弦函数的频域赋形或滤波，即频域数据序列[X(j)]与预定义的频域数据序列[Z(j)]点乘，生成频域数据序列[S(j)]；数据序列[S(j)]的表达式如下：
[S(j)]＝[x(1)·z(1)，x(2)·z(2)，…，x(J)·z(J)]，其中“·”表示乘运算。
频域数据序列[Z(j)]由根升余弦函数生成，例如，对根升余弦函数进行离散采样获得频域数据序列[Z(j)]。离散采样的采样间隔与频域数据序列[X(j)]的相邻数据频域间隔相同，即离散采样的采样间隔与子载波间隔相同。
如果不需要进行过采样，则直接将数据序列[S(j)]进行反向傅里叶变换(IFFT)后，形成数据序列[s(k)]，其中k＝1,2，…，K，这时，J＝K。
如果需要进行过采样，则在数据序列[S(j)]中补零，形成数据序列[S(k)]，然后将数据序列[S(k)]进行IFFT后，形成数据序列[s(k)]，其中k＝1,2，…，K，这时，J＜K。
然后数据序列[s(k)]承载在物理时频资源上进行传输。
本申请实施例还提供一种数据传输设备，包括：
存储器，被配置为存储程序；处理器，被配置为执行程序，当程序被执行时，将第一数据序列和第二数据序列点乘后得到第三数据序列，其中，第一数据序列和第二数据序列为频域数据序列；对第三数据序列进行反向傅里叶变化，得到第四数据序列；将第四数据序列承载在物理时频资源上传输。
图8为本申请实施例提供的一种数据传输设备的结构示意图，如图8所示，该数据传输设备包括处理器81、存储器82、接收器83和发送器84；数据传输设备中处理器81的数量可以是一个或多个，图8中以一个处理器81为例；数据传输设备中的处理器81、存储器82、接收器83和发送器84可以通过总线或其他方式连接，图8中以通过总线连接为例。
存储器82作为一种计算机可读存储介质，可用于存储软件程序、计算机可执行程序以及模块，如本申请图1实施例中的数据传输方法对应的程序指令/模块。处理器81通过运行存储在存储器82中的软件程序、指令以及模块，从而应用数据传输设备的各种功能以及数据处理，即实现上述的数据传输方法。
存储器82可主要包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需的应用程序；存储数据区可存储根据数据传输设备的使用所创建的数据等。此外，存储器82可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件、或其他非易失性固态存储器件。
接收器83为任一种或多种具有无线信号接收能力的器件或模块的组合，发送器84为任一种或多种具有无线信号发送能力的器件或模块的组合。
本申请实施例还提供一种包含计算机可执行指令的存储介质，计算机可执行指令在由计算机处理器执行时用于执行一种数据传输方法，该方法包括：将第一数据序列和第二数据序列点乘后得到第三数据序列，其中，第一数据序列和第二数据序列为频域数据序列；对第三数据序列进行反向傅里叶变化，得到第四数据序列；将第四数据序列承载在物理时频资源上传输。

Claims (28)

  1. 一种数据传输方法，包括：
    将第一数据序列和第二数据序列点乘后得到第三数据序列，其中，所述第一数据序列和所述第二数据序列为频域数据序列；
    对所述第三数据序列进行反向傅里叶变化，得到第四数据序列；
    将所述第四数据序列承载在物理时频资源上传输。
  2. 根据权利要求1所述的方法，其中，所述第二数据序列由根升余弦函数生成。
  3. 根据权利要求2所述的方法，其中，所述根升余弦函数为频域压缩的根升余弦函数。
  4. 根据权利要求2所述的方法，其中，所述根升余弦函数的滚降因子的取值范围为[0.7，1]，所述根升余弦函数的半值带宽与所述第一数据序列所占带宽的比值为P/2，P的取值范围为[0.9，1.1]。
  5. 根据权利要求4所述的方法，其中，P为1。
  6. 根据权利要求4所述的方法，其中，所述根升余弦函数的滚降因子为1。
  7. 根据权利要求2所述的方法，其中，所述第二数据序列是对所述根升余弦函数进行离散采样生成的。
  8. 根据权利要求2所述的方法，其中，所述根升余弦函数非零函数值所对应的自变量长度小于或等于所述第一数据序列所占带宽。
  9. 根据权利要求2所述的方法，其中，所述根升余弦函数其中，y(f)为升余弦函数
    其中，A为常数，α为滚降因子，2f0为根升余弦函数的半值带宽，2f0(1+α)为非零函数值所对应的自变量长度。
  10. 根据权利要求1所述的方法，其中，所述第二数据序列由升余弦函数生成。
  11. 根据权利要求10所述的方法，其中，所述升余弦函数为频域压缩的升余弦函数。
  12. 根据权利要求10所述的方法，其中，所述升余弦函数的滚降因子的取 值范围为[0.7，1]，所述升余弦函数的半值带宽与所述第一数据序列所占带宽的比值为P/2，P的取值范围为[0.9，1.1]。
  13. 根据权利要求12所述的方法，其中，P为1。
  14. 根据权利要求12所述的方法，其中，所述升余弦函数的滚降因子为1。
  15. 根据权利要求10所述的方法，其中，所述第二数据序列是对所述升余弦函数进行离散采样生成的。
  16. 根据权利要求10所述的方法，其中，所述升余弦函数非零函数值所对应的自变量长度小于或等于所述第一数据序列所占带宽。
  17. 根据权利要求10所述的方法，其中，所述升余弦函数y(f)为
    其中，A为常数，α为滚降因子，2f0为升余弦函数的半值带宽，2f0(1+α)为非零函数值所对应的自变量长度。
  18. 根据权利要求1～17任一项所述的方法，其中，所述第一数据序列由第五数据序列通过傅里叶变换生成，其中，所述第五数据序列为时域数据序列。
  19. 根据权利要求18所述的方法，其中，所述第五数据序列由第六数据序列生成，所述第六数据序列由0和1组成的第七数据序列经过星座点调制后形成，所述第六数据序列的星座点调制为π/2-二进制相移键控BPSK。
  20. 根据权利要求19所述的方法，其中，所述第六数据序列为参考序列，所述参考序列的星座点调制为π/2-BPSK。
  21. 根据权利要求19或20所述的方法，其中，所述第六数据序列除了包含星座点调制的数据之外，还包含L个参考序列数据，其中，L≥0。
  22. 根据权利要求19或20所述的方法，其中，所述第五数据序列由第六数据序列生成，包括：
    在所述第六数据序列的每相邻两个数据之间插入N个新数据，所述新数据为所述相邻两个数据之和乘N为非负整数。
  23. 根据权利要求22所述的方法，其中，N为0或1。
  24. 根据权利要求19或20所述的方法，其中，所述第五数据序列由第六数据序列生成，包括：
    在所述第六数据序列的每相邻两个数据之间插入N个新数据，所述新数据的模与所述相邻两个数据的模相同，插入所述新数据后相邻数据的相位差为其中，N为非负整数。
  25. 根据权利要求1～17任一项所述的方法，其中，所述第一数据序列的长度和所述第二数据序列的长度相同。
  26. 根据权利要求1～17任一项所述的方法，在所述将所述第四数据序列承载在物理时频资源上传输之前，还包括：
    对所述第四数据序列进行滤波。
  27. 一种数据传输设备，包括：
    存储器，被配置为存储程序；
    处理器，被配置为执行程序，当所述程序被执行时，将第一数据序列和第二数据序列点乘后得到第三数据序列，其中，所述第一数据序列和所述第二数据序列为频域数据序列；对所述第三数据序列进行反向傅里叶变化，得到第四数据序列；将所述第四数据序列承载在物理时频资源上传输。
  28. 一种非易失存储介质，所述存储介质包括存储的程序，其中，所述程序运行时执行权利要求1至26中任一项所述的数据传输方法。
PCT/CN2023/099777 2022-09-05 2023-06-13 数据传输方法、设备及存储介质 WO2024051242A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202211080863.5A CN117692291A (zh) 2022-09-05 2022-09-05 数据传输方法、设备及存储介质
CN202211080863.5 2022-09-05

Publications (1)

Publication Number Publication Date
WO2024051242A1 true WO2024051242A1 (zh) 2024-03-14

Family

ID=90128847

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/099777 WO2024051242A1 (zh) 2022-09-05 2023-06-13 数据传输方法、设备及存储介质

Country Status (2)

Country Link
CN (1) CN117692291A (zh)
WO (1) WO2024051242A1 (zh)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110191077A (zh) * 2019-06-04 2019-08-30 广东电网有限责任公司 一种降低papr的方法、装置、设备及存储介质
CN111901279A (zh) * 2020-07-07 2020-11-06 中兴通讯股份有限公司 数据传输方法、装置、设备和存储介质
US20220038319A1 (en) * 2018-10-28 2022-02-03 Indian Institute Of Technology Hyderabad Method and system for generating a transmit waveform for reference sequences
CN114070698A (zh) * 2020-08-10 2022-02-18 华为技术有限公司 数据发送、接收方法及装置
CN114616805A (zh) * 2019-09-05 2022-06-10 中兴通讯股份有限公司 低峰值平均功率比(papr)的调制方案
CN114747258A (zh) * 2019-12-13 2022-07-12 中兴通讯股份有限公司 低峰值平均功率比的频域调制方案

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20220038319A1 (en) * 2018-10-28 2022-02-03 Indian Institute Of Technology Hyderabad Method and system for generating a transmit waveform for reference sequences
CN110191077A (zh) * 2019-06-04 2019-08-30 广东电网有限责任公司 一种降低papr的方法、装置、设备及存储介质
CN114616805A (zh) * 2019-09-05 2022-06-10 中兴通讯股份有限公司 低峰值平均功率比(papr)的调制方案
CN114747258A (zh) * 2019-12-13 2022-07-12 中兴通讯股份有限公司 低峰值平均功率比的频域调制方案
CN111901279A (zh) * 2020-07-07 2020-11-06 中兴通讯股份有限公司 数据传输方法、装置、设备和存储介质
CN114070698A (zh) * 2020-08-10 2022-02-18 华为技术有限公司 数据发送、接收方法及装置

Also Published As

Publication number Publication date
CN117692291A (zh) 2024-03-12

Similar Documents

Publication Publication Date Title
US10103921B2 (en) Method and apparatus for transmitting a signal
US10454746B2 (en) System and method for orthogonal frequency division multiplexing-offset quadrature amplitude modulation
US7948868B2 (en) Method and arrangement relating to the insertion of pilot tones in the frequency domain in SC-FDMA
CN101218769B (zh) 用于减小功率峰均比的方法
JP2014526201A (ja) フィルタバンク・マルチキャリア・システムにおいてｐａｐｒを低減させるための方法および装置
CN103227768B (zh) 一种新的ici自消除方法在ofdm调制中的应用
US20210051050A1 (en) Method and system for multi-carrier time division multiplexing modulation/demodulation
KR101022753B1 (ko) Ｏｆｄｍ 시스템 및 이를 위한 데이터 전송 방법
CN111901279A (zh) 数据传输方法、装置、设备和存储介质
CN111901277A (zh) 一种数据调制方法、装置、设备及存储介质
CN105553909B (zh) 一种迭代限幅滤波降低ofdm信号峰均比的方法
US8406320B2 (en) Digital clipping method for a transmitter of an orthogonal frequency division multiple access system
EP3962009B1 (en) Symbol processing method and device
EP3480985B1 (en) Method and apparatus for signal transmission
Sudha et al. Low-complexity modified SLM method for PAPR reduction in OFDM systems
WO2024051242A1 (zh) 数据传输方法、设备及存储介质
CN109617851B (zh) 一种基于dft平滑滤波的信道估计方法及装置
Daoud Multiband orthogonal wavelet division multiplexing: Complexity and power peaks enhancement
Soma et al. PAPR reduction based on subcarriers in FBMC based system
WO2024113975A1 (zh) 数据调制方法、装置、介质及存储介质
Hasan et al. Performance Evaluation of OFDM vs FBMC in Impulsive Noise Channel
Ali et al. Design and Implementation of Adaptive Universal Filtered Multi Carrier for 5G and Beyond
Tabassum et al. Peak to average power ratio reduction in NC–OFDM systems
US20230308334A1 (en) Signal transmission method and apparatus
Prakash et al. MULTICARRIER WAVEFORMS FOR ADVANCED WIRELESS COMMUNICATION

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23861945

Country of ref document: EP

Kind code of ref document: A1