# US 11,121,900 B2 · Discrete Fourier transform size decomposition > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 11,121,900 B2 - Document ID: US11121900B2 - Status: Granted - Kind: B2 - Application number: 16/834,421 - Filed: 2020-03-30 - Published: 2020-11-05 - Granted: 2021-09-14 - Earliest claimed: 2019-05-03 - Assignees: QUALCOMM Incorporated - Applicants: QUALCOMM Incorporated - Inventors: Yi Huang; Peter Gaal; Xiao Feng Wang; Wanshi Chen - Web page: https://patentgrep.com/patent/US11121900B2 ## CPC - H04L 27/2636: {with FFT or DFT modulators, e.g. standard single-carrier frequency-division multiple access [SC-FDMA] transmitter or DFT spread orthogonal frequency division multiplexing [DFT-SOFDM]} - G06F 17/141: {Discrete Fourier transforms} - G06F 17/18: for evaluating statistical data {, e.g. average values, frequency distributions, probability functions, regression analysis (forecasting specially adapted for a specific administrative, business or logistic context G06Q10/04)} - H03F 3/20: Power amplifiers, e.g. Class B amplifiers, Class C amplifiers (H03F3/26 - H03F3/30 take precedence) - H04B 1/711: the interference being multi-path interference - H04J 11/003: {at the transmitter (transmission to multiple receive units in multiple input multiple output [MIMO] H04B7/0452; transmit antenna weighting H04B7/0615)} - H04L 5/0023: {Time-frequency-space} - H04L 5/0046: {Determination of the number of bits transmitted on different sub-channels} - H04L 5/0062: {Avoidance of ingress interference, e.g. ham radio channels} - H04L 27/2651: {Modification of fast Fourier transform [FFT] or discrete Fourier transform [DFT] demodulators for performance improvement} - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - H03F: AMPLIFIERS - H04B: TRANSMISSION - H04J: MULTIPLEX COMMUNICATION (transmission in general H04B; peculiar to transmission of digital information H04L5/00; systems for the simultaneous or sequential transmission of more than one television signal H04N7/08; in exchanges H04Q11/00; stereophonic systems H04S) ## Abstract Various aspects of the present disclosure generally relate to wireless communication. In some aspects, a user equipment (UE) may determine, based at least in part on a decomposition rule for a discrete Fourier transform (DFT) block, a plurality of decomposition groups for tones, corresponding to a plurality of antenna ports of the UE, of a transmission. The UE may map the tones to the plurality of decomposition groups for transmission processing, and transmit, using the plurality of antenna ports, the transmission based at least in part on transmission processing. Numerous other aspects are provided. ## Claims ### Claim 1 A method of wireless communication performed by a user equipment (UE), comprising: determining, based at least in part on a decomposition rule for a discrete Fourier transform (DFT) block, a plurality of decomposition groups for tones, corresponding to a plurality of antenna ports of the UE, of a transmission, wherein respective sizes of the plurality of decomposition groups are selected such that a total size of the plurality of decomposition groups is equivalent to a size of the DFT block, the respective sizes of the plurality of decomposition groups and the size of the DFT block each satisfy a size constraint, and the respective sizes of the plurality of decomposition groups each satisfy a size balancing criterion; mapping the tones to the plurality of decomposition groups for transmission processing; and transmitting, using the plurality of antenna ports, the transmission based at least in part on transmission processing. ### Claim 2 (depends on 1) The method of claim 1, wherein the plurality of antenna ports correspond to a plurality non-coherent antennas. ### Claim 3 (depends on 1) The method of claim 1, wherein the size constraint is defined based at least in part on an equation: N=Aα*Bβ*Cγ, where N is a particular size that satisfies the size constraint, A, B, and C are size factors, and α, β, γ are non-negative integers. ### Claim 4 (depends on 1) The method of claim 1, wherein the size constraint is defined based at least in part on an equation: N=2α*ββ*5γ, where N is a particular size that satisfies the size constraint and α, β, γ are non-negative integers. ### Claim 5 (depends on 1) The method of claim 1, wherein determining the plurality of decomposition groups comprises: determining whether a particular size that satisfies the size constraint is a multiple of a pre-configured group size factor; and determining the respective sizes for the plurality of decomposition groups based at least in part on whether the particular size that satisfies the size constraint is the multiple of the pre-configured group size factor. ### Claim 6 (depends on 1) The method of claim 1, wherein the size balancing criterion is related to a quantity of decomposition groups of the plurality of decomposition groups. ### Claim 7 (depends on 1) The method of claim 1, wherein a difference between the respective sizes of the plurality of decomposition groups satisfies the size balancing criterion. ### Claim 8 (depends on 1) The method of claim 1, wherein determining the plurality of decomposition groups comprises: determining a plurality of possible decomposition group results for the plurality of decomposition groups; and selecting a particular possible decomposition group result for the plurality of decomposition groups based at least in part on a standard deviation of the respective sizes of the plurality of decomposition groups for the particular possible decomposition group result. ### Claim 9 (depends on 8) The method of claim 8, further comprising: normalizing the particular possible decomposition group result; and wherein selecting the particular possible decomposition group result comprises: selecting the particular possible decomposition group result based at least in part on the standard deviation of the respective sizes of the plurality of decomposition groups for the particular possible decomposition group result after normalizing the particular possible decomposition group result. ### Claim 10 (depends on 1) The method of claim 1, further comprising: determining the plurality of decomposition groups based at least in part on at least one of a set of DFT size ratios or a set of antenna power amplifier ratios. ### Claim 11 (depends on 10) The method of claim 10, wherein the set of DFT size ratios is a set of normalized DFT size ratios. ### Claim 12 (depends on 10) The method of claim 10, wherein the set of antenna power amplifier ratios is a set of normalized antenna power amplifier ratios. ### Claim 13 (depends on 1) The method of claim 1, wherein the size balancing criterion is a balanced size balancing criterion or an unbalanced size balancing criterion. ### Claim 14 (depends on 1) The method of claim 1, wherein the plurality of antenna ports are associated with a common power amplifier value or a plurality of different power amplifier values. ### Claim 15 (depends on 14) The method of claim 14, wherein the size balancing criterion is based at least in part on the common power amplifier value or the plurality of different power amplifier values. ### Claim 16 A user equipment (UE) for wireless communication, comprising: a memory; and one or more processors operatively coupled to the memory, the memory and the one or more processors configured to: determine, based at least in part on a decomposition rule for a discrete Fourier transform (DFT) block, a plurality of decomposition groups for tones, corresponding to a plurality of antenna ports of the UE, of a transmission, wherein respective sizes of the plurality of decomposition groups are selected such that a total size of the plurality of decomposition groups is equivalent to a size of the DFT block, the respective sizes of the plurality of decomposition groups and the size of the DFT block each satisfy a size constraint, and the respective sizes of the plurality of decomposition groups each satisfy a size balancing criterion; map the tones to the plurality of decomposition groups for transmission processing; and transmit, using the plurality of antenna ports, the transmission based at least in part on transmission processing. ### Claim 17 (depends on 16) The UE of claim 16, wherein the plurality of antenna ports correspond to a plurality non-coherent antennas. ### Claim 18 (depends on 16) The UE of claim 16, wherein the size constraint is defined based at least in part on an equation: N=Aα*Bβ*Cγ, where N is a particular size that satisfies the size constraint, A, B, and C are size factors, and α, β, γ are non-negative integers. ### Claim 19 (depends on 16) The UE of claim 16, wherein the size constraint is defined based at least in part on an equation: N=2α*3β*5γ, where N is a particular size that satisfies the size constraint and α, β, γ are non-negative integers. ### Claim 20 (depends on 16) The UE of claim 16, wherein the one or more processors, when determining the plurality of decomposition groups, are to: determine whether a particular size that satisfies the size constraint is a multiple of a pre-configured group size factor; and determine the respective sizes for the plurality of decomposition groups based at least in part on whether the particular size that satisfies the size constraint is the multiple of the pre-configured group size factor. ### Claim 21 (depends on 16) The UE of claim 16, wherein the size balancing criterion is related to a quantity of decomposition groups of the plurality of decomposition groups. ### Claim 22 A non-transitory computer-readable medium storing one or more instructions for wireless communication, the one or more instructions comprising: one or more instructions that, when executed by one or more processors of a user equipment (UE), cause the one or more processors to: determine, based at least in part on a decomposition rule for a discrete Fourier transform (DFT) block, a plurality of decomposition groups for tones, corresponding to a plurality of antenna ports of the UE, of a transmission, wherein respective sizes of the plurality of decomposition groups are selected such that a total size of the plurality of decomposition groups is equivalent to a size of the DFT block, the respective sizes of the plurality of decomposition groups and the size of the DFT block each satisfy a size constraint, and the respective sizes of the plurality of decomposition groups each satisfy a size balancing criterion; map the tones to the plurality of decomposition groups for transmission processing; and transmit, using the plurality of antenna ports, the transmission based at least in part on transmission processing. ### Claim 23 (depends on 22) The non-transitory computer-readable medium of claim 22, wherein the plurality of antenna ports correspond to a plurality non-coherent antennas. ### Claim 24 (depends on 22) The non-transitory computer-readable medium of claim 22, wherein the size constraint is defined based at least in part on an equation: N=Aα*Bβ*Cγ, where N is a particular size that satisfies the size constraint, A, B, and C are size factors, and α, β, γ are non-negative integers. ### Claim 25 (depends on 22) The non-transitory computer-readable medium of claim 22, wherein the size constraint is defined based at least in part on an equation: N=2α*3β*5γ, where N is a particular size that satisfies the size constraint and α, β, γ are non-negative integers. ### Claim 26 (depends on 22) The non-transitory computer-readable medium of claim 22, wherein the one or more instructions, that cause the one or more processors to determine the plurality of decomposition groups, cause the one or more processors to: determine whether a particular size that satisfies the size constraint is a multiple of a pre-configured group size factor; and determine the respective sizes for the plurality of decomposition groups based at least in part on whether the particular size that satisfies the size constraint is the multiple of the pre-configured group size factor. ### Claim 27 (depends on 22) The non-transitory computer-readable medium of claim 22, wherein the size balancing criterion is related to a quantity of decomposition groups of the plurality of decomposition groups. ### Claim 28 An apparatus for wireless communication, comprising: means for determining, based at least in part on a decomposition rule for a discrete Fourier transform (DFT) block, a plurality of decomposition groups for tones, corresponding to a plurality of antenna ports of a user equipment (UE), of a transmission, wherein respective sizes of the plurality of decomposition groups are selected such that a total size of the plurality of decomposition groups is equivalent to a size of the DFT block, the respective sizes of the plurality of decomposition groups and the size of the DFT block each satisfy a size constraint, and the respective sizes of the plurality of decomposition groups each satisfy a size balancing criterion; means for mapping the tones to the plurality of decomposition groups for transmission processing; and means for transmitting, using the plurality of antenna ports, the transmission based at least in part on transmission processing. ### Claim 29 (depends on 28) The apparatus of claim 28, wherein the plurality of antenna ports correspond to a plurality non-coherent antennas. ### Claim 30 (depends on 28) The apparatus of claim 28, wherein the size constraint is defined based at least in part on an equation: N=Aα*Bβ*Cγ, where N is a particular size that satisfies the size constraint, A, B, and C are size factors, and α, β, γ are non-negative integers.