IP Library › Granted Patent US 12,513,034
Granted Patent B2
US 12,513,034 · App. 18/696,904 · Granted Dec 30, 2025

Data transmission method, data modulation method, and electronic device and storage medium

Inventors: Yu Xin (Shenzhen, CN); Guanghui Yu (Shenzhen, CN); Tong Bao (Shenzhen, CN); Jin Xu (Shenzhen, CN); Liujun Hu (Shenzhen, CN)
Assignee: ZTE CORPORATION
H04L27/2628H04L27/26136H04L27/26362H04L27/2666
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,513,034
App. No.
18/696,904
Granted
Dec 30, 2025
Kind
B2
Abstract

A data transmission method includes transmitting to-be-transmitted data in N frequency domain resource blocks, where each of the N frequency domain resource blocks includes K(n) subcarriers, where n=1, 2, . . . , N, N is greater than or equal to 1, and K(n) is greater than or equal to 1; performing inverse Fourier transform and an upsampling operation on the to-be-transmitted data in each of the N frequency domain resource blocks to form N groups of data sequences; and transmitting the N groups of data sequences.

Claims (48)

1 . A data transmission method, comprising:

transmitting to-be-transmitted data in N frequency domain resource blocks, wherein an n-th frequency domain resource block of the N frequency domain resource blocks comprises K(n) subcarriers, wherein n=1, 2, . . . , N, N is greater than or equal to 1, and the K(n) is greater than or equal to 1;

performing an inverse Fourier transform and an upsampling operation on to-be-transmitted data in each of the N frequency domain resource blocks to form N groups of data sequences; and

transmitting the N groups of data sequences;

after performing the inverse Fourier transform and the upsampling operation on the to-be-transmitted data in each of the N frequency domain resource blocks, the method further comprises: performing filtering on the N groups of data sequences, wherein the filtering comprises time domain convolution filtering; and

after performing the filtering on the N groups of data sequences, the method further comprises: performing a dot multiply operation on the N groups of data sequences, wherein a to-be-multiplied sequence which is multiplied by the N groups of data sequences in the dot multiply operation comprises a sequence of data of which modulo are equal and phases sequentially change by a same value θ(n), wherein different blocks of the N frequency domain resource blocks correspond to different values of θ(n).

2 . The method of claim 1 , wherein filtering function parameters used by different ones of the N frequency domain resource blocks are different.

3 . The method of claim 1 , wherein a function for the filtering is multiplied, and a to-be-multiplied sequence comprises the sequence of data of which modulo are equal and phases sequentially change by the same value θ(n), wherein different blocks of the N frequency domain resource blocks use different values of θ(n).

4 . The method of claim 1 , wherein transmitting the N groups of data sequences comprises:

in a case where N is greater than 1, adding the N groups of data sequences as a first data sequence; and

transmitting the first data sequence.

5 . The method of claim 1 , wherein the method further comprises one of:

a ratio of numbers of subcarriers of any two of the N frequency domain resource blocks satisfies 2 to a power of i, wherein i is an integer; or

a number of inverse Fourier transform points of the inverse Fourier transform is less than or equal to a sum of numbers of subcarriers comprised in the N frequency domain resource blocks.

6 . The method of claim 1 , wherein a number K(n) of subcarriers on at least one of the N frequency domain resource blocks does not satisfy 2 to a power of i, and oversampling inverse Fourier transform is used so that a number of inverse Fourier transform points is 2 to a power of i, and the N frequency domain resource blocks use a same number of inverse Fourier transform points.

7 . The method of claim 1 , wherein performing the inverse Fourier transform on the to-be-transmitted data on each of the N frequency domain resource blocks comprises:

in a case where adjacent subcarrier spacings of the N frequency domain resource blocks are equal, but numbers of subcarriers comprised in the N frequency domain resource blocks are not equal, oversampling inverse Fourier transform is used so that a number of inverse Fourier transform points is 2 to a power of i, and the N frequency domain resource blocks use a same number of inverse Fourier transform points.

8 . An electronic device, comprising:

at least one processor; and

a memory configured to store at least one program;

wherein when executed by the at least one processor, the at least one program causes the at least one processor to perform the data transmission method of claim 1 .

9 . A non-transitory computer-readable storage medium, storing at least one program executable by at least one processor to perform the data transmission method of claim 1 .

10 . A data modulation method, comprising:

dividing to-be-transmitted data into N groups of data sets, wherein an n-th group of the N groups of data sets comprises K(n) pieces of to-be-transmitted data, wherein n=1, 2, . . . , N, a value of N is greater than or equal to 1, and a value of K(n) is greater than or equal to 1;

performing an inverse Fourier transform and an upsampling operation on each of the N groups of data sets to form N groups of data sequences; and

transmitting the N groups of data sequences;

after performing the inverse Fourier transform and the upsampling operation on each of the N groups of data sets, the method further comprises: performing filtering on the N groups of data sequences, wherein the filtering comprises time domain convolution filtering; and

after performing the filtering on the N groups of data sequences, the method further comprises: performing a dot multiply operation on the N groups of data sequences, wherein a to-be-multiplied sequence which is multiplied by the N groups of data sequences in the dot multiply operation comprises a sequence of data of which modulo are equal and phases sequentially change by a same value θ(n), wherein different data sets of the N groups of data sets correspond to different values of θ(n).

11 . The method of claim 10 , wherein a function for the filtering is multiplied, and a to-be-multiplied sequence comprises the sequence of data of which modulo are equal and phases sequentially change by the same value θ(n), wherein different data sets of the N groups of data sets use different values of θ(n).

12 . The method of claim 10 , wherein transmitting the N groups of data sequences comprises:

in a case where N is greater than 1, adding the N groups of data sequences as a first data sequence; and

transmitting the first data sequence.

13 . The method of claim 10 , wherein the method further comprises one of:

the N groups of data sets comprise different numbers of pieces of to-be-transmitted data; or

a number of pieces of to-be-transmitted data comprised in at least one group of the N groups of data sets does not satisfy 2 to a power of i, and oversampling inverse Fourier transform is used so that a number of inverse Fourier transform points is 2 to a power of i, and the N groups of data sets use a same number of inverse Fourier transform points.

14 . An electronic device, comprising:

at least one processor; and

a memory configured to store at least one program;

wherein when executed by the at least one processor, the at least one program causes the at least one processor to perform the data modulation method of claim 10 .

15 . A data transmission method, comprising:

transmitting to-be-transmitted data in N frequency domain resource blocks, wherein an n-th frequency domain resource block of the N frequency domain resource blocks comprises K(n) subcarriers, wherein n=1, 2, . . . , N, a value of N is greater than or equal to 1, and a value of the K(n) is greater than or equal to 1;

performing an inverse Fourier transform on to-be-transmitted data in each of the N frequency domain resource blocks to form N groups of data sequences; and

transmitting the N groups of data sequences;

wherein a number K(n) of subcarriers on at least one of the N frequency domain resource blocks does not satisfy 2 to a power of i, and oversampling inverse Fourier transform is used so that a number of inverse Fourier transform points is 2 to the power of i, and the N frequency domain resource blocks use a same number of inverse Fourier transform points, wherein i is an integer, and the number of inverse Fourier transform points is less than or equal to a sum of numbers of subcarriers comprised in the N frequency domain resource blocks.

16 . An electronic device, comprising:

at least one processor; and

a memory configured to store at least one program;

wherein when executed by the at least one processor, the at least one program causes the at least one processor to perform the data transmission method of claim 15 .

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 17, 2024
From: XIN, YU; YU, GUANGHUI; BAO, TONG; XU, JIN; HU, LIUJUN
To: ZTE CORPORATION
Reel/Frame 067446/0582 →
Priority Claims (1)
CN 202111151590.4 · Sep 29, 2021 · national
Continuity (1)
Related Publication 20250039029A1 · Jan 30, 2025
References Cited (38)
US 5917919A · Rosenthal · 1999 [cited by examiner]
US 5987005A · Fertner · 1999 [cited by examiner]
US 6381263B1 · Suzuki · 2002 [cited by examiner]
US 7280469B2 · Jin · 2007 [cited by examiner]
US 9998304B1 · Polydoros et al. · 2018 [cited by applicant]
US 10535356B2 · Fuchs · 2020 [cited by examiner]
US 11616676B1 · Patchava · 2023 [cited by examiner]
US 20020154686A1 · Ginesi · 2002 [cited by examiner]
US 20090245422A1 · Sampath · 2009 [cited by examiner]
US 20130281148A1 · Seyama · 2013 [cited by examiner]
US 20140093255A1 · Liu · 2014 [cited by examiner]
US 20140099116A1 · Bai · 2014 [cited by examiner]
US 20160352543A1 · Hu · 2016 [cited by examiner]
US 20170237596A1 · Wild · 2017 [cited by examiner]
US 20180278397A1 · Park · 2018 [cited by examiner]
US 20180331871A1 · Martinez · 2018 [cited by examiner]
US 20190020522A1 · Sun · 2019 [cited by examiner]
US 20190132177A1 · Wang · 2019 [cited by examiner]
US 20190379437A1 · Park · 2019 [cited by examiner]
US 20200052948A1 · Sahin · 2020 [cited by examiner]
US 20200244503A1 · Bala · 2020 [cited by examiner]
US 20210014094A1 · Nadal · 2021 [cited by examiner]
US 20210242952A1 · Lanneer · 2021 [cited by examiner]
US 20210288859A1 · Radosevic · 2021 [cited by examiner]
US 20210399932A1 · Laporte · 2021 [cited by examiner]
US 20220158755A1 · Lee · 2022 [cited by examiner]
US 20220271983A1 · Ma · 2022 [cited by examiner]
US 20230246677A1 · Liu · 2023 [cited by examiner]
US 20240275658A1 · Li · 2024 [cited by examiner]
US 20250039029A1 · Xin · 2025 [cited by examiner]
CN 106470179A · 2017 [cited by applicant]
CN 107743314A · 2018 [cited by applicant]
CN 110870270A · 2020 [cited by applicant]
CN 112449429A · 2021 [cited by applicant]
CN 113169947A · 2021 [cited by applicant]
GB 2557209B2 · 2018 [cited by applicant]
International Search Report in Application No. PCT/CN2022/120224, dated Sep. 21, 2022, 4 pages, including translation. [cited by applicant]
Extended European Search Report in Application No. 22874738.2, dated Sep. 15, 2025, 11 pages. [cited by applicant]
Cited By (1)
US 12,627,551