# US 2010/0165829 A1 · Methods and systems for papr reduction in sc-fdma systems

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0165829 A1
- Document ID: US20100165829A1
- Status: Published application
- Kind: A1
- Application number: 12/425,486
- Filed: 2009-04-17
- Published: 2010-07-01
- Earliest claimed: 2008-12-31
- Assignees: QUALCOMM Incorporated
- Inventors: Madihally J. Narasimha; Je Woo Kim; Yuanning Yu; Jong Hyeon Park
- Web page: https://patentgrep.com/patent/US20100165829A1

## CPC

- H04L 27/2614: {Peak power aspects}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Certain embodiments of the present disclosure relate to methods for peak-to-average power ratio (PAPR) reduction of a transmission signal in a single carrier frequency division multiple access (SC-FDMA) system. The proposed methods and systems are based on manipulations of an SC-FDMA transmission signal in a time- and/or a frequency-domain.

## Claims

### Claim 1

A transmission method for a communication system using single carrier frequency division multiple access (SC-FDMA), comprising:
performing a serial-to-parallel conversion of modulated symbols of data to obtain a first sequence of samples;
performing a time-to-frequency transform on the first sequence of samples to obtain a second sequence of samples;
performing a frequency-domain manipulation of the second sequence of samples to obtain a third sequence of samples;
performing a frequency-to-time transform on the third sequence of samples to obtain a fourth sequence of samples, where a number of samples of the fourth sequence is greater than a number of samples of the second sequence;
performing a parallel-to-serial conversion of the fourth sequence of samples to obtain a fifth sequence of samples; and
transmitting the fifth sequence of samples over a wireless channel.

### Claim 2 (depends on 1)

The method of claim 1, wherein:
performing the transform on the first sequence of samples to obtain the second sequence of samples comprises performing a fast Fourier transform (FFT); and
performing the transform on the third sequence of samples to obtain the fourth sequence of samples comprises performing an inverse fast Fourier transform (IFFT).

### Claim 3 (depends on 1)

The method of claim 1, wherein performing the frequency-domain manipulation of the second sequence of samples to obtain the third sequence of samples comprises permuting samples of the second sequence.

### Claim 4 (depends on 3)

The method of claim 3, wherein permuting samples of the second sequence comprises right cyclic shifting of samples of the second sequence.

### Claim 5 (depends on 1)

The method of claim 1, wherein performing the frequency-domain manipulation of the second sequence of samples to obtain the third sequence of samples comprises permuting samples of the second sequence, expanding a bandwidth of the permuted samples of the second sequence, and filtering permuted samples of the second sequence with the expanded bandwidth, and wherein a number of samples of the third sequence is greater than the number of samples of the second sequence.

### Claim 6 (depends on 5)

The method of claim 5, wherein filtering comprises a Root-Raised-Cosine (RRC) filtering.

### Claim 7

A transmission method for a communication system using single carrier frequency division multiple access (SC-FDMA), comprising:
performing a serial-to-parallel conversion of modulated symbols of data to obtain a first sequence of samples;
performing a time-domain manipulation of the first sequence of samples to obtain a second sequence of samples;
performing a time-to-frequency transform on the second sequence of samples to obtain a third sequence of samples;
performing a frequency-domain manipulation of the third sequence of samples to obtain a fourth sequence of samples;
performing a frequency-to-time transform on the fourth sequence of samples to obtain a fifth sequence of samples, where a number of samples of the fifth sequence is greater than a number of samples of the third sequence;
performing a parallel-to-serial conversion of the fifth sequence of samples to obtain a sixth sequence of samples; and
transmitting the sixth sequence of samples over a wireless channel.

### Claim 8 (depends on 7)

The method of claim 7, wherein:
performing the transform on the second sequence of samples to obtain the third sequence of samples comprises performing a fast Fourier transform (FFT); and
performing the transform on the fourth sequence of samples to obtain the fifth sequence of samples comprises performing an inverse fast Fourier transform (IFFT).

### Claim 9 (depends on 7)

The method of claim 7, wherein performing the time-domain manipulation of the first sequence of samples to obtain the second sequence of samples comprises rotating phases of samples of the first sequence, and wherein performing the frequency-domain manipulation of the third sequence of samples to obtain the fourth sequence of samples of the third sequence with the expanded bandwidth.

### Claim 10 (depends on 9)

The method of claim 9, wherein a number of samples of the fourth sequence is greater than the number of samples of the third sequence.

### Claim 11 (depends on 9)

The method of claim 9, wherein filtering comprises a Root-Raised-Cosine (RRC) filtering.

### Claim 12 (depends on 7)

The method of claim 7, wherein performing the time-domain manipulation of the first sequence of samples to obtain the second sequence of samples comprises oversampling and continuous phase modulation of samples of the first sequence, and wherein performing the frequency-domain manipulation of the third sequence of samples to obtain the fourth sequence of samples comprises reducing a bandwidth of samples of the third sequence and filtering samples of the third sequence with the reduced bandwidth.

### Claim 13 (depends on 12)

The method of claim 12, wherein a number of samples of the second sequence is greater than a number of samples of the first sequence, and wherein a number of samples of the fourth sequence is smaller than the number of samples of the third sequence.

### Claim 14 (depends on 12)

The method of claim 12, wherein filtering comprises a Root-Raised-Cosine (RRC) filtering.

### Claim 15

An apparatus for a communication system using single carrier frequency division multiple access (SC-FDMA), comprising:
logic for performing a serial-to-parallel conversion of modulated symbols of data to obtain a first sequence of samples;
logic for performing a time-to-frequency transform on the first sequence of samples to obtain a second sequence of samples;
logic for performing a frequency-domain manipulation of the second sequence of samples to obtain a third sequence of samples;
logic for performing a frequency-to-time transform on the third sequence of samples to obtain a fourth sequence of samples, where a number of samples of the fourth sequence is greater than a number of samples of the second sequence;
logic for performing a parallel-to-serial conversion of the fourth sequence of samples to obtain a fifth sequence of samples; and
logic for transmitting the fifth sequence of samples over a wireless channel.

### Claim 16 (depends on 15)

The apparatus of claim 15, wherein:
the logic for performing the transform on the first sequence of samples to obtain the second sequence of samples comprises logic for performing a fast Fourier transform (FFT); and
the logic for performing the transform on the third sequence of samples to obtain the fourth sequence of samples comprises logic for performing an inverse fast Fourier transform (IFFT).

### Claim 17 (depends on 15)

The apparatus of claim 15, wherein the logic for performing the frequency-domain manipulation of the second sequence of samples to obtain the third sequence of samples comprises logic for permuting samples of the second sequence.

### Claim 18 (depends on 17)

The apparatus of claim 17, wherein the logic for permuting samples of the second sequence comprises logic for right cyclic shifting of samples of the second sequence.

### Claim 19 (depends on 15)

The apparatus of claim 15, wherein the logic for performing the frequency-domain manipulation of the second sequence of samples to obtain the third sequence of samples comprises logic for permuting samples of the second sequence, expanding a bandwidth of the permuted samples of the second sequence, and filtering permuted samples of the second sequence with the expanded bandwidth, and wherein a number of samples of the third sequence is greater than the number of samples of the second sequence.

### Claim 20 (depends on 19)

The apparatus of claim 19, wherein the logic for filtering comprises logic for Root-Raised-Cosine (RRC) filtering.

### Claim 21

An apparatus for a communication system using single carrier frequency division multiple access (SC-FDMA), comprising:
logic for performing a serial-to-parallel conversion of modulated symbols of data to obtain a first sequence of samples;
logic for performing a time-domain manipulation of the first sequence of samples to obtain a second sequence of samples;
logic for performing a time-to-frequency transform on the second sequence of samples to obtain a third sequence of samples;
logic for performing a frequency-domain manipulation of the third sequence of samples to obtain a fourth sequence of samples;
logic for performing a frequency-to-time transform on the fourth sequence of samples to obtain a fifth sequence of samples, where a number of samples of the fifth sequence is greater than a number of samples of the third sequence;
logic for performing a parallel-to-serial conversion of the fifth sequence of samples to obtain a sixth sequence of samples; and
logic for transmitting the sixth sequence of samples over a wireless channel.

### Claim 22 (depends on 21)

The apparatus of claim 21, wherein:
the logic for performing the transform on the second sequence of samples to obtain the third sequence of samples comprises logic for performing a fast Fourier transform (FFT); and
the logic for performing the transform on the fourth sequence of samples to obtain the fifth sequence of samples comprises logic for performing an inverse fast Fourier transform (IFFT).

### Claim 23 (depends on 21)

The apparatus of claim 21, wherein the logic for performing the time-domain manipulation of the first sequence of samples to obtain the second sequence of samples comprises logic for rotating phases of samples of the first sequence, and wherein the logic for performing the frequency-domain manipulation of the third sequence of samples to obtain the fourth sequence of samples comprises logic for expanding a bandwidth of samples of the third sequence and filtering samples of the third sequence with the expanded bandwidth.

### Claim 24 (depends on 23)

The apparatus of claim 23, wherein a number of samples of the fourth sequence is greater than the number of samples of the third sequence.

### Claim 25 (depends on 23)

The apparatus of claim 23, wherein the logic for filtering comprises logic for Root-Raised-Cosine (RRC) filtering.

### Claim 26 (depends on 21)

The apparatus of claim 21, wherein the logic for performing the time-domain manipulation of the first sequence of samples to obtain the second sequence of samples comprises logic for oversampling and continuous phase modulation of samples of the first sequence, and wherein the logic for performing the frequency-domain manipulation of the third sequence of samples to obtain the fourth sequence of samples comprises logic for reducing a bandwidth of samples of the third sequence and filtering samples of the third sequence with the reduced bandwidth.

### Claim 27 (depends on 26)

The apparatus of claim 26, wherein a number of samples of the second sequence is greater than a number of samples of the first sequence, and wherein a number of samples of the fourth sequence is smaller than the number of samples of the third sequence.

### Claim 28 (depends on 26)

The apparatus of claim 26, wherein the logic for filtering comprises logic for Root-Raised-Cosine (RRC) filtering.

### Claim 29

An apparatus for a communication system using single carrier frequency division multiple access (SC-FDMA), comprising:
means for performing a serial-to-parallel conversion of modulated symbols of data to obtain a first sequence of samples;
means for performing a time-to-frequency transform on the first sequence of samples to obtain a second sequence of samples;
means for performing a frequency-domain manipulation of the second sequence of samples to obtain a third sequence of samples;
means for performing a frequency-to-time transform on the third sequence of samples to obtain a fourth sequence of samples, where a number of samples of the fourth sequence is greater than a number of samples of the second sequence;
means for performing a parallel-to-serial conversion of the fourth sequence of samples to obtain a fifth sequence of samples; and
means for transmitting the fifth sequence of samples over a wireless channel.

### Claim 30 (depends on 29)

The apparatus of claim 29, wherein:
the means for performing the transform on the first sequence of samples to obtain the second sequence of samples comprises means for performing a fast Fourier transform (FFT); and
the means for performing the transform on the third sequence of samples to obtain the fourth sequence of samples comprises means for performing an inverse fast Fourier transform (IFFT).

### Claim 31 (depends on 29)

The apparatus of claim 29, wherein the means for performing the frequency-domain manipulation of the second sequence of samples to obtain the third sequence of samples comprises means for permuting samples of the second sequence.

### Claim 32 (depends on 31)

The apparatus of claim 31, wherein the means for permuting samples of the second sequence comprises means for right cyclic shifting of samples of the second sequence.

### Claim 33 (depends on 29)

The apparatus of claim 29, wherein the means for performing the frequency-domain manipulation of the second sequence of samples to obtain the third sequence of samples comprises means for permuting samples of the second sequence, expanding a bandwidth of the permuted samples of the second sequence, and filtering permuted samples of the second sequence with the expanded bandwidth, and wherein a number of samples of the third sequence is greater than the number of samples of the second sequence.

### Claim 34 (depends on 33)

The apparatus of claim 33, wherein the means for filtering comprises means for Root-Raised-Cosine (RRC) filtering.

### Claim 35

An apparatus for a communication system using single carrier frequency division multiple access (SC-FDMA), comprising:
means for performing a serial-to-parallel conversion of modulated symbols of data to obtain a first sequence of samples;
means for performing a time-domain manipulation of the first sequence of samples to obtain a second sequence of samples;
means for performing a time-to-frequency transform on the second sequence of samples to obtain a third sequence of samples;
means for performing a frequency-domain manipulation of the third sequence of samples to obtain a fourth sequence of samples;
means for performing a frequency-to-time transform on the fourth sequence of samples to obtain a fifth sequence of samples, where a number of samples of the fifth sequence is greater than a number of samples of the third sequence;
means for performing a parallel-to-serial conversion of the fifth sequence of samples to obtain a sixth sequence of samples; and
means for transmitting the sixth sequence of samples over a wireless channel.

### Claim 36 (depends on 35)

The apparatus of claim 35, wherein:
the means for performing the transform on the second sequence of samples to obtain the third sequence of samples comprises means for performing a fast Fourier transform (FFT); and
the means for performing the transform on the fourth sequence of samples to obtain the fifth sequence of samples comprises means for performing an inverse fast Fourier transform (IFFT).

### Claim 37 (depends on 35)

The apparatus of claim 35, wherein the means for performing the time-domain manipulation of the first sequence of samples to obtain the second sequence of samples comprises means for rotating phases of samples of the first sequence, and wherein the means for performing the frequency-domain manipulation of the third sequence of samples to obtain the fourth sequence of samples comprises means for expanding a bandwidth of samples of the third sequence and filtering samples of the third sequence with the expanded bandwidth.

### Claim 38 (depends on 37)

The apparatus of claim 37, wherein a number of samples of the fourth sequence is greater than the number of samples of the third sequence.

### Claim 39 (depends on 37)

The apparatus of claim 37, wherein the means for filtering comprises means for Root-Raised-Cosine (RRC) filtering.

### Claim 40 (depends on 35)

The apparatus of claim 35, wherein the means for performing the time-domain manipulation of the first sequence of samples to obtain the second sequence of samples comprises means for oversampling and continuous phase modulation of samples of the first sequence, and wherein the means for performing the frequency-domain manipulation of the third sequence of samples to obtain the fourth sequence of samples comprises means for reducing a bandwidth of samples of the third sequence and filtering samples of the third sequence with the reduced bandwidth.

### Claim 41 (depends on 40)

The apparatus of claim 40, wherein a number of samples of the second sequence is greater than a number of samples of the first sequence, and wherein a number of samples of the fourth sequence is smaller than the number of samples of the third sequence.

### Claim 42 (depends on 40)

The apparatus of claim 40, wherein the means for filtering comprises means for Root-Raised-Cosine (RRC) filtering.

### Claim 43

A computer-program product for a communication system using single carrier frequency division multiple access (SC-FDMA), comprising a computer-readable medium having instructions stored thereon, the instructions being executable by one or more processors and the instructions comprising:
instructions for performing a serial-to-parallel conversion of modulated symbols of data to obtain a first sequence of samples;
instructions for performing a time-to-frequency transform on the first sequence of samples to obtain a second sequence of samples;
instructions for performing a frequency-domain manipulation of the second sequence of samples to obtain a third sequence of samples;
instructions for performing a frequency-to-time transform on the third sequence of samples to obtain a fourth sequence of samples, where a number of samples of the fourth sequence is greater than a number of samples of the second sequence;
instructions for performing a parallel-to-serial conversion of the fourth sequence of samples to obtain a fifth sequence of samples; and
instructions for transmitting the fifth sequence of samples over a wireless channel.

### Claim 44 (depends on 43)

The computer-program product of claim 43, wherein:
the instructions for performing the transform on the first sequence of samples to obtain the second sequence of samples comprise instructions for performing a fast Fourier transform (FFT); and
the instructions for performing the transform on the third sequence of samples to obtain the fourth sequence of samples comprise instructions for performing an inverse fast Fourier transform (IFFT).

### Claim 45 (depends on 43)

The computer-program product of claim 43, wherein the instructions for performing the frequency-domain manipulation of the second sequence of samples to obtain the third sequence of samples comprise instructions for permuting samples of the second sequence.

### Claim 46 (depends on 45)

The computer-program product of claim 45, wherein the instructions for permuting samples of the second sequence comprise instructions for right cyclic shifting of samples of the second sequence.

### Claim 47 (depends on 43)

The computer-program product of claim 43, wherein the instructions for performing the frequency-domain manipulation of the second sequence of samples to obtain the third sequence of samples comprise instructions for permuting samples of the second sequence, expanding a bandwidth of the permuted samples of the second sequence, and filtering permuted samples of the second sequence with the expanded bandwidth, and wherein a number of samples of the third sequence is greater than the number of samples of the second sequence.

### Claim 48 (depends on 47)

The computer-program product of claim 47, wherein the instructions for filtering comprise instructions for Root-Raised-Cosine (RRC) filtering.

### Claim 49

A computer-program product for a communication system using single carrier frequency division multiple access (SC-FDMA), comprising a computer-readable medium having instructions stored thereon, the instructions being executable by one or more processors and the instructions comprising:
instructions for performing a serial-to-parallel conversion of modulated symbols of data to obtain a first sequence of samples;
instructions for performing a time-domain manipulation of the first sequence of samples to obtain a second sequence of samples;
instructions for performing a time-to-frequency transform on the second sequence of samples to obtain a third sequence of samples;
instructions for performing a frequency-domain manipulation of the third sequence of samples to obtain a fourth sequence of samples;
instructions for performing a frequency-to-time transform on the fourth sequence of samples to obtain a fifth sequence of samples, where a number of samples of the fifth sequence is greater than a number of samples of the third sequence;
instructions for performing a parallel-to-serial conversion of the fifth sequence of samples to obtain a sixth sequence of samples; and
instructions for transmitting the sixth sequence of samples over a wireless channel.

### Claim 50 (depends on 49)

The computer-program product of claim 49, wherein:
the instructions for performing the transform on the second sequence of samples to obtain the third sequence of samples comprise instructions for performing a fast Fourier transform (FFT); and
the instructions for performing the transform on the fourth sequence of samples to obtain the fifth sequence of samples comprise instructions for performing an inverse fast Fourier transform (IFFT).

### Claim 51 (depends on 49)

The computer-program product of claim 49, wherein the instructions for performing the time-domain manipulation of the first sequence of samples to obtain the second sequence of samples comprise instructions for rotating phases of samples of the first sequence, and wherein the instructions for performing the frequency-domain manipulation of the third sequence of samples to obtain the fourth sequence of samples comprise instructions for expanding a bandwidth of samples of the third sequence and filtering samples of the third sequence with the expanded bandwidth.

### Claim 52 (depends on 51)

The computer-program product of claim 51, wherein a number of samples of the fourth sequence is greater than the number of samples of the third sequence.

### Claim 53 (depends on 51)

The computer-program product of claim 51, wherein the instructions for filtering comprise instructions for Root-Raised-Cosine (RRC) filtering.

### Claim 54 (depends on 49)

The computer-program product of claim 49, wherein the instructions for performing the time-domain manipulation of the first sequence of samples to obtain the second sequence of samples comprise instructions for oversampling and continuous phase modulation of samples of the first sequence, and wherein the instructions for performing the frequency-domain manipulation of the third sequence of samples to obtain the fourth sequence of samples comprise instructions for reducing a bandwidth of samples of the third sequence and filtering samples of the third sequence with the reduced bandwidth.

### Claim 55 (depends on 54)

The computer-program product of claim 54, wherein a number of samples of the second sequence is greater than a number of samples of the first sequence, and wherein a number of samples of the fourth sequence is smaller than the number of samples of the third sequence.

### Claim 56 (depends on 54)

The computer-program product of claim 54, wherein the instructions for filtering comprise instructions for Root-Raised-Cosine (RRC) filtering.
