IP Library › Granted Patent US 12,149,393
Granted Patent B2
US 12,149,393 · App. 17/838,060 · Granted Nov 19, 2024

Time-domain modulation scheme for low peak average power ratio

Inventors: Yu Xin (Guangdong, CN); Jun Xu (Guangdong, CN); Guanghui Yu (Guangdong, CN); Jian Hua (Guangdong, CN)
Assignee: ZTE Corporation
H04L27/2614H04L27/2627H04L27/3411H04W52/0219
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,149,393
App. No.
17/838,060
Granted
Nov 19, 2024
Kind
B2
Abstract

Methods, apparatus, and systems for reducing Peak Average Power Ratio (PAPR) in signal transmissions are described. In one example aspect, a wireless communication method includes determining, for an input sequence, an output sequence. The output sequence corresponds to an output of a convolutional modulation between a set of coefficients and an intermediate sequence. The intermediate sequence is generated by inserting N zero coefficients between coefficients of the input sequence. The number of non-zero coefficients in the set of coefficients is based on N, N being a positive integer. Values of the non-zero coefficients correspond to values between 0 to π/2 to reduce a peak to average power ratio of the output sequence. The method also includes generating a waveform using the output sequence.

Claims (45)

1. A wireless communication method, comprising:

determining, for an input sequence, an output sequence, wherein the output sequence corresponds to an output of a convolutional modulation between a set of coefficients and an intermediate sequence, wherein the intermediate sequence is generated by inserting N zero coefficients into the input sequence, wherein the set of coefficients includes non-zero coefficients that are represented as [f(0), f(1), . . . , f(2N)] or [f(0), f(1), . . . , f(2N+1)], wherein a number of the non-zero coefficients in the set of coefficients is 2N+1 or 2N+2, N being a positive integer indicating a number of zero coefficients inserted into the input sequence to generate the intermediate sequence, wherein values of the non-zero coefficients are based on cos (θi), and wherein i is between 0 and N and θi is between 0 to π/2 and a number of different values of cos (θi) for the set of coefficients is N+1; and generating a waveform using the output sequence.

2. The method of claim 1 , wherein the number of the non-zero coefficients is:

2N+1, in response to the non-zero coefficients represented as [f(0), f(1), . . . , f(2N)] being obtained by p·[g(0), g(1), . . . , g(2N)], p being a scalar value; or

2N+2, in response to the non-zero coefficients represented as [f(0), f(1), . . . , f(2N+1)] being a convolution of p·[g(0), g(1), . . . , g(2N)] and [1, 1], and

wherein g(0)=g(2N), g(1)=g(2N−1), . . . and g(N−1)=g(N+1), wherein values of g(0), g(1), . . . , g(N) correspond to values between 0 to π/2, and wherein g(i)=cos (i), 0≤i≤N, and 0≤θi≤π/2.

3. The method of claim 1 , wherein the convolutional modulation comprises a multi-path delay operation, and wherein the multi-path delay operation includes a circular delay in which coefficients in the intermediate sequence are shifted in time domain in a circular manner or a linear delay in which coefficients in the intermediate sequence are shifted in time domain in a linear manner.

4. The method of claim 1 , wherein the convolutional modulation comprises a multi-path delay operation, and wherein the multi-path delay operation comprises:

generating multiple delayed paths based on the intermediate sequence using different delay values; and

computing a weighted sum of the multiple delayed paths using the non-zero coefficients.

5. The method of claim 1 , wherein the input sequence is determined by mapping data bits to constellation points according to a modulation scheme.

6. A wireless communication method, comprising:

receiving a sequence generated based on an output of a convolutional modulation between a set of coefficients and an intermediate sequence, wherein the intermediate sequence is generated by inserting N zero coefficients into an input sequence, wherein the set of coefficients includes non-zero coefficients that are represented as [f(0), f(1), . . . , f(2N)] or [f(0), f(1), . . . , f(2N+1)], wherein a number of the non-zero coefficients in the set of coefficients is 2N+1 or 2N+2, N being a positive integer indicating a number of zero coefficients inserted into the input sequence to generate the intermediate sequence, wherein values of the non-zero coefficients are based on cos (θi), and wherein i is between 0 and N and θi is between 0 to π/2 and a number of different values of cos (θi) for the set of coefficients is N+1; and

demodulating the received sequence to determine the input sequence.

7. The method of claim 6 , wherein the number of the non-zero coefficients is:

2N+1, in response to the non-zero coefficients represented as [f(0), f(1), . . . , f(2N)] being obtained by p· [g(0), g(1), . . . , g(2N)], p being a scalar value; or

2N+2, in response to the non-zero coefficients represented as [f(0), f(1), . . . , f(2N+1)] being a convolution of p· [g(0), g(1), . . . , g(2N)] and [1, 1], and

wherein g(0)=g(2N), g(1)=g(2N−1), . . . , and g(N−1)=g(N+1), and wherein g(0), g(1), . . . , and g(N) correspond to values that are between 0 to π/2, and wherein g(i)=cos (i), 0≤i≤N, and 0≤θi≤π/2.

8. The method of claim 6 , wherein the convolutional modulation comprises a multi-path delay operation, and wherein the multi-path delay operation includes a circular delay in which elements in the intermediate sequence are shifted in time domain in a circular manner or a linear delay in which elements in the intermediate sequence are shifted in time domain in a linear manner.

9. The method of claim 6 , further comprising:

determining corresponding mapped constellation points from the input sequence according to a modulation scheme; and

determining data bits based on the mapped constellation points.

10. The method of claim 6 , wherein demodulating the received sequence comprises:

combining, using the non-zero coefficients, adjacent elements of the sequence to determine a corresponding element in the input sequence.

11. A wireless communication apparatus comprising a processor and a memory storing instructions, execution of which by the processor causes the apparatus to perform operations comprising:

determining, for an input sequence, an output sequence, wherein the output sequence corresponds to an output of a convolutional modulation between a set of coefficients and an intermediate sequence, wherein the intermediate sequence is generated by inserting N zero coefficients into the input sequence, wherein the set of coefficients includes non-zero coefficients that are represented as [f(0), f(1), . . . , f(2N)] or [f(0), f(1), . . . , f(2N+1)], wherein a number of the non-zero coefficients in the set of coefficients is 2N+1 or 2N+2, N being a positive integer indicating a number of zero coefficients inserted into the input sequence to generate the intermediate sequence, wherein values of the non-zero coefficients are based on cos (θi), and wherein i is between 0 and N and θi is between 0 to π/2 and a number of different values of cos (θi) for the set of coefficients is N+1; and

generating a waveform using the output sequence.

12. The apparatus of claim 11 , wherein the number of the non-zero coefficients is:

2N+1, in response to the non-zero coefficients represented as [f(0), f(1), . . . , f(2N)] being obtained by p· [g(0), g(1), . . . , g(2N)], p being a scalar value; or

2N+2, in response to the non-zero coefficients represented as [f(0), f(1), . . . , f(2N+1)] being a convolution of p·[g(0), g(1), . . . , g(2N)] and [1, 1], and

wherein g(0)=g(2N), g(1)=g(2N−1), . . . , and g(N−1)=g(N+1), wherein values of g(0), g(1), . . . g(N) correspond to values between 0 to π/2, and wherein g(i)=cos (i), 0≤i≤N, and 0≤θi≤π/2.

13. The apparatus of claim 11 , wherein the convolutional modulation comprises a multi-path delay operation, and wherein the multi-path delay operation includes a circular delay in which coefficients in the intermediate sequence are shifted in time domain in a circular manner or a linear delay in which coefficients in the intermediate sequence are shifted in time domain in a linear manner.

14. The apparatus of claim 11 , wherein the convolutional modulation comprises a multi-path delay operation, and wherein the multi-path delay operation comprises:

generating multiple delayed paths based on the intermediate sequence using different delay values; and

computing a weighted sum of the multiple delayed paths using the non-zero coefficients.

15. A wireless communication apparatus comprising a processor and a memory storing instructions, execution of which by the processor causes the apparatus to perform operations comprising:

receiving a sequence generated based on an output of a convolutional modulation between a set of coefficients and an intermediate sequence, wherein the intermediate sequence is generated by inserting N zero coefficients into an input sequence, wherein the set of coefficients includes non-zero coefficients that are represented as [f(0), f(1), . . . , f(2N)] or [f(0), f(1), . . . , f(2N+1)], wherein a number of the non-zero coefficients in the set of coefficients is 2N+1 or 2N+2, N being a positive integer indicating a number of zero coefficients inserted into the input sequence to generate the intermediate sequence, wherein values of the non-zero coefficients are based on cos (θi), and wherein i is between 0 and N and θi is between 0 to π/2 and a number of different values of cos (θi) for the set of coefficients is N+1; and

demodulating the received sequence to determine the input sequence.

16. The apparatus of claim 15 , wherein the number of the non-zero coefficients is:

2N+1, in response to the non-zero coefficients represented as [f(0), f(1), . . . , f(2N)] being obtained by p·[g(0), g(1), . . . , g(2N)], p being a scalar value; or

2N+2, in response to the non-zero coefficients represented as [f(0), f(1), . . . , f(2N+1)] being a convolution of p· [g(0), g(1), . . . , g(2N)] and [1, 1], and

wherein g(0)=g(2N), g(1)=g(2N−1), . . . and g(N−1)=g(N+1), wherein values of g(0), g(1), . . . , g(N) correspond to values between 0 to π/2, and wherein g(i)=cos (i), 0≤i≤N, and 0≤θi≤π/2.

17. The apparatus of claim 15 , wherein the convolutional modulation comprises a multi-path delay operation, and wherein the multi-path delay operation includes a circular delay in which elements in the intermediate sequence are shifted in time domain in a circular manner or a linear delay in which elements in the intermediate sequence are shifted in time domain in a linear manner.

18. The apparatus of claim 15 , wherein demodulating the received sequence comprises:

combining, using the non-zero coefficients, adjacent elements of the received sequence to determine a corresponding element in the input sequence.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 10, 2022
From: XIN, YU; XU, JUN; YU, GUANGHUI; HUA, JIAN
To: ZTE CORPORATION
Reel/Frame 060172/0780 →
Continuity (2)
Continuation PCTCN2019125218 · Dec 13, 2019
Related Publication 20220385513A1 · Dec 1, 2022