Communication method and apparatus

What is AI technical title?
AI technical title is built by Patsnap AI team. It summarizes the technical point description of the patent document.
By designing a long training field with specific sequence values for wireless LANs, the problem of excessively high PAPR of long training sequences under distributed resource units is solved, thereby improving channel estimation accuracy and system performance.

WO2026098436A1PCT designated stage Publication Date: 2026-05-15HUAWEI TECH CO LTD

View PDF 4 Cites 0 Cited by

Patent Information

Authority / Receiving Office: WO · WO
Patent Type: Applications
Current Assignee / Owner: HUAWEI TECH CO LTD
Filing Date: 2025-11-04
Publication Date: 2026-05-15

Application Information

Patent Timeline

04 Nov 2025

Application

15 May 2026

Publication

WO2026098436A1

IPC: H04L27/26

CPC: Y02D30/70; H04L27/26; H04L25/02; H04L5/00

AI Tagging

Application Domain

Baseband system details Transmission path multiple use

Technology Topics

Telecommunications Electrical and Electronics engineering

Explore More Agents

Novelty Search
Search existing technologies and assess novelty
↗
FTO
Analyze whether a product may infringe others' patents
↗
Design FTO
Check prior-design risk for exterior design
↗
Drafting
Draft patent application text based on a technical solution
↗
Find Solutions with TRIZ
Generate feasible solution to solve your technical challenge
↗

Get free access to AI patent search and analysis

Check patentability, review prior art and ask IP Agent with full patent context.

AI Technical Summary

Technical Problem

In existing wireless LAN communication, the design of long training sequences for long training fields under distributed resource units is insufficient, resulting in an excessively high peak-to-average power ratio, which affects the accuracy of channel estimation and system performance.

Method used

By using long training fields with specific sequence values, long training sequences are designed for 484-tone DRU, 242-tone DRU, 106-tone DRU, or 52-tone DRU, 26-tone DRU, to reduce the peak-to-average power ratio (PAPR) and improve the channel estimation accuracy.

Benefits of technology

By reducing the PAPR of long training sequences, the accuracy of channel estimation and system performance are improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

Figure CN2025132365_15052026_PF_FP_ABST

Patent Text Reader

Abstract

The present application relates to the technical field of communications, and in particular to a communication method and apparatus. The present application can be applied to the IEEE 802.11ax standard, 802.11be standard, 802.11bn standard, etc., and other standards of the IEEE 802.11 series, such as the 802.15 standards, the 802.11bf standard, the IMMW standards, the SparkLink standard, etc. The present application designs an LTF sequence applicable to a DRU, and the LTF sequence can have a low PAPR in different DRU transmissions.

Need to check novelty before this filing date? Find Prior Art

Description

Communication methods and devices

[0001] This application claims priority to Chinese Patent Application No. 202411587969.3, filed on November 7, 2024, entitled "Communication Method and Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communication technology, and in particular to a communication method and apparatus. Background Technology

[0003] Wireless local area networks (WLANs) have evolved through several generations of standards, including 802.11a / b / g, 802.11n, 802.11ac, 802.11ax, 802.11be, and 802.11bn. Among these, 802.11n is known as high throughput (HT), 802.11ac as very high throughput (VHT), 802.11ax as high efficient (HE), 802.11be as extremely high throughput (EHT), and 802.11bn as ultra-high reliability (UHR).

[0004] Currently, a low-power indoor (LPI) communication method is defined, imposing strict limits on the maximum transmitted power and maximum power spectral density. For example, for an access point (AP), the maximum power can be 36 dBm, and the maximum power spectral density can be 5 dBm / MHz. For a station (STA), the maximum power can be 24 dBm, and the maximum power spectral density can be -1 dBm / MHz. The device's transmit power is limited by both the maximum power and the maximum power spectral density. First, the transmit power cannot exceed the maximum power, and second, the transmit power spectral density cannot exceed the maximum power spectral density. Compared to the maximum power, the limitation on the maximum power spectral density is more stringent; the maximum transmit power is usually more heavily constrained by the maximum power spectral density. For a station, the maximum power limit stipulated by regulations is only reached when the bandwidth is at its maximum of 320 MHz. Below this bandwidth, due to the limitation on the maximum power spectral density, signals can only be transmitted at lower power. Since the power spectral density is limited, the transmission power can be improved by discretizing a finite number of subcarriers onto a wider bandwidth, i.e., more subcarriers. This is called a Discrete Resource Unit (DRU) or Distributed RU.

[0005] The long training field (LTF) (hereinafter referred to as the LTF field) is used for channel estimation. This LTF is generated based on a long training sequence (hereinafter referred to as the LTF sequence). The current LTF sequence is designed for regular RU (rRU). Therefore, designing LTF sequences under DRU is an urgent problem to be solved. Summary of the Invention

[0006] This application provides a communication method and apparatus that effectively reduces the peak-to-average power ratio (PAPR) of LTF sequences on DRU.

[0007] In a first aspect, embodiments of this application provide a communication method, which can be applied to a first site. The first site may include a wireless local area network (WLAN) device (including Wi-Fi devices or devices involved in the StarFlash Alliance, etc.), or may be a chip, functional module, processing system, or communication component disposed within the WLAN device. The method includes:

[0008] Generate a long training field based on the long training sequence; send the long training field; wherein, the sequence value corresponding to the 484-tone DRU in the long training sequence is any one of the following:

[0009] [-1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1 -1 1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1-1 1 -1 -1 1 1 -1 -1 1 1 1 1 1 -1 1 1 -1 -1 1 1 -1 1 1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 1 1 1 1 1 -1 1 -1 -1 -1 1 1]；

[0010] [-1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 1 1 1 -1 1 1 1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 1 -1 -1-1 1 1 1 -1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 1 -1]；

[0011] [-1 1 -1 1 1 -1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 1 1 1 1 -1 1 -1 -1 1 1 -1 1 1 1 -1 -1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1-1 -1 1 -1 -1 -1 1 1 -1 1 -1 -1 1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 -1 1 1 1 1 1 1 -1 -1 -1 ...

[0012] [1 1 1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 -1 1 1 1 1 -1 1 -1 1 1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 1 -1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 1-1 -1 -1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 1 - ...

[0013] The target DRU for the first site can be a 484-tone DRU, a 242-tone DRU, a 106-tone DRU, a 52-tone DRU, or a 26-tone DRU. This target DRU is used to generate the long training field; in other words, the DRU corresponding to the long training field is the target DRU. This target DRU can also be called an assigned DRU, etc. The name of this target DRU is not limited in the embodiments of this application.

[0014] In this embodiment, the LTF sequence has a low PAPR under 484-tone DRU transmission, and the LTF sequence obtained based on the sequence value corresponding to the 484-tone DRU also has a low PAPR under different DRU transmissions. By reducing the PAPR of the LTF sequence, the accuracy of channel estimation can be effectively improved, and the system performance can be enhanced.

[0015] Secondly, embodiments of this application provide a communication method, which can be applied to a second site. The second site may include a WLAN device (including Wi-Fi devices or devices involved in the StarFlash Alliance, etc.), or may be a chip, functional module, processing system, or communication component disposed within the WLAN device. The method includes:

[0016] Receive the long training field; perform channel estimation based on the long training field and the long training sequence; wherein, the sequence value corresponding to the 484-tone DRU in the long training sequence is any one of the following:

[0017] [-1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1 -1 1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1-1 1 -1 -1 1 1 -1 -1 1 1 1 1 1 -1 1 1 -1 -1 1 1 -1 1 1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 1 1 1 1 1 -1 1 -1 -1 -1 1 1]；

[0018] [-1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 1 1 1 -1 1 1 1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 1 -1 -1-1 1 1 1 -1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 1 -1]；

[0019] [-1 1 -1 1 1 -1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 1 1 1 1 -1 1 -1 -1 1 1 -1 1 1 1 -1 -1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1-1 -1 1 -1 -1 -1 1 1 -1 1 -1 -1 1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 ...

[0020] [1 1 1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 -1 1 1 1 1 -1 1 -1 1 1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 1 -1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 1-1 -1 -1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 1 - ...

[0021] In conjunction with the first or second aspect, in one possible implementation, the subcarrier range of the 242-tone DRU is [-499:2:-17,17:2:499]; or,

[0022] The subcarrier range of the 242-tone DRU is [-498:2:-16,18:2:500].

[0023] In one possible implementation, in conjunction with the first or second aspect, the long training sequence is obtained by concatenating the sequence values corresponding to 484-tone DRU 1 and 484-tone DRU 2, based on the subcarrier indices in 484-tone DRU 1 and 484-tone DRU 2.

[0024] Combining the first or second aspect, in one possible implementation, the long training sequence is:

[0025] [0 1 1 1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 1 -1 1 -1 -1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 1 1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1 1 1 1 1 -1 1 1 -1 -1 1 1 1 1 -1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 1 -1 -1 1 -1 -1 1 1 -1 1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 1 -1-1 1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 1 1 1 -1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 1 1 1 1 -1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 11 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 -1 -1 -1 -1 ...

[0026] Thirdly, embodiments of this application provide a communication method, which can be applied to a first site. The first site may include a WLAN device (including Wi-Fi devices or devices involved in the StarFlash Alliance, etc.), or may be a chip, functional module, processing system, or communication component disposed within the WLAN device. The method includes:

[0027] Generate a long training field based on a long training sequence, which is:

[0028] [0 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 1 1 1 1 -1 -11 -1 1 1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1-1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 1 1 1 1 1 1 1 1 -1 -1 ... -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 1 -1];

[0029] Send the long training field.

[0030] Fourthly, embodiments of this application provide a communication method, which can be applied to a second site. The second site may include a WLAN device (including Wi-Fi devices or devices involved in the StarFlash Alliance, etc.), or may be a chip, functional module, processing system, or communication component disposed within the WLAN device. The method includes:

[0031] Receive a long training field; perform channel estimation based on the long training field and the long training sequence, which is:

[0032] [0 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 1 1 1 1 -1 -11 -1 1 1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1-1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 1 1 1 1 1 1 1 1 -1 -1 ... -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 1 1 1 1 -1].

[0033] It is understood that the LTF sequence can also be the sequence in the subsequent embodiments, which will not be shown one by one here.

[0034] Fifthly, embodiments of this application provide a first site for performing the methods in the first aspect, the third aspect, or any possible implementation. The first site includes modules for performing the methods in the first aspect, the third aspect, or any possible implementation.

[0035] Sixthly, embodiments of this application provide a second site for performing the methods in the second aspect, the fourth aspect, or any possible implementation. The second site includes modules for performing the methods in the second aspect, the fourth aspect, or any possible implementation.

[0036] In a seventh aspect, embodiments of this application provide a first site, the first site including a processor, configured to cause the first site to perform the methods shown in the first aspect, the third aspect, or any possible implementation thereof. Alternatively, the processor is configured to execute a computer program stored in a memory, wherein when the computer program is executed, the methods shown in the first aspect, the third aspect, or any possible implementation thereof are performed.

[0037] In one possible implementation, the memory is located outside the first site mentioned above.

[0038] In one possible implementation, the memory is located within the aforementioned first site.

[0039] In this embodiment, the processor and memory can also be integrated into a single device, meaning they can be combined. For example, the first station can be a chip.

[0040] In one possible implementation, the first station also includes a transceiver for receiving or transmitting signals. For example, the transceiver can also be used to transmit an LTF field, such as when the first station is a WLAN device.

[0041] Eighthly, embodiments of this application provide a second site, the second site including a processor, configured to cause the second site to perform the methods shown in the second aspect, the fourth aspect, or any possible implementation thereof. Alternatively, the processor is configured to execute a computer program stored in memory, wherein when the computer program is executed, the methods shown in the second aspect, the fourth aspect, or any possible implementation thereof are performed.

[0042] In one possible implementation, the memory is located outside the aforementioned second site.

[0043] In one possible implementation, the memory is located within the aforementioned second site.

[0044] In this embodiment, the processor and memory can also be integrated into a single device, meaning they can be combined. For example, the second station can be a chip.

[0045] In one possible implementation, the second station also includes a transceiver for receiving or transmitting signals. For example, this transceiver could be used to receive the LTF field, such as when the second station is a WLAN device.

[0046] In a ninth aspect, embodiments of this application provide a first site, the first site including logic circuitry and an interface, the logic circuitry and the interface being coupled; the interface is used for inputting and / or outputting information, and the logic circuitry is used to cause the first site to perform the methods described in the first aspect, the third aspect, or any possible implementation thereof.

[0047] For example, an interface for outputting information may include: an interface for outputting LTF fields. For example, logic circuitry for generating LTF fields based on an LTF sequence, etc.

[0048] In a tenth aspect, embodiments of this application provide a second site, the second site including logic circuitry and an interface, the logic circuitry and the interface being coupled; the interface is used for inputting and / or outputting information, and the logic circuitry is used to cause the second site to perform the methods described in the second aspect, the fourth aspect, or any possible implementation thereof.

[0049] For example, the interface for outputting information includes: an interface for inputting an LTF field. For example, logic circuitry for performing channel estimation, etc., based on the LTF sequence and the LTF field.

[0050] Eleventhly, embodiments of this application provide a computer-readable storage medium for storing a computer program that, when run on a computer (such as the site shown above), causes the methods shown in any of the first to fourth aspects or any possible implementation thereof to be executed.

[0051] In a twelfth aspect, embodiments of this application provide a computer program product comprising a computer program that, when run on a computer (such as the site shown above), causes the methods shown in any of the first to fourth aspects or any possible implementation thereof to be executed.

[0052] In a thirteenth aspect, embodiments of this application provide a computer program that, when run on a computer, executes the methods shown in any of the first to fourth aspects or any possible implementations described above.

[0053] In a fourteenth aspect, embodiments of this application provide a communication system comprising a first station and a second station, wherein the first station is configured to perform the methods described in the first aspect, the third aspect, or any possible implementation thereof, and the second station is configured to perform the methods described in the second aspect, the fourth aspect, or any possible implementation thereof. Attached Figure Description

[0054] Figure 1 is a schematic diagram of the architecture of the communication system provided in an embodiment of this application;

[0055] Figure 2 is a schematic diagram of the relationship between spatial flow and time provided in an embodiment of this application;

[0056] Figure 3 is a schematic diagram of the 80MHz subcarrier distribution and RU distribution provided in an embodiment of this application;

[0057] Figure 4 is a flowchart illustrating the communication method provided in an embodiment of this application;

[0058] Figure 5 is a schematic diagram of a communication device provided in an embodiment of this application;

[0059] Figure 6 is a schematic diagram of another structure of the communication device provided in an embodiment of this application;

[0060] Figure 7 is a schematic diagram of a chip structure provided in an embodiment of this application. Detailed Implementation

[0061] To facilitate understanding of the technical solution of this application, the application will be further described below with reference to the accompanying drawings.

[0062] The terms "first" and "second," etc., used in the specification, claims, and drawings of this application are used only to distinguish different objects and not to describe a specific order. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not limited to the listed steps or units, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to these processes, methods, products, or apparatuses.

[0063] The term "embodiment" as used herein means that a particular feature, structure, or characteristic described in connection with an embodiment may be included in at least one embodiment of this application. The appearance of this phrase in various places throughout the specification does not necessarily refer to the same embodiment, nor is it a separate or alternative embodiment mutually exclusive with other embodiments. It will be explicitly and implicitly understood by those skilled in the art that the embodiments described herein can be combined with other embodiments.

[0064] In this application, "at least one (item)" refers to one or more, "more than one" refers to two or more, "at least two (items)" refers to two or three or more, and "and / or" is used to describe the relationship between related objects, indicating that there can be three relationships. For example, "A and / or B" can mean: only A exists, only B exists, and both A and B exist simultaneously, where A and B can be singular or plural. "Or" indicates that there can be two relationships, such as only A exists and only B exists; when A and B are not mutually exclusive, it can also mean that there are three relationships, such as only A exists, only B exists, and both A and B exist simultaneously. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one (item) of the following" or similar expressions refer to any combination of these items. For example, at least one (item) of a, b, or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c".

[0065] In this application, "send" and "receive" indicate the direction of signal transmission. For example, "send information to XX" can be understood as the destination of the information being XX, which can include direct transmission via the air interface or indirect transmission via the air interface from other units or modules. "Receive information from YY" can be understood as the source of the information being YY, which can include direct reception from YY via the air interface or indirect reception from YY via the air interface from other units or modules. "Send" can also be understood as the "output" of a chip interface, and "receive" can also be understood as the "input" of a chip interface. In other words, sending and receiving can occur between devices, such as between network devices and terminal devices, or within a device, such as between components, modules, chips, software modules, or hardware modules within the device via buses, traces, or interfaces.

[0066] The following describes the communication system involved in the embodiments of this application.

[0067] The technical solutions provided in this application can be applied to WLAN systems, such as Wi-Fi or AMP. For example, the technical solutions provided in this application can be applied to the Institute of Electrical and Electronics Engineers (IEEE) 802.11 series standards (or protocols), such as the 802.11b standard, 802.11be standard, 802.11bn standard (or Wi-Fi 8, also known as ultra-high reliability (UHR) or ultra-high reliability and throughput (UHRT)), or next-generation standards of the 802.11bn standard, or standards supporting ambient power (AMP), etc., and will not be listed exhaustively. The technical solutions provided in this application can also be applied to wireless personal area networks (WPANs) that support integrated millimeter wave (IMMW) and ultra-wideband (UWB) technologies. The technical solutions provided in the embodiments of this application can be applied to the IEEE 802.15 series standards, such as the 802.15.4a, 802.15.4z, or 802.15.4ab standards, or future UWB WPAN standards, etc., and will not be listed one by one. The technical solutions provided in the embodiments of this application can also be applied to the Spark Link or NearLink standards. The technical solutions provided in the embodiments of this application can also be applied to the following communication systems, such as Internet of Things (IoT) systems, vehicle-to-everything (V2X, where X can represent anything), device-to-device (D2D), narrowband Internet of Things (NB-IoT) systems, long term evolution (LTE) systems, 5th generation (5G) communication systems, and new communication systems that will emerge in the future development of communication, etc.For example, V2X can include vehicle-to-vehicle (V2V), vehicle-to-infrastructure (V2I), vehicle-to-pedestrian (V2P), or vehicle-to-network (V2N) communication.

[0068] WLAN systems can provide high-speed, low-latency transmission. As WLAN application scenarios continue to evolve, WLAN systems will be applied to more scenarios or industries, such as the Internet of Things industry, the Internet of Vehicles industry, the banking industry, enterprise offices, stadiums and exhibition halls, concert halls, hotel rooms, dormitories, hospital wards, classrooms, shopping malls, squares, streets, production workshops and warehouses, etc. Of course, devices that support WLAN communication or sensing (such as access points or sites) can be sensor nodes in smart cities (such as smart water meters, smart electricity meters, and smart air monitoring nodes), smart devices in smart homes (such as smart cameras, projectors, displays, televisions, speakers, refrigerators, and washing machines), nodes in the Internet of Things (IoT), entertainment terminals (such as wearable devices for augmented reality (AR) and virtual reality (VR), smart devices in smart offices (such as printers, projectors, loudspeakers, and speakers), vehicle-to-everything (V2X) devices, infrastructure in daily life scenarios (such as vending machines, self-service navigation kiosks in supermarkets, self-service checkout machines, and self-service ordering machines), and equipment in large sports and music venues.

[0069] Although the embodiments of this application primarily use WLAN as an example, especially networks applied to the IEEE 802.11 series of standards, the various aspects involved in the embodiments of this application can be extended to other networks employing various standards or protocols. For example, Bluetooth, high-performance radio LAN (HIPERLAN) (a wireless standard similar to the IEEE 802.11 standard), and wide area networks (WANs) or other networks now known or developed in the future. Therefore, regardless of the coverage area and wireless access protocol used, the various aspects provided in this application can be applied to any suitable wireless network.

[0070] The method provided in this application embodiment can be implemented by a communication device in a communication system. For example, the communication device can be an access point (AP) or a station (STA). This communication device includes, but is not limited to, communication servers, routers, switches, bridges, computers, mobile phones, smart home devices, tags, and other central control points. For example, access points and stations can be devices used in vehicle networks, IoT nodes and sensors in IoT, smart cameras, smart remote controls, smart water and electricity meters in smart homes, and sensors in smart cities. The following is a detailed description:

[0071] An Access Point (AP) serves as an access point for a STA (such as a mobile phone) to access a wired (or wireless) network. It is primarily deployed in homes, buildings, and campuses, with a typical coverage radius of tens to hundreds of meters. Outdoor deployments are also possible. An access point acts as a bridge between wired and wireless networks, connecting various wireless network clients and then connecting the wireless network to the Ethernet. Specifically, an access point can be a terminal device (such as a mobile phone) with a Wi-Fi chip or a network device (such as a router). Access points can support the 802.11be standard. They can also be devices supporting various WLAN standards of the 802.11 standard, such as 802.11bp, 802.1bn, 802.11be, 802.11ax, 802.11ac, 802.11n, 802.11g, 802.11b, and 802.11a. An access point (AP) is a device with wireless communication capabilities. The AP can be a complete device, or it can be a chip, processing system, or functional module installed within a complete device. The device with these chips, processing systems, or functional modules installed can implement the methods and functions of the embodiments of this application under the control of these chips, processing systems, or functional modules. The access point in this application can be an AMP AP, a high-efficiency (HE) AP, or an extrameally high-throughput (EHT) AP, or it can be an access point applicable to a future generation of Wi-Fi standards.

[0072] A Station (STA) can be a wireless communication chip, wireless sensor, or wireless communication terminal, and can also be referred to as a user. For example, a station can be a mobile phone supporting Wi-Fi communication, a tablet computer supporting Wi-Fi communication, a set-top box supporting Wi-Fi communication, a smart TV supporting Wi-Fi communication, a smart wearable device supporting Wi-Fi communication, an in-vehicle communication device supporting Wi-Fi communication, a computer supporting Wi-Fi communication, a tag supporting Wi-Fi communication, or a sensor supporting Wi-Fi communication. Optionally, the station can support various wireless local area networks (WLAN) standards of the 802.11 family, such as 802.11bp, 802.11bn, 802.11be, 802.11ax, 802.11ac, 802.11n, 802.11g, 802.11b, and 802.11a. The STA in this application can be an HE STA supporting AMP, an EHT STA supporting AMP, or an STA supporting AMP that is compatible with a future generation of Wi-Fi standards. A STA is a device with wireless communication capabilities. The STA can be a complete device, or it can be a chip, processing system, or functional module installed in a complete device. Devices with these chips, processing systems, or functional modules installed can implement the methods and functions of the embodiments of this application under the control of the chips, processing systems, or functional modules.

[0073] Figure 1 is a schematic diagram of the architecture of a communication system provided in an embodiment of this application. Figure 1 exemplarily shows one AP and six STAs, such as STA1 to STA6. As shown in Figure 1, the embodiments of this application can be applied to scenarios such as communication, sensing, or power transmission between APs and STAs, between APs, or between STAs in a WLAN, and the embodiments of this application do not limit this. For example, the AP can communicate, sense, or transmit power with a single STA, or the AP can communicate, sense, or transmit power with multiple STAs simultaneously. For example, communication, sensing, or power transmission between the AP and multiple STAs can be divided into downlink transmission where the AP simultaneously sends signals to multiple STAs, and uplink transmission where multiple STAs send signals to the AP. The number of APs and non-AP STAs shown in Figure 1 are only examples. In specific implementations, the number of APs or non-AP STAs can be more or less, and the embodiments of this application do not limit this.

[0074] The following describes the terms used in the embodiments of this application.

[0075] 1. PAPR

[0076] In the time domain, wireless signals have constantly changing amplitudes, therefore their transmit power is not constant. PAPR (Peak Power Ratio) refers to the ratio of a signal's peak power to its average power over a period of time. Since an OFDM symbol is composed of multiple independently modulated subcarrier signals superimposed, when the signals on each subcarrier are in the same or similar phase, the superimposed signal will be modulated by the same initial phase signal, resulting in a large instantaneous power peak, which further leads to a high PAPR. Because the dynamic range of a typical power amplifier is limited, OFDM symbols with high PAPR easily enter the nonlinear region of the power amplifier, causing nonlinear distortion, significant spectral spread interference, and in-band signal distortion, resulting in a severe degradation of the overall system performance. Therefore, reducing PAPR is a current research topic.

[0077] 2. LTF (hereinafter referred to as LTF field) and LTF sequence

[0078] LTF fields refer to the time domain dimension, while LTF sequences refer to the frequency domain dimension. An LTF sequence undergoes an inverse Fourier transform to form a time-domain LTF. Therefore, an LTF is generated based on an LTF sequence. This LTF includes one or more OFDM symbols. Besides undergoing an inverse Fourier transform, LTF sequences can also undergo other processing operations to form LTF fields. It should be understood that the inverse Fourier transform and other processing operations described here are general procedures for converting frequency-domain signals to time-domain signals; existing processing methods can be referenced and will not be elaborated upon here.

[0079] The LTF sequence is designed for specific bandwidths and specifies the sequence values (or LTF sequence values) corresponding to each subcarrier during LTF transmission. The LTF sequence is used for channel estimation, or in other words, the LTF is used for channel estimation. The LTF field can be used for channel estimation of various spatial streams (SS). The bandwidth used for transmitting the LTF includes data subcarriers and pilot subcarriers.

[0080] In Wi-Fi scenarios, single-stream pilots are often used to support channel estimation and data transmission for multiple streams, utilizing multiple LTF fields to help sites simultaneously estimate the channels of multiple spatial streams. To accurately estimate spatial stream channels, the Wi-Fi standard proposes using a P-matrix to maintain the orthogonality of the LTFs of each stream.

[0081] In one possible implementation, the data subcarriers are transmitted as follows:

[0082] To ensure the orthogonality of the LTF fields of each stream, the sequence values can be multiplied by a P matrix. For example, the k-th subcarrier in the bandwidth corresponds to the k-th sequence value in the LTF sequence. kThe nth OFDM symbol corresponding to the mth spatial flow is multiplied by the element in the mth row and nth column of the P matrix.

[0083] For example, when the spatial flux number is 2, the P matrix is as follows:

[0084] For example, when the spatial flux number is 4, the P matrix is as follows:

[0085] Figure 2 is a schematic diagram illustrating the relationship between spatial flow and time according to an embodiment of this application. In Figure 2, "1" or "-1" corresponds to the P matrix. For example, "1, -1, 1, 1" in the first row of Figure 2 corresponds to the first row of the P matrix, and so on. The times shown in Figure 2, such as 0 ns, -400 ns, -200 ns, or -600 ns, represent the cyclic shift diversity (CSD) corresponding to each spatial flow. Figure 2 also exemplarily illustrates the relationship between different spatial flows and the P matrix.

[0086] The k-th subcarrier experiences channel H k Then, the receiver receives the frequency domain signal Y. k It can be represented as: Y k =H k ×P 4×4 ×LTF k

[0087] Because of P 4×4 The matrix is an orthogonal matrix, that is... I is the identity matrix. It is P 4×4 The conjugate transpose of the matrix. Therefore, the channel on the k-th subcarrier. The multiple-in multiple-out (MIMO) channel corresponding to the k-th subcarrier can be estimated using the above method.

[0088] In one possible implementation, the pilot subcarrier is transmitted as follows:

[0089] The k-th subcarrier in the bandwidth corresponds to the k-th LTF sequence value in the LTF sequence. k The nth OFDM symbol corresponding to the mth spatial flow is multiplied by the element in the mth row and nth column of the R matrix. For example, R(m, n) = P(1, n). That is, each row of the R matrix is equal to the first row of the P matrix. Of course, as standards evolve, each row of the R matrix can also be equal to the second or third row of the P matrix, etc., which will not be listed here. Alternatively, as standards evolve, the R matrix can be designed separately; this application does not limit this approach.

[0090] Therefore, the data subcarriers and pilot subcarriers corresponding to each LTF field may be multiplied by different values, resulting in a change in the PAPR value of the original LTF sequence design. Optionally, when designing the LTF sequence, it is necessary to design that the PAPR of the corresponding resource blocks is relatively small when the pilot subcarriers and data subcarriers corresponding to the sequence are rotated according to the values of all the P matrix elements mentioned above.

[0091] LTF sequences can be categorized into 1x, 2x, and 4x sequences. In a 1x LTF sequence, there must be at least three zeros between two adjacent non-zero elements. In a 2x LTF sequence, there must be at least one zero between two adjacent non-zero elements. In a 4x LTF sequence, there can be consecutive non-zero elements. The 4x LTF sequence has the densest concentration of non-zero elements, thus providing the most accurate channel estimation.

[0092] In this embodiment, the RU corresponding to the LTF field is the same as the RU corresponding to the data field. The sequence values carried on each subcarrier in the RU corresponding to the LTF field are determined by the LTF sequence.

[0093] 3. Distributed Resource Unit (DRU)

[0094] Regarding bandwidth configuration, the following bandwidth configurations are supported: 20MHz, 40MHz, 80MHz, 160MHz, 80+80MHz, and 320MHz. The difference between 160MHz and 80+80MHz is that the former is a continuous frequency band, while the latter's two 80MHz bands can be separated. This description of bandwidth configuration is merely illustrative and not intended to limit the embodiments of this application. The 802.11be standard defines subcarrier distribution (tone plan) (or subcarrier planning) based on continuous resource units (RUs).

[0095] Figure 3 is a schematic diagram of the subcarrier distribution and RU distribution of 80MHz provided in the embodiments of this application. When the bandwidth is 80MHz, the entire bandwidth can be divided into a 996-tone RU (i.e., a continuous resource unit containing 996 subcarriers). Each 996-tone RU can be divided into two 484-tone RUs, each 484-tone RU can be divided into two 242-tone RUs, each 242-tone RU can be divided into two 106-tone RUs and one 26-tone RU, each 106-tone RU can be divided into two 52-tone RUs, and each 52-tone RU can be divided into two 26-tone RUs. For continuous RUs (or conventional RUs), the more subcarriers they have, the larger the bandwidth they occupy, and the greater the power they can transmit in LPI mode. However, small RUs occupy too little bandwidth, and the transmit power allowed by regulations is very small, thus limiting their transmission distance and performance.

[0096] Table 1 illustrates, for example, the relationship between maximum transmit power and bandwidth in an LPI scenario.

[0097] Table 1

[0098] As can be seen from Table 1, the maximum transmission power of the device increases accordingly with the increase of transmission bandwidth.

[0099] Therefore, DRU can be used to distribute the subcarriers of the original continuous resource unit to a larger bandwidth range, thereby improving the signal transmission power.

[0100] In one possible implementation, the subcarrier distribution under an 80MHz bandwidth is shown in Tables 2 and 3. 40MHz can also be referred to as a discrete bandwidth of 40MHz.

[0101] Table 2 illustrates an example of subcarrier planning for a bandwidth of 80MHz. Subcarriers with an index of 0 are DC subcarriers, subcarriers with positive indices have frequencies higher than the DC subcarrier frequency, and subcarriers with negative indices have frequencies lower than the DC subcarrier frequency. Optionally, subcarriers with indices greater than 0 are located in the positive half-frequency (or upper half-frequency), and subcarriers with indices less than 0 are located in the negative half-frequency (or lower half-frequency).

[0102] Table 2

[0103] In this application, [a:b:c] can refer to all integers from a to c (where a and c are also integers), with a step size of b. That is: a, (a+b), (a+2b), (a+3b), ..., c. Whether the last value c can be obtained depends on whether ca is exactly an integer multiple of b. If not, element c is not included. When b equals 1, [a:c] can usually be used to represent [a:1:c]. For example, [-128:127] represents -128, -127, -126, -125, ..., 125, 126, 127.

[0104] Table 3 provides an example of the pilot subcarrier indices in each DRU when the bandwidth is 40 MHz. Table 3 is illustrated using Table 2 as an example.

[0105] Table 3

[0106] If the DRU directly adopts the LTF sequence corresponding to the consecutive RUs, then regardless of the subcarrier distribution, the changes in subcarrier division and pilot position will result in a large PAPR in the LTF field corresponding to the DRU, affecting the channel estimation accuracy and thus reducing system performance.

[0107] Therefore, embodiments of this application provide a communication method and apparatus that can effectively reduce PAPR, improve channel estimation accuracy, and enhance system performance. The LTF sequence involved in this application is designed based on the subcarrier distribution of the DRU and the position of the pilot subcarriers, reducing the PAPR of the LTF field under the DRU. Even when the data subcarriers and pilot subcarriers undergo different phase rotations in MIMO transmission using single-stream pilot mode, it still exhibits a low PAPR.

[0108] The following describes the method provided in the embodiments of this application.

[0109] Figure 4 is a flowchart illustrating the communication method provided in an embodiment of this application. The first and second stations involved in this method are as described above and will not be detailed here. As an example, the first station is a non-AP STA, and the second station is an AP. As another example, the first station is an AP, and the second station is a non-AP STA. Of course, both the first and second stations can be non-AP STAs, etc., which will not be listed here. As shown in Figure 4, the method includes:

[0110] 401. The first station generates an LTF field based on the LTF sequence.

[0111] For explanations of LTF sequences and LTF fields, please refer to the terminology descriptions above; they will not be elaborated upon here. For a detailed explanation of LTF sequences, please refer to the following text; they will not be detailed here.

[0112] In one possible implementation, the first station determines the LTF sequence based on the bandwidth. The LTF sequence can be designed for different bandwidths, meaning that different bandwidths correspond to different LTF sequences, thus allowing the first station to determine the corresponding LTF sequence based on the bandwidth.

[0113] In another possible implementation, the first station determines the LTF sequence based on bandwidth and sequence pattern, which includes a 1x LTF sequence pattern, a 2x LTF sequence pattern, or a 4x LTF sequence pattern. Optionally, for a DRU, the LTF sequence can only be a 4x LTF sequence pattern, so that when the first station learns that the RU it is using is a DRU, it can determine the LTF sequence based solely on the bandwidth of that DRU.

[0114] In one possible implementation, a first station receives a trigger frame that includes bandwidth information, the first station's identifier, and resource allocation information indicating the size and location of the DRU allocated to the first station. Thus, the first station can obtain the bandwidth, the size and location of the DRU allocated to it from the trigger frame. If the first station is a non-AP STA, it can receive trigger frames from the AP.

[0115] Optionally, the DRU corresponding to the LTF field is the same as the DRU corresponding to the data field. For example, the first station determines the DRU based on the trigger frame. This application embodiment does not limit the method by which the first station determines the DRU it uses.

[0116] As one possible implementation, the first site generates an LTF field based on the LTF sequence and the DRU. This DRU is used to generate the LTF field. For clarity, the DRU used to generate the LTF field is called the target DRU. This target DRU can be any one or more DRUs shown in Table 2. Each subcarrier in the target DRU corresponds to a sequence value in the LTF sequence, which is 1 or -1. The sequence values for other subcarriers in the bandwidth besides those in the target DRU are 0, or in other words, the sequence values for other DRUs in the bandwidth besides the target DRU are 0. For uplink transmission, other DRUs refer to DRUs in the bandwidth other than those allocated to the first site. Similarly, for downlink transmission, other DRUs refer to DRUs in the bandwidth other than those allocated by the AP to at least one first site.

[0117] For example, the sequence value corresponding to the kth subcarrier in the bandwidth is the kth sequence value. When the kth subcarrier belongs to the subcarrier in the target DRU, the kth sequence value is the kth sequence value in the LTF sequence. When the kth subcarrier does not belong to the subcarrier in the target DRU, the kth sequence value is 0.

[0118] As another possible implementation, the first site generates the LTF field based on the LTF sequence, DRU, and P matrix. As an example, when the spatial stream count is 1, the LTF field can carry the LTF sequence value corresponding to the target DRU. As another example, when the spatial stream count is greater than or equal to 2, the LTF field can be generated based on the LTF sequence value corresponding to the target DRU and the P matrix, or the LTF field can be generated based on the LTF sequence value corresponding to the target DRU and the R matrix.

[0119] 402. The first station sends the LTF field, and the corresponding second station receives the LTF field.

[0120] The LTF field can be carried in a PPDU, which may also include data fields. The specific format of the PPDU is not limited in this application.

[0121] 403. The second station performs channel estimation based on the LTF sequence and LTF field.

[0122] The second station can perform channel estimation based on the sequence value carried by the LTF field and the locally stored LTF sequence. The specific process of channel estimation is not limited in the embodiments of this application.

[0123] The LTF sequence designed in this application can effectively reduce the PAPR of the LTF field, improve the accuracy of channel estimation, and improve system performance.

[0124] The following uses 80MHz as an example to describe the LTF sequence involved in the embodiments of this application. Any implementation shown below can be a standalone embodiment, or any implementation shown below can be combined with FIG. 4 to form an embodiment. For ease of reference, different examples are distinguished by serial numbers below, and these serial numbers should not be construed as limiting the embodiments of this application. For ease of description, the sequence value corresponding to each DRU is referred to as a sequence segment below, but the name of this sequence segment should not be construed as limiting the embodiments of this application.

[0125] In one possible implementation, the subcarrier ranges of each DRU involved in Implementation Method 1 below are referenced in Table 2, and will not be detailed further below.

[0126] Implementation Method 1

[0127] The sequence values corresponding to the 484-tone DRU in the LTF sequence are shown in any one of Examples 1 to 4, or as a modified sequence segment of any one of Examples 1 to 4. The modifications shown here include any one or more combinations of the following: reversal, inversion of all values, inversion of the sequence values corresponding to odd-indexed subcarriers, inversion of the sequence values corresponding to even-indexed subcarriers, or inversion of the sequence values corresponding to pilot subcarriers. That is, the sequence value corresponding to the 484-tone DRU can be any one of the sequence segments in Examples 1 to 4, or it can be the opposite sequence segment, the reversed sequence segment, the sequence segment obtained by inverting the sequence values corresponding to odd-indexed subcarriers, or the sequence segment obtained by inverting the sequence values corresponding to even-indexed subcarriers. The above modifications do not affect PAPR; therefore, the modified sequence segments shown below also fall within the protection scope of this application's embodiments. The opposite sequence segment is the sequence segment obtained by inverting the various sequence values shown below. A reverse sequence segment is formed by reversing the order of the sequence values shown below. For example, the 484th sequence value becomes the first sequence value in the reverse sequence segment, the 483rd sequence value becomes the second sequence value, and so on. These examples will not be listed here. The methods for obtaining reverse or opposite sequence segments based on the sequence segments shown below are not detailed in the embodiments of this application.

[0128] As an example 1, the sequence value corresponding to the 484-tone DRU in the LTF sequence is: [-1 1 1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 ... -1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 1 1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 1 -1 1 1 -1 -1 1 1 1 -1 -1 1 1 1 -1 -1 1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 1 -1 -1 -1 1-1 1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 -1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 -1 -1 -1 ...

[0129] For example, the sequence values shown in Example 1 correspond to the sequence values of 484-tone DRU 1 shown in Table 2. Combining this with the subcarrier range of 484-tone DRU 1, the correspondence between the subcarrier indices and sequence values in 484-tone DRU 1 is as follows:

[0130] -499 corresponds to the 1a sequence value, -497 corresponds to the 2a sequence value, -495 corresponds to the 3a sequence value, -493 corresponds to the 4a sequence value, -491 corresponds to the 5a sequence value, -489 corresponds to the 6a sequence value, -487 corresponds to the 7a sequence value, and so on, with 499 corresponding to the 484a sequence value.

[0131] As an example 2, the sequence value corresponding to the 484-tone DRU in the LTF sequence is: [-1 -1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 - ... -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 -1 1 -1 1 1 -1 1 1 1 1 1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 1 1 - ... 1 1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 1 -1 1 -1 -1 1 -1-1 -1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 1 -1]。

[0132] As an example 3, the sequence value corresponding to the 484-tone DRU in the LTF sequence is: [-1 1 -1 1 1 -1 1 -1 1 -1 1 1 1 -11 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 -1 1 -1 1 1 1 1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 1 1 - ... 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 - ... -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1-1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1]. These 484 sequence values are successively called the 1b-th sequence value, the 2b-th sequence value, and so on, up to the 484b-th sequence value.

[0133] For example, the sequence values shown in Example 3 correspond to the sequence values of the 484-tone DRU 2 shown in Table 2. Combining this with the subcarrier range of the 484-tone DRU 2, the correspondence between the subcarrier indices and sequence values in the 484-tone DRU 2 is as follows:

[0134] -498 corresponds to the 1st sequence value, -496 corresponds to the 2nd sequence value, -494 corresponds to the 3rd sequence value, -492 corresponds to the 4th sequence value, -490 corresponds to the 5th sequence value, -488 corresponds to the 6th sequence value, -486 corresponds to the 7th sequence value, and so on, with 500 corresponding to the 484th sequence value.

[0135] As an example 4, the sequence value corresponding to the 484-tone DRU in the LTF sequence is: [1 1 1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 -1 1 1 1 1 1 - ... 1 -1 -1 1 1 -1 1 1 1 1 -1 1 1 1 1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 1 1 1 -1 1 1 1 -1 1 1 1 1 1 1 1 1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 ... 1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 -1 1 1 1 1 -1 -1 -1 -1 ... 1 -1 1 -1 1 -1 1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1-1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 1 1 1 - ...

[0136] As one possible implementation, the LTF sequence is determined based on any one of the sequence segments shown in Examples 1 to 4. For example, the sequence value corresponding to 484-tone DRU 1 in the LTF sequence is any one of Examples 1 to 4 above, and the sequence value corresponding to 484-tone DRU 2 in the LTF sequence is the sequence value after transformation of any one of Examples 1 to 4 above.

[0137] As another possible implementation, the LTF sequence is determined based on any one of the sequence segments shown in Examples 1 and 2, and any one of the sequence segments shown in Examples 3 and 4. In other words, the LTF sequence corresponds to any one of the sequence segments shown in Example 1 or Example 2, and any one of the sequence segments shown in Example 3 or Example 4.

[0138] For example, Example 1 or Example 2 corresponds to 484-tone DRU 1, and Example 3 or Example 4 corresponds to 484-tone DRU 2. An LTF sequence is obtained by randomly selecting a sequence segment or a modified sequence segment from each of 484-tone DRU 1 and 484-tone DRU 2 and concatenating them according to the subcarrier indices in their respective DRUs.

[0139] Taking a subcarrier spacing of 78.125 kHz as an example, there are 1024 subcarriers within 80 MHz, with an index range of [-512:511]. Optionally, the LTF sequence length is 1024, meaning the LTF sequence includes 1024 LTF sequence values, which correspond sequentially to the 1024 subcarriers. The LTF sequence values corresponding to the guard subcarriers and DC subcarriers among these 1024 subcarriers can be 0. The LTF sequence is represented as LTF. -512:511 Or DRU LTF -512:511 Optionally, the LTF sequence has a length of 1001, meaning it consists of 1001 LTF sequence values, each corresponding to one of the 1001 subcarriers. The LTF sequence is represented as LTF.-500:500 Or DRU LTF - 500:500 Of course, the length of an LTF sequence can also be greater than 1001 and less than 1024, etc. The expressions for LTF sequences will not be listed here.

[0140] Taking Examples 1 and 3 as examples, and combining the subcarrier ranges of 484-tone DRU 1 and 484-tone DRU 2 shown in Table 2, the sequence values corresponding to each subcarrier are concatenated in ascending order of index to obtain the LTF sequence. Each sequence value in the LTF sequence can be the sequence value corresponding to the subcarrier with index -499 to the sequence value corresponding to the subcarrier with index 500. In other words, the LTF sequence can be the 1a sequence value corresponding to -499, the 1b sequence value corresponding to -498, the 2a sequence value corresponding to -497, the 2b sequence value corresponding to -496, the 3a sequence value corresponding to -495, the 3b sequence value corresponding to -494, the 4a sequence value corresponding to -493, the 4b sequence value corresponding to -492, the 5a sequence value corresponding to -491, the 5b sequence value corresponding to -490, the 6a sequence value corresponding to -489, the 6b sequence value corresponding to -488, the 7a sequence value corresponding to -487, the 7b sequence value corresponding to -486, and so on. These will not be listed individually here.

[0141] That is, the LTF sequence is:

[0142] LTF -500:500 =[0 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -]

[0143] 1 -1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 1 -11 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 11 -1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1 ... 1 -1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 -1 1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 -1 1 1 1 1 1 -1).

[0144] or,

[0145] LTF -512:511 =[0 0 0 0 0 0 0 0 0 0 0 0 0 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 1 1

[0146] -1 -1 -1 1 -1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1-1 -1 1 1 1 1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1-1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 1 -1 1 1 -1 1 1 -1 1 1 1 -1 1 1 1 -1 -1 ... 1 -1 1 1 -1 1 -1 1 1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 1 -1 0 ...

[0147] The inverted sequence, reversed sequence, or reversed-inverted sequence of the LTF sequence shown above also falls within the protection scope of this application's embodiments. An inverted sequence includes a sequence after all values are inverted, or a sequence after the sequence values corresponding to subcarriers with odd indices are inverted, or a sequence after the sequence values corresponding to subcarriers with even indices are inverted. That is, the sequence shown above is an LTF sequence, or an LTF sequence is an inverted sequence, reversed sequence, or reversed-inverted sequence of the sequence shown above. This application's embodiments do not limit this. The description of sequence variations herein also applies to the following text, and will not be repeated hereafter.

[0148] The LTF sequence shown above is only an example. For example, an LTF sequence can also be obtained by combining Example 1 and Example 4, or by combining Example 2 and Example 3, or by combining Example 2 and Example 4. All of these are within the protection scope of the embodiments of this application, and will not be listed here.

[0149] Implementation Method Two

[0150] The LTF sequence is:

[0151] LTF -500:500＝[0 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 1 1 1 1 -1 -11 -1 1 1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1-1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 1 1 1 1 1 1 1 1 -1 -1 ... -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 1 1 1 1 -1].

[0152] or,

[0153] LTF -512:511＝[0 0 0 0 0 0 0 0 0 0 0 0 0 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -11 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 1-1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 -1 1 1 -1 1 1 1 -1 1 1 1 1 -1 1 1 1 1 1 -1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 -1 -1 1 -1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 ...

[0154] The LTF sequence shown in Implementation Method 2 is just an example. For an explanation of the LTF sequence, please refer to Implementation Method 1. It will not be described in detail here.

[0155] Table 4 exemplifies the PAPR of each DRU. Table 4 uses two spatial flows as an example. Taking two spatial flows as an example, the PAPR corresponding to each spatial flow is calculated separately. One LTF sequence corresponds to two spatial flows, each with two PAPRs. The larger of these two PAPRs is called the maximum PAPR of the LTF sequence. That is, the PAPR of each DRU shown in Table 4 is the maximum PAPR of the LTF sequence shown in Implementation Method 2. The 'max' shown in Table 4 represents the maximum PAPR among different DRUs of the same size.

[0156] Table 4

[0157] It is understandable that the PAPR of other LTF sequences obtained by combining implementation method one is similar to that in Table 4, and will not be shown one by one here.

[0158] The LTF sequences shown in the above implementations all have low PAPR during different DRU transmissions.

[0159] The following describes the design principles involved in the embodiments of this application.

[0160] The sender and receiver can design an LTF sequence based on the design principles described below. The designed LTF sequence may be the same as or different from the implementation methods one to two described above. Alternatively, the sender and receiver may not execute the design principles described below, but instead directly store the LTF sequence designed according to the design principles described below. All LTF sequences designed according to the design principles described below fall within the protection scope of the embodiments of this application.

[0161] In this embodiment of the application, an LTF sequence is designed for DRUs with a discrete bandwidth of 80MHz. Based on the inclusion relationship between DRUs of different sizes, candidate sequence sets with low PAPR can be selected for each small-sized DRU first. Then, based on the inclusion relationship between DRUs of different sizes, a combined sequence set with low PAPR for the large-sized DRU formed by combining them is selected from the candidate sequence set. Finally, the sequences of all DRUs are merged to generate a complete LTF sequence.

[0162] Based on the subcarrier distribution shown in Table 2 and the pilot positions shown in Table 3, some pilot subcarriers in the 52-tone DRU are also pilot subcarriers of the 106-tone DRU, 242-tone DRU, and 484-tone DRU. Referring to Table 3, it can be observed that shifting the pilot subcarrier index in the lower half-band 500 units to the right allows both the data subcarrier and pilot subcarrier positions to completely overlap with those in the upper half-band.

[0163] Therefore, when designing LTF sequences, the sequences corresponding to the lower half-band can have a related structure with the sequences in the upper half-band. For example, for the sequence value corresponding to a 52-tone DRU, the sequence value corresponding to the 52-tone DRU satisfies:

[0164] or LTF 52-toneDRU =[a1,a2,b1,b2,a3,a4,b3,b4,…,a 12 ,a 13 ,b 12 ,b 13 ,-a1,-a2,b1,b2,-a3,-a4,b3,b4,…,-a 12 ,-a 13 ,b 12 ,b13 ]

[0165] In other words, the sequence value corresponding to the upper half-band is obtained from the sequence value 'a' in the lower half-band. i or b i The sequence (i = 1, 2, ..., 13) is obtained by inverting all of them. Under the above structural constraints, sequences with lower PAPR are selected as candidate sequences for 52-tone DRU.

[0166] The 106-tone DRU contains two 52-tone DRUs, and the time-domain signals of the sequence segments corresponding to these two 52-tone DRUs are S... A (t) and S B (t), then select the signal S that makes it possible. A (t)+S B (t) or S A (t)-S B (t) The candidate sequence combination with lower PAPR is used as the candidate sequence set for the 106-tone DRU. Optionally, the sequence values corresponding to the two additional subcarriers can also be set so that the spliced 106-tone DRU has a lower PAPR.

[0167] When S A (t)+S B When (t) has a small PAPR, the candidate sequence of the 106-tone DRU is denoted as a combination of the two 52-tone DRUs. A (t)-S B (t) When the PAPR is low, the combination of the sequence of 52-tone DRU A, the negative sequence of 52-tone DRU B (i.e., the inverted sequence of 52-tone DRU B), and the sequence values corresponding to the two additional subcarriers is used as the candidate sequence of 106-tone DRU.

[0168] Similarly, the 242-tone DRU includes two 106-tone DRUs and one 26-tone DRU. The candidate sequence set for the 242-tone DRU can be generated using the same method. Sequences corresponding to the two 106-tone DRUs are selected from the candidate sequence set of the 106-tone DRUs, and the sequence corresponding to 26-tone DRU 5 is selected from the candidate sequence set of the 26-tone DRU, thus forming the candidate sequence set for the 242-tone DRU.

[0169] Similarly, a 484-tone DRU consists of two 242-tone DRUs, and a subsequent sequence set of the 484-tone DRU can be generated using the same method. Then, a combination of two 484-tone DRUs is selected such that the smaller of the largest PAPR values among the PAPR values of the LTF fields corresponding to all DRUs is concatenated to form the final LTF sequence.

[0170] The following describes the communication device provided in the embodiments of this application.

[0171] This application divides the communication device into functional modules according to the above method embodiments. For example, each function can be divided into its own functional modules, or two or more functions can be integrated into one processing module. The integrated modules can be implemented in hardware or as software functional modules. It should be noted that the module division in this application is illustrative and only represents one logical functional division; other division methods may be used in actual implementation. The communication device of the embodiments of this application will be described in detail below with reference to Figures 5 to 7.

[0172] Figure 5 is a schematic diagram of a communication device provided in an embodiment of this application. As shown in Figure 5, the communication device includes a processing module 501 and a transceiver module 502. The transceiver module 502 can implement corresponding communication functions, and the processing module 501 is used to implement corresponding processing functions. For example, the transceiver module 502 can also be called an interface, a communication interface, or a communication module, etc.

[0173] In some embodiments of this application, the communication device can be used to perform the actions performed by the first station in the above method embodiments. In this case, the first station can be the device itself or a chip or functional module configurable in the device. The transceiver module 502 is used to perform the transceiver-related operations of the first station in the above method embodiments, and the processing module 501 is used to perform the processing-related operations of the first station in the above method embodiments.

[0174] Processing module 501 can acquire LTF sequences;

[0175] The transceiver module 502 can be used to send or output the LTF sequence. For details on sending or outputting the LTF sequence, please refer to the descriptions of the LTF sequence and LTF field above; further details will not be provided here.

[0176] or,

[0177] Processing module 501 is used to generate an LTF field based on the LTF sequence;

[0178] Transceiver module 502 is used to send or output LTF fields.

[0179] Reusing Figure 5, in some other embodiments of this application, the communication device can be used to perform the actions performed by the second station in the above method embodiments. In this case, the second station can be the device itself or a chip or functional module configurable in the device. The transceiver module 502 is used to perform the transceiver-related operations of the second station in the above method embodiments, and the processing module 501 is used to perform the processing-related operations of the second station in the above method embodiments.

[0180] The transceiver module 502 can be used to receive PPDUs, which include an LTF field.

[0181] The processing module 501 can be used to perform channel estimation based on the LTF sequence and the LTF field.

[0182] For example, the transceiver module 502 described above can be an antenna module. Alternatively, the transceiver module 502 can be an input / output module. Optionally, in the above embodiments, the communication device may further include a storage module, which can be used to store instructions and / or data. The processing module 501 can read the instructions and / or data from the storage module to enable the communication device to implement the aforementioned method embodiments. For example, the storage module may be used to store LTF sequences.

[0183] For details regarding the specific explanations of each term, noun, or step in the above embodiments, please refer to the descriptions in the above method embodiments; they will not be detailed here.

[0184] The specific descriptions of the transceiver module and processing module shown in the above embodiments are merely examples. For the specific functions or execution steps of the transceiver module and processing module, please refer to the above method embodiments, which will not be described in detail here.

[0185] It is understandable that the module division in the above-mentioned device is merely a logical functional division. Each function can correspond to a functional module, or two or more functions can be integrated into one functional module. In actual implementation, all or some modules can be integrated into one physical entity, or they can be distributed across different physical entities. Furthermore, the above-mentioned functional modules can be implemented in hardware, software, or a combination of both.

[0186] In one example, the functional unit in any of the above devices may be one or more integrated circuits configured to implement the above methods, such as: one or more application-specific integrated circuits (ASICs), or one or more central processing units (CPUs), one or more microcontroller units (MCUs), one or more digital signal processors (DSPs), or one or more field-programmable gate arrays (FPGAs), or a combination of at least two of these integrated circuit forms.

[0187] The communication device of the present application embodiments has been described above. The following describes possible product forms of the communication device. Any product possessing the functions of the communication device described in FIG. 5 above falls within the protection scope of the present application embodiments. The following description is merely illustrative and does not limit the product form of the communication device of the present application embodiments to this.

[0188] In one possible implementation, in the communication device shown in FIG5, the processing module 501 can be one or more processors, and the transceiver module 502 can be a transceiver, or the transceiver module 502 can also be a transmitting module and a receiving module. The transmitting module can be a transmitter, and the receiving module can be a receiver. The transmitting module and the receiving module are integrated into one device, such as a transceiver. In the embodiments of this application, the processor and the transceiver can be coupled, etc., and the connection method of the processor and the transceiver is not limited in the embodiments of this application. In the process of executing the above method, the process of sending information in the above method can be the process of the processor outputting the above information. When outputting the above information, the processor outputs the above information to the transceiver so that the transceiver can transmit it. After the above information is output by the processor, it may need to undergo other processing before reaching the transceiver. Similarly, the process of receiving information in the above method can be the process of the processor receiving the input above information. When the processor receives the input information, the transceiver receives the above information and inputs it into the processor. Furthermore, after the transceiver receives the above information, the above information may need to undergo other processing before being input into the processor.

[0189] Figure 6 is a schematic diagram of another structure of the communication device provided in an embodiment of this application. As shown in Figure 6, the communication device 60 includes one or more processors 620 and transceivers 610.

[0190] In some embodiments of this application, the communication device can be used to execute the steps, methods, or functions performed by the first station. For example, the processor 620 can be used to execute the functions or steps implemented by the processing module 501 shown in FIG. 5, and the transceiver 610 can be used to execute the functions or steps implemented by the transceiver module 502 shown in FIG. 5. Detailed descriptions of the processor 620 and the transceiver 610 can be found in FIG. 5 or the method embodiments shown above, and will not be elaborated further here.

[0191] In other embodiments of this application, the communication device is used to execute the steps, methods, or functions performed by the second station. For example, the processor 620 can be used to execute the functions or steps implemented by the processing module 501 shown in FIG. 5, and the transceiver 610 can be used to execute the functions or steps implemented by the transceiver module 502 shown in FIG. 5. Detailed descriptions of the processor 620 and the transceiver 610 can be found in FIG. 5 or the method embodiments shown above, and will not be elaborated further here.

[0192] In various implementations of the communication device shown in Figure 6, the transceiver may include a receiver for performing the function (or operation) of receiving, and a transmitter for performing the function (or operation) of transmitting. The transceiver is also used to communicate with other devices / appliances via a transmission medium.

[0193] Optionally, the communication device 60 may further include one or more memories 630 for storing program instructions and / or data. The memory 630 is coupled to the processor 620. The coupling in this embodiment is an indirect coupling or communication connection between communication devices, units, or modules, and can be electrical, mechanical, or other forms, used for information exchange between the communication devices, units, or modules. The processor 620 may operate in conjunction with the memory 630. The processor 620 can execute program instructions stored in the memory 630. Optionally, at least one of the above-mentioned memories may be included in the processor.

[0194] This embodiment does not limit the specific connection medium between the transceiver 610, processor 620, and memory 630. In Figure 6, the memory 630, processor 620, and transceiver 610 are connected via a bus 640, indicated by a thick line. The connection methods between other components are merely illustrative and not intended to be limiting. The bus can be an address bus, data bus, control bus, etc. For ease of illustration, only one thick line is used in Figure 6, but this does not indicate that there is only one bus or one type of bus.

[0195] In the embodiments of this application, the processor may be a general-purpose processor, a digital signal processor, an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc., and can implement or execute the various methods, steps, and logic block diagrams disclosed in the embodiments of this application. The general-purpose processor may be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this application can be directly manifested as being executed by a hardware processor, or being executed by a combination of hardware and software modules within the processor.

[0196] In this application embodiment, the memory may include, but is not limited to, non-volatile memory such as hard disk drive (HDD) or solid-state drive (SSD), random access memory (RAM), erasable programmable read-only memory (EPROM), read-only memory (ROM), or compact disc read-only memory (CD-ROM), etc. Memory is any storage medium capable of carrying or storing program code having instruction or data structure forms, and capable of being read and / or written by a computer (such as the communication device shown in this application), but is not limited to this. The memory in this application embodiment may also be a circuit or any other device capable of implementing storage functions, used to store program instructions and / or data.

[0197] The processor 620 is primarily used to process communication protocols and data, control the entire communication device, execute software programs, and process the data from those programs. The memory 630 is primarily used to store software programs and data. The transceiver 610 may include control circuitry and an antenna. The control circuitry is primarily used for converting baseband signals to radio frequency signals and processing radio frequency signals. The antenna is primarily used for transmitting and receiving radio frequency signals in the form of electromagnetic waves. Input / output devices, such as touchscreens, displays, and keyboards, are primarily used to receive user input data and output data to the user.

[0198] When the communication device is powered on, the processor 620 can read the software program in the memory 630, interpret and execute the instructions of the software program, and process the data of the software program. When data needs to be transmitted wirelessly, the processor 620 performs baseband processing on the data to be transmitted and outputs the baseband signal to the radio frequency (RF) circuit. The RF circuit then performs RF processing on the baseband signal and transmits the RF signal outward in the form of electromagnetic waves through the antenna. When data is sent to the communication device, the RF circuit receives the RF signal through the antenna, converts the RF signal into a baseband signal, and outputs the baseband signal to the processor 620. The processor 620 converts the baseband signal back into data and processes the data.

[0199] In another implementation, the radio frequency circuitry and antenna can be set up independently of the processor performing baseband processing. For example, in a distributed scenario, the radio frequency circuitry and antenna can be arranged remotely, independent of the communication device.

[0200] The communication device shown in this application embodiment may have more components than those in Figure 6, and this application embodiment does not limit this. The methods executed by the processor and transceiver shown above are only examples, and the specific steps executed by the processor and transceiver can be referred to the methods described above. The dashed lines in Figure 6 indicate optional parts.

[0201] In another possible implementation, in the communication device shown in Figure 5, the processing module 501 can be one or more logic circuits, and the transceiver module 502 can be an input / output interface, or a communication interface, or an interface circuit, or an interface, etc. Alternatively, the transceiver module 502 can also be a sending module and a receiving module, where the sending module can be an output interface and the receiving module can be an input interface, and the sending module and receiving module are integrated into one module, such as an input / output interface.

[0202] Figure 7 is a schematic diagram of a chip structure provided in an embodiment of this application. As shown in Figure 7, the chip includes a logic circuit 701 and an interface 702. That is, the processing module 501 can be implemented using the logic circuit 701, and the transceiver module 502 can be implemented using the interface 702. The logic circuit 701 can be a chip, processing circuit, integrated circuit, or system-on-chip (SoC) chip, etc., and the interface 702 can be a communication interface, input / output interface, pins, etc. For example, Figure 7 illustrates a chip using the aforementioned communication device as an example, which includes a logic circuit 701 and an interface 702.

[0203] In this embodiment, the logic circuit and the interface can also be coupled to each other. The specific connection method of the logic circuit and the interface is not limited in this embodiment. For example, the logic circuit 701 can be used to execute the functions or steps implemented by the processing module 501 shown in FIG. 5, and the interface 702 can be used to execute the functions or steps implemented by the transceiver module 502 shown in FIG. 5. For a detailed description of the logic circuit 701 and the interface 702, please refer to FIG. 5 or the method embodiment shown above, which will not be detailed here.

[0204] The communication device shown in the embodiments of this application can implement the method provided in the embodiments of this application in hardware form, or it can implement the method provided in the embodiments of this application in software form, etc., and the embodiments of this application do not limit it in this way.

[0205] Furthermore, embodiments of this application also provide a communication system, which includes a first station and a second station, the first station and the second station being used to perform the methods in any of the foregoing embodiments.

[0206] This application also provides a computer program for implementing the operations and / or processes performed by various sites in the methods provided in this application.

[0207] This application also provides a computer-readable storage medium storing computer code that, when executed on a computer, causes the computer to perform the operations and / or processes performed by various communication devices in the methods provided in this application.

[0208] This application also provides a computer program product comprising computer code or a computer program that, when run on a computer, causes the operations and / or processes performed by various entities in the method provided in this application to be executed.

[0209] In the embodiments provided in this application, it should be understood that the disclosed systems, communication devices, and methods can be implemented in other ways. For example, the communication device embodiments described above are merely illustrative. For instance, the division of modules is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple modules or components may be combined or integrated into another system, or some features may be ignored or not executed. In addition, the mutual coupling or direct coupling or communication connection shown or discussed may be indirect coupling or communication connection through some interfaces, communication devices, or modules, or it may be an electrical, mechanical, or other form of connection.

[0210] The modules described as separate components may or may not be physically separate. The components shown as modules may or may not be physical modules; that is, they may be located in one place or distributed across multiple network modules. Some or all of the modules can be selected according to actual needs to achieve the technical effects of the solutions provided in the embodiments of this application.

[0211] Furthermore, the functional modules in the various embodiments of this application can be integrated into one processing module, or each module can exist physically separately, or two or more modules can be integrated into one module. The integrated modules described above can be implemented in hardware or as software functional modules.

[0212] If the integrated module is implemented as a software functional module and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a readable storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned readable storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

Claims

1. A communication method, characterized in that, The method includes: Generate long training fields based on long training sequences; Send the long training field; Wherein, the sequence value corresponding to 484-tone DRU in the long training sequence is any one of the following: [-1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1 -1 1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 1 1-1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 1 1 -1 1 1 -1 -1 1 1 -1 1 1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 1 1 1 1 1 -1 1 -1 -1 -1 1 1]； [-1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 1 1 1 -1 1 1 1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 1 -1]； [-1 1 -1 1 1 -1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 1 1 1 1 -1 1 -1 -1 1 1 -1 1 1 1 -1 -1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1-1 -1 1 -1 -1 -1 1 1 -1 1 -1 -1 1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 ... [1 1 1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 -1 1 1 1 1 -1 1 -1 1 1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 1 -1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 -1 -1]。 2. The method according to claim 1, characterized in that, The subcarrier range of the 484-tone DRU is [-499:2:-17,17:2:499]; or, The subcarrier range of the 484-tone DRU is [-498:2:-16,18:2:500].

3. The method according to claim 2, characterized in that, The long training sequence is: [0-1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 -1 1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 1 1 1 -1]。 4. A communication method, characterized in that, The method includes: Receive long training fields; Channel estimation is performed based on the long training field and the long training sequence; Wherein, the sequence value corresponding to 484-tone DRU in the long training sequence is any one of the following: [-1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1 -1 1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 1 1 -1 1 1 -1 -1 1 1 -1 1 1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 1 1 1 1 1 -1 1 -1 -1 -1 1 1]； [-1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 1 1 1 -1 1 1 1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 1 -1]； [-1 1 -1 1 1 -1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 1 1 1 1 -1 1 -1 -1 1 1 -1 1 1 1 -1 -1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1-1 -1 1 -1 -1 -1 1 1 -1 1 -1 -1 1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 ... [1 1 1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 -1 1 1 1 1 -1 1 -1 1 1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 1 -1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 -1 -1]。 5. The method according to claim 4, characterized in that, The subcarrier range of the 484-tone DRU is [-499:2:-17,17:2:499]; or, The subcarrier range of the 484-tone DRU is [-498:2:-16,18:2:500].

6. The method according to claim 5, characterized in that, The long training sequence is: [0-1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 -1 1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 1 1 1 -1]。 7. A communication method, characterized in that, The method includes: A long training field is generated based on a long training sequence, wherein the long training sequence is: [0-1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 11 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 -1 1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 1 1 1 -1]； Send the long training field.

8. A communication method, characterized in that, The method includes: Receive long training fields; Channel estimation is performed based on the long training field and the long training sequence, wherein the long training sequence is: [0-1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 -1 1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 1 1 1 -1]。 9. A communication device, characterized in that, Includes a module for performing the method as described in any one of claims 1-8.

10. A communication device, characterized in that, Includes a processor, the processor being configured to cause the communication device to implement the method as described in any one of claims 1-8.

11. A chip, characterized in that, It includes logic circuitry and an interface, the logic circuitry and the interface being coupled, the logic circuitry being configured to enable the chip to implement the method as described in any one of claims 1-8.

12. A computer-readable storage medium, characterized in that, The computer-readable storage medium is used to store a computer program, which, when executed by a computer, performs the method as described in any one of claims 1-8.

13. A computer program product, characterized in that, When the computer program product is executed by a computer, the method described in any one of claims 1-8 is performed.

14. A communication system, characterized in that, It includes a first site and a second site, wherein the first site is used to perform the method as described in any one of claims 1-3 and 7, and the second site is used to perform the method as described in any one of claims 4-6 and 8.