IP Library › Granted Patent US 12,438,670
Granted Patent B2
US 12,438,670 · App. 18/168,030 · Granted Oct 7, 2025

Pilot transmission method and device

Inventors: Pu Yuan (Guangdong, CN); Dajie Jiang (Guangdong, CN)
Assignee: VIVO MOBILE COMMUNICATION CO., LTD.
H04L5/0051H04L27/2605H04L27/261
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,438,670
App. No.
18/168,030
Granted
Oct 7, 2025
Kind
B2
Abstract

Embodiments of this application disclose a pilot transmission method and device. The method includes: inserting, by a communications device, a pilot symbol into a first data sequence to obtain a second data sequence; and transmitting, by the communications device, the second data sequence, where the second data sequence has been subjected to faster-than-Nyquist processing.

Claims (65)

1. A pilot transmission method, wherein the method comprises:

inserting, by a communications device, a pilot symbol into a first data sequence to obtain a second data sequence; and

transmitting, by the communications device, the second data sequence, wherein the second data sequence has been subjected to faster-than-Nyquist processing;

wherein zero-level symbol(s) are arranged on at least one of two ends of the pilot symbol.

2. The method according to claim 1 , wherein after the inserting, by a communications device, a pilot symbol into a first data sequence to obtain a second data sequence, the method further comprises:

performing, by the communications device, upsampling processing on the second data sequence, wherein the faster-than-Nyquist processing comprises the upsampling processing.

3. The method according to claim 2 , wherein after the performing upsampling processing on the second data sequence, the method further comprises:

adding a zero-level symbol to the second data sequence on at least one side of the pilot symbol.

4. The method according to claim 3 , wherein the number of zero-level symbols added satisfies the following equation:

K≥L°− 2 N+ 1, wherein

K is the number of zero-level symbols added; L° is a minimum total number of the pilot symbol and zero-level symbols adjacent to the pilot symbol after the pilot symbol is inserted; and N is an upsampling factor for the upsampling processing.

5. The method according to claim 4 , wherein the minimum total number of the pilot symbol and zero-level symbols adjacent to the pilot symbol after the pilot symbol is inserted is determined using the following equation:

L

o

=

⌈

2

⁢

N

/

τ

⌉

,

wherein

τ is a time domain overlap coefficient for the faster-than-Nyquist processing.

6. The method according to claim 1 , wherein before the inserting, by a communications device, a pilot symbol into a first data sequence to obtain a second data sequence, the method further comprises:

performing, by the communications device, upsampling processing on the first data sequence, wherein the Faster-Than-Nyquist processing comprises the upsampling processing.

7. The method according to claim 6 , wherein before the performing, by the communications device, upsampling processing on the first data sequence, the method further comprises:

adding a zero-level symbol to the first data sequence at a position at which the pilot symbol is to be inserted.

8. The method according to claim 7 , wherein the number of zero-level symbols added satisfies the following equation:

q

≥

L

o

-

N

+

1

N

,

wherein

q is the number of zero-level symbols added; L° is a minimum total number of the pilot symbol and zero-level symbols adjacent to the pilot symbol after the pilot symbol is inserted; and N is an upsampling factor for the upsampling processing.

9. The method according to claim 1 , wherein in a case that zero-level symbols are arranged at both ends of the pilot symbol, the zero-level symbols at two ends of the pilot symbol are equal in quantity, or the zero-level symbols at two ends of the pilot symbol differ by 1 in quantity.

10. The method according to claim 1 , wherein the second data sequence is transmitted in a first sub-frame, the first sub-frame comprising a guard gap, the pilot symbol, and a data segment.

11. The method according to claim 10 , wherein a frame structure in which the first sub-frame is located comprises a plurality of such first sub-frames, each of the first sub-frames comprising one such guard gap, one such pilot symbol, and one such data segment.

12. The method according to claim 11 , wherein the frame structure further comprises a second sub-frame, wherein the second sub-frame is located in a header of the frame structure, and the second sub-frame is used for transmitting a synchronization signal burst.

13. A communications device, comprising a processor, a memory, and a program or instructions stored in the memory and capable of running on the processor, wherein when the program or the instructions are executed by the processor, a pilot transmission method is implemented, wherein the pilot transmission method comprises:

inserting, by the communications device, a pilot symbol into a first data sequence to obtain a second data sequence; and

transmitting, by the communications device, the second data sequence, wherein the second data sequence has been subjected to faster-than-Nyquist processing;

wherein zero-level symbol(s) are arranged on at least one of two ends of the pilot symbol.

14. The communications device according to claim 13 , wherein after the inserting, by a communications device, a pilot symbol into a first data sequence to obtain a second data sequence, the method further comprises:

performing, by the communications device, upsampling processing on the second data sequence, wherein the faster-than-Nyquist processing comprises the upsampling processing.

15. The communications device according to claim 14 , wherein after the performing upsampling processing on the second data sequence, the method further comprises:

adding a zero-level symbol to the second data sequence on at least one side of the pilot symbol.

16. The communications device according to claim 15 , wherein the number of zero-level symbols added satisfies the following equation:

K≥L°− 2 N+ 1, wherein

K is the number of zero-level symbols added; L° is a minimum total number of the pilot symbol and zero-level symbols adjacent to the pilot symbol after the pilot symbol is inserted; and N is an upsampling factor for the upsampling processing.

17. The communications device according to claim 13 , wherein before the inserting, by a communications device, a pilot symbol into a first data sequence to obtain a second data sequence, the method further comprises:

performing, by the communications device, upsampling processing on the first data sequence, wherein the Faster-Than-Nyquist processing comprises the upsampling processing.

18. The communications device according to claim 17 , wherein before the performing, by the communications device, upsampling processing on the first data sequence, the method further comprises:

adding a zero-level symbol to the first data sequence at a position at which the pilot symbol is to be inserted.

19. A non-transitory readable storage medium, wherein the non-transitory readable storage medium stores a program or instructions, and when the program or the instructions are executed by a processor, a pilot transmission method is implemented, wherein the pilot transmission method comprises:

inserting a pilot symbol into a first data sequence to obtain a second data sequence; and

transmitting the second data sequence, wherein the second data sequence has been subjected to faster-than-Nyquist processing;

wherein zero-level symbol(s) are arranged on at least one of two ends of the pilot symbol.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 13, 2023
From: YUAN, PU; JIANG, DAJIE
To: VIVO MOBILE COMMUNICATION CO., LTD.
Reel/Frame 062673/0783 →
Priority Claims (1)
CN 202010859876.7 · Aug 24, 2020 · national
Continuity (2)
Continuation PCTCN2021114278 · Aug 24, 2021
Related Publication 20230188295A1 · Jun 15, 2023
References Cited (15)
US 5692013A · Koslov et al. · 1997 [cited by applicant]
US 9780975B1 · Kwak · 2017 [cited by examiner]
US 20150263822A1 · Abdoli et al. · 2015 [cited by applicant]
US 20170126451A1 · Kim · 2017 [cited by examiner]
US 20180205578A1 · Kwak et al. · 2018 [cited by applicant]
US 20190313378A1 · Abdoli · 2019 [cited by examiner]
US 20220263698A1 · Harada · 2022 [cited by examiner]
CN 104394110A · 2015 [cited by applicant]
CN 106464443A · 2017 [cited by applicant]
CN 206775509U · 2017 [cited by applicant]
CN 110266617A · 2019 [cited by applicant]
CN 110380994A · 2019 [cited by applicant]
CN 110545142A · 2019 [cited by applicant]
CN 111327551A · 2020 [cited by applicant]
Hefnawy, et al., “Overview of Faster-Than-Nyquist for Future Mobile Communication Systems”, DOCOMO Communications Laboratories Europe GmbH, IEEE, Munich, Germany, 2013. [cited by applicant]