Time-domain modulation scheme for low peak-to-average power ratio

By inserting zero elements in high-frequency wireless communication and performing convolutional modulation, combining multipath delay operation and π/2-BPSK modulation, the problems of low signal-to-noise ratio and low power amplifier efficiency are solved, and the low peak average power ratio is achieved signal transmission improves battery life and signal-to-noise ratio.

CN114747259BActive Publication Date: 2024-12-03ZTE CORP
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN201980102651.2
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2019-12-13
Publication Date
2024-12-03
Estimated Expiration
2039-12-13

AI Technical Summary

Technical Problem

In high-frequency wireless communication scenarios, the signal-to-noise is relatively low and the power amplifier is less efficient, making it difficult to meet the low peak average power ratio (PAPR) requirements. Especially in large-scale machine type communications, terminal devices want to reduce power consumption to increase battery life.

Method used

By inserting zero elements into the input sequence, generating intermediate sequences and performing convolutional modulation, using a set of non-zero coefficients to reduce the peak average power ratio of the output sequence, using multipath delay operation and π/2-binary phase shift keying ( BPSK) modulation scheme to generate and demodulate sequences for low PAPR signal transmission.

Benefits of technology

It effectively reduces the peak average power ratio of signal transmission, improves the signal-to-noise ratio, saves the power consumption of user equipment, and improves the battery life of terminal equipment. It is suitable for application scenarios of 5G and future communication standards such as B5G or 6G.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114747259B_ABST
    Figure CN114747259B_ABST
Patent Text Reader

Abstract

A method, apparatus, and system for reducing a peak-to-average power ratio (PAPR) in signal transmission is described. In one example aspect, a wireless communication method includes: determining an output sequence for an input sequence. The output sequence corresponds to an output of a convolution modulation between a set of coefficients and an intermediate sequence. The intermediate sequence is generated by inserting N zero elements between elements of the input sequence. The number of non-zero coefficients in the set of coefficients is based on N, where N is a positive integer. The values ​​of the non-zero coefficients correspond to values ​​between 0 and π / 2 to reduce the peak-to-average power ratio of the output sequence. The method also includes using the output sequence to generate a waveform.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This patent application is generally directed to wireless communications. Background Art

[0002] Mobile communications technology is driving the world toward an increasingly interconnected and networked society. Rapid growth in mobile communications and technological advancements are driving greater demand for capacity and connectivity. Other factors, such as energy consumption, device cost, spectrum efficiency, and latency, are also crucial to meeting the demands of various communication scenarios. Various technologies are being explored, including new approaches to providing higher quality of service, longer battery life, and improved performance. Summary of the Invention

[0003] This patent application describes, inter alia, techniques for reducing the Peak to Average Power Ratio (PAPR) in signal transmission.

[0004] In one exemplary aspect, a wireless communication method includes determining an output sequence for an input sequence. The output sequence corresponds to an output of convolution modulation between a set of coefficients and an intermediate sequence. The intermediate sequence is generated by inserting N zero elements between elements of the input sequence. The number of non-zero coefficients in the set of coefficients is based on N, where N is a positive integer. The values ​​of the non-zero coefficients correspond to values ​​between 0 and π / 2. The method also includes generating a waveform using the output sequence.

[0005] In another example aspect, a wireless communication method includes receiving a sequence generated based on an output of convolution modulation between a set of coefficients and an intermediate sequence. The intermediate sequence is generated by inserting N zero elements between elements of the input sequence. The number of non-zero coefficients in the set of coefficients is based on N, where N is a positive integer. The values ​​of the non-zero coefficients correspond to values ​​between 0 and π / 2. The method also includes demodulating the sequence to determine the input sequence.

[0006] In another exemplary aspect, a communication device is disclosed, comprising a processor configured to implement the above method.

[0007] In yet another exemplary aspect, a computer program storage medium is disclosed. The computer program storage medium includes code stored thereon. When executed by a processor, the code causes the processor to implement the described method.

[0008] These and other aspects are described throughout this application. BRIEF DESCRIPTION OF THE DRAWINGS

[0009] Figure 1 is a flowchart representation of a wireless communication method according to the present technology.

[0010] Figure 2is a flowchart representation of another wireless communication method according to the present technology.

[0011] Figure 3 An example sequence of operations according to the present technique is shown.

[0012] Figure 4 An example of a wireless communication system is shown in which the technology according to one or more embodiments of the present technology can be applied.

[0013] Figure 5 is a block diagram representation of a portion of a wireless station according to one or more embodiments in which the present technology may be applied. DETAILED DESCRIPTION

[0014] The section headings used in this application are intended solely to improve readability and are not intended to limit the scope of the embodiments and techniques disclosed in each section to that section. Certain features are described using the example of 5G wireless protocols. However, the applicability of the disclosed techniques is not limited to 5G wireless systems.

[0015] In high-frequency wireless communication scenarios, path loss and shadow attenuation are relatively large. Consequently, the signal-to-noise ratio (SNR) in certain areas near the cell edge is low. Furthermore, power amplifier (PA) efficiency is relatively low at high frequencies. To improve the signal-to-interference-and-noise ratio (SINR) and save power consumption in user equipment (UE), it is desirable for the UE to transmit signals with a low peak-to-average power ratio (PAPR).

[0016] Furthermore, in the case of massive machine-type communications (mMTC), terminal devices may desire to significantly reduce power consumption. For example, in some cases, a long battery life (e.g., more than ten years) is desirable to reduce the need to dispatch maintenance teams to replace batteries. To improve the PA efficiency of such terminal devices, the transmitted signal should have a low PAPR. Specifically, when a large number of user devices obtain non-orthogonal access, the SINR is very low. A low modulation and coding scheme (MCS) and low PAPR signal modulation are needed to improve transmission quality.

[0017] In the current fifth-generation (5G) New Radio (NR) standard, although the peak-to-average ratio of DFT-s-OFDM signals is relatively low, it still struggles to meet the low PAPR requirements of various B5G or 6G application scenarios. This patent application describes techniques that can be implemented in various embodiments to use modulation schemes that further reduce PAPR.

[0018] Figure 1is a flowchart representation of a wireless communication method 100 according to the present technology. Method 100 can be implemented by a wireless station such as a base station or a wireless device described in this application. For example, a processor in the wireless station (e.g., the processor electronics described in this application) can be configured to implement method 100. Method 100 includes: at operation 110, determining an output sequence for an input sequence. The output sequence corresponds to the output of a convolution modulation between a set of coefficients and an intermediate sequence. The intermediate sequence is generated by inserting N zero elements between elements of the input sequence. The set of coefficients can include zero coefficients and non-zero coefficients. The number of non-zero coefficients in the set of coefficients is based on N, where N is a positive integer. The values ​​of the non-zero coefficients correspond to values ​​between 0 and π / 2 to reduce the peak-to-average power ratio of the output sequence. Method 100 also includes: at operation 120, using the output sequence to generate a waveform.

[0019] In some embodiments, the above method may preferably further include one or more of the following features. In some embodiments, the number of non-zero coefficients is 2N+1. In some embodiments, the non-zero coefficients are represented as [f(0), f(1), ..., f(2N)] = p·[g(0), g(1), ..., g(2N)], where p is a scalar value. In some embodiments, the number of non-zero coefficients is 2N+2. In some embodiments, the non-zero coefficients are represented as convolutions, for example: p is a scalar value. In some embodiments, [h(0), h(1)] = [1, 1]. In some embodiments, g(0) = g(2N), g(1) = g(2N-1), ..., and g(N-1) = g(N+1), and g(0), g(1), ..., ..., and g(N) correspond to values ​​between 0 and π / 2. In some embodiments, g(i) = cos(θ i ), 0≤i≤N, and 0≤θ i <π / 2. In some embodiments, p includes a normalization parameter. The value of p can be 1. The value of p can also be based on N. For example, when N=1, Or when N=2, In some embodiments, p is the same for all elements. In some embodiments, p may vary for different elements in the sequence.

[0020] In some embodiments, the modulation operation includes a multipath delay operation. In some embodiments, the multipath delay operation includes a cyclic delay in which the elements of the intermediate sequence are shifted in a cyclic manner in the time domain, or a linear delay in which the elements of the intermediate sequence are shifted in a linear manner in the time domain.

[0021] In some embodiments, the multipath delay operation includes: using different delay values, generating multiple delay paths based on the intermediate sequence, and using the set of non-zero coefficients to calculate the weighted sum of the multiple delay paths. The advantage of inserting zero coefficients between the coefficients of the input sequence is that data with a path difference of two steps is not affected by the multipath weighted sum. For example, given three paths D -1 、D 0 and D -1 , path D 0 The data in path D will not affect -1 and the data in D1. Assume that path D -1 The coefficient is d(-1), path D 0 The coefficient of is d(0), and the path D 1 The coefficient of is d(1). In some embodiments, d(0)=1, so for path D 0 In some embodiments, Thus, after multipath delay calculation, by superimposing D -1 and D 1 The obtained phase is between the phases of two adjacent elements, thus reducing the PAPR.

[0022] In some embodiments, the convolution modulation operation is also referred to as a filtering operation of the filter module. The parameters of the filtering operation correspond to non-zero coefficients f(n).

[0023] In some embodiments, the input sequence is determined by mapping data bits to constellation points according to a modulation scheme. In some embodiments, the modulation scheme includes π / 2-binary phase shift keying (BPSK). An advantage of using π / 2-BPSK as a modulation scheme is that the phase between each two adjacent elements in the data sequence is π / 2. In some embodiments, after the multipath delay operation, the phase after the superposition positioning data path has a difference of 0 or π / 4 (for example, for N=1) with the adjacent elements, or alternatively has a difference of 0 or π / 6 (for example, for N=2) with the adjacent elements, thereby reducing the peak-to-average power ratio (PAPR) of the resulting data sequence.

[0024] In some embodiments, the input sequence comprises a data sequence or a reference sequence. In some embodiments, the input sequence comprises one or more zero elements. In some embodiments, a zero element is inserted before or after each element of the input sequence. In some embodiments, the input sequence is part of a data sequence transmitted by the wireless device.

[0025] Figure 22 is a flowchart representation of another wireless communication method 200 according to the present technology. Method 200 includes, at operation 210, receiving a sequence generated based on the output of convolution modulation between a set of coefficients and an intermediate sequence. The intermediate sequence is generated by inserting N zero elements between elements of the input sequence. The set of coefficients may include zero coefficients and non-zero coefficients. The number of non-zero coefficients in the set of coefficients is based on N, where N is a positive integer. The values ​​of the non-zero coefficients correspond to values ​​between 0 and π / 2 to reduce the peak-to-average power ratio of the sequence. Method 200 also includes, at operation 220, demodulating the sequence to determine the input sequence.

[0026] In some embodiments, the above method may preferably further include one or more of the following features. In some embodiments, the number of non-zero coefficients is 2N+1. In some embodiments, the non-zero coefficients are represented as [f(0), f(1), ..., f(2N)] = p·[g(0), g(1), ..., g(2N)], where p is a scalar value. In some embodiments, the number of non-zero coefficients is 2N+2. In some embodiments, the non-zero coefficients are represented as convolutions, for example, p is a scalar value. In some embodiments, [h(0), h(1)] = [1, 1]. In some embodiments, g(0) = g(2N), g(1) = g(2N-1), ..., and g(N-1) = g(N+1), and g(0), g(1), ..., and g(N) correspond to values ​​between 0 and π / 2. In some embodiments, g(i) = cos(θ i ), 0≤i≤N, and 0≤θ i <π / 2. In some embodiments, p includes a normalization parameter. The value of p can be 1. The value of p can also be based on N. For example, when N=1, Or when N=2, In some embodiments, p is the same for all elements. In some embodiments, p may vary for different elements in the sequence.

[0027] In some embodiments, the modulation operation includes a multipath delay operation. In some embodiments, the multipath delay operation includes a cyclic delay in which the elements of the intermediate sequence are shifted in a cyclic manner in the time domain, or a linear delay in which the elements of the intermediate sequence are shifted in a linear manner in the time domain.

[0028] In some embodiments, the input sequence comprises a data sequence or a reference sequence. In some embodiments, the input sequence comprises one or more zero elements. In some embodiments, demodulating the sequence comprises using a set of non-zero coefficients to operate with a combination of adjacent elements of the sequence to determine corresponding elements in the input sequence.

[0029] In some embodiments, the input sequence of coefficients is determined by mapping data bits to constellation points according to a modulation scheme. The modulation scheme includes π / 2-binary phase shift keying (BPSK). The advantage of using π / 2-BPSK as a modulation scheme is that the phase between each two adjacent elements in the data sequence is π / 2. In some embodiments, after the multipath delay operation, the phase after the superposition positioning data path has a difference of π / 4 (for example, for N=1) with the adjacent elements, or alternatively has a difference of π / 6 (for example, for N=2) with the adjacent elements, thereby reducing the peak-to-average power ratio (PAPR) of the resulting data sequence. In some embodiments, the method further includes determining the corresponding mapped constellation point from the input sequence according to the modulation scheme, and determining the data bit based on the mapped constellation point.

[0030] When the modulation scheme of π / 2-BPSK is combined with the path coefficient, the superposition path (e.g., D -1 and D 1 ) data, the modulus value obtained is equal to the path D 0 modulus. In this way, the modulus values ​​of all element data of the data sequence [s(k)] are equal, and the phase difference between adjacent elements is relatively small, thereby reducing the PAPR of the data sequence [s(k)]. In addition, after receiving the data including the data sequence [s(k)], the receiving end obtains the data including the data sequence [x(i)] by using a correlation detection algorithm such as maximum ratio combining, which reduces the processing complexity of the receiving side. The data sequence [x(i)] does not cause error propagation between data elements during demodulation. In addition, although the length of [s(k)] is twice that of [x(i)], which requires more physical resources, the improvement of the signal-to-noise ratio (SNR) (for example, experiments show that the SNR can be improved by more than 3dB) can compensate for the loss of transmission efficiency.

[0031] As further described herein, the above method provides a flexible solution for manipulating input data sequences to achieve low PAPR. For example, the path delay operation and coefficients can be variable (i.e., the value of N can be variable) based on the input data sequence. The modulus of all elements in the resulting sequence is the same. In particular, when normalized by parameter p, the modulus equals 1, which reduces the PAPR. The disclosed techniques also impose low complexity on the transmitter and / or receiver. Some examples of the disclosed techniques are described in the following exemplary embodiments.

[0032] Example 1

[0033] The input data sequence is [x(i)] = [x(1), x(2), ..., x(I)]. A zero coefficient is inserted after each element to form a second data sequence [y(j)] = [x(1), 0, x(2), 0, ..., x(I), 0]. Therefore, y(1) = x(1), y(2) = 0, y(3) = x(2), y(4) = 0, ..., and J = 2I. The second data sequence [y(j)] then undergoes a multipath delay operation based on the non-zero coefficients. With a delay length of The non-zero coefficients may be in a set of coefficients that includes zero coefficients and non-zero coefficients.

[0034] In this embodiment, the multipath delay calculation is a multipath cyclic delay calculation including the following steps:

[0035] (1) In the first path, the data sequence [y(j)] undergoes a cyclic delay with a delay value of -2. The resulting data sequence is: P / 2×[x(2),0,...,x(1),0,x(1),0]. Note that due to the cyclic or circular nature of the delay operation, the element [x(1),0] is shifted to the end of the sequence.

[0036] (2) In the second path, the data sequence [y(j)] undergoes a cyclic delay with a delay value of -1. The resulting data sequence is: Note that due to the cyclic or looping nature of the delay operation, the element x(1) is shifted to the end of the sequence.

[0037] (3) In the third path, the data sequence [y(j)] undergoes a cyclic delay with a delay value of 0. Because the delay value is 0, the data sequence of this path remains [y(j)]. The resulting data sequence is: p × [x(1), 0, x(2), 0, ..., x(1), 0].

[0038] (4) In the fourth path, the data sequence [y(j)] undergoes a cyclic delay with a delay value of 1. The resulting data sequence is:

[0039] (5) In the fifth path, the data sequence [y(j)] undergoes a cyclic delay with a delay value of 2. Note that due to the cyclic or circular nature of the delay operation, the element x(I) is shifted to the beginning of the sequence. The resulting data sequence is P / 2×[x(I),0,x(1),0,x(2),0,…,x(I-1),0].

[0040] After adding the data sequences obtained from the five paths, the data sequence [s(k)] is as follows:

[0041]

[0042] The phase difference between adjacent elements of )s(k) can be 6 / π (for example, when N=2). For N>2, the phase difference can also be less than 6 / π. In some embodiments, p includes a normalization parameter. The value of p can be 1. The value of p can also be based on N. For example, when N=2, In some embodiments, p is the same for all elements. In some embodiments, p may vary for different elements in the sequence.

[0043] The data sequence [s(k)] is carried on the physical time-frequency resources for transmission. When transmitting on the physical time-frequency resources, some s(K) elements may be discarded to save resources.

[0044] Example 2

[0045] The input data sequence is [x(i)] = [x(1), x(2), ..., x(I)]. A zero coefficient is inserted after each element to form a second data sequence [y(j)] = [x(1), 0, x(2), 0, ..., x(I), 0]. Therefore, y(1) = x(1), y(2) = 0, y(3) = x(2), y(4) = 0, ..., and J = 2I. The second data sequence [y(j)] then undergoes a multipath delay operation based on the non-zero coefficients. With a delay length of The non-zero coefficients may be in a set of coefficients that includes zero coefficients and non-zero coefficients.

[0046] In this embodiment, the multipath delay calculation is a multipath linear delay calculation including the following steps:

[0047] (1) In the first path, the data sequence [y(j)] undergoes a linear delay of -2. The resulting data sequence is: P / 2×[x(1),0,x(2),0,...,x(I),0]. Note that due to the linear nature of the delay operation, the first element x(1) is linearly shifted to the time domain position t = -2.

[0048] (2) In the second path, the data sequence [y(j)] undergoes a linear delay with a delay value of -1. The resulting data sequence is: Note that due to the linear nature of the delay operation, the first element x(1) is linearly shifted to the time domain position t=-1, and leading zeros are added to the sequence so that it can be aligned with the first sequence starting from the time domain position t=-2.

[0049] (3) In the third path, the data sequence [y(j)] undergoes a linear delay with a delay value of 0. Since the delay value is 0, the data sequence of this path remains [y(j)]. The resulting data sequence is p×[0,0,x(1),0,x(2),0,...,x(1),0]. Note that two leading zeros are added to this sequence so that it can be aligned with the first sequence starting from time domain position t=-2.

[0050] (4) In the fourth path, the data sequence [y(j)] undergoes a linear delay with a delay value of 1. The resulting data sequence is: Note that although the delay value of the fourth path is only 1, three leading zeros are added to the sequence so that it can be aligned with the other sequences starting from time domain position t=-2.

[0051] (5) In the fifth path, the data sequence [y(j)] undergoes a linear delay with a delay value of 2. The resulting data sequence is p / 2×[0,0,0,0,x(1),0,x(2),0,…,x(I),0]. Four leading zeros are added to this sequence so that it can be aligned with other sequences starting from the time domain position t=-2.

[0052] After adding the data sequences obtained by the five paths in (1), (2), (3) and (4), the obtained data sequence [s(k)] is as follows:

[0053]

[0054] The phase difference between adjacent elements of s(k) may be 6 / π (for example, when N=2). For N>2, the phase difference may also be less than 6 / π.

[0055] In some embodiments, p includes a normalization parameter. The value of p can be 1. The value of p can also be based on N. For example, when N=2, In some embodiments, p is the same for all elements. In some embodiments, p may vary for different elements in the sequence.

[0056] The data sequence [s(k)] is carried on the physical time-frequency resources for transmission. When transmitted on the physical time-frequency resources, the first data element s(1) is superimposed with the previous data block and transmitted, and the last data element s(K) is superimposed with the next data block and transmitted.

[0057] Example 3

[0058] The input data sequence is [x(i)] = [x(1), x(2), ..., x(I)]. A zero coefficient is inserted after each element to form a second data sequence [y(j)] = [x(1), 0, x(2), 0, ..., x(I), 0]. Therefore, y(1) = x(1), y(2) = 0, y(3) = x(2), y(4) = 0, ..., and J = 2I. The second data sequence [y(j)] then undergoes a multipath delay operation based on the non-zero coefficients. With The non-zero coefficients may be in a set of coefficients that include both zero coefficients and non-zero coefficients. Different delay lengths may be assigned to coefficients such as or Different coefficients like .

[0059] In this embodiment, the multipath delay calculation is a multipath cyclic delay calculation including the following steps:

[0060] (1) In the first path, the data sequence [y(j)] undergoes a cyclic delay with a delay value of -1. The resulting data sequence is: Note that due to the cyclic or looping nature of the delay operation, the element x(1) is shifted to the end of the sequence.

[0061] (2) In the second path, the data sequence [y(j)] undergoes a cyclic delay with a delay value of 0. Since the delay value is 0, the data sequence of this path remains [y(j)]. The resulting data sequence is:

[0062] (3) In the third path, the data sequence [y(j)] undergoes a cyclic delay with a delay value of 1. The resulting data sequence is:

[0063] (4) In the fourth path, the data sequence [y(j)] undergoes a cyclic delay with a delay value of 2. Note that due to the cyclic or circular nature of the delay operation, the element x(i) is shifted to the beginning of the sequence. The resulting data sequence is

[0064] After adding the data sequences obtained through the three paths in (1), (2), (3), and (4), the obtained data sequence [s(k)] is as follows:

[0065]

[0066] therefore,

[0067] In some embodiments, the phase difference between adjacent elements of s(k) is 0 or 4 / π (e.g., when N=1). In some embodiments, the phase difference between adjacent elements of s(k) is 0 or 6 / π (e.g., when N=2). For N>2, the phase difference may also be less than 6 / π.

[0068] In some embodiments, p includes a normalization parameter. The value of p can be 1. The value of p can also be based on N. For example, when N=1, Or when N=2, In some embodiments, p is the same for all elements. In some embodiments, p may vary for different elements in the sequence.

[0069] The data sequence [s(k)] is carried on the physical time-frequency resources for transmission. When transmitting on the physical time-frequency resources, some s(K) elements may be discarded to save resources.

[0070] Example 4

[0071] The input data sequence is [x(i)] = [x(1), x(2), ..., x(I)]. A zero coefficient is inserted after each element to form a second data sequence [y(j)] = [x(1), 0, x(2), 0, ..., x(I), 0]. Therefore, y(1) = x(1), y(2) = 0, y(3) = x(2), y(4) = 0, ..., and J = 2I. The second data sequence [y(j)] then undergoes a multipath delay operation based on the non-zero coefficients. With a delay length of The non-zero coefficients may be in a set of coefficients that include both zero coefficients and non-zero coefficients. Different delay lengths may be assigned to coefficients such as or Different coefficients like .

[0072] In this embodiment, the multipath delay calculation is a multipath linear delay calculation including the following steps:

[0073] (1) In the first path, the data sequence [y(j)] undergoes a linear delay with a delay value of -1. The resulting data sequence is: Note that due to the linear nature of the delay operation, the first element x(1) is linearly shifted to the time domain position t=-1.

[0074] (2) In the second path, the data sequence [y(j)] undergoes a linear delay with a delay value of 0. Since the delay value is 0, the data sequence of this path remains [y(j)]. The resulting data sequence is: Note that leading zeros are added to the sequence so that the second sequence can be aligned with the first sequence starting from time domain position t=-1.

[0075] (3) In the third path, the data sequence [y(j)] undergoes a linear delay with a delay value of 1. The resulting data sequence is: Note that although the third path only experiences a delay value of 1, two leading zeros are added to the sequence so that this third sequence can be aligned with the other two sequences starting from the time domain position t=-1.

[0076] (4) In the fourth path, the data sequence [y(j)] undergoes a linear delay of 2. The resulting data sequence is

[0077] After adding the data sequences obtained through the three paths in (1), (2), (3) and (4), the obtained data sequence [s(k)] is as follows:

[0078]

[0079] therefore,

[0080] In some embodiments, the phase difference between adjacent elements of s(k) is 0 or 4 / π (e.g., when N=1). In some embodiments, the phase difference between adjacent elements of s(k) is 0 or 6 / π (e.g., when N=2). For N>2, the phase difference may also be less than 6 / π.

[0081] In some embodiments, p includes a normalization parameter. The value of p can be 1. The value of p can also be based on N. For example, when N=1, Or when N=2, In some embodiments, p is the same for all elements. In some embodiments, p may vary for different elements in the sequence.

[0082] The data sequence [s(k)] is carried on the physical time-frequency resources for transmission. When transmitted on the physical time-frequency resources, the first data element s(1) is superimposed with the previous data block and transmitted, and the last data element s(K) is superimposed with the next data block and transmitted.

[0083] Example 5

[0084] Figure 3An example operation sequence according to the present technology is shown. The user data sequence [b(m)] to be transmitted is first constellation point modulated to generate a data sequence [x(i)]. Constellation modulation includes π / 2-BPSK, π / 4-QPSK, QPSK, 16QAM and / or APSK. Zero elements are then inserted into the data sequence [x(i)] to generate a data sequence [y(j)]. Zero coefficients can be inserted before or after each element of the data sequence [x(i)]. The resulting data sequence [y(j)] is then convolution modulated to generate a data sequence [s(k)] based on a set of coefficients. Convolution modulation includes circular convolution, linear convolution, cyclic delay operation or linear delay operation. The set of coefficients includes non-zero coefficients derived according to the above embodiments. For example, the non-zero coefficients can be

[0085] Example 6

[0086] when Figure 3 When the convolution modulation is circular convolution modulation, the circular convolution modulation includes circular convolution of the data sequence [y(j)] and the data sequence f(n). Different cyclic shifts of the data sequence f(n) can be implemented to achieve different multipath delay lengths. Other details of the convolution modulation are similar to those described in the above embodiment.

[0087] In some embodiments, before the data sequence [s(k)] is carried on the physical time-frequency resources for transmission, other operations may be performed, such as adding a reference sequence to the data sequence [s(k)], adding a reference sequence before or after the data sequence [s(k)], performing a fast Fourier transform (FFT), performing frequency shaping, performing an inverse FFT (IFFT), and / or filtering the data sequence [s(k)].

[0088] Figure 4 An example of a wireless communication system 400 in which techniques according to one or more embodiments of the present technology can be applied is shown. The wireless communication system 400 may include one or more base stations (BSs) 405a, 405b, one or more wireless devices 410a, 410b, 410c, 410d, and a core network 425. The base stations 405a, 405b may provide wireless services to the wireless devices 410a, 410b, 410c, and 410d in one or more wireless sectors. In some embodiments, the base stations 405a, 405b include directional antennas that generate two or more directional beams to provide wireless coverage in different sectors.

[0089] The core network 425 can communicate with one or more base stations 405a and 405b. The core network 425 provides connectivity to other wireless communication systems and wired communication systems. The core network may include one or more service subscription databases for storing information related to subscribed wireless devices 410a, 410b, 410c, and 410d. The first base station 405a may provide wireless services based on a first radio access technology, while the second base station 405b may provide wireless services based on a second radio access technology. Depending on the deployment scenario, base stations 405a and 405b may be quasi-co-located or installed separately on-site. Wireless devices 410a, 410b, 410c, and 410d may support a variety of different radio access technologies. The techniques and embodiments described herein may be implemented by a base station of the wireless devices described herein.

[0090] Figure 5 is a block diagram representation of a portion of a wireless site according to one or more embodiments to which the present technology may be applied. A wireless site 505, such as a base station or a wireless device (or UE), may include processor electronics 510, such as a microprocessor that implements one or more wireless technologies presented in this application. The wireless site 505 may include transceiver electronics 515 to send and / or receive wireless signals via one or more communication interfaces, such as an antenna 520. The wireless site 505 may include other communication interfaces for transmitting and receiving data. The wireless site 505 may include one or more memories (not explicitly shown) configured to store information, such as data and / or instructions. In some embodiments, the processor electronics 510 may include at least a portion of the transceiver electronics 515. In some embodiments, at least some of the disclosed techniques, modules, or functions are implemented using the wireless site 505.

[0091] It should be understood that this application discloses techniques that can be embodied in various embodiments to effectively reduce the PAPR in signal transmissions, thereby meeting the low PAPR requirements of various wireless communication applications. The disclosed and other embodiments, modules, and functional operations described in this application, including the structures disclosed herein and their structural equivalents, can be implemented in digital electronic circuitry, or in computer software, firmware, or hardware, or in a combination of one or more of these. The disclosed and other embodiments can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a computer-readable medium, for execution by a data processing apparatus or for controlling the operations of the data processing apparatus. The computer-readable medium can be a machine-readable storage device, a machine-readable storage substrate, a storage device, a composition of matter that effects a machine-readable propagated signal, or one or more combinations thereof. The term "data processing apparatus" encompasses all apparatus, devices, and machines for processing data, including, for example, a programmable processor, a computer, or multiple processors or computers. In addition to hardware, the apparatus may also include code that creates an execution environment for the computer program in question, such as code constituting processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of these. A propagated signal is an artificially generated signal, eg, a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to suitable receiver apparatus.

[0092] A computer program (also referred to as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program may be stored as part of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple collaborative files (e.g., files that store one or more modules, subroutines, or portions of code). A computer program may be deployed to execute on a single computer or on multiple computers located at one site or distributed across multiple sites and interconnected by a communications network.

[0093] The processes and logic flows described herein can be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be performed by, and the apparatus can be implemented as, special purpose logic circuitry, such as an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit).

[0094] By way of example, processors suitable for executing computer programs include both general-purpose and special-purpose microprocessors, as well as any one or more processors of any type of digital computer. Typically, a processor will receive instructions and data from a read-only memory or a random-access memory, or both. The essential elements of a computer are a processor for executing instructions and one or more memory devices for storing instructions and data. Typically, a computer will also include, or be operatively coupled to, one or more mass storage devices (e.g., magnetic, magneto-optical, or optical disks) for storing data, to receive data from or transfer data to the mass storage devices, or both. However, a computer need not have such devices. Computer-readable media suitable for storing computer program instructions and data include all forms of nonvolatile memory, media, and storage devices, including, for example, semiconductor memory devices such as EPROM, EEPROM, and flash memory devices; magnetic disks, such as internal hard disks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROM discs. The processor and memory may be supplemented by, or incorporated into, special-purpose logic circuitry.

[0095] Although this patent application contains many details, these details should not be interpreted as limitations on the scope of any invention or what may be claimed, but rather as descriptions of features that may be specific to particular embodiments of particular inventions. Certain features described in this patent application in the context of separate embodiments may also be implemented in combination in a single embodiment. Conversely, various features described in the context of a single embodiment may also be implemented in multiple embodiments individually or in any suitable subcombination. Furthermore, although features may be described above as functioning in a particular combination, and even initially claimed as such, in some cases one or more features from the claimed combination may be deleted from the combination as well as the claimed combination.

Claims

1. A wireless communication method, include: For an input sequence, an output sequence is determined, wherein the output sequence corresponds to an output of a convolution modulation between a set of coefficients and an intermediate sequence, wherein the intermediate sequence is generated by inserting N zero elements between each adjacent element of the input sequence, wherein the set of coefficients includes non-zero coefficients represented as [f(0), f(1), ..., f(2N+1)], wherein N is a positive integer, and wherein the values ​​of the non-zero coefficients are based on cos(θ i ), where 0≤i≤N and 0≤θ i ≤π / 2, for the cos(θ i ) is N+1; and Generate a waveform using the output sequence, Wherein, the non-zero coefficients are represented as [f(0), f(1), ..., f(2N+1)], wherein [f(0), f(1), ..., f(2N+1)] is the convolution of p·[g(0), g(1), ..., g(2N)] and [h(0), h(1)], and wherein p is a scalar value.

2. The method according to claim 1, in, [h(0),h(1)]=[1,1].

3. The method according to claim 1 or 2, in, g(0)=g(2N), g(1)=g(2N-1), ..., and g(N-1)=g(N+1).

4. The method according to claim 2, in, g(i)=cos(θ i ), 0≤i≤N, and 0≤θ i ≤π / 2.

5. The method according to claim 1 or 2, in, p includes the normalization parameter.

6. The method according to claim 5, in, p is 1, or 7. The method according to claim 1 or 2, in, The convolution modulation operation includes a multipath delay operation.

8. The method according to claim 7, in, The multipath delay operation includes a cyclic delay in which the elements of the intermediate sequence are shifted in a cyclic manner in the time domain or a linear delay in which the elements of the intermediate sequence are shifted in a linear manner in the time domain.

9. The method according to claim 7, in, The multipath delay calculation includes: generating a plurality of delay paths based on the intermediate sequence using different delay values; and A weighted sum of the delay paths is calculated using the non-zero coefficients.

10. The method according to claim 1 or 2, in, The input sequence is determined by mapping data bits to constellation points according to a modulation scheme.

11. The method according to claim 10, in, The modulation scheme includes π / 2-binary phase shift keying BPSK.

12. The method according to claim 1 or 2, in, The input sequence includes a data sequence or a reference sequence.

13. The method according to claim 1 or 2, in, The zero elements are inserted before or after each element of the input sequence.

14. A wireless communication method, include: Receiving a sequence generated based on an output of a convolution modulation between a set of coefficients and an intermediate sequence, wherein the intermediate sequence is generated by inserting N zero elements between each adjacent element of the input sequence, wherein the set of coefficients includes non-zero coefficients represented as [f(0), f(1), ..., f(2N+1)], wherein N is a positive integer, and wherein the values ​​of the non-zero coefficients are based on cos(θ i ), where 0≤i≤N and 0≤θ i ≤π / 2, for the cos(θ i ) is N+1; and demodulating the sequence to determine the input sequence, Wherein, the non-zero coefficients are represented as [f(0), f(1), …, f(2N+1)], and [f(0), f(1), …, f(2N+1)] is the convolution of p·[g(0), g(1), …, g(2N)] and [h(0), h(1)], where p is a scalar value.

15. The method according to claim 14, in, [h(0),h(1)]=[1,1].

16. The method according to claim 14 or 15, wherein g(0) = g(2N), g(1) = g(2N-1), ..., and g(N-1) = g(N+1).

17. The method according to claim 16, in, g(i)=cos(θ i ), 0≤i≤N, and 0≤θ i ≤π / 2.

18. The method according to claim 14 or 15, in, p includes the normalization parameter.

19. The method according to claim 18, in, p is 1, or 20. The method according to claim 14 or 15, in, The convolution modulation operation includes a multipath delay operation.

21. The method according to claim 20, in, The multipath delay operation includes a cyclic delay in which the elements of the intermediate sequence are shifted in a cyclic manner in the time domain or a linear delay in which the elements of the intermediate sequence are shifted in a linear manner in the time domain.

22. The method according to claim 14 or 15, include: Determining corresponding mapped constellation points from the input sequence according to a modulation scheme; as well as Data bits are determined based on the mapped constellation points.

23. The method according to claim 22, in, The modulation scheme includes π / 2-binary phase shift keying BPSK.

24. The method according to claim 14 or 15, in, The input sequence includes a data sequence or a reference sequence.

25. The method according to claim 24, in, The input sequence includes one or more zero elements.

26. The method according to claim 14 or 15, in, Demodulating the sequence comprises: The non-zero coefficients are used to operate with combinations of adjacent elements of the sequence to determine corresponding elements in the input sequence.

27. A communication device comprising a processor and a memory, the processor being configured to read instructions from the memory to implement the method according to any one of claims 1 to 26.

28. A computer program product having stored thereon codes which, when executed by a processor, cause the processor to carry out the method according to any one of claims 1 to 26.