Communication method and apparatus

By designing a flag sequence and QBPSK modulation scheme that satisfy specific element relationships, the problem of high PAPR in the long-distance transmission scheme of the 802.11b standard was solved, achieving more efficient signal transmission and improved system performance.

WO2026067529A1PCT designated stage Publication Date: 2026-04-02HUAWEI TECH CO LTD
View PDF 5 Cites 0 Cited by

Patent Information

Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Filing Date
2025-09-25
Publication Date
2026-04-02

AI Technical Summary

Technical Problem

Existing 802.11b standard long-distance transmission schemes have low spectral efficiency and are difficult to manage. How can we reduce the peak-to-average power ratio (PAPR) to improve system performance?

Method used

By designing a flag sequence that satisfies specific element relationships, such as the j-th element being the same as or opposite to the n-th element among N elements, the symmetry of the data subcarrier is matched, and QBPSK modulation is adopted to uniformly distribute signal energy and reduce PAPR.

Benefits of technology

It effectively reduces the PAPR of the flag field, improves system performance, reduces nonlinear distortion and spectral spread interference, and enhances signal transmission quality.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN2025123960_02042026_PF_FP_ABST
    Figure CN2025123960_02042026_PF_FP_ABST
Patent Text Reader

Abstract

The present application relates to the technical field of communications, and particularly relates 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 standard, the 802.11bf standard, the IMMW standard or the SparkLink standard. The present application designs a new mark sequence, which can reduce the PAPR of a mark field. The first N elements or last N elements in the mark sequence satisfy: a jth element among the N elements is the same as an (N / 2+1-j)th element among the N elements, or the jth element and the (N / 2+1-j)th elements are opposite numbers of each other, and the elements are 1 or -1.
Need to check novelty before this filing date? Find Prior Art

Description

Communication method and apparatus

[0001] This application claims priority to the Chinese patent application No. 202411393408.X, filed on September 30, 2024, entitled “Communication method and apparatus”, the content of which is incorporated herein by reference in its entirety. This application claims priority to the Chinese patent application No. 202411551023.1, filed on October 31, 2024, entitled “Communication method and apparatus”, the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0002] The present application relates to the field of communication technology, and in particular to a communication method and apparatus. BACKGROUND

[0003] Wireless local area network (WLAN) has gone through 802.11a / b / g, 802.11n, 802.11ac, 802.11ax, 802.11be and 802.11bn from the beginning. Among them, the 802.11a / b / g standards are collectively referred to as non high throughput (non-HT), the 802.11n standard is referred to as high throughput (HT), the 802.11ac standard is referred to as very high throughput (VHT), the 802.11ax standard is referred to as high efficient (HE), the 802.11be standard is referred to as extremely high throughput (EHT), and the 802.11bn standard is referred to as ultra high reliability (UHR).

[0004] With the increasing number of WLAN-based internet of things (IoT) devices, and the difficulty of deploying multiple access points (APs) in a home environment, there is an increasing demand for WLANs to support long-range transmission. The 802.11b standard uses a direct-sequence spread spectrum (DSSS) modulation method to convert digital signals into analog signals with a wider frequency width to enhance the reliability of data transmission. However, the spectrum efficiency of the long-range transmission scheme based on the 802.11b standard is low, and the standard is relatively old, making network management difficult. Therefore, in 802.11bn and subsequent standards, enhanced long range (ELR) transmission based on orthogonal frequency division multiplexing (OFDM) modulation has become one of the research hotspots.

[0005] In view of this, how to reduce the peak to average power ratio (PAPR) needs to be solved urgently. SUMMARY

[0006] Embodiments of the present application provide a communication method and device, which can effectively reduce the PAPR of the mark field (hereinafter referred to as the PAPR of the mark sequence, or the PAPR of the mark sequence).

[0007] In a first aspect, embodiments of the present application provide a communication method, which is applied to a first station. The first station can be a Wi-Fi device, or a chip or functional module placed in a Wi-Fi device. The Wi-Fi device can include an IoT device, etc. The method includes:

[0008] generating a mark field according to a mark sequence, the mark sequence corresponding to a BSS color of a basic service set (BSS) in which the first station is located, and the first N elements in the mark sequence and / or the last N elements in the mark sequence satisfy: the jth element in the N elements is the same as the (j+1)th element in the N elements, or the jth element and the (j+1)th element are opposite numbers, the elements in the N elements are 1 or -1, and N is a positive integer; and transmitting an enhanced long range physical protocol data unit (ELR-PPDU) including the mark field. ​​

[0009] In the embodiments of the present application, the jth element in the N elements is the same as or opposite to the th element, which can better match the data subcarriers corresponding to the flag field, and satisfy the symmetry of data subcarrier division. If the jth element is the same as the th element, under quadrature binary phase shift keying (QBPSK) modulation, the two elements correspond to the energy of the imaginary part of the time domain signal. If the jth element is opposite to the th element, under QBPSK modulation, the two elements correspond to the energy of the real part of the time domain signal, so that the energy distribution of the signal is more uniform, the PAPR is effectively reduced, and the system performance is improved.

[0010] In a second aspect, the embodiments of the present application provide a communication method, which is applied to a second station. The second station can be a Wi-Fi device, or a chip or functional module in the Wi-Fi device. The Wi-Fi device can include an IoT device, etc. The method includes:

[0011] receiving a PPDU, the PPDU including a flag field; and determining, according to a flag sequence corresponding to a BSS color of a BSS in which the second station is located and the flag field, whether the PPDU is an ELR-PPDU of the BSS in which the second station is located; wherein a first N elements in the flag sequence and / or a last N elements in the flag sequence satisfy: a jth element in the N elements is the same as a th element in the N elements, or the jth element is opposite to the th element, the elements in the N elements being 1 or -1, and N being a positive integer.

[0012] With reference to the first aspect or the second aspect, in a possible implementation, the total number of elements in the flag sequence corresponds to the total number of data subcarriers corresponding to the OFDM symbol occupied by the flag field.

[0013] With reference to the first aspect or the second aspect, in a possible implementation, the flag field occupies two OFDM symbols, and the total number of elements in the flag sequence is equal to the total number of data subcarriers corresponding to the two OFDM symbols.

[0014] For example, the number of data subcarriers corresponding to each OFDM symbol is 48, and the total number of data subcarriers corresponding to the two OFDM symbols is 96. The total number of elements in the flag sequence is 96.

[0015] ​​​​​In the embodiments of the present application, the total number of elements in the flag sequence and the data subcarriers corresponding to the OFDM symbol satisfy the above relationship, so that the elements in the flag sequence and the data subcarriers have a mapping relationship.

[0016] With reference to the first aspect or the second aspect, in a possible implementation, the N elements are [x1, x2, x3, …, x N / 2 y1, y2, y3, …, y N / 2 ], or the N elements are [-x1, -x2, -x3, …, -x N / 2 y1, y2, y3, …, y N / 2 ].

[0017] wherein, or, i is 1, 2, 3, …, N / 2.

[0018] With reference to the first aspect or the second aspect, in a possible implementation, N=48, the 48 elements are [x1, x2, x3, …, x 24 y1, y2, y3, …, y 24 ], or the 48 elements are [-x1, -x2, -x3, …, -x 24 y1, y2, y3, …, y 24 ].

[0019] wherein,

[0020] i is 1, 2, 3, …, 24.

[0021] The 25-i th element in the first 24 elements and the i th element in the last 24 elements in the above 48 elements satisfy the above characteristics, which can better match the data subcarriers corresponding to the flag field. Alternatively, the above 48 elements can correspond to 48 data subcarriers corresponding to one OFDM symbol. For example, one OFDM symbol in the flag field can correspond to 48 data subcarriers, which are divided into subcarriers with an index less than 0 and subcarriers with an index greater than 0 by the direct current subcarrier, and the subcarrier index in the subcarriers with an index less than 0 and the subcarrier index in the subcarriers with an index greater than 0 can have a symmetric relationship. Therefore, the distribution of the data subcarriers can be matched by the above relationship between 25-i and i.

[0022] Through the design of 'i' described above, the first 24 elements out of the 48 elements can be matched with the last 24 elements in terms of data subcarrier distribution, and can also be matched with the pilot subcarrier distribution. For example, one OFDM symbol in the flag field can correspond to 48 data subcarriers and 4 pilot subcarriers. Two of these four pilot subcarriers are distributed among the subcarriers with indices less than 0, and the other two are distributed among the subcarriers with indices greater than 0. Furthermore, there is a 13-data subcarrier interval between the two pilot subcarriers with indices greater than 0.

[0023] Through the above (-1) i With (-1) i+1 The design allows the PAPR of the above 48 elements after reversing and / or inverting to be the same as (or the difference is less than the threshold) the PAPR of the above 48 elements, and also achieves a low PAPR for these 48 elements.

[0024] Combining the first or second aspect, in one possible implementation, [x1,x2,x3,…,x 24 ,y1,y2,y3,…,y 24 ] and [-x1,-x2,-x3,…,-x 24 ,y1,y2,y3,…,y 24 Orthogonal.

[0025] Optionally, [x1,x2,x3,…,x 24 ,y1,y2,y3,…,y 24 [x1, -x2, -x3, ..., -x] represents the 48 elements in the flag sequence corresponding to the BSS color of BSS1. 24 ,y1,y2,y3,…,y 24 [ ] represents the 48 elements in the flag sequence corresponding to the BSS color of BSS2. By satisfying the orthogonality relation, the probability of misidentification of ELR-PPDU between cells can be effectively reduced.

[0026] Combining the first or second aspect, in one possible implementation, N = 48, the first 48 elements of the flag sequence and the last 48 elements of the flag sequence satisfy:

[0027] [x1,x2,x3,…,x 24 ,y1,y2,y3,…,y 24 ,x1,x2,x3,…,x 24 ,y1,y2,y3,…,y 24 ];or,

[0028] [x1,x2,x3,…,x 24 ,y1,y2,y3,…,y 24-x1, -x2, -x3,..., -x 24 -y1, -y2, -y3,..., -y 24 ] ; or,

[0029] -x1, -x2, -x3,..., -x 24 y1, y2, y3,..., y 24 -x1, -x2, -x3,..., -x 24 y1, y2, y3,..., y 24 ] ; or,

[0030] -x1, -x2, -x3,..., -x 24 y1, y2, y3,..., y 24 x1, x2, x3,..., x 24 -y1, -y2, -y3,..., -y 24 ] ; or,

[0031] x1, x2, x3,..., x 24 y1, y2, y3,..., y 24 y 24 y 23 y 21 ..., y1, x 24 x 23 x 22 ..., x1] ; or,

[0032] x1, x2, x3,..., x 24 y1, y2, y3,..., y 24 -y 24 -y 23 -y 21 ..., -y1, -x 24 -x 23 -x 22 ..., -x1] ; or,

[0033] -x1, -x2, -x3,..., -x 24 y1, y2, y3,..., y 24 y 24 y 23 y 21 ..., y1, -x 24 -x 23 -x 22 ..., -x1] ; or,

[0034] -x1, -x2, -x3,..., -x 24 y1, y2, y3,..., y 24 -y24 -y 23 -y 21 …, -y1, x 24 x 23 x 22 …, x1].

[0035] With reference to the first aspect or the second aspect, in a possible implementation, an element in the flag sequence is a row element in the matrix M corresponding to the BSS color, and the matrix M is as follows:

[0036]

[0037]

[0038] Any two rows in the matrix C are orthogonal to each other, and the N elements are a row element in the matrix C.

[0039] In the embodiments of the present application, any row element in the matrix C can satisfy the characteristics of the N elements as described above, and any two rows in the matrix C are orthogonal, so that the PAPR can be effectively reduced, and the probability of misrecognition can also be reduced.

[0040] In a third aspect, the embodiments of the present application provide a communication method, which is applied to a first station. The first station can be a Wi-Fi device, or a chip or a functional module in the Wi-Fi device. The Wi-Fi device can include an IoT device, etc. The method comprises the following steps:

[0041] generating a flag field according to the flag sequence, and transmitting an ELR-PPDU including the flag field; wherein the flag sequence is the sequence in the subsequent embodiments.

[0042] In a fourth aspect, the embodiments of the present application provide a communication method, which is applied to a second station. The second station can be a Wi-Fi device, or a chip or a functional module in the Wi-Fi device. The Wi-Fi device can include an IoT device, etc. The method comprises the following steps:

[0043] receiving a PPDU including a flag field; and determining whether the PPDU is an ELR-PPDU of a BSS in which the second station is located according to a flag sequence and the flag field, wherein the flag sequence is the sequence in the subsequent embodiments.

[0044] ​​​​In the embodiments of the present application, the flag sequence shown in the third aspect or the fourth aspect satisfies the characteristics of the flag sequence shown in the first aspect or the second aspect. The flag sequence designed by the embodiments of the present application can effectively reduce the PAPR of the flag field.

[0045] The flag sequence provided in the present application can be for one OFDM symbol. If the flag field occupies one OFDM symbol, the data subcarriers corresponding to the one OFDM symbol carry the entire flag sequence. If the flag field occupies two or more OFDM symbols, the flag sequences carried by the data subcarriers corresponding to other OFDM symbols have a mapping relationship with the flag sequence provided in the present application, which can be one of or a combination of the same, negation, reverse order, and the like.

[0046] The flag sequence provided in the present application can also be for multiple OFDM symbols. If the flag field occupies one OFDM symbol, the data subcarriers corresponding to the one OFDM symbol carry the entire flag sequence. If the flag field occupies two or more OFDM symbols, the data subcarriers corresponding to each OFDM symbol in the multiple OFDM symbols respectively carry a part of the flag sequence, and all the data subcarriers corresponding to the multiple OFDM symbols carry the entire flag sequence.

[0047] In a fifth aspect, the embodiments of the present application provide a first station for performing the method in the first aspect or the third aspect or any possible implementation manner. The first station includes a module for performing the method in the first aspect or the third aspect or any possible implementation manner.

[0048] In a sixth aspect, the embodiments of the present application provide a second station for performing the method in the second aspect or the fourth aspect or any possible implementation manner. The second station includes a module for performing the method in the second aspect or the fourth aspect or any possible implementation manner.

[0049] In a seventh aspect, the embodiments of the present application provide a first station including a processor for causing the first station to perform the method shown in the first aspect or the third aspect or any possible implementation manner. Alternatively, the processor is configured to execute a computer program stored in a memory, and when the computer program is executed, the method shown in the first aspect or the third aspect or any possible implementation manner is performed.

[0050] In a possible implementation manner, the memory is located outside the first station.

[0051] In a possible implementation manner, the memory is located inside the first station.

[0052] In the embodiments of the present application, the processor and the memory can also be integrated in one device, i.e., the processor and the memory can also be integrated together. For example, the first station can be a chip.

[0053] In a possible implementation, the first station further includes a transceiver configured to receive or transmit a signal. For example, the transceiver can be configured to transmit the ELR-PPDU. For example, the first station can be a Wi-Fi device.

[0054] In an eighth aspect, the embodiments of the present application provide a second station, which includes a processor configured to cause the second station to perform the method in the second aspect or the fourth aspect or any possible implementation.

[0055] In a possible implementation, the memory is located outside the second station.

[0056] In a possible implementation, the memory is located inside the second station.

[0057] In the embodiments of the present application, the processor and the memory can also be integrated in one device, i.e., the processor and the memory can also be integrated together. For example, the second station can be a chip.

[0058] In a possible implementation, the second station further includes a transceiver configured to receive or transmit a signal. For example, the transceiver can be configured to receive the ELR-PPDU. For example, the second station can be a Wi-Fi device.

[0059] In a ninth aspect, the embodiments of the present application provide a first station, which includes a logic circuit and an interface, and the logic circuit and the interface are coupled; the interface is configured to input and / or output information, and the logic circuit is configured to cause the first station to perform the method in the first aspect or the fourth aspect or any possible implementation.

[0060] For example, the interface configured to output information can include that the interface is configured to input the ELR-PPDU. For example, the logic circuit is configured to generate the LTF field according to the LTF sequence.

[0061] In a tenth aspect, the embodiments of the present application provide a second station, which includes a logic circuit and an interface, and the logic circuit and the interface are coupled; the interface is configured to input and / or output information, and the logic circuit is configured to cause the second station to perform the method in the second aspect or the fourth aspect or any possible implementation.

[0062] Exemplarily, the interface for outputting information comprises: an interface for outputting the ELR-PPDU. Exemplarily, the logic circuit is configured to perform channel estimation according to the LTF sequence and the LTF field.

[0063] In an eleventh aspect, a computer-readable storage medium is provided, which stores a computer program, and when the computer program is run on a computer (e.g., the station shown above), the method shown in any one of the first aspect to the fourth aspect or any possible implementation manner thereof is performed.

[0064] In a twelfth aspect, a computer program product is provided, which comprises a computer program, and when the computer program is run on a computer (e.g., the station shown above), the method shown in any one of the first aspect to the fourth aspect or any possible implementation manner thereof is performed.

[0065] In a thirteenth aspect, a computer program is provided, and when the computer program is run on a computer, the method shown in any one of the first aspect to the fourth aspect or any possible implementation manner thereof is performed.

[0066] In a fourteenth aspect, a communication system is provided, which comprises a first station and a second station, the first station is configured to perform the method shown in the first aspect or the third aspect or any possible implementation manner thereof, and the second station is configured to perform the method shown in the second aspect or the fourth aspect or any possible implementation manner thereof. BRIEF DESCRIPTION OF DRAWINGS

[0067] FIG. 1 is a schematic diagram of an architecture of a communication system according to an embodiment of the present application;

[0068] FIG. 2a is a content of a matrix H;

[0069] FIG. 2b is a PAPR corresponding to each of 64 flag sequences;

[0070] FIG. 3 is a schematic diagram of a flow of a communication method according to an embodiment of the present application;

[0071] FIG. 4 is a schematic diagram of division of subcarriers corresponding to an OFDM symbol according to an embodiment of the present application;

[0072] FIG. 5a is a schematic diagram of a format of an ELR-PPDU according to an embodiment of the present application;

[0073] FIG. 5b is a schematic diagram of a format of an ELR-PPDU according to an embodiment of the present application;

[0074] FIG. 6 is a PAPR of 64 flag sequences in a matrix M according to an embodiment of the present application;

[0075] FIG. 7 is a structural schematic diagram of a communication device according to an embodiment of the present application;

[0076] FIG. 8 is another structural schematic diagram of a communication device according to an embodiment of the present application;

[0077] FIG. 9 is a structural schematic diagram of a chip according to an embodiment of the present application;

[0078] FIG. 10 is a PAPR of 64 flag sequences in matrix M according to an embodiment of the present application;

[0079] FIG. 11 is a PAPR of 64 flag sequences in matrix M according to an embodiment of the present application. DETAILED DESCRIPTION

[0080] For the purpose of facilitating understanding of the technical solutions of the present application, the present application will be further described below with reference to the accompanying drawings.

[0081] The terms "first" and "second" and the like in the specification of the present application, claims, and drawings are only used to distinguish different objects, and are not used to describe a specific order. In addition, the terms "comprise" and "have" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or device, etc. comprising a series of steps or units is not limited to the listed steps or units, but can optionally further comprise steps or units not listed, etc., or can optionally further comprise other steps or units inherent to the process, method, product, or device, etc.

[0082] Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the present application. The appearance of the phrase in various places in the specification does not necessarily all refer to the same embodiment, nor is it necessarily mutually exclusive of other embodiments. It will be explicitly and implicitly appreciated by those skilled in the art that the embodiments described herein can be combined with other embodiments.

[0083] In the present application, "at least one" means one or more, "multiple" means two or more, "at least two" means two or three or more, and "and / or" is used to describe the relationship between the associated objects, which means that there can be three relationships, for example, "A and / or B" can mean: only A, only B, and A and B exist at the same time, where A and B can be singular or plural. "Or" means there can be two relationships, such as only A, only B; when A and B are not mutually exclusive, it can also mean that there are three relationships, such as only A, only B, and A and B exist at the same time. The character " / " generally represents an "or" relationship between the associated objects before and after. "At least one" or similar expressions refer to any combination of these items. For example, at least one 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".

[0084] It can be understood that some implementations or some examples are numbered in the present application for subsequent reference.

[0085] The following describes a communication system related to an embodiment of the present application.

[0086] The technical solutions provided in the embodiments of the present application can be applied to a wireless local area network (WLAN) system, such as Wi-Fi and the like. The method provided in the embodiments of the present application can be applicable to the institute of electrical and electronics engineers (IEEE) 802.11 series standards, for example, the 802.11be standard, the 802.11bn standard (or also referred to as Wi-Fi 8, and also referred to as ultra high reliability (UHR) or ultra high reliability and throughput (UHRT), etc.), or a next-generation standard of the 802.11bn standard or a standard supporting ambient power (AMP), and the like. The technical solutions provided in the embodiments of the present application can also be applied to a wireless personal area network (WPAN) based on integrated millimeter wave (IMMW), ultra wideband (UWB) technology, and the like. The method provided in the embodiments of the present application can be applicable to the IEEE 802.15 series standards, for example, the 802.15.4a standard, the 802.15.4z standard or the 802.15.4ab standard, or a future generation UWB WPAN standard, and the like. The technical solutions provided in the embodiments of the present application can also be applied to a spark link or nearlink standard. The technical solutions provided in the embodiments of the present application can also be applied to a communication system, for example, can be an internet of things (IoT) system, a vehicle-to-everything (V2X, X can represent any thing) system, a device-to-device (D2D) system, a narrow band IoT (NB-IoT) system, a long term evolution (LTE) system, a 5th-generation (5G) communication system, and a new communication system to be appeared in future communication development, and the like.For example, the V2X can include vehicle to vehicle (V2V), vehicle to infrastructure (V2I), vehicle to pedestrian (V2P) or vehicle to network (V2N) communication, etc.

[0087] The WLAN system can provide high-rate and low-latency transmission. With the continuous evolution of WLAN application scenarios, the WLAN system will be applied to more scenarios or industries, such as the Internet of Things industry, the Internet of Vehicles industry, or the banking industry, enterprise offices, stadiums and exhibition halls, concert halls, hotel rooms, dormitories, wards, classrooms, supermarkets, squares, streets, manufacturing workshops, and warehouses, etc. Of course, the devices (such as access points or stations) supporting WLAN communication or sensing can be sensor nodes in smart cities (such as smart water meters, smart electricity meters, and smart air detection nodes), smart devices in smart homes (such as smart cameras, projectors, display screens, televisions, sound systems, refrigerators, washing machines, etc.), nodes in the Internet of Things, entertainment terminals (such as augmented reality (AR), virtual reality (VR), etc. wearable devices), smart devices in smart offices (such as printers, projectors, amplifiers, sound systems, etc.), Internet of Vehicles devices in the Internet of Vehicles, infrastructure in daily life scenarios (such as vending machines, self-service navigation stations in supermarkets, self-service checkout devices, self-service ordering machines, etc.), and devices in large sports and music venues, etc.

[0088] Although the embodiments of the present application mainly take WLAN as an example, especially the network applied to the IEEE 802.11 series standard, but the various aspects involved in the embodiments of the present application can be extended to other networks using various standards. For example, Bluetooth, high performance radio LAN (HIPERLAN) (a wireless standard similar to the IEEE 802.11 standard) and wide area network (WAN) or other now known or later developed networks.

[0089] In a possible implementation, the method provided by the embodiments of the present application 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).

[0090] An AP is a device with wireless communication capability, which supports communication or sensing or energy transfer using WLAN standards, and has the capability to communicate or sense with or transfer energy to other devices in a WLAN network, such as non-AP stations (non-AP STAs) or other access points. Alternatively, an access point is equivalent to a bridge connecting wired and wireless networks, and mainly functions to connect various wireless network clients together, and then access the wireless network to the Ethernet. In a WLAN system, an access point can be referred to as an access point station (AP STA). An AP is a device that provides services for non-AP STAs, and can support 802.11 series standards or subsequent standards, etc. For example, an access point can be an access point for a terminal (such as a mobile phone) to enter a wired (or wireless) network, and is mainly deployed in homes, buildings, and parks, with a typical coverage radius of tens of meters to hundreds of meters, and can also be deployed outdoors. For another example, an AP can be a communication server, a router, a switch, a network bridge, or the like. An AP can include various forms of macro base stations, micro base stations, relay stations, and the like. An AP can be a whole device (such as a WLAN device or a Wi-Fi device or an IoT device, etc.), or can be a chip, a processing system, or a functional module installed in a whole device, and the device in which the chip, the processing system, or the functional module is installed can implement the methods and functions of the embodiments of the present application under the control of the chip, the processing system, or the functional module.

[0091] A STA is a device with wireless communication capability, which supports communication or sensing or energy transfer using WLAN standards, and has the capability to communicate or sense with or transfer energy to other non-AP STAs or access points in a WLAN network. In a WLAN system, a station can be referred to as a non-AP station (non-access point station, non-AP STA). For example, a STA is any user communication device that allows a user to communicate or sense or transfer energy with an AP and then communicate with a WLAN. For example, a STA can be a wireless communication chip, a wireless sensor, or a wireless communication terminal, and can also be referred to as a user. For another example, a STA can be a mobile phone supporting Wi-Fi communication functions, a tablet computer supporting Wi-Fi communication functions, a set-top box supporting Wi-Fi communication functions, a smart television supporting Wi-Fi communication functions, a smart wearable device supporting Wi-Fi communication functions, a vehicle-mounted communication device supporting Wi-Fi communication functions, and a computer supporting Wi-Fi communication functions, etc. A STA can be a whole device (such as a WLAN device or a Wi-Fi device or an IoT device, etc.), or can be a chip, a processing system, or a functional module installed in a whole device, and the device in which the chip, the processing system, or the functional module is installed can implement the methods and functions of the embodiments of the present application under the control of the chip, the processing system, or the functional module.

[0092] The communication system can include access points and stations. For example, embodiments of the present application can be applied to scenarios of communication or sensing between an AP and a STA, between APs, or between STAs in a WLAN, and the present application is not limited in this respect. Optionally, an AP can communicate or sense with a single STA, or an AP can communicate or sense with multiple STAs simultaneously. Specifically, the AP communicating or sensing with multiple STAs can be divided into downlink transmission in which the AP sends signals to multiple STAs simultaneously, and uplink transmission in which multiple STAs send signals to the AP. The communication between an AP and a STA, between APs, or between STAs can support a WLAN communication standard, which can include standards of the IEEE 802.11 series, such as the 802.11bn standard, and of course also standards after the 802.11bn standard.

[0093] FIG. 1 is a schematic diagram of an architecture of a communication system according to an embodiment of the present application. The communication system can include one or more APs and one or more STAs. As shown in FIG. 1, two APs, such as AP1 and AP2, and three STAs, such as STA1, STA2, and STA3, are shown. As an example, the method provided by embodiments of the present application can be applied to data communication or sensing between an AP and one or more STAs, such as the communication between AP1 and STA1 shown in FIG. 1. As another example, the method provided by embodiments of the present application can be applied to communication between APs, such as the communication or sensing between AP1 and AP2 shown in FIG. 1. As yet another example, the method provided by embodiments of the present application can be applied to communication or sensing between STAs, such as the communication or sensing between STA2 and STA3 shown in FIG. 1.

[0094] In FIG. 1, a STA is taken as a mobile phone and an AP is taken as a router as an example, which does not limit the types of APs and STAs in embodiments of the present application. Meanwhile, the number of APs and STAs shown in FIG. 1 is only an example, and in specific implementations, the number of APs or STAs can be more or less, and the present application is not limited in this respect.

[0095] From different perspectives of sending and receiving signals, the first station shown below can be understood as a communication device that sends a PPDU, and the second station can be understood as a communication device that receives a PPDU.

[0096] From the perspective of different devices, as an example, the first station can be an AP, and the second station can be a non-AP STA. As another example, the first station and the second station can both be non-AP STAs or both be APs. As yet another example, the first station can be a non-AP STA, and the second station can be an AP. Specific forms of the first station and the second station are not listed one by one here.

[0097] Embodiments of the present application are described from the perspective of the first station and the second station, but the first station and the second station can also forward the signal through other devices in the process of transmitting the signal, such as forwarding the signal between the first station and the second station through a forwarding device. Embodiments of the present application do not limit other devices other than the first station and the second station.

[0098] The method related to embodiments of the present application is described below.

[0099] For the time domain, the amplitude of the wireless signal is constantly changing, so the transmission power of the wireless signal is not constant. PAPR refers to the ratio of the peak power of the signal in a period of time to the average power of the signal. Since the OFDM symbol is superimposed by a plurality of independently modulated subcarrier signals, when the phases of the subcarriers are the same or similar, the superimposed signal will be modulated by the same initial phase signal, thereby generating a larger instantaneous power peak, which further leads to a higher PAPR. Since the dynamic range of a general power amplifier is limited, an OFDM symbol with a large peak-to-average ratio is easy to enter the nonlinear region of the power amplifier, resulting in nonlinear distortion of the signal, causing significant spectral spread interference and in-band signal distortion, and leading to a serious decline in the performance of the entire system. In view of this, embodiments of the present application provide a communication method and device, which can effectively reduce the PAPR of the flag field.

[0100] As a possible implementation, each row in the following matrix represents a flag sequence:

[0101] Wherein, H' is a 64*96 matrix, and the elements in the matrix are 1 or -1.

[0102] FIG. 2a is the content of the matrix H. Each row in H' represents a flag sequence, that is, there are a total of 64 flag sequences.

[0103] Figure 2b is the PAPR corresponding to each of the 64 flag sequences. The horizontal axis in Figure 2b represents the index of the flag sequence, such as 1-64, and the vertical axis in Figure 2b represents the PAPR in decibels (dB). The modulation mode of the flag field generated according to the flag sequence is QBPSK, which means that bits 0 and 1 are mapped to 1i and -1i.

[0104] As can be seen from Figure 2b, the minimum PAPR is 5.25 dB. For IoT devices or small bandwidth devices, the PAPR is large, which can cause more nonlinear distortion, and also reduce the efficiency of the power amplifier, thereby affecting the system performance.

[0105] To solve the problem of large PAPR corresponding to the flag sequence, the present application designs a new flag sequence, which has a lower PAPR.

[0106] Figure 3 is a flowchart of a communication method according to an embodiment of the present application. The first station and the second station involved in the method are described with reference to Figure 1, which will not be described in detail here. As shown in Figure 3, the method comprises:

[0107] 301. The first station generates a flag field according to a flag sequence, the flag sequence corresponding to the BSS color of the BSS in which the first station is located.

[0108] The flag field is generated according to the flag sequence, and the elements in the flag sequence are mapped to corresponding frequency domain subcarriers. The value of the element carried on the frequency domain subcarrier is subjected to inverse Fourier transform and other processing operations to form the flag field occupying the OFDM symbol in the time domain. It should be understood that the inverse Fourier transform and other processing operations here are the general processing of converting the frequency domain signal to the time domain signal, which can be referred to the existing processing mode and will not be described here.

[0109] The flag field occupies one or more OFDM symbols, such as two OFDM symbols or three OFDM symbols, etc. Hereinafter, the case of occupying two OFDM symbols will be described.

[0110] The flag field can use the modulation mode of QBPSK, which means that bits 0 and 1 are mapped to 1i and -1i. By using the modulation mode of QBPSK, the false detection probability of the ELR-PPDU can be reduced. Generally, the non-ELR PPDU usually uses the modulation mode of BPSK at the position corresponding to the field, so that the flag field uses the modulation mode of QBPSK, which can reduce the false detection probability of the non-ELR PPDU being mistaken for the ELR-PPDU.

[0111] The BSS color can be used to distinguish different cells. In other words, the BSS colors of different cells are different. In other words, the BSS colors of different BSSs are different. The flag sequence carried in the identification field of the ELR PPDU sent by the first station corresponds to the BSS color of the BSS in which the first station is located, so that other stations in the BSS in which the first station is located can all identify whether the ELR PPDU is the ELR PPDU of the BSS according to the flag field. The flag field can be used to identify whether the PPDU including the flag field is the ELR PPDU of the cell. Alternatively, the flag field can also be used to identify whether the PPDU including the flag field is an ELR-PPDU.

[0112] The flag field can be referred to as an ELR flag field, and the name of the flag field is not limited in the embodiments of the present application. Alternatively, the flag field includes a flag field 1 and a flag field 2, the flag field 1 occupies one OFDM symbol, and the flag field 2 occupies one OFDM symbol. The flag field occupying two OFDM symbols can be one field or can be divided into a flag field 1 and a flag field 2, and the embodiments of the present application are not limited in this regard.

[0113] In a possible implementation, the number of bits indicating the BSS color can correspond to the total number of flag sequences. For example, the BSS color occupies 6 bits, and at most 2 6 =64 BSS colors can be indicated; in order to distinguish the flag sequences corresponding to different cells, the total number of flag sequences can be 2 6 =64. Of course, the total number of flag sequences can also be greater than 64. For example, the BSS color occupies 5 bits, and at most 2 5 =32 BSS colors can be indicated, and the total number of flag sequences can be 32. It can be understood that, for the convenience of description, the BSS color occupies 6 bits, and the total number of flag sequences is 64 in the following description.

[0114] In a specific implementation, the information used to distinguish different cells can be a BSS identifier (BSSID) or other information in addition to the BSS color. Therefore, the flag sequence used by the first station can correspond to the BSS color of the BSS in which the first station is located, and can also correspond to other information (such as a BSSID) of the BSS in which the first station is located, and the embodiments of the present application are not limited in this regard.

[0115] In a possible implementation, the total number of elements in a flag sequence corresponds to the total number of data subcarriers corresponding to the OFDM symbols occupied by the flag field. For example, if the number of data subcarriers corresponding to one OFDM symbol is N, the total number of data subcarriers corresponding to two OFDM symbols is 2N. Optionally, the total number of elements in the flag sequence is 2N. For example, N = 48. The elements in the flag sequence are 1 or -1. Optionally, the total number of elements in the flag sequence is N. For example, each OFDM symbol in the flag field corresponds to a flag sequence, and the total number of elements in a flag sequence corresponds to the total number of data subcarriers corresponding to one OFDM symbol occupied by the flag field. For example, flag field 1 in the flag field corresponds to flag sequence 1, and flag field 2 in the flag field corresponds to flag sequence 2, the total number of elements in the flag sequence 1 is N, and the total number of elements in the flag sequence 2 is N. The flag sequence 2 satisfies a transformation rule with the flag sequence 1. The transformation rule includes, but is not limited to, at least one of the following: the flag sequence 2 is the same as the flag sequence 1, the flag sequence 2 is the inverse of the flag sequence 1, and the flag sequence 2 is the reverse of the flag sequence 1.

[0116] In other words, the flag sequence provided in the present application can be for one OFDM symbol. If the flag field occupies one OFDM symbol, the data subcarriers corresponding to the one OFDM symbol carry the entire flag sequence. If the flag field occupies two or more OFDM symbols, the flag sequences carried by the data subcarriers corresponding to the other OFDM symbols have a mapping relationship with the flag sequence provided in the present application, which can be, for example, one of the following operations or a combination operation: same, inverse, reverse, and the like.

[0117] The flag sequence provided in the present application can also be for multiple OFDM symbols. If the flag field occupies one OFDM symbol, the data subcarriers corresponding to the one OFDM symbol carry the entire flag sequence. If the flag field occupies two or more OFDM symbols, the data subcarriers corresponding to each OFDM symbol in the multiple OFDM symbols respectively carry a part of the flag sequence, and all the data subcarriers corresponding to the multiple OFDM symbols carry the entire flag sequence.

[0118] Figure 4 is a diagram illustrating the division of subcarriers corresponding to an OFDM symbol according to an embodiment of the present application. As shown in Figure 4, one OFDM symbol can correspond to 52 subcarriers, of which 4 subcarriers are pilot subcarriers and 48 subcarriers are data subcarriers. The indices of the 52 subcarriers are [-26:-1, 1:26], of which the indices [-21, -7, 7, 21] are pilot subcarriers. The indices of the pilot subcarriers shown here are only examples, and the indices of the pilot subcarriers can change as the standard evolves, which is not limited by embodiments of the present application. In addition, the values carried on the pilot subcarriers are 1 or -1, which is not limited by the present application.

[0119] Optionally, the first element to the 96th element in the flag sequence can correspond to the 48 data subcarriers of the first OFDM symbol in the flag field in turn, and the 48 data subcarriers corresponding to the second OFDM symbol. For example, the first element to the 48th element in the flag sequence correspond to [-26:-22, -20:-8, -6:-1, 1:6, 8:20, 22:26] in the 48 data subcarriers of the first OFDM symbol in turn. For another example, the 49th element to the 96th element in the flag sequence correspond to [-26:-22, -20:-8, -6:-1, 1:6, 8:20, 22:26] in the 48 data subcarriers of the second OFDM symbol in turn.

[0120] In embodiments of the present application, [a:b:c] can refer to all integers from a to c (a and c are also integers) with a step of b. That is: a, (a+b), (a+2b), (a+3b), …, c. Whether the last value c can be taken depends on whether c-a is exactly an integer multiple of b, if not, the element c is not included. When b is equal to 1, [a:c] can be used to represent [a:1:c] generally. For example, [-26:-1] represents -26, -25, -24, -23, …, -3, -2, -1.

[0121] The features satisfied by the flag sequence and the specific elements of the flag sequence involved in embodiments of the present application are described below, and are not described in detail here.

[0122] 302. The first station sends the ELR-PPDU including the flag field. Correspondingly, the second station receives the ELR-PPDU.

[0123] The ELR-PPDU can also include an ELR-data field, which can be used to carry data information. The ELR-PPDU can also include an ELR long training field (LTF), which can be used for channel estimation. For better channel estimation, the ELR-LTF field can also have a 3dB power gain, for example. Alternatively, the resource unit (RU) used to transmit the ELR-LTF field is the same as the RU used to transmit the data field. The ELR-PPDU can also include an ELR signal (SIG) field, which can be used to carry information for demodulating the ELR-data field, etc. Alternatively, the RUs used to transmit the ELR-SIG field and the ELR-data field are the same as the RUs used to transmit the LTF field.

[0124] Alternatively, the bandwidth used to transmit the ELR-PPDU can be 20MHz. Alternatively, the first station can transmit the ELR-PPDU in units of 20MHz. With a subcarrier spacing of 78.125KHz, for example, there are 256 subcarriers in the 20MHz. The indices of the 256 subcarriers are [-128:127].

[0125] Table 1 shows 4 52-tone RUs used to transmit the ELR-LTF, for example. The subcarrier indices of the RUs are shown in Table 1:

[0126] Table 1

[0127] The 4 52-tone RUs used to transmit the ELR-LTF shown in Table 1 are merely examples, and do not limit the embodiments of the present application.

[0128] The format of the ELR-PPDU is described below, for example:

[0129] Figure 5a is a schematic diagram of a format of an ELR-PPDU according to an embodiment of the present application. As shown in Figure 5a, the ELR-PPDU includes the following fields: legacy preamble (or legacy preamble code), ELR preamble (or ELR preamble code), and ELR data. The legacy preamble field can be used to indicate legacy devices to avoid the transmission of the ELR-PPDU. That is, through the legacy preamble field, legacy devices can avoid transmitting a PPDU in the transmission time of the ELR-PPDU. The ELR preamble field is used for detection of the ELR-PPDU, channel estimation, and indication of modulation and coding of the ELR data field, etc. The ELR data field can carry data. Optionally, a flag field is included in the ELR preamble field.

[0130] Figure 5b is a schematic diagram of a format of an ELR-PPDU according to an embodiment of the present application. As shown in Figure 5b, the ELR-PPDU includes at least one of the following fields: legacy-short training field (L-STF), legacy-long training field (L-LTF) (or legacy-channel estimation field (L-CEF), legacy signal (L-SIG), repetition legacy signal (RL-SIG), universal signal (U-SIG) 1, U-SIG 2, ELR-mark 1, ELR-mark 2, ELR-STF, ELR-LTF, ELR-SIG, or ELR data.

[0131] The L-STF can be used for discovery of the ELR-PPDU, coarse synchronization, or automatic gain control (AGC), etc. The L-LTF can be used for fine synchronization, channel estimation, etc. The L-SIG and RL-SIG can be used to carry information related to the length of the ELR-PPDU, etc. The U-SIG can carry a physical layer version indication, etc. The ELR-STF can be used for automatic gain control of the subsequent fields, etc. For descriptions of other fields, refer to the foregoing, which will not be repeated here.

[0132] It can be understood that the order or position between the fields shown in FIG. 5b is only an example and does not limit the embodiments of the present application. With the development of the standard, the ELR-PPDU can also have other formats, and the embodiments of the present application do not limit the format of the ELR-PPDU shown in FIG. 5b. The transmission distance of the ELR-PPDU can be greater than a certain threshold. With the development of the standard, the PPDU including the flag field can also have other functions or other names, as long as the PPDU includes the flag field and the flag sequence meets the relationship shown in the embodiments of the present application, the PPDU is within the protection scope of the embodiments of the present application.

[0133] 303. The second station determines whether the received PPDU is the ELR-PPDU of the BSS in which the second station is located according to the flag sequence corresponding to the BSS color of the BSS in which the second station is located and the flag field in the received PPDU.

[0134] The second station performs a correlation operation according to the flag sequence corresponding to the BSS color of the BSS in which the second station is located and the flag field in the received PPDU. If the correlation result is greater than or equal to a threshold, the received PPDU of the second station is the ELR-PPDU of the BSS in which the second station is located. The BSS in which the first station is located is the same as the BSS in which the second station is located. If the correlation result is less than the threshold, the received PPDU of the second station is not the ELR-PPDU of the BSS in which the second station is located, or the received PPDU of the second station is not an ELR-PPDU.

[0135] Optionally, the second station determines whether the received PPDU is an ELR-PPDU according to the modulation mode of the flag field. For example, if the modulation mode of the flag field is QBPSK, it indicates that the received PPDU of the second station is an ELR-PPDU.

[0136] The description of the flag sequence can refer to step 201 or the following, which will not be described in detail here.

[0137] In the embodiments of the present application, the jth element in the N elements is the same as or opposite to the (j+1)th element, which can better match the data subcarriers corresponding to the flag field and meet the symmetry of data subcarrier division. If the jth element is the same as the (j+1)th element, under QBPSK modulation, the two elements contribute to the energy of the imaginary part of the time domain signal, and if the jth element is opposite to the (j+1)th element, under QBPSK modulation, the two elements contribute to the energy of the real part of the time domain signal, so that the energy distribution of the signal is more uniform, effectively reducing the PAPR and improving the system performance.

[0138] ​​​The following introduces a characteristic that a flag sequence in an embodiment of the present application satisfies.

[0139] In a possible implementation, the first N elements in the flag sequence and / or the last N elements in the flag sequence satisfy: the jth element in the N elements is the same as the (j+1)th element in the N elements, or the jth element and the (j+1)th element are opposite numbers.

[0140] The first N elements in the flag sequence represent the 1st element to the Nth element in the flag sequence. For example, if the total number of elements in the flag sequence is 2N, the last N elements in the flag sequence are the (N+1)th element to the (2N)th element. For another example, if the total number of elements in the flag sequence is N, the first N elements and the last N elements are the same. That is, the N elements shown below can be the flag sequence shown in the embodiment of the present application, the flag sequence composed of the N elements belongs to the protection scope of the embodiment of the present application, or the 2N elements shown below are the flag sequence shown in the embodiment of the present application, and the flag sequence composed of the 2N elements also belongs to the protection scope of the embodiment of the present application.

[0141] As shown in step 301, N is the number of data subcarriers corresponding to one OFDM symbol occupied by the flag field. The data subcarriers corresponding to one OFDM symbol can be divided into data subcarriers with an index less than 0 and data subcarriers with an index greater than 0 by the direct current subcarrier, and the index of the data subcarriers with an index less than 0 is in a symmetrical relationship with the index in the data subcarriers with an index greater than 0. Therefore, by satisfying the jth element in the N elements and the (j+1)th element in the N elements, the N elements can be better matched with the distribution of the data subcarriers.

[0142] The following illustrates the expression of the N elements. The parameters shown below are only examples and do not limit the embodiments of the present application. In addition to the expression shown in example 1 and example 2 below, other expressions can also be used, which are not listed one by one here.

[0143] As an example 1, the N elements are [x1, x2, x3, …, xN-1, xN]. For example, x1, x2, x3, …, xN-1, xN are represented by a sequence x, y1, y2, y3, …, yN-1, yN are represented by a sequence y, and the N elements are represented by a sequence S, then N / 2 N / 2 N / 2 N / 2 a

[0144] ​​​​​​​​​​As another example 2, the N elements are [-x1, -x2, -x1, …, -x N / 2 , y1, y2, y3, …, y N / 2 ]. For example, x1, x2, x3, …, x N / 2 . The sequence , y1, y2, y3, …, y N / 2 . The sequence , the N elements are represented by the sequence S b , then

[0145] For example 1 and example 2, , or i is 1, 2, 3, …, N / 2. The sequence and the sequence are binary sequences with a length of N / 2, and the elements are 1 or -1. and are linear mapping functions, that is is a sequence with the same length as , and satisfy the above example 1, is a sequence with the same length as , and satisfy the above example 2.

[0146] For example, the N elements shown in the above example 1 are the first N elements or the last N elements in the flag sequence corresponding to the BSS color 1. The N elements shown in the above example 2 are the first N elements or the last N elements in the flag sequence corresponding to the BSS color 2. The N elements shown in example 1 are orthogonal to the N elements shown in example 2. That is, the sequence composed of the N elements shown in example 1 and the sequence composed of the N elements shown in example 2 are orthogonal. Thus, the flag sequence corresponding to the BSS color 1 and the flag sequence corresponding to the BSS color 2 can be as orthogonal as possible.

[0147] In the embodiment of the application, the sequence S a is orthogonal to the sequence S b . Alternatively, if the sequence and the sequence are orthogonal, then and are also orthogonal. Similarly, if the sequence and the sequence are orthogonal, then and The flag sequence corresponding to the BSS color of the BSS in which the first station is located can satisfy the example 1 or the example 2.

[0148] In the embodiment of the application, the flag sequence corresponding to the BSS color of the BSS in which the first station is located can satisfy the example 1 or the example 2.

[0149] It should be noted that the same parameters in the example 1 and the example 2 can be the same value or different values for different flag sequences, and the embodiment of the application does not limit this. For example, x1=1 for the example 1, and x1=1 or x1=-1 for the example 2. The examples 1 and 2 focus on different expressions, and therefore the same parameters are used for description, but this is not a limitation of the embodiment of the application. The description of the examples 1 and 2 herein also applies to the following, which will not be repeated.

[0150] The following takes N=48 as an example to describe the relationship between the first 48 elements in the flag sequence or the relationship between the last 48 elements. The 48 elements can be the first 48 elements or the last 48 elements in the flag sequence with a length of 96, or the 48 elements in the flag sequence with a length of 48.

[0151] Taking the example 1 as an example, the 48 elements are [x1, x2, x3, …, x 24 , y1, y2, y3, …, y 24 ].

[0152] Taking the example 2 as an example, the 48 elements are [-x1, -x2, -x3, …, -x 24 , y1, y2, y3, …, y 24 ].

[0153] Wherein,

[0154] The value of i is 1, 2, 3, …, 24.

[0155] That is, taking the example 1 as an example, the 48 elements are [x1, x2, x3, …, x 24 , x 24 , -x 23 , x 22 , -x 21 , x 20 , -x 19 , -x 18 , x 17 , -x 16 , x 15 , -x 14 , x 13 ,

[0156] -x 12 ,x 11 ,-x 10 ,x9,-x8,x7,-x6,-x5,x4,-x3,x2,-x1]。

[0157] In Example 2, the 48 elements are [-x1, -x2, -x3, …, -x 24 ,x 24 ,-x 23 ,x 22 ,-x 21 ,x 20 ,-x 19 ,-x 18 ,x 17 ,-x 16 ,

[0158] x 15 ,-x 14 ,x 13 ,-x 12 ,x 11 ,-x 10 ,x9,-x8,x7,-x6,-x5,x4,-x3,x2,-x1]。

[0159] wherein [x1, x2, x3, …, x 24 ,y1,y2,y3,…,y 24 ] and [-x1, -x2, -x3, …, -x 24 ,y1,y2,y3,…,y 24 ] are orthogonal.

[0160] Optionally, [x1, x2, x3, …, x 24 ,y1,y2,y3,…,y 24 ] are the first 48 elements or the last 48 elements in the logo sequence corresponding to the BSS color 1, and [-x1, -x2, -x3, …, -x 24 ,y1,y2,y3,…,y 24 ] are the first 48 elements or the last 48 elements in the logo sequence corresponding to the BSS color 2. By satisfying the orthogonal relationship, the probability of misrecognizing the ELR-PPDU between cells can be effectively reduced.

[0161] According to the distribution of data subcarriers and pilot subcarriers shown in FIG. 4, there are 6 data subcarriers before the first pilot subcarrier in the subcarriers with index greater than 0, there are 13 data subcarriers between the first pilot subcarrier and the second pilot subcarrier, and there are 5 data subcarriers after the second pilot subcarrier. Therefore, through the design of i = {1, 2, 3, 4, 5, 6, 20, 21, 22, 23, 24} and i = {7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19}, not only the distribution of the first 24 elements and the last 24 elements in the first 48 elements (or the last 48 elements) in the flag sequence is matched, but also the distribution of the pilot subcarriers is matched. Through the design of i = (-1) i and i = (-1) i+1 , the PAPR of the sequence of 48 elements after the inverse order and / or negation of the sequence of 48 elements is the same (or the difference is less than a threshold) as the PAPR of the sequence of 48 elements, and the PAPR of the sequence of 48 elements is low. Thus, the PAPR of the flag sequence can be reduced as much as possible. That is, the flag sequence obtained in combination with the 48 elements can have the same PAPR (or the difference is less than a threshold) as the PAPR of the sequence of 48 elements, reducing the complexity of designing the flag sequence. At the same time, the first 24 elements and the last 24 elements in the 48 elements can further reduce the complexity of designing the flag sequence and the search complexity of the flag sequence by satisfying the above example 1 or example 2.

[0162] The following illustrates the first 48 elements or the last 48 elements in the flag sequence. The 48 elements shown below can be the first 48 elements or the last 48 elements in the flag sequence with a length of 96, or the 48 elements in the flag sequence with a length of 48.

[0163] The first 48 elements or the last 48 elements in the flag sequence with a length of 96, or the 48 elements in the flag sequence with a length of 48 can be one of the following:

[0164] 1 1 1 1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 -1 1 -1 1 -1;

[0165] 1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 -1;

[0166] 1 1 -1 1 -1 1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1;

[0167] 1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1;

[0168] 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 1 1 1 -1 1 -1- 1 -1 -1 1 -1 -1;

[0169] 1 1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 -1- 1 -1 1 1 1 -1;

[0170] 1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 -1 -1;

[0171] 1 1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1;

[0172] 1 -1 -1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1;

[0173] 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 -1;

[0174] 1 1 1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1;

[0175] 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 -1;

[0176] 1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1;

[0177] 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1;

[0178] 1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 -1.

[0179] 1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 -1.

[0180] The following illustrates the first 48 elements, or the last 48 elements, in a logo sequence. The 48 elements shown below can be the first 48 elements or the last 48 elements in a logo sequence of length 96, or the 48 elements in a logo sequence of length 48.

[0181] The first 48 elements, or the last 48 elements, in a logo sequence of length 96, or the 48 elements in a logo sequence of length 48, can be one of the following:

[0182] 1 1 1 1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 1.

[0183] 1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1.

[0184] 1 1 -1 1 -1 -1 1 -1 1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1.

[0185] 1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 1;

[0186] 1 1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 -1 1;

[0187] 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1;

[0188] 1 -1 -1 1 1 1 1 -1 -1 1 -1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 -1 1 1 1 -1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 1;

[0189] 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1;

[0190] 1 1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 1 1 1 1 -1 -1 1;

[0191] 1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 1;

[0192] 1 1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 1 1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1;

[0193] 1 -1 -1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 1;

[0194] 1 -1 1 1 -1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1;

[0195] 1 -1 1 -1 1 -1 -1 1 -1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 1 1;

[0196] 1 1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 1 1 -1 1;

[0197] 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1。

[0198] In a possible implementation, the first 48 elements in the flag sequence are denoted as sequence x, and the last 48 elements in the flag sequence are denoted as sequence y, and the sequence x and the sequence y satisfy: the sequence y is the same as the sequence x, or the sequence y is the sequence obtained by negating the sequence x, or the sequence y is the sequence obtained by reversing the sequence x, or the sequence y is the sequence obtained by negating and reversing the sequence x. For the characteristics that the sequence x and the sequence y satisfy, refer to the foregoing, and details are not described herein again.

[0199] Taking example 1 as an example, the flag sequence can be any of the following:

[0200] [x1, x2, x3, …, x 24 , y1, y2, y3, …, y 24 , x1, x2, x3, …, x 24 , y1, y2, y3, …, y 24 ];

[0201] [x1, x2, x3, …, x 24 , y1, y2, y3, …, y 24 , -x1, -x2, -x3, …, -x 24 , -y1, -y2, -y3, …, -y 24 ];

[0202] [x1, x2, x3, …, x 24 , y1, y2, y3, …, y 24 , y 24 , y 23 , y 21 , …, y1, x 24 , x 23 , x 22 , …, x1];

[0203] [x1, x2, x3, …, x 24 , y1, y2, y3, …, y 24 , -y 24 , -y 23 , -y 21 , …, -y1, -x 24 , -x 23 , -x 22 , …, -x1]。

[0204] For the relationship between y i and x 25-i , refer to example 1 in the foregoing, and details are not described herein again.

[0205] Taking example 2 as an example, the flag sequence can be any of the following:

[0206] [-x1,-x2,-x3,...,-x 24 ,y1,y2,y3,...,y 24 ,-x1,-x2,-x3,...,-x 24 ,y1,y2,y3,...,y 24 ];

[0207] [-x1,-x2,-x3,...,-x 24 ,y1,y2,y3,...,y 24 ,x1,x2,x3,...,x 24 ,-y1,-y2,-y3,...,-y 24 ];

[0208] [-x1,-x2,-x3,...,-x 24 ,y1,y2,y3,...,y 24 ,y 24 ,y 23 ,y 21 ,...,y1,-x 24 ,-x 23 ,-x 22 ,...,-x1];

[0209] [-x1,-x2,-x3,...,-x 24 ,y1,y2,y3,...,y 24 ,-y 24 ,-y 23 ,-y 21 ,...,-y1,x 24 ,x 23 ,x 22 ,...,x1].

[0210] The relationship between y i and x 25-i is referred to the example 2 above, which is not described in detail here.

[0211] The flag sequence can be obtained in combination of the first 48 elements (or the last 48 elements) in the flag sequence shown above, and the relationship between the first 48 elements and the last 48 elements, which is not described in detail here.

[0212] The flag sequence can also be referred to the matrix M shown below, for example, the flag sequence can be one row in the matrix M shown below.

[0213] As an example, if the ELR-PPDU distinguishes two BSSs, the flag sequences corresponding to the BSS colors of the two BSSs can be two rows of the matrix M below. For example, the flag sequence corresponding to the BSS color 1 is a row of the matrix M, and the flag sequence corresponding to the BSS color 2 is a row of the matrix M except the row corresponding to the BSS color 2.

[0214] As another example, if the ELR-PPDU distinguishes three BSSs, the flag sequences corresponding to the BSS colors of the three BSSs can be three rows of the matrix M below.

[0215] In an embodiment of the present application, the matrix M exemplarily shows 64 flag sequences corresponding to 64 BSS colors. In combination with the characteristics met by the flag sequences shown in the embodiment of the present application, there can be other matrix M, which is not limited in the embodiment of the present application. For example, if the partial sequences shown in the matrix M are the flag sequences corresponding to the BSS colors, the partial flag sequences belong to the protection scope of the embodiment of the present application. Or, if all the sequences in the matrix M are the flag sequences corresponding to the BSS colors, the matrix M also belongs to the protection scope of the embodiment of the present application.

[0216] In combination with the characteristics met by the flag sequences, the flag sequences can be designed. In the following, some flag sequences are exemplarily shown. In combination with the method shown in the above, other flag sequences can also be obtained, which will not be listed one by one in the following.

[0217] In a possible implementation, the flag sequence 1 corresponding to the first OFDM symbol in the flag field and the flag sequence 2 corresponding to the second OFDM symbol in the flag field can meet: the flag sequence 1 is the same as the flag sequence 2, or the flag sequence 2 is the sequence obtained by reversing the flag sequence 1, or the flag sequence 2 is the sequence obtained by reversing the order of the flag sequence 1, or the flag sequence 2 is the sequence obtained by reversing and reversing the order of the flag sequence 1. For the characteristics met by the flag sequence 1 and the flag sequence 1, reference can be made to the above, which will not be described in detail herein. The flag sequence 1 or the flag sequence 2 can be one of the 48 elements shown in the above.

[0218] The characteristics met by the flag sequences involved in the embodiments of the present application are introduced in the above. In the embodiments of the present application, the flag sequences corresponding to different BSS colors also meet orthogonality, thereby effectively reducing the non-linear distortion, improving the efficiency of the power amplifier, and maximizing the probability of reducing the mis-recognized PPDU, and improving the overall performance of the ELR system. Therefore, the relationship between multiple flag sequences will be introduced in the following.

[0219] For example 1 and example 2 shown in the above, the sequences S a and S b are orthogonal, and any two sequences and sequence are orthogonal, then and are also orthogonal. Similarly, if two sequences and sequence are orthogonal, then and are also orthogonal. Therefore, 16 orthogonal sequences ~ sequences and 16 orthogonal sequences sequences can be selected respectively. In combination with the relationship between y i and x 25-i , the above 32 sequences can be used to obtain a set of low-PAPR flag sequences. The set of low-PAPR flag sequences includes flag sequences corresponding to different BSS colors.

[0220] The following exemplary shows the first 48 elements (or the last 48 elements) of each of the 32 flag sequences. The 48 elements shown below can be the first 48 elements or the last 48 elements of a flag sequence with a length of 96, or the 48 elements of a flag sequence with a length of 48.

[0221] 1 1 1 1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 -1 1 -1 1 -1;

[0222] 1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 -1;

[0223] 1 1 -1 1 -1 1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1;

[0224] 1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1;

[0225] 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1;

[0226] 1 1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 -1;

[0227] 1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 -1 -1;

[0228] 1 1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1;

[0229] 1 -1 -1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1;

[0230] 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 -1;

[0231] 1 1 1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1;

[0232] 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 -1;

[0233] 1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1;

[0234] 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1;

[0235] 1 -1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1;

[0236] 1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 -1;

[0237] 1 1 1 1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 1;

[0238] 1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1;

[0239] 1 1 -1 1 -1 -1 1 -1 1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1;

[0240] 1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 1;

[0241] 1 1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 -1 1;

[0242] 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1;

[0243] 1 -1 -1 1 1 1 1 -1 -1 1 -1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 -1 1 1 1 -1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 1;

[0244] 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1;

[0245] 1 1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 1 1 1 1 -1 -1 1;

[0246] 1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 1;

[0247] 1 1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 1 1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1;

[0248] 1 -1 -1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 1;

[0249] 1 -1 1 1 -1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1;

[0250] 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1.

[0251] 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1.

[0252] 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1.

[0253] For the convenience of description, the first 48 elements in the above 32 flag sequences are referred to as a matrix C.

[0254] In a possible implementation, an element in the flag sequence is an element in a row corresponding to the BSS color in the matrix M, and the matrix M is as follows:

[0255] or or or

[0256] Any two rows in the matrix C are orthogonal to each other, and the N elements are an element in a row in the matrix C. For details of the matrix C, refer to the foregoing description, which is not described in detail herein. P is a unit matrix or a permutation matrix, that is:

[0257] or

[0258] In the embodiments of this application, any element in the matrix C can satisfy the characteristics of the N elements, and any two rows in the matrix C are orthogonal, so that the PAPR can be effectively reduced, and the probability of misrecognition can also be reduced.

[0259] The flag sequence involved in the embodiments of this application is described below.

[0260] As an example, the flag sequence is

[0261] 1 1 1 1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 1 1 1 1 -1 1 1 -1 1 1 -1 -1 1 -1 1 1 1 1 1;

[0262] 1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 1 1 -1 -1 -1 -1 1 1 1;

[0263] 1 1 -1 1 -1 1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 -1 1 1;

[0264] 1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 1;

[0265] 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1;

[0266] 1 1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1;

[0267] 1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 -1 1 -1 1 1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 1;

[0268] 1 1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 1 1 1;

[0269] 1 -1 -1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1;

[0270] 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1;

[0271] 1 1 1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 1 1;

[0272] 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 1 -1 1 1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 1;

[0273] 1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 1 1 1 -1 1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 1;

[0274] 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 1;

[0275] 1 -1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 -1 1;

[0276] 1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 1 -1 1 -1 -1 1 1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 1;

[0277] 1 1 1 1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 -1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 1;

[0278] 1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1 -1 1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 1;

[0279] 1 1 -1 1 -1 -1 1 -1 1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 -1 1 1 1 -1 1 1 -1 1 -1 -1 1 -1 1 1;

[0280] 1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 1 -1 1;

[0281] 1 1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 1 1;

[0282] 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 1 1;

[0283] 1 -1 -1 1 1 1 1 -1 -1 1 -1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 -1 1 1 1 -1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 -1 -1 1 1 1 -1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 -1 1;

[0284] 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 1;

[0285] 1 1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 1 1;

[0286] 1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 -1 -1 1 1 -1 1 1 1 1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1;

[0287] 1 1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 1 1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 -1 -1 -1 1 1;

[0288] 1 -1 -1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 -1 1;

[0289] 1 -1 1 1 -1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 -1 1;

[0290] 1 -1 1 -1 1 -1 -1 1 -1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 1 1 1 1 1 1 1 -1 1 1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 1 1 -1 1 -1 -1 1 -1 1 -1 1;

[0291] 1 1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 1 1 1;

[0292] 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1;

[0293] 1 1 1 1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1;

[0294] 1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1;

[0295] 1 1 -1 1 -1 1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1;

[0296] 1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 1 1 1 1 1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1;

[0297] 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 1 1 1 -1 -1 1 1 1 -1;

[0298] 1 1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1;

[0299] 1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 -1 -1 1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 1 1 1 -1 -1 1 1 1 1 1 -1 1 -1 1 -1 1 -1 1 -1;

[0300] 1 1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1;

[0301] 1 -1 -1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 -1;

[0302] 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 1 1 1 1 -1 -1;

[0303] 1 1 1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 -1;

[0304] 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 1 -1 1 1 -1 -1;

[0305] 1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 1 -1 -1 1 1 -1 -1 1 -1;

[0306] 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 1 1 1 -1 1 1 -1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 1 -1;

[0307] 1 -1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 1 1 1 -1 1 1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 1 -1 -1 -1 1 -1 -1 -1 1 1 -1 1 -1;

[0308] 1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 -1;

[0309] 1 1 1 1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1;

[0310] 1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 1 1 -1 1 1 1 -1 -1 -1 -1;

[0311] 1 1 -1 1 -1 -1 1 -1 1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1;

[0312] 1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1;

[0313] 1 1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 -1;

[0314] 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1;

[0315] 1 -1 -1 1 1 1 1 -1 -1 1 -1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 -1 1 1 1 -1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 -1 -1 -1 1 1 -1;

[0316] 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 1 1 -1 1 1 1 1 -1 1 1 1 -1 1 1 1 1 1 -1;

[0317] 1 1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 1 1 -1 -1 1 1 -1 -1;

[0318] 1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 -1;

[0319] 1 1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 1 1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 -1 -1;

[0320] 1 -1 -1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 1 1 -1 1 1 -1 1 1 1 -1 -1 1 1 -1;

[0321] 1 -1 1 1 -1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1;

[0322] 1 -1 1 -1 1 -1 -1 1 -1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 -1;

[0323] 1 1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1;

[0324] 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 -1;

[0325] The order of any row in the matrix M is not limited in the embodiments of the present application. The order of the elements in any row in the matrix M can be rearranged. The orthogonality between the sequences is not affected, and the PAPR of the flag sequence is not affected.

[0326] Inverting the elements in any row in the matrix M is also within the protection scope of the embodiments of the present application. For example, inverting one or more rows of elements in the matrix M, the inverted matrix is still within the protection scope of the embodiments of the present application. The orthogonality between the sequences is not affected, and the PAPR of the flag sequence is not affected.

[0327] The matrix obtained by reversing and / or inverting the first 48 elements in one or more rows of elements in the matrix M is still within the protection scope of the embodiments of the present application. The orthogonality between the sequences is not affected, and the PAPR of the flag sequence is not affected.

[0328] The matrix obtained by reversing and / or inverting the last 48 elements in one or more rows of elements in the matrix M is still within the protection scope of the embodiments of the present application. The orthogonality between the sequences is not affected, and the PAPR of the flag sequence is not affected.

[0329] The PAPR of the flag sequence involved in the embodiments of the present application is introduced below.

[0330] FIG. 6 is the PAPR of the 64 flag sequences in the matrix M provided by the embodiments of the present application. The abscissa in FIG. 6 represents the index of the flag sequence, and the ordinate in FIG. 6 represents the PAPR in dB.

[0331] Table 2 exemplarily shows the size relationship between the PAPR of the flag sequence designed in the embodiments of the present application and the flag sequence shown in FIG. 2a. Table 2 shows the minimum PAPR comparison, the maximum PAPR comparison and the PAPR median comparison between the flag sequence designed in the embodiments of the present application and the flag sequence shown in FIG. 2a.

[0332] Table 2 Table 2

[0333] From the above, it can be seen that the maximum PAPR of the logo sequence designed in the present application is lower than the minimum PAPR shown in FIG. 2a, and thus the logo sequence designed in the present application has obvious advantages.

[0334] The relevant description of the sequence provided below refers to the above and will not be described in detail below.

[0335] The following illustrates the first 48 elements or the last 48 elements in the logo sequence. The 48 elements shown below can be the first 48 elements or the last 48 elements in the logo sequence with a length of 96, or the 48 elements in the logo sequence with a length of 48.

[0336] The first 48 elements or the last 48 elements in the logo sequence with a length of 96, or the 48 elements in the logo sequence with a length of 48 can be as follows:

[0337] 1 1 1 1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 -1 1 -1 1 -1;

[0338] 1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1;

[0339] 1 1 -1 1 -1 1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1;

[0340] 1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1;

[0341] 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1;

[0342] 1 1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 -1;

[0343] 1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 -1 -1;

[0344] 1 1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1;

[0345] 1 -1 -1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1;

[0346] 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 -1;

[0347] 1 1 1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1;

[0348] 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 -1;

[0349] 1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1;

[0350] 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1;

[0351] 1 -1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1;

[0352] 1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 -1.

[0353] The following illustrates the first 48 elements, or the last 48 elements, in a flag sequence. The 48 elements shown below can be the first 48 elements or the last 48 elements in a flag sequence of length 96, or the 48 elements in a flag sequence of length 48.

[0354] The first 48 elements, or the last 48 elements, in a flag sequence of length 96, or the 48 elements in a flag sequence of length 48, can be one of the following:

[0355] 1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 1 1;

[0356] 1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1;

[0357] 1 -1 -1 -1 1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 -1 1 1;

[0358] 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1;

[0359] 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1;

[0360] 1 1 1 -1 1 1 1 1 1 -1 1 -1 -1 1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1;

[0361] 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 1 1 1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 1;

[0362] 1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1 1 1;

[0363] 1 1 1 -1 1 1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 1 1 -1 1;

[0364] 1 -1 1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 1 1;

[0365] 1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 1;

[0366] 1 1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 1 1 1 -1 1;

[0367] 1 1 -1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1;

[0368] 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 1

[0369] 1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 1

[0370] 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 1

[0371] The following shows, by way of example, the first 48 elements (or the last 48 elements) of each of 32 flag sequences. The 48 elements shown below can be the first 48 elements or the last 48 elements of a flag sequence of length 96, or the 48 elements of a flag sequence of length 48.

[0372] 1 1 1 1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 -1 1 -1 1 -1

[0373] 1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 -1

[0374] 1 1 -1 1 -1 1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1

[0375] 1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1;

[0376] 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1;

[0377] 1 1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 -1;

[0378] 1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 -1 -1;

[0379] 1 1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1;

[0380] 1 -1 -1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1;

[0381] 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 -1;

[0382] 1 1 1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1;

[0383] 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 -1;

[0384] 1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1;

[0385] 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1;

[0386] 1 -1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1;

[0387] 1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 -1;

[0388] 1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 1 1;

[0389] 1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1;

[0390] 1 -1 -1 -1 1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 -1 1 1;

[0391] 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1;

[0392] 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1;

[0393] 1 1 1 -1 1 1 1 1 1 -1 1 -1 -1 1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1;

[0394] 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 1 1 1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 1;

[0395] 1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1 1 1;

[0396] 1 1 1 -1 1 1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 1 1 -1 1;

[0397] 1 -1 1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 1 1 1;

[0398] 1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 1;

[0399] 1 1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 1;

[0400] 1 1 -1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1;

[0401] 1 1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 1;

[0402] 1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 1;

[0403] 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 1.

[0404] As shown above, the first 48 elements in the above 32 flag sequences are referred to as matrix C. The way to obtain matrix M from matrix C is referred to above and will not be described in detail here. Matrix M obtained from the above matrix C will not be listed here.

[0405] As shown above, the order of any row in matrix M can be rearranged, which also belongs to the protection scope of the embodiments of the present application.

[0406] As shown above, the elements in one or more rows in matrix M can be inverted, such as the inversion of part of the elements (such as the first 48 elements, or the last 48 elements), or the inversion of all elements, which also belongs to the protection scope of the embodiments of the present application.

[0407] As shown above, the first 48 elements in one or more rows in matrix M can be reversed, which still belongs to the protection scope of the embodiments of the present application.

[0408] As shown above, the last 48 elements in one or more rows in matrix M can be reversed, which still belongs to the protection scope of the embodiments of the present application.

[0409] The inversion of one or more columns or all columns in matrix M, such as the first, third, fifth, sixth, eighth, tenth, twelfth, fourteenth, sixteenth, eighteenth, nineteenth, twenty-first, twenty-third, twenty-sixth, twenty-eighth, thirtieth, thirty-first, thirty-third, thirty-fifth, thirty-seventh, thirty-ninth, forty-first, forty-third, forty-fourth, forty-sixth, and forty-eighth columns, also belongs to the protection scope of the embodiments of the present application.

[0410] Optionally, the first column of the matrix M is all 1, if not considering the orthogonality problem, the first column of part of rows of the matrix M can be taken as negative, thereby further increasing the Hamming distance between different sequences, which belongs to the protection scope of the embodiments of the present application. By increasing the Hamming distance between sequences, the identification efficiency of the ELR PPDU and the identification efficiency of the BSS color can be improved.

[0411] Fig. 10 is the PAPR of the 64 flag sequences in the matrix M provided by the embodiments of the present application. The abscissa in Fig. 10 represents the index of the flag sequence, and the ordinate in Fig. 10 represents the PAPR in dB.

[0412] Table 3 exemplarily shows the size relationship between the PAPR of the flag sequence designed by the embodiments of the present application and the flag sequence shown in Fig. 2a. Table 3 shows the minimum PAPR comparison, the maximum PAPR comparison and the PAPR median comparison between the flag sequence designed by the present application and the flag sequence shown in Fig. 2a.

[0413] Table 3

[0414] From the above, it can be seen that the maximum PAPR of the flag sequence designed by the present application is lower than the minimum PAPR shown in Fig. 2a, so that the flag sequence designed by the present application has obvious advantages.

[0415] The following illustrates the first 48 elements or the last 48 elements in the flag sequence. The 48 elements shown below can be the first 48 elements or the last 48 elements in the flag sequence with a length of 96, or can be the 48 elements in the flag sequence with a length of 48.

[0416] The first 48 elements or the last 48 elements in the flag sequence with a length of 96, or the 48 elements in the flag sequence with a length of 48 can be as follows:

[0417] 1 1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1;

[0418] 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1;

[0419] 1 -1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 1 -1 1 1 -1;

[0420] 1 1 -1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 -1 -1 1 -1 1 1 -1;

[0421] 1 -1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1;

[0422] 1 -1 1 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 1 1 -1 1 1 -1 -1 -1;

[0423] 1 1 -1 1 1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 1 1 -1;

[0424] 1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1.

[0425] The above 8 orthogonal flag sequences also satisfy the relevant features involved in Example 1 above.

[0426] The following illustrates the first 48 elements, or the last 48 elements, in a signature sequence. The 48 elements shown below can be the first 48 elements or the last 48 elements in a signature sequence of length 96, or the 48 elements in a signature sequence of length 48.

[0427] The first 48 elements, or the last 48 elements, in a signature sequence of length 96, or the 48 elements in a signature sequence of length 48, can be one of the following:

[0428] 1 -1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1;

[0429] 1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 1;

[0430] 1 1 -1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 1;

[0431] 1 1 -1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 -1 -1 1;

[0432] 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1;

[0433] 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 1 1 1 -1 1 1 1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1;

[0434] 1 1 1 -1 1 1 1 -1 1 1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1;

[0435] 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 1 1 1 1 1 1 -1 1 1 -1 1 1 1 1 1 -1 1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 1 -1 1 1 1 -1 1.

[0436] The above 8 orthogonal marker sequences also satisfy the relevant features involved in Example 2 above.

[0437] The descriptions of the eight orthogonal label sequences that satisfy the features mentioned in Example 1 above, and the eight orthogonal label sequences that satisfy the features mentioned in Example 2 above, are as follows:

[0438] As shown in Examples 1 and 2 above, sequence S a With sequence S b They are orthogonal, and any two sequences are... and sequence If orthogonal, then and They are also orthogonal. Similarly, if two sequences... and sequence If they are orthogonal, then S b1 With S b2 They are also orthogonal. Therefore, multiple orthogonal sequences (such as 8 sequences) can be selected. ~sequence Simultaneously select multiple orthogonal sequences (e.g., 8 sequences). ~sequence Then any two sequences in these sequences are orthogonal. Combined with y i With x 25-i The relationship between these sequences allows the corresponding marker sequences to have low PAPR, resulting in a set of marker sequences with low PAPR. This set of marker sequences includes marker sequences corresponding to different BSS colors.

[0439] The following exemplarily shows 16 flag sequences, the first 48 elements (or the last 48 elements) of each sequence. The 48 elements shown below can be the first 48 elements or the last 48 elements in a flag sequence of length 96, or can be 48 elements in a flag sequence of length 48.

[0440] 1 1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1;

[0441] 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1;

[0442] 1 -1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1;

[0443] 1 1 -1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 -1 -1 1 -1 1 1 -1;

[0444] 1 -1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1;

[0445] 1 -1 1 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 1 1 -1 1 1 -1 -1 -1;

[0446] 1 1 -1 1 1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 1 1 -1;

[0447] 1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1;

[0448] 1 -1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1;

[0449] 1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 1;

[0450] 1 1 -1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 1;

[0451] 1 1 -1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 -1 -1 1;

[0452] 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1;

[0453] 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1;

[0454] 1 1 1 -1 1 1 1 -1 1 1 1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 1 1 -1 1;

[0455] 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 1 -1 1 1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 1 -1 1.

[0456] As shown above, for the convenience of description, the first 48 elements in the above 16 flag sequences are referred to as a matrix C.

[0457] As shown above, the matrix M1 is as follows:

[0458] or or or

[0459] Any two rows in the matrix C are orthogonal to each other, and N elements are one row of elements in the matrix C. For the specific content of the matrix C, refer to the above, which will not be described in detail here. P is a unit matrix or a permutation matrix, i.e.:

[0460] or

[0461] Matrix The matrix M is a 64*96 matrix, any two rows in the matrix can be orthogonal or completely opposite, thus the Hamming distance between different rows can be guaranteed, thereby reducing the false detection probability. For example, any row in the matrix can be used as a flag sequence, and the flag sequence after Q-BPSK modulation generates the flag field in the ELR PPDU.

[0462] Taking the matrix C listed above as an example, the flag sequence is

[0463] 1 1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 1 1 1 1;

[0464] 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 1;

[0465] 1 -1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 1;

[0466] 1 1 -1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 -1 -1 1 1;

[0467] 1 -1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 -1 1 1 1 -1 1 -1 -1 1 -1 1;

[0468] 1 -1 1 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 1 -1 1;

[0469] 1 1 -1 1 1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 1 1 -1 1 1;

[0470] 1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 1;

[0471] 1 -1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 -1 -1 1;

[0472] 1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 1;

[0473] 1 1 -1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 1 1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 1;

[0474] 1 1 -1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 1 -1 -1 -1 1 1 1 -1 1 1;

[0475] 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1;

[0476] 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 --1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 1 -1 1 -1 1 1 -1 1 1;

[0477] 1 1 1 -1 1 1 1 -1 1 1 1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 1 1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 1 1 1 -1 1 1 1 -1 1 1 1;

[0478] 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 1 -1 1 1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 1 1 1 1 1 1 -1 1 1 -1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1;

[0479] 1 1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 -1;

[0480] 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1;

[0481] 1 -1 1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1 1 1 1 -1 1 1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 -1 1 -1;

[0482] 1 1 -1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 -1;

[0483] 1 -1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 -1;

[0484] 1 -1 1 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 1 1 1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1;

[0485] 1 1 -1 1 1 -1 1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1;

[0486] 1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 -1;

[0487] 1 -1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 1 1 1 -1;

[0488] 1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 1 1 -1 -1 -1 1 1 1 -1 -1 1 1 -1;

[0489] 1 1 -1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 -1;

[0490] 1 1 -1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 -1 1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 -1 -1;

[0491] 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 1 -1;

[0492] 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1;

[0493] 1 1 1 -1 1 1 1 -1 1 1 1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1;

[0494] 1 1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 1 -1 1 1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 -1;

[0495] -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 -1;

[0496] -1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1;

[0497] -1 1 -1 1 -1 1 1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 -1 1 1 -1 1 1 1 1 1 1 1 1 1 1 -1 1 1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 -1 1 -1;

[0498] -1 -1 1 1 1 -1 1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 -1 1 1 1 -1 -1;

[0499] -1 1 -1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 -1 1 1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 -1 1 1 1 1 1 1 1 1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 -1;

[0500] -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 1 1 1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1;

[0501] -1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1;

[0502] -1 1 1 1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1 1 1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 -1;

[0503] -1 1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 -1 1 1 1 1 1 -1 1 1 1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 1 1 1 -1;

[0504] -1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 1 1 1 1 1 1 -1 -1 -1 1 1 1 -1 -1 1 1 -1;

[0505] -1 -1 1 1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 -1;

[0506] -1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 -1 -1;

[0507] -1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 1 -1;

[0508] -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1;

[0509] -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1;

[0510] -1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 -1;

[0511] -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 1 1 1 1;

[0512] -1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 1;

[0513] -1 1 -1 1 -1 1 1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 -1 1 1 -1 1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 1;

[0514] -1 -1 1 1 1 -1 1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 -1 -1 1 1;

[0515] -1 1 -1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 -1 1 1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 -1 1 1 1 -1 1 -1 -1 1 -1 1;

[0516] -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 1 -1 1;

[0517] -1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 -1 1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 1 1 -1 1 1;

[0518] -1 1 1 1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 1;

[0519] -1 1 1 1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 -1 1 1 1 1 1 -1 1 1 1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 -1 -1 1;

[0520] -1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 1;

[0521] -1 -1 1 1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 1;

[0522] -1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 1 -1 -1 -1 1 1 1 -1 1 1;

[0523] -1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1;

[0524] -1 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 1 -1 1 -1 1 1 -1 1 1;

[0525] -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 1 1 1 -1 1 1 1 -1 1 1 1;

[0526] -1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 1 1 1 1 1 1 -1 1 1 -1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1.

[0527] As shown above, the order of any row in the matrix M can be rearranged, which also belongs to the protection scope of the embodiments of the present application.

[0528] As shown above, the elements of one or more rows in the matrix M are negated, such as the elements of one or more rows are negated (such as the first 48 elements, or the last 48 elements), or all the elements are negated, which also belongs to the protection scope of the embodiments of the present application.

[0529] As shown above, the first 48 elements of one or more rows in the matrix M are reversed, which also belongs to the protection scope of the embodiments of the present application.

[0530] As shown above, the last 48 elements of one or more rows in the matrix M are reversed, which also belongs to the protection scope of the embodiments of the present application.

[0531] The column or columns or all columns of the 1st, 3rd, 5th, 6th, 8th, 10th, 12th, 14th, 16th, 18th, 19th, 21st, 23rd, 26th, 28th, 30th, 31st, 33rd, 35th, 37th, 39th, 41st, 43rd, 44th, 46th, and 48th columns in the matrix M are negated, which also belongs to the protection scope of the embodiments of the present application.

[0532] Optionally, the first column of the matrix M is all 1, if the orthogonality problem is not considered, the first column of some rows of the matrix M can be negated, so as to further increase the Hamming distance between different sequences, which belongs to the protection scope of the embodiments of the present application. By increasing the Hamming distance between the sequences, the identification efficiency of the ELR PPDU and the identification efficiency of the BSS color can be improved.

[0533] FIG. 11 is the PAPR of the 64 flag sequences in the matrix M provided by the embodiments of the present application. The horizontal coordinate in FIG. 11 represents the index of the flag sequence, and the vertical coordinate in FIG. 11 represents the PAPR, in dB.

[0534] Table 4 exemplarily shows the size relationship between the PAPR of the flag sequence designed in the embodiment of the present application and the flag sequence shown in Fig. 2a. Table 4 shows the minimum PAPR comparison, the maximum PAPR comparison and the PAPR median comparison between the flag sequence designed in the present application and the flag sequence shown in Fig. 2a.

[0535] Table 4

[0536] From the above, it can be seen that the maximum PAPR of the flag sequence designed in the present application is lower than the minimum PAPR shown in Fig. 2a, so the flag sequence designed in the present application has obvious advantages.

[0537] The communication device provided by the embodiment of the present application will be introduced below.

[0538] The present application divides the function modules of the communication device according to the above-mentioned method embodiments, for example, each function module can be divided according to each function, or two or more functions can be integrated in one processing module. The integrated module can be realized in the form of hardware or in the form of software function module. It should be noted that the division of the modules in the present application is illustrative, and is only a logical function division, and another division mode can be used in actual implementation. The communication device of the embodiment of the present application will be described in detail below with reference to Figs. 7 to 9.

[0539] Fig. 7 is a structure schematic diagram of the communication device provided by the embodiment of the present application. As shown in Fig. 7, the communication device includes a processing module 701 and a transceiver module 702. The transceiver module 702 can realize corresponding communication functions, and the processing module 701 is used to realize corresponding processing functions. The transceiver module 702 can also be referred to as an interface, a communication interface or a communication module, etc.

[0540] In some embodiments of the present application, the communication device can be used to execute the actions performed by the first station in the above-mentioned method embodiments, at this time, the first station can be the device itself or a chip or a function module, etc. configurable in the device. The transceiver module 702 is used to execute the transceiving related operations of the first station in the above-mentioned method embodiments, and the processing module 701 is used to execute the processing related operations of the first station in the above-mentioned method embodiments.

[0541] The processing module 701 is used to generate a flag field according to a flag sequence;

[0542] The transceiver module 702 is used to send or output a PPDU including the flag field.

[0543] Referring to FIG. 7, in some embodiments of the present disclosure, the communication apparatus can be configured to perform the actions of the second station in the above method embodiments. The second station can be the device itself or a chip or functional module configured in the device. The transceiver module 702 can be configured to perform the operations related to the transceiving of the second station in the above method embodiments. The processing module 701 can be configured to perform the operations related to the processing of the second station in the above method embodiments.

[0544] The transceiver module 702 can be configured to receive the PPDU, which includes the flag field.

[0545] The processing module 701 can be configured to determine, according to the flag sequence and the flag field, whether the PPDU is an ELR-PPDU corresponding to the BSS color of the BSS.

[0546] For example, the transceiver module 702 can be an antenna module. For another example, the transceiver module 702 can be an input / output module. Optionally, in some embodiments, the communication apparatus can further include a storage module, which can be configured to store instructions and / or data. The processing module 701 can read the instructions and / or data in the storage module, so that the communication apparatus can implement the above method embodiments.

[0547] In some embodiments, the specific descriptions of the terms, names or steps can refer to the descriptions in the above method embodiments, which will not be repeated here.

[0548] The specific descriptions of the transceiver module and the processing module in the above embodiments are only examples. For the specific functions or steps of the transceiver module and the processing module, please refer to the above method embodiments, which will not be repeated here.

[0549] It can be understood that the division of the modules in the above apparatus is only a logical function division. One function module can correspond to one function, or two or more functions can be integrated into one function module. In actual implementation, all or part of the modules can be integrated into one physical entity, or distributed in different physical entities. In addition, the function modules can be implemented in the form of hardware, software or a combination of hardware and software.

[0550] In an example, the functional units in any of the above apparatuses can be one or more integrated circuits configured to implement the above methods, for example, 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.

[0551] The communication apparatus of the embodiments of the present application is introduced above, and possible product forms of the communication apparatus are introduced below. Any product form with the functions of the communication apparatus described in FIG. 7 falls within the protection scope of the embodiments of the present application. The introduction below is only for example, and does not limit the product form of the communication apparatus of the embodiments of the present application.

[0552] In a possible implementation, in the communication apparatus shown in FIG. 7, the processing module 701 can be one or more processors, and the transceiver module 702 can be a transceiver, or the transceiver module 702 can also be a sending module and a receiving module, the sending module can be a transmitter, and the receiving module can be a receiver, and the sending module and the receiving module are integrated in one device, for example, a transceiver. In the embodiments of the present application, the processor and the transceiver can be coupled, and the connection manner of the processor and the transceiver is not limited in the embodiments of the present application. In the process of executing the above method, the process of sending information in the above method can be the process of outputting the above information by the processor. When the above information is output, the processor outputs the above information to the transceiver, so as to be transmitted by the transceiver. The above information can need to be processed further after being output by the processor, and then reaches the transceiver. Similarly, the process of receiving information in the above method can be the process of receiving the input above information by the processor. When the processor receives the input information, the transceiver receives the above information and inputs it to the processor. Further, after the transceiver receives the above information, the above information can need to be processed further, and then input to the processor.

[0553] FIG. 8 is another structural schematic diagram of the communication apparatus provided by the embodiments of the present application. As shown in FIG. 8, the communication apparatus 80 includes one or more processors 820 and a transceiver 810.

[0554] In some embodiments of the present application, the communication device can be configured to perform the steps or methods or functions performed by the first station, e.g., the processor 820 can be configured to perform the functions or steps implemented by the processing module 701 as shown in FIG. 7, and the transceiver 810 can be configured to perform the functions or steps implemented by the transceiving module 702 as shown in FIG. 7. For the detailed description of the processor 820 and the transceiver 810, reference can be made to FIG. 7 or the method embodiments described above, and thus no further elaboration is provided herein.

[0555] In some embodiments of the present application, the communication device can be configured to perform the steps or methods or functions performed by the first station, e.g., the processor 820 can be configured to perform the functions or steps implemented by the processing module 701 as shown in FIG. 7, and the transceiver 810 can be configured to perform the functions or steps implemented by the transceiving module 702 as shown in FIG. 7. For the detailed description of the processor 820 and the transceiver 810, reference can be made to FIG. 7 or the method embodiments described above, and thus no further elaboration is provided herein.

[0556] In the various implementations of the communication device shown in FIG. 8, the transceiver can include a receiver configured to perform the functions (or operations) of receiving and a transmitter configured to perform the functions (or operations) of transmitting. The transceiver is configured to communicate with other devices / apparatuses over a transmission medium.

[0557] Optionally, the communication device 80 can further include one or more memories 830 configured to store program instructions and / or data. The memory 830 is coupled to the processor 820. The coupling between the communication device, units or modules in the embodiments of the present application is indirect coupling or communication connection between the communication device, units or modules, which can be electrical, mechanical or other forms, for information interaction between the communication device, units or modules. The processor 820 can operate in cooperation with the memory 830. The processor 820 can execute the program instructions stored in the memory 830. Optionally, at least one of the one or more memories can be included in the processor.

[0558] The specific connection medium between the transceiver 810, the processor 820 and the memory 830 in the embodiments of the present application is not limited. In FIG. 8, the memory 830, the processor 820 and the transceiver 810 are connected by a bus 840, which is represented by a thick line in FIG. 8, and the connection mode between other components is only schematically illustrated and is not limited. The bus can be divided into an address bus, a data bus, a control bus, etc. For convenience of representation, only one thick line is used in FIG. 8, but it does not mean that there is only one bus or only one type of bus.

[0559] In the embodiments of the present application, the processor can be a general processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, etc., which can implement or execute the disclosed methods, steps and logic block diagrams in the embodiments of the present application. The general processor can be a microprocessor or any conventional processor, etc. The steps of the method disclosed in combination with the embodiments of the present application can be directly embodied as execution completed by a hardware processor, or executed by a combination of hardware and software modules in the processor, etc.

[0560] In the embodiments of the present application, the memory can include, but is not limited to, a non-volatile memory such as a hard disk drive (HDD) or a solid-state drive (SSD), a random access memory (RAM), an erasable programmable ROM (EPROM), a read-only memory (ROM) or a compact disc read-only memory (CD-ROM), etc. The memory can be any storage medium capable of carrying or storing program codes in the form of instructions or data structures and capable of being read and / or written by a computer (such as the communication device shown in the present application, etc.), but is not limited thereto. The memory in the embodiments of the present application can also be a circuit or any other device capable of realizing a storage function, used for storing program instructions and / or data.

[0561] The processor 820 is mainly used for processing communication protocols and communication data, controlling the whole communication device, executing software programs, and processing data of the software programs. The memory 830 is mainly used for storing software programs and data. The transceiver 810 can include a control circuit and an antenna, and the control circuit is mainly used for conversion between baseband signals and radio frequency signals and processing of the radio frequency signals. The antenna is mainly used for transmitting and receiving radio frequency signals in the form of electromagnetic waves. The input and output device, such as a touch screen, a display screen, a keyboard, etc., is mainly used for receiving data input by a user and outputting data to the user.

[0562] When the communication apparatus is powered on, the processor 820 can read a software program in the memory 830, interpret and execute instructions of the software program, and process data of the software program. When data needs to be transmitted wirelessly, the processor 820 outputs a baseband signal to the radio frequency circuit after baseband processing of the data to be transmitted, and the radio frequency circuit converts the baseband signal into a radio frequency signal and transmits the radio frequency signal in the form of an electromagnetic wave through the antenna. When data is transmitted to the communication apparatus, the radio frequency circuit receives a radio frequency signal through the antenna, converts the radio frequency signal into a baseband signal, and outputs the baseband signal to the processor 820, and the processor 820 converts the baseband signal into data and processes the data.

[0563] In another implementation, the radio frequency circuit and the antenna can be arranged independently of the processor that performs baseband processing, for example, in a distributed scenario, the radio frequency circuit and the antenna can be arranged remotely from the communication apparatus.

[0564] The communication apparatus shown in the embodiments of the present application can also have more components than those shown in FIG. 8, and the embodiments of the present application do not limit this. The methods performed by the processor and the transceiver shown above are only examples, and the specific steps performed by the processor and the transceiver can refer to the methods described above. The optional part in FIG. 8 is indicated by a dashed line.

[0565] In another possible implementation, in the communication apparatus shown in FIG. 7, the processing module 701 can be one or more logic circuits, and the transceiving module 702 can be an input / output interface, also referred to as a communication interface, or an interface circuit, or an interface, etc. Alternatively, the transceiving module 702 can also be a sending module and a receiving module, the sending module can be an output interface, and the receiving module can be an input interface, and the sending module and the receiving module are integrated into one module, for example, an input / output interface.

[0566] FIG. 9 is a structural schematic diagram of a chip provided by the embodiments of the present application. As shown in FIG. 9, the chip shown in FIG. 9 includes a logic circuit 901 and an interface 902. That is, the processing module 701 can be implemented by the logic circuit 901, and the transceiving module 702 can be implemented by the interface 902. The logic circuit 901 can be a chip, a processing circuit, an integrated circuit, or a system on chip (SoC) chip, etc., and the interface 902 can be a communication interface, an input / output interface, a pin, etc. For example, FIG. 9 is shown by taking the above communication apparatus as an example, and the chip includes the logic circuit 901 and the interface 902.

[0567] In the embodiments of the present application, the logic circuit and the interface can also be coupled with each other. The present application does not limit the specific connection mode of the logic circuit and the interface. For example, the logic circuit 901 can be used to execute the functions or steps implemented by the processing module 701 shown in FIG. 7, and the interface 902 can be used to execute the functions or steps implemented by the transceiver module 702 shown in FIG. 7. The specific description of the logic circuit 901 and the interface 902 can refer to the method embodiments shown in FIG. 7 or the above description, and will not be described in detail here.

[0568] The communication apparatus shown in the embodiments of the present application can implement the method provided by the embodiments of the present application in the form of hardware, or implement the method provided by the embodiments of the present application in the form of software, etc., and the present application does not limit this.

[0569] In addition, the embodiments of the present application also provide a communication system, which includes a first station and a second station, and the first station and the second station can be used to execute the method in any of the above embodiments.

[0570] The present application also provides a computer program for implementing the operations and / or processes performed by each station in the method provided by the present application.

[0571] The present application also provides a computer readable storage medium, which stores computer code, when the computer code is run on a computer, the computer code makes the computer execute the operations and / or processes performed by each communication apparatus in the method provided by the present application.

[0572] The present application also provides a computer program product, which includes computer code or computer program, when the computer code or computer program is run on a computer, the operations and / or processes performed by each station in the method provided by the present application are executed.

[0573] In the several embodiments provided by the present application, it should be understood that the disclosed system, communication apparatus and method can be implemented in other ways. For example, the above-described communication apparatus embodiments are only schematic. The division of the modules is only a logical function division. There can be another division manner in actual implementation, for example, a plurality of modules or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the modules shown or discussed can be indirect coupling or communication connection through some interface, communication apparatus or module, and can also be electrical, mechanical or other forms of connection.

[0574] The modules described as separate components may or may not be physically separate, and the components displayed as modules may or may not be physical modules, that is, may be located in one place, or may be distributed to multiple network modules. Part or all of the modules can be selected according to actual needs to achieve the technical effects of the scheme provided by the embodiments of the present application.

[0575] In addition, each functional module in each embodiment of the present application can be integrated in one processing module, or each module can exist physically alone, or two or more modules can be integrated in one module. The integrated module can be realized in the form of hardware or in the form of a software functional module.

[0576] The integrated module, if realized in the form of a software functional module and sold or used as an independent product, can be stored in a computer-readable storage medium. Based on this understanding, the technical scheme of the present application essentially or the part that contributes to the prior art, or all or part of the technical scheme can be embodied in the form of a software product. The computer software product is stored in a readable storage medium, including a plurality of instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned readable storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, and various program code storage media.

Claims

1. A communication method characterized by comprising: The method is applied to a first station, and the method comprises: The flag field is generated according to a flag sequence, the flag sequence corresponds to a BSS color of a basic service set (BSS) where the first station is located, a first N elements in the flag sequence, and / or a last N elements in the flag sequence satisfy: a jth element in the N elements is associated with a (j-1)th element in the N elements, and / or a (j+1)th element in the N elements is associated with the jth element in the N elements. the jth element is the same as the ith element, or the jth element is different from the ith element N elements are mutually opposite numbers, and elements in the N elements are 1 or -1, N being a positive integer. An enhanced long range physical layer protocol data unit (ELR-PPDU) including the flag field is sent.

2. A communication method characterized by comprising: The method is applied to a second station, and the method comprises: A physical layer protocol data unit (PPDU) is received, the PPDU including a flag field; According to a flag sequence corresponding to a basic service set (BSS) color of a BSS in which the second station is located and the flag field, it is determined whether the PPDU is an enhanced long range physical layer protocol data unit (ELR-PPDU) of the BSS in which the second station is located. wherein the first N elements in the flag sequence, and / or the last N elements in the flag sequence satisfy: the jth element in the N elements is different from the jth element in the N elements the jth element is the same as the ith element, or the jth element is different from the ith element N elements are mutually opposite numbers, and elements in the N elements are 1 or -1, N being a positive integer.

3. The method according to claim 1 or 2, characterized in that, The flag field occupies two orthogonal frequency division multiplexing (OFDM) symbols, and a total number of elements in the flag sequence is equal to a total number of data subcarriers corresponding to the two OFDM symbols.

4. The method according to any one of claims 1 to 3, characterized in that, N = 48, the 48 elements are [x1, x2, x3,..., x 24 , y1, y2, y3,..., y 24 ], or the 48 elements are [-x1, -x2, -x3,..., -x 24 , y1, y2, y3,..., y 24 ]. wherein i is 1, 2, 3, …, 24.

5. The method of claim 4, wherein, said [x1,x2,x3,...,x 24 ,y1,y2,y3,...,y 24 ] is orthogonal to said [-x1,-x2,-x3,...,-x 24 ,y1,y2,y3,...,y 24 ].

6. The method according to any one of claims 1 to 5, characterized in that, N is 48, and the 48 elements are as follows: 1 1 1 1 1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 -1 1 -1 1 -1; 1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 -1; 1 1 -1 1 -1 1 1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 -1; 1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1; 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1; 1 1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 1 -1; 1 -1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 -1 -1; 1 1 1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1; 1 -1 -1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1; 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 -1; 1 1 1 -1 -1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1; 1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 1 1 -1; 1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1; 1 -1 1 1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1; 1 -1 1 -1 -1 1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1; 1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 1 -1 1 -1 -1 1 1 -1 -1; 1 1 1 1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 1; 1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 -1 1 1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1; 1 1 -1 1 -1 -1 1 -1 1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1; 1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 1-1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 1; 1 1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 1 -1 1 1 -1 -1 -1 1; 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 1; 1 -1 -1 1 1 1 1 -1 -1 1 -1 1 1 1 1 1 -1 -1 -1 1 1 -1 1 1 -1 1 1 1 -1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 -1 1 1 -1 -1 1 1; 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1; 1 1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 1 1 1 1 -1 -1 1; 1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 1 -1 -1 -1 1 1; 1 1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 1 1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1; 1 -1 -1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 1; 1 -1 1 1 -1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 1; 1 -1 1 -1 1 -1 -1 1 -1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 1 1; 1 1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 1 1 -1 1; 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 1 -1 1 -1 1 1 -1 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. The method according to any one of claims 4-6, characterized in that, N is 48, and the first 48 elements in the flag sequence and the last 48 elements in the flag sequence satisfy: [x1,x2,x3,...,x 24 ,y1,y2,y3,...,y 24 ,x1,x2,x3,...,x 24 ,y1,y2,y3,...,y 24 ] ; or, [x1,x2,x3,...,x 24 ,y1,y2,y3,...,y 24 ,-x1,-x2,-x3,...,-x 24 ,-y1,-y2,-y3,...,-y 24 ] ; or, [-x1, -x2, -x3,..., -x 24 , y1, y2, y3,..., y 24 , -x1, -x2, -x3,..., -x 24 , y1, y2, y3,..., y 24 ]; or, [-x1, -x2, -x3,..., -x 24 ,y1,y2,y3,…,y 24 ,x1,x2,x3,…,x 24 ,-y1,-y2,-y3,…,-y 24 ] ; or, [x1,x2,x3,…,x 24 ,y1,y2,y3,…,y 24 ,y 24 ,y 23 ,y 21 ,…,y1,x 24 ,x 23 ,x 22 ,…,x1] ; or, [x1,x2,x3,…,x 24 ,y1,y2,y3,…,y 24 ,-y 24 ,-y 23 ,-y 21 ,…,-y1,-x 24 ,-x 23 ,-x 22 ,…,-x1] ; or, [-x1,-x2,-x3,…,-x 24 ,y1,y2,y3,…,y 24 ,y 24 ,y 23 ,y 21 ,…,y1,-x 24 ,-x 23 ,-x 22 ,…,-x1] ; or, [-x1,-x2,-x3,…,-x 24 ,y1,y2,y3,…,y 24 ,-y 24 ,-y 23 ,-y 21 ,…,-y1,x 24 ,x 23 ,x 22 ,…,x1] 8. The method according to any one of claims 1 to 7, characterized in that, Elements in the flag sequence are elements in a row corresponding to the BSS color in a matrix M, and the matrix M is as follows: or or or wherein, or Any two rows in the matrix C are mutually orthogonal, and the N elements are elements in a row in the matrix C.

9. A communications device, characterized by A module for performing the method of any one of claims 1-8 is included.

10. A communications device, characterized by A processor is included for causing the communication device to implement the method of any one of claims 1-8.

11. A computer readable storage medium characterized in that, The computer readable storage medium is used to store a computer program, which is executed by a communication device to cause the method of any one of claims 1-8 to be implemented.

12. A computer program product, characterised in that, The computer program product is executed by a computer to cause the method of any one of claims 1-8 to be executed.

13. A communication system, characterized by A first station and a second station are included, the first station being configured to perform the method of any one of claims 1, 3-8, and the second station being configured to perform the method of any one of claims 2-8.

Citation Information

Patent Citations

  • Communication method, device and system based on cyclic shift diversity sequence

    CN114679746A

  • Wireless communication method, station device and access point device

    CN116671249A

  • Communication method and device and storage medium

    CN117955789A

  • Backscatter communication method, communication device and storage medium

    CN118282488A

  • Sharing a transmission opportunity of a wireless communication medium

    US20200260488A1