Method for processing physical layer protocol data unit (PPDU), and wireless communication device

By determining the number of overflow bits and filling them into the target space stream using appropriate rules, the problem of insufficient or excessive complement length caused by different subcarrier modulation orders in the traditional complement mechanism is solved, thereby improving the transmission efficiency and decoding accuracy of PPDU.

WO2026232620A1PCT designated stage Publication Date: 2026-11-12SHENZHEN TCL NEW-TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
PCT/CN2025/094117
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Filing Date
2025-05-09
Publication Date
2026-11-12

AI Technical Summary

Technical Problem

In existing technologies, traditional complement mechanisms fail to effectively handle the problem of insufficient or excessive complement length caused by different modulation orders of different subcarriers, and UEQM technology fails to effectively solve the problems of multi-user alignment and padding, resulting in decoding errors and reduced transmission efficiency.

Method used

By determining the number of overflow bits and judging whether it is greater than a preset value, different rules (such as binary search, linear search, jump search, interpolation search, etc.) are used to determine the target space stream to which the overflow bits are filled, ensuring the accuracy of Pre-FEC padding and packet expansion, and adapting to the modulation methods of different subcarriers.

Benefits of technology

This technology enables independent processing of the remaining data bits in the last OFDM symbol of the PPDU data portion, improving OFDM symbol alignment and effective segmentation of FEC coded blocks, thereby enhancing transmission efficiency and decoding accuracy.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN2025094117_12112026_PF_FP_ABST
    Figure CN2025094117_12112026_PF_FP_ABST
Patent Text Reader

Abstract

Provided in the present disclosure is a method for processing a physical layer protocol data unit (PPDU), which method is executed on a first device. The method comprises: determining the number of excess bits, wherein the number of excess bits is the number of remaining data bits of a data part of a PPDU in the last OFDM symbol; and determining whether the number of excess bits is greater than a first preset value.
Need to check novelty before this filing date? Find Prior Art

Description

A method for processing a physical layer protocol data unit (PPDU) and a wireless communication device TECHNICAL FIELD

[0001] The present disclosure relates to the field of wireless communication, and in particular, to a method for processing a physical layer protocol data unit (PPDU) and a wireless communication device. BACKGROUND

[0002] A physical layer protocol data unit (PPDU) in Wi-Fi generally includes a preamble, a signal field, and a data portion. A padding mechanism can be added after the data portion to ensure the data length meets the standard requirements, such as OFDM symbol alignment or satisfying the requirement of FEC encoding block size. Traditionally, the padding mechanism can assume that all data subcarriers use the same modulation mode, such as all subcarriers using QAM-256.

[0003] UEQM allows different subcarriers to use different modulation modes, such as high-frequency subcarriers using low-order modulation (e.g., QPSK) to improve reliability and low-frequency subcarriers using high-order modulation (e.g., 1024-QAM) to improve data rate. This technique can optimize channel utilization, especially in environments where there is frequency-selective fading, and the SNR of different subcarriers differs greatly, UEQM can effectively improve overall performance. The existing technology determines that when using the UEQM technology in the UHR version, the related technology of the PPDU is left pending. Therefore, it is necessary to propose a method for processing a physical layer protocol data unit (PPDU) and a wireless communication device to improve the existing technology. SUMMARY

[0004] The technical problem to be solved by the present application is to provide a method for processing a physical layer protocol data unit (PPDU) and a wireless communication device to solve the problems in the prior art.

[0005] According to one aspect of the present disclosure, a method for processing a physical layer protocol data unit (PPDU) is provided, which is executed on a first device, and the method comprises:

[0006] determining a number of overflow bits, wherein the number of overflow bits is a number of data bits remaining in a last OFDM symbol of a data portion of the PPDU;

[0007] determining whether the number of overflow bits is greater than a first preset value.

[0008] According to one aspect of this disclosure, a wireless communication device is provided, including a processor and a memory for storing a computer program, the processor for calling and running the computer program stored in the memory to perform steps in the data processing method as described in any of the preceding claims.

[0009] According to one aspect of this disclosure, a readable storage medium is provided for storing a computer program that is invoked and executed by a processor to perform any of the methods described above.

[0010] The beneficial effects of the present invention are as follows: The embodiments of this disclosure first determine the number of overflow bits, and then determine whether the number of overflow bits is greater than a first preset value, thereby realizing the independent processing of the remaining data bits of the data part of the PPDU in the last OFDM symbol. Attached Figure Description

[0011] To more clearly illustrate the embodiments of this disclosure or related technologies, the following figures will be briefly described in the embodiments. Obviously, the figures are merely some embodiments of this disclosure, and those skilled in the art can obtain other figures based on these figures without creative effort.

[0012] Figure 1 illustrates a schematic diagram of the wireless communication system architecture provided in this disclosure.

[0013] Figure 2 illustrates one of the flowcharts of the method for processing Physical Layer Protocol Data Units (PPDUs) provided in this disclosure.

[0014] Figure 3 illustrates a second flowchart of the method for processing Physical Layer Protocol Data Units (PPDUs) provided in this disclosure.

[0015] Figure 4 illustrates the third flowchart of the method for processing Physical Layer Protocol Data Units (PPDUs) provided in this disclosure.

[0016] Figure 5 illustrates a schematic diagram of the space stream filled by the overflowing bits.

[0017] Figure 6 illustrates a schematic diagram of the overflowing bits filling all space streams.

[0018] Figure 7 illustrates the fourth flowchart of the method for processing Physical Layer Protocol Data Units (PPDUs) provided in this disclosure.

[0019] Figure 8 illustrates an exemplary block diagram of a wireless communication system provided in this disclosure. Detailed Implementation

[0020] The embodiments of this disclosure have been described in detail with reference to the accompanying drawings, outlining technical aspects, structural features, objectives, and effects, as described below. Specifically, the terminology used in the embodiments of this disclosure is for the purpose of describing particular embodiments only and is not intended to limit the disclosure.

[0021] In this disclosure, “A or B” may mean “A only”, “B only”, or “both A and B”.

[0022] In other words, in this disclosure, “A or B” can be interpreted as “A and / or B”. For example, in this disclosure, “A, B or C” can mean “A only”, “B only”, “C only” or “any combination of A, B, and C”.

[0023] The forward slash ( / ) or comma used in this disclosure can mean "and / or". For example, "A / B" can mean "A and / or B". Therefore, "A / B" can mean "A only", "B only", or "both A and B". For example, "A, B, C" can mean "A, B, or C".

[0024] In this disclosure, "at least one of A and B" may mean "only A", "only B" or "both A and B". Furthermore, in this disclosure, the expression "at least one of A or B" or "at least one of A and / or B" may be interpreted as "at least one of A and B".

[0025] Additionally, in this disclosure, "at least one of A, B, and C" may mean "A only", "B only", "C only" or "any combination of A, B, and C". Furthermore, "at least one of A, B, or C" or "at least one of A, B, and / or C" may mean "at least one of A, B, and C".

[0026] Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of the stated features. In the description of this application, "multiple" means two or more, unless otherwise explicitly specified.

[0027] Those skilled in the art will recognize and understand that the details of the described examples are merely illustrative of some embodiments, and that the teachings set forth herein are applicable to various alternative settings.

[0028] This disclosure can be applied to wireless local area network (WLAN) scenarios and supports protocols applicable to the Institute of Electrical and Electronics Engineers (IEEE), such as IEEE 802.11be / EHT / Wi-Fi 7, IEEE 802.11bn / UHR / Wi-Fi 8, IEEE 802.15 / UWB, or IEEE 802.11bf / sensing, or their next generation. Alternatively, this disclosure can also be applied to wireless local area network systems such as Internet of Things (IoT) networks or Vehicle-to-X (V2X) networks. Of course, the embodiments disclosed herein can also be applied to other possible communication systems, such as Long Term Evolution (LTE) systems, LTE Frequency Division Duplex (FDD) systems, LTE Time Division Duplex (TDD) systems, Universal Mobile Telecommunication System (UMTS), Worldwide Interoperability for Microwave Access (WiMAX) communication systems, 5th generation (5G) mobile communication systems, such as New Radio (NR) systems, and future 6th generation (6G) mobile communication systems and next-generation communication systems.

[0029] The existing technology has at least one of the following problems:

[0030] Question 1: Traditional two's complement technology does not take into account the different modulation orders of each subcarrier.

[0031] Traditional two's complement mechanisms assume that all subcarriers use the same modulation order, thus calculating the required number of padding bits based on a uniform modulation order. However, when different subcarriers use different modulation schemes, each subcarrier has a different modulation order, resulting in a different number of bits carried by each symbol. In this case, traditional two's complement mechanisms cannot correctly calculate the required number of padding bits, leading to insufficient or excessive two's complement length. This, in turn, affects OFDM symbol alignment or effective segmentation of FEC coded blocks, ultimately causing decoding errors or reduced transmission efficiency.

[0032] Question 2: Traditional UEQM modulation techniques do not consider multi-user alignment and padding issues when PPDU encoding is not used.

[0033] When using traditional UEQM technology in HT, the existing technology did not support encoding methods where multiple users construct the same PPDU, leading to issues with using UEQM without considering padding techniques. Therefore, there is no reasonable solution when it is necessary to consider both UEQM and MU PPDU padding simultaneously.

[0034] Question 3: The padding coefficient 'a' required by UEQM for the PE to use the highest modulation level may not be the same as the actual padding coefficient 'a' of the PPDU.

[0035] Furthermore, after the PPDU's complementation process is completed, Packet Extension (PE) needs to be determined jointly based on the Pre-FEC padding coefficient 'a' and the nominal packet complement (NOMINAL_PACKET_PADDING). The Pre-FEC padding coefficient 'a' is specified in the UHR as being selected based on the spatial stream with the highest modulation level (the first spatial stream). In previous issues, we found that the PPDU's data field does not necessarily end on the first spatial stream. Therefore, when using PE after implementing UEQM technology, the coefficient 'a' traditionally used directly for Pre-FEC padding cannot be directly used for PE.

[0036] To facilitate understanding of the technical solutions provided in the embodiments of this application, a brief introduction to the relevant technologies of this application is given first.

[0037] The existing UHR version specifies that a high-throughput (HT) stream parser is used when using UEQM technology. Therefore, after encoding is completed, the transmitter will segment the encoded PPDU according to the number of encoded bits that one OFDM symbol of each spatial stream can carry and distribute it to the corresponding spatial stream, as shown in Figure 1.

[0038] In the disclosed embodiments, the site device (STA) can also be referred to as a non-access point device or a non-access point multi-link device (non-AP STA / non-AP MLD), hereinafter referred to as STA. The access point device (AP) can also be referred to as an access point device or an access point multi-link device (AP STA / AP MLD), hereinafter referred to as AP. Data transmission between the AP and the device can be performed using multiple space streams (SS). On these space streams, depending on the differences in channel states, equal modulation (EQM) or unequal modulation (UEQM) can be selected. However, when using UEQM, due to the differences in modulation / constellation order, the number of codes (N) that each space stream can carry in a unit of orthogonal frequency division multiplexing symbol time (OFDM symbol time) is limited. CBPSS,m,u The values ​​are also different. Therefore, a stream parser is needed to determine the N values ​​for each spatial stream. CBPSS,m,u The data blocks to be sent are divided into each spatial stream in a round-robin manner.

[0039] This difference means that traditional methods cannot be directly used when encoding and padding multi-user physical protocol data units (MU PPDUs). First, to determine the number of bits needed for padding for each user, the number of overflow bits (N) must be determined. Excess This is also referred to as the number of data bits left in the last OFDM symbol. Secondly, to control the amount of padding before Forward Error Correction (FEC) coding as much as possible, Wi-Fi requires the system to pad only to 1 / 4 of an OFDM symbol, called a symbol segment. To indicate the specific location where padding is needed, Wi-Fi defines a Pre-FEC padding coefficient 'a', which corresponds to the number of symbol segments (a = {1, 2, 3, 4}). Furthermore, encoding also requires knowing the number of symbols (N) in the MU PPDU. SYMOnly after determining these two pieces of information, and combining them with the traditional encoding process of Low-Density Parity-Check (LDPC), can the encoding and complementation of the MU PPDU be achieved. Furthermore, after completing the encoding and complementation, the required packet extension (PE) duration for the entire PPDU needs to be determined based on the PPDU's Pre-FEC padding coefficient 'a' and the nominal packet padding value. This allows the PE to be implemented and the complete encoding of the UEQM PPDU to be achieved, thus providing the receiving end with sufficient time to parse the packet, as shown in Figure 2.

[0040] The method for processing Physical Layer Protocol Data Units (PPDUs) provided in this application will be described in detail below with reference to the accompanying drawings and through some embodiments and application scenarios.

[0041] In order to enable encoding and complementation of PPDUs of arbitrary length when using UEQM technology, this disclosure classifies and searches for possible values ​​of the Pre-FEC padding coefficient a and the total number of symbols N_SYM based on the number of bits that UEQM can carry on each OFDM symbol in each spatial stream and the amount of overflow of the Data Field in the last OFDM symbol. The specific method is as follows.

[0042] Figure 3 illustrates one of the flowcharts of a method for processing Physical Layer Protocol Data Units (PPDUs) provided in this disclosure. As shown in Figure 3, this method can be applied to a first device, and the method includes:

[0043] Step S100: The first device determines the number of overflow bits; wherein, the number of overflow bits is the number of data bits remaining in the last OFDM symbol of the data portion of the PPDU;

[0044] Step S200: The first device determines whether the number of overflow bits is greater than the first preset value.

[0045] It is worth noting that the first device can be a transmitter or other devices, and there are no restrictions here.

[0046] In one implementation, the first device determines the number of overflow bits N using the following formula: Excess,u N Excess,u =(8·APEP_LENGTH) u +N tail,u +N service )mod N DBPS,u

[0047] in,

[0048] APEP_LENGTH is the APEP_LENGTH parameter in user u's TXVECTOR;

[0049] N tail,u It is the number of bits at the end of each user u's string;

[0050] N service It is the number of bits in the Service field of the Data Field of the PPDU;

[0051] N DBPS,u This is the number of data bits for user u on each OFDM symbol, as shown in the following formula:

[0052] in,

[0053] R u It is the bitrate of user u;

[0054] N SD,u It is the number of data subcarriers on one OFDM symbol for user u on the allocated bandwidth / RU;

[0055] N SS,r,u It is the number of space flows of user u on the allocated RU r;

[0056] N BPSCS,m,u It is the number of codes that user u can carry on each subcarrier in the m-th spatial stream;

[0057] N CBPSS,m,u =N SD,u *N BPSCS,m,u It is the number of codes that user u can carry per OFDM symbol on the m-th spatial stream;

[0058] N CBPS,u It is the number of encoded bits for user u on each OFDM symbol.

[0059] In another implementation, other methods (such as AI models) can be used to determine the number of overflow bits.

[0060] Due to the number of overflow bits N Excess,u It is calculated by modulo, and can only be greater than or equal to 0. Therefore, only the following two implementation methods need to be considered:

[0061] Referring to Figure 4, in some embodiments, the method further includes step S201: when the number of overflow bits is greater than the first preset value, determining the target space stream to which the number of overflow bits is filled.

[0062] It is worth noting that the first preset value is 0, but other values ​​can be used in practice, and this embodiment does not limit this.

[0063] To specifically analyze the two's complement problem in UEQM (how to determine the target space stream to which the overflow bits are filled), the following method is used.

[0064] As shown in Figure 5, taking a practical example, when UEQM has four spatial streams, the scenarios requiring padding on the last OFDM symbol can be categorized into four scenarios as shown in the figure. The overflowing bits are filled into the first, second, third, or fourth spatial stream, respectively. This leads to a situation where, during pre-FEC padding, the data needs to be padded to the nearest 1 / 4 OFDM symbol to determine the Pre-FEC padding coefficient 'a', while the N values ​​in different spatial streams... CBPSS They may differ. Therefore, it is necessary to first determine which spatial stream the data overflows into (i.e., the target spatial stream) before using N from that target spatial stream. CBPSS To calculate the Pre-FEC padding coefficient a.

[0065] If there is N ss There are N spatial streams, and the minimum size of the data blocks distributed to each spatial stream by the stream parser is N. CBPSS,m,u , where N CBPSS,m,u Let N be the number of codes that user u can carry in one OFDM symbol on the m-th spatial stream. CBPSS,m,u *R u This represents the amount of data that user u can carry in one OFDM symbol on the m-th spatial stream. This value (N) can be used to represent the corresponding data in the first m spatial streams of UEQM. CBPSS,m,u *R u Add them together and then add them to N. Excess,u The comparison method determines the number of overflow bits to fill the target space stream. The first m space streams can include the first space stream, the second space stream, ..., and the m-th space stream. The method for determining the target space stream can be summarized mathematically as follows:

[0066] In some embodiments, the first device determines the target space stream to which the overflow bits are filled by: determining the target space stream to which the overflow bits are filled based on a first rule, a second rule, a third rule, and / or a fourth rule.

[0067] In one implementation, the first device determines the target space stream to which the overflow bits are to be filled based on a first rule.

[0068] It is worth noting that the first rule can be a dichotomy, but in practice it can also be other rules (such as a trichotomy or a quartic division).

[0069] Specifically, the number of overflow bits N Excess,u The following constraint must be met: 0 ≤ N Excess,u <N DBPS,u

[0070] In other words, if the number of overflow bits is less than the number of data bits per OFDM symbol for user u, and the number of overflow bits is greater than or equal to 0, the target spatial stream to which the overflow bits are filled can be determined using a binary search method. Before this, the sum of the data that the first x0 spatial streams can carry is defined as... (number of x0 streams coding bits prefix sum):

[0071] Then for any number N ss The spatial flow x0 can be determined using the following algorithm:

[0072] Let the initial conditions be:

[0073] The value x0 returned at the end of the calculation is the target space stream to which the overflow bits are filled. Because the binary search method has simple decision rules, low computational cost per step, and moderate overall algorithm complexity, it is suitable for most scenarios.

[0074] It is worth noting that, in the embodiments disclosed herein, the first x1 spatial flows may include the first spatial flow, the second spatial flow, ... the x1th spatial flow.

[0075] In one implementation, the first device determines the target space stream to which the overflow bits are filled based on a second rule.

[0076] It is worth noting that the second rule can be a sequential traversal or a linear scan, but in practice it can also be other rules (such as sequential traversal or a non-linear scan).

[0077] Specifically, due to the spatial flow N CBPSS,i,u Greater than 0, N CBPSS,m,u The sum of the first m elements It has monotonicity, that is:

[0078] satisfy use The monotonicity can be traversed through x0 = 1, 2, ..., N ss Find the first one that satisfies

[0079] The specific linear search algorithm is as follows:

[0080] Initial conditions let

[0081] The value x0 returned at the end of the linear search algorithm is the space stream filled with the overflow bits. This method requires checking each bit individually. and N Excess,u The value of is very simple to calculate within a single step; therefore, this method is applicable to N. ss Smaller cases.

[0082] Similarly, we can also use the largest... Start the search until the first matching condition is found. Referring to the linear search algorithm described above, it will not be repeated here. It should be noted that other similar linear search algorithms are also within the scope of protection of this disclosure.

[0083] In one implementation, the first device determines the target space stream to which the overflow bits are filled based on a third rule.

[0084] It is worth noting that the third rule can be a skip search, but in practice it can also be other rules (such as searching through an AI model).

[0085] Specifically, because the search step size of the second rule is 1, it leads to N ss When the value is large, the search is slow; therefore, a faster search can be achieved by changing the value of the fixed step size Δ. For example... Where N can be less than N ss The integer N can also be less than N. ss For decimals, this disclosure does not impose any restrictions and allows for skip comparisons. The sum of the data that the first x0 spatial streams can carry is:

[0086] In one implementation, let x0 = jΔ, j = {1, 2, 3, ...} in the above equation. If N SCBPS,jΔ,u <N Excess,u Let j = j + 1, when N SCBPS,jΔ,u If the sum is greater than or equal to X, backtrack to the interval [(j-1)Δ, jΔ], and then search again with a smaller Δ. Here, we exemplify a linear search by setting Δ = 1. The specific algorithm is as follows:

[0087] Initial conditions

[0088] in, This indicates rounding down to the nearest integer.

[0089] The value x0 returned at the end of this jump-linear search algorithm is the target space stream to which the overflow bits are filled. This method is applicable to N. ssWhen the size is large, fast searching can be achieved.

[0090] In one implementation, the first device determines the target space stream to which the overflow bits are filled based on a fourth rule.

[0091] It is worth noting that the fourth rule can be interpolation lookup, but in practice it can also be other rules (such as lookup through an AI model).

[0092] Specifically, the interpolation search method is an optimization method based on the first rule (such as the binary search method), which uses N Excess,u and The relationship was used The monotonic growth characteristic of N, according to N Excess,u exist Position within the range, estimate the midpoint x1:

[0093] By starting from the intermediate point x1, which is relatively close to the final result, the number of iterations required in the middle of the algorithm is greatly reduced, thereby achieving higher search efficiency.

[0094] Specific algorithm (first based on N) Excess,u Calculate the value of x1, and then perform a binary search starting from x1, as shown below:

[0095] Let the initial conditions be:

[0096] The value x0 returned by the above interpolation search algorithm at the end is the target space stream to which the overflow bits are filled. This method is applicable to N. ss When the size is large, the search efficiency is very high, and it is suitable for N. SCBPS,1,u , When the values ​​differ significantly. In one implementation, the first device determines the target space stream to which the overflow bits are filled by: determining the target space stream to which the overflow bits are filled based on a first rule and a fourth rule.

[0097] Specifically, when the target space stream to which the overflow bits are filled is determined based on the fourth rule, and two or more consecutive cycles occur where x0 and x2 are not close to each other but the difference is still large, the target space stream to which the overflow bits are filled can be determined based on the first rule.

[0098] In one implementation, the first device determines the target space stream to which the overflow bits are filled by: determining the target space stream to which the overflow bits are filled based on a second rule, a first rule, or a fourth rule.

[0099] Specifically, if the search speed is too slow when determining the target space stream to which the overflow bits are filled based on the second rule, the target space stream to which the overflow bits are filled can be determined based on the first rule or the fourth rule.

[0100] In some existing WiFi versions, the use of UEQM technology is limited to 2 to 4 spatial streams. Because the number of spatial streams is small, the space to be searched is limited, so each spatial stream can be searched independently. The number of spatial streams is the number of UEQM spatial streams, denoted by N. SS express.

[0101] In some embodiments, when the number of space streams is a first value (e.g., 2), determining the target space stream to which the overflow bits are filled includes:

[0102] If the number of overflow bits is less than or equal to the number of data bits carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream;

[0103] If the number of overflow bits is greater than the number of data bits carried by the first spatial stream, then the overflow bits are filled into the second spatial stream.

[0104] In some embodiments, when the number of space streams is a first value, determining the target space stream to which the overflow bits are filled includes:

[0105] If the number of overflow bits is greater than the amount of data that user u can carry in one OFDM symbol on the first spatial stream, then the number of overflow bits is filled into the second spatial stream;

[0106] If the number of overflow bits is less than or equal to the number of data that user u can carry in one OFDM symbol on the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

[0107] It is worth noting that the second value can be 2, or of course other values, and this disclosure does not impose any restrictions on this.

[0108] When UEQM's N SS When the value is 2, since the UEQM mode (UEQM patent) is determined, only two UEQM modes exist: {M,M-1} and {M,M-2}. The number of bits that the two spatial streams can carry per unit OFDM symbol time is different in these two modes. Therefore, there are two methods to determine the target spatial stream to which the overflow bits should be filled:

[0109] Method 1: The target spatial flow is determined using the following expression:

[0110] If the number of overflow bits is less than or equal to the number of data bits carried by the first spatial stream, then the number of overflow bits N is... Excess,u Fill the first space stream (or the first space stream); conversely, if the number of overflow bits exceeds the number of data bits that the first space stream can carry, the first space stream cannot carry all N bits. Excess,u And N Excess,u It must be less than the sum of the number of data bits carried by the two spatial streams, therefore, N Excess,u Fill the second space flow.

[0111] Method 2: The target spatial flow is determined using the following expression:

[0112] Besides through N Excess,u and R u *N CBPSS,1,u The difference in the target space stream is used to determine the number of overflow bits, or by determining N. Excess,u and R u *N CBPSS,1,u The target space flow for the number of overflow bits is determined by the proportional relationship between N and N. Excess,u Greater than R u *N CBPSS,1,u This indicates that the first spatial stream cannot carry all the overflow bits; therefore, the target spatial stream is the second spatial stream. Conversely, if the first spatial stream can carry all the overflow bits, the target spatial stream is the first spatial stream.

[0113] In some embodiments, when the number of space streams is a second value, determining the target space stream to which the overflow bits are filled includes:

[0114] If the number of overflow bits is greater than the sum of the data carried by the first two spatial streams, then the number of overflow bits is filled into the third spatial stream;

[0115] If the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than the data carried by the first spatial stream, then the number of overflow bits is filled into the second spatial stream;

[0116] If the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is less than or equal to the data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

[0117] In some embodiments, when the number of space streams is a second value, determining the target space stream to which the overflow bits are filled includes:

[0118] If the number of overflow bits is less than the amount of data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream;

[0119] If the number of overflow bits is greater than or equal to the amount of data carried by the first spatial stream, and the number of overflow bits is less than the sum of the amounts of data carried by the first two spatial streams, then the number of overflow bits is filled into the second spatial stream;

[0120] If the number of overflow bits is greater than or equal to the sum of the data carried by the first two spatial streams, then the number of overflow bits is filled into the third spatial stream.

[0121] It is worth noting that the first two spatial flows are the first spatial flow and the second spatial flow. The second value can be 3, but it can also take other values, and this disclosure does not restrict this.

[0122] When UEQM's N SS When the value is 3, since the UEQM mode (UEQM patent) has three modes: {M,M,M-1}, {M,M,M-2}, and {M,M-1,M-2}, the number of bits that the three spatial streams can carry in a unit OFDM symbol time is not exactly the same in the three modes. Therefore, there are two methods to determine the target spatial stream to which the overflow bits are filled:

[0123] Method 1: The target spatial flow is determined as follows:

[0124] The above method uses a binary search (binary tree) approach to search for the target space stream to which the overflow bits should be filled. This calculation method uses two layers of conditional statements to classify and search for the three candidate space streams to which the overflow bits should be filled.

[0125] Method 2: The target spatial flow is determined as follows:

[0126] The above method classifies and calculates the target space stream to which the overflow bits are filled using a linear search. This method searches N one by one. CBPSS,1,u The sum of the first element, N CBPSS,2,u The sum of the first two elements is used to determine the target space stream to which the overflow bits are filled.

[0127] In some embodiments, when the number of space streams is a third value, determining the target space stream to which the overflow bits are filled includes:

[0128] If the number of overflow bits is greater than the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the fourth spatial stream;

[0129] If the number of overflow bits is greater than the sum of the data carried by the first two spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the third spatial stream;

[0130] If the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than the data carried by the first spatial stream, then the number of overflow bits is filled into the second spatial stream;

[0131] If the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is less than or equal to the data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

[0132] In some embodiments, when the number of space streams is a third value, determining the target space stream to which the overflow bits are filled includes:

[0133] If the number of overflow bits is greater than the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the fourth spatial stream;

[0134] If the number of overflow bits is less than the sum of the data carried by the first three spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first two spatial streams, then the number of overflow bits is filled into the third spatial stream;

[0135] If the number of overflow bits is less than the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than or equal to the data carried by the first spatial stream, then the number of overflow bits is filled into the second spatial stream;

[0136] If the number of overflow bits is less than the amount of data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

[0137] It is worth noting that the third value can be 4, but other values ​​can also be used in practice, and this disclosure does not impose any restrictions on this. The first three spatial flows can include the first spatial flow, the second spatial flow, and the third spatial flow.

[0138] Specifically, when N of UEQM SS When the value is 4, since the UEQM mode (UEQM patent) has four modes: {M,M,M,M-1}, {M,M,M,M-2}, {M,M,M-1,M-2}, and {M,M-1,M-1,M-2}, the number of bits that the four spatial streams can carry in a unit OFDM symbol time is not completely different under these four modes. Therefore, there are two methods to determine the target spatial stream to which the overflow bits are filled:

[0139] Method 1: The target spatial flow is determined as follows:

[0140] The above method uses a binary search (binary tree) approach to classify and search the target space stream to which the overflow bits should be filled. This method employs two layers of conditional statements to classify and search the four candidate space streams to which the overflow bits should be filled.

[0141] Method 2

[0142] The above method classifies and searches the target space stream to which the overflow bits are filled using a linear search approach. This method determines N by searching one by one. CBPSS,2,u The sum of the first two elements, N CBPSS,3,u The sum of the first three elements is used to determine the target space stream to which the overflow bits are filled.

[0143] When N SS When N = 5 to 8, the number of space streams is relatively large, so the third and fourth rules can be used to determine the target space stream to which the overflow bits will be filled. The following will further discuss N. SS When N = 7, the third rule is used to determine the target space stream to which the overflow bits will be filled; SS When the value is 8, the fourth rule is used to determine the target space stream to which the overflow bits are filled.

[0144] In some embodiments, when the number of space streams is a fourth value, determining the target space stream to which the overflow bits are filled includes:

[0145] If the number of overflow bits is greater than the sum of the data carried by the first three spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, then the number of overflow bits is filled into the fifth spatial stream;

[0146] If the number of overflow bits is greater than the sum of the data carried by the first three spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, then the number of overflow bits is filled into the fourth spatial stream;

[0147] If the number of overflow bits is less than or equal to the sum of the data carried by the first three spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first two spatial streams, then the number of overflow bits is filled into the third spatial stream;

[0148] If the number of overflow bits is less than or equal to the sum of the data carried by the first three spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than the data carried by the first spatial stream, then the number of overflow bits is filled into the second spatial stream.

[0149] If the number of overflow bits is less than or equal to the amount of data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

[0150] In some embodiments, when the number of space streams is a fourth value, determining the target space stream to which the overflow bits are filled includes:

[0151] If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, then the number of overflow bits is filled into the fifth spatial stream;

[0152] If the number of overflow bits is less than the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the fourth spatial stream;

[0153] If the number of overflow bits is less than the sum of the data carried by the first three spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first two spatial streams, then the number of overflow bits is filled into the third spatial stream;

[0154] If the number of overflow bits is less than the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than or equal to the data carried by the first spatial stream, then the number of overflow bits is filled into the second spatial stream;

[0155] If the number of overflow bits is less than the amount of data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

[0156] It is worth noting that the fourth value can be 5, and in practice, it can also take other values; this disclosure does not impose any restrictions on this. The first four spatial flows can include the first spatial flow, the second spatial flow, the third spatial flow, and the fourth spatial flow.

[0157] Specifically, when UEQM N SS When the value is 5, the target space stream to which the overflow bits are filled is determined using any of the following methods:

[0158] Method 1:

[0159] The above method classifies and searches the space streams to which the overflow bits have been filled using a binary search (binary tree) approach. This method employs three levels of conditional statements to classify and search the eight candidate space streams to which the overflow bits have been filled.

[0160] Method 2:

[0161] The above method classifies and searches the target space stream to which the overflow bits are filled using a linear search approach. This method searches N bits sequentially. CBPSS,2,uThe sum of the first two elements, N CBPSS,3,u The sum of the first 3 elements, N CBPSS,4,u The sum of the first four elements is used to determine the target space stream to which the overflow bits will be filled.

[0162] In some embodiments, when the number of space streams is a fifth value, determining the target space stream to which the overflow bits are filled includes:

[0163] If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first five spatial streams, then the number of overflow bits is filled into the sixth spatial stream;

[0164] If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first five spatial streams, then the number of overflow bits is filled into the fifth spatial stream;

[0165] If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first five spatial streams, then the number of overflow bits is filled into the fifth spatial stream;

[0166] If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the fourth spatial stream.

[0167] If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first two spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the third spatial stream.

[0168] If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than the data carried by the first spatial stream, then the number of overflow bits is filled into the second spatial stream.

[0169] If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is less than or equal to the data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

[0170] In some embodiments, when the number of space streams is a fifth value, determining the target space stream to which the overflow bits are filled includes:

[0171] If the number of overflow bits is greater than the sum of the data carried by the first five spatial streams, then the number of overflow bits is filled into the sixth spatial stream;

[0172] If the number of overflow bits is less than or equal to the sum of the data carried by the first five spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first four spatial streams, then the number of overflow bits is filled into the fifth spatial stream;

[0173] If the number of overflow bits is less than the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the fourth spatial stream;

[0174] If the number of overflow bits is less than the sum of the data carried by the first three spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first two spatial streams, then the number of overflow bits is filled into the third spatial stream;

[0175] If the number of overflow bits is less than the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than or equal to the data carried by the first spatial stream, then the number of overflow bits is filled into the second spatial stream;

[0176] If the number of overflow bits is less than the amount of data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

[0177] It is worth noting that the fifth value can be 6, and in practice, it can also take other values; this disclosure does not impose any restrictions on this. The first five spatial streams can include the first spatial stream, the second spatial stream, the third spatial stream, the fourth spatial stream, and the fifth spatial stream.

[0178] Specifically, when UEQM N SS When the value is 6, the target space stream to which the overflow bits are filled is determined using any of the following methods:

[0179] Method 1:

[0180] The above method uses a binary search (binary tree) approach to classify and search for the target space stream to which the overflow bits should be filled. This method employs three layers of conditional statements to classify and search for six candidate space streams to which the overflow bits should be filled.

[0181] Method 2:

[0182] The above method classifies and searches the target space stream to which the overflow bits are filled using a linear search approach. This method confirms the search for N by searching one by one.CBPSS,2,u The sum of the first two elements, N CBPSS,3,u The sum of the first 3 elements, N CBPSS,4,u The sum of the first 4 elements, N CBPSS,5,u The sum of the first 5 elements is used to determine the target space stream to which the overflow bits are filled.

[0183] In some embodiments, when the number of space streams is a sixth value, determining the target space stream to which the overflow bits are filled includes:

[0184] If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first six spatial streams, then the number of overflow bits is filled into the seventh spatial stream;

[0185] If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first six spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first five spatial streams, then the number of overflow bits is filled into the sixth spatial stream.

[0186] If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first six spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first five spatial streams, then the number of overflow bits is filled into the fifth spatial stream.

[0187] If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the fourth spatial stream.

[0188] If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first two spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the third spatial stream.

[0189] If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than the data carried by the first spatial stream, then the number of overflow bits is filled into the second spatial stream.

[0190] If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is less than or equal to the data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

[0191] In some embodiments, when the number of space streams is a sixth value, determining the target space stream to which the overflow bits are filled includes:

[0192] If the number of overflow bits is greater than the sum of the data carried by the first six spatial streams, then the number of overflow bits is filled into the seventh spatial stream;

[0193] If the number of overflow bits is greater than or equal to the sum of the data carried by the first five spatial streams, and the number of overflow bits is less than the sum of the data carried by the first six spatial streams, then the number of overflow bits is filled into the sixth spatial stream;

[0194] If the number of overflow bits is greater than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than the sum of the data carried by the first five spatial streams, then the number of overflow bits is filled into the fifth spatial stream;

[0195] If the number of overflow bits is greater than or equal to the sum of the data carried by the first three spatial streams, and the number of overflow bits is less than the sum of the data carried by the first four spatial streams, then the number of overflow bits is filled into the fourth spatial stream.

[0196] If the number of overflow bits is greater than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is less than the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the third spatial stream;

[0197] If the number of overflow bits is greater than or equal to the amount of data carried by the first spatial stream, and the number of overflow bits is less than the sum of the amounts of data carried by the first two spatial streams, then the number of overflow bits is filled into the second spatial stream;

[0198] If the number of overflow bits is less than the amount of data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

[0199] In some embodiments, when the number of space streams is a sixth value, determining the target space stream to which the overflow bits are filled includes: determining the target space stream to which the overflow bits are filled based on a jump lookup method.

[0200] It is worth noting that the sixth value can be 7, and in practice, it can also take other values; this disclosure does not impose any restrictions on this. The first six spatial streams can include the first spatial stream, the second spatial stream, the third spatial stream, the fourth spatial stream, the fifth spatial stream, and the sixth spatial stream.

[0201] Specifically, when UEQM N SS When the value is 7, the target space stream to which the overflow bits are filled is determined using any of the following methods:

[0202] Method 1:

[0203] The above method uses a binary search (binary tree) approach to classify and search for the target space stream to which the overflow bits should be filled. This method employs three layers of conditional statements to classify and search for six candidate space streams to which the overflow bits should be filled.

[0204] Method 2:

[0205] The above method classifies and searches the target space stream to which the overflow bits are filled using a linear search approach. This method confirms the search for N by searching one by one. CBPSS,2,u The sum of the first two elements, N CBPSS,3,u The sum of the first 3 elements, N CBPSS,4,u The sum of the first 4 elements, N CBPSS,5,u The sum of the first 5 elements, N CBPSS,6,u The sum of the first 6 elements is used to determine the target space stream to which the overflow bits are filled.

[0206] Method 3:

[0207] In addition to the two methods mentioned above, a third rule, namely the skip search method, can be used to determine the target spatial stream to which the overflow bits will be filled. For example, a UEQM scenario will be used to illustrate the implementation details. First, when the UEQM pattern is {M,M,M-1,M-1,M-2,M-2,M-2}, the resource unit (RU) size used is 26 subcarriers (26-tone) RU, and the effective data subcarriers N... SD =24. The modulation and coding scheme (MCS) of the first spatial stream is 10, that is, 1024-QAM modulation is used, the modulation level M=6, and the code rate R u =3 / 4, the number of codes that the spatial stream can carry in one OFDM symbol time for each modulation level is shown in Table 1.

[0208] Table 1. Number of codes that the spatial stream can carry in one OFDM symbol time at each modulation level.

[0209] Assume N Excess,u =400, let Δ = 3,

[0210] When j = 1, we can obtain: N SCBPS,1·Δ,u=N SCBPS,3,u =306 <N Excess,u =400

[0211] According to the skip search method, we can obtain: j = j + 1 = 2

[0212] N can be obtained SCBPS,2·Δ,u =N SCBPS,6,u =540>N Excess,u =400

[0213] Therefore, j = 2, and the search is performed on x0 ∈ [3+1, 6-1] = [4, 5] N. SCBPS,6,u =396 <N Excess,u =400 N SCBPS,5,u =468>N Excess,u =400

[0214] Therefore, we can obtain x0 = 5, where x0 is the number of overflow bits that fill the target space stream.

[0215] In some embodiments, when the number of space streams is a seventh value, determining the target space stream to which the overflow bits are filled includes:

[0216] If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first six spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first seven spatial streams, then the number of overflow bits is filled into the eighth spatial stream.

[0217] If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first six spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first seven spatial streams, then the number of overflow bits is filled into the seventh spatial stream.

[0218] If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first six spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first five spatial streams, then the number of overflow bits is filled into the sixth spatial stream.

[0219] If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first six spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first five spatial streams, then the number of overflow bits is filled into the fifth spatial stream.

[0220] If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the fourth spatial stream.

[0221] If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first two spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the third spatial stream.

[0222] If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than the data carried by the first spatial stream, then the number of overflow bits is filled into the second spatial stream.

[0223] If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is less than or equal to the data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

[0224] In some embodiments, when the number of space streams is a seventh value, determining the target space stream to which the overflow bits are filled includes:

[0225] If the number of overflow bits is greater than the sum of the data carried by the first seven spatial streams, then the number of overflow bits is filled into the eighth spatial stream;

[0226] If the number of overflow bits is less than the sum of the data carried by the first seven spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first six spatial streams, then the number of overflow bits is filled into the seventh spatial stream;

[0227] If the number of overflow bits is less than the sum of the data carried by the first six spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first five spatial streams, then the number of overflow bits is filled into the sixth spatial stream;

[0228] If the number of overflow bits is less than the sum of the data carried by the first five spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first four spatial streams, then the number of overflow bits is filled into the fifth spatial stream;

[0229] If the number of overflow bits is less than the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the fourth spatial stream;

[0230] If the number of overflow bits is less than the sum of the data carried by the first three spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first two spatial streams, then the number of overflow bits is filled into the third spatial stream;

[0231] If the number of overflow bits is less than the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than or equal to the data carried by the first spatial stream, then the number of overflow bits is filled into the second spatial stream;

[0232] If the number of overflow bits is less than the amount of data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

[0233] In some embodiments, when the number of space streams is a seventh value, determining the target space stream to which the overflow bits are filled includes: determining the target space stream to which the overflow bits are filled based on interpolation.

[0234] It is worth noting that the seventh value can be 8, and in practice, it can also take other values; this disclosure does not impose any restrictions on this. The first seven spatial streams can include the first spatial stream, the second spatial stream, the third spatial stream, the fourth spatial stream, the fifth spatial stream, the sixth spatial stream, and the seventh spatial stream.

[0235] When the number of spatial streams in the UEQM is 8, the implementation details are described in detail through a UEQM scenario. The UEQM pattern is {M,M,M-1,M-1,M-2,M-2,M-3,M-3}, the RU size used is a 26-tone RU, and the effective data subcarriers are N. SD =24. The MCS of the first spatial stream is 10, i.e., 1024-QAM modulation is used, the modulation level M=6, and the code rate R u =3 / 4, and the number of codes that the spatial stream can carry in one OFDM symbol time for each modulation level is shown in Table 2.

[0236] Table 2. Number of codes that the spatial stream can carry in one OFDM symbol time for each modulation level.

[0237] When UEQM N SS When the value is 8, the target space stream to which the overflow bits are filled is determined using any of the following methods:

[0238] Method 1:

[0239] The above method uses a binary search (binary tree) approach to classify and search for the target space stream to which the overflow bits should be filled. This method employs three layers of conditional statements to classify and search for eight candidate space streams to which the overflow bits should be filled.

[0240] Method 2:

[0241] The above method classifies and searches the target space stream to which the overflow bits are filled using a linear search approach. This method confirms the search for N by searching one by one. CBPSS,2,u The sum of the first two elements, N CBPSS,3,u The sum of the first 3 elements, N CBPSS,4,u The sum of the first 4 elements, N CBPSS,5,u The sum of the first 5 elements, N CBPSS,6,u The sum of the first 6 elements, N CBPSS,7,u The sum of the first 7 elements is used to determine the target space stream to which the overflow bits are filled.

[0242] The method further includes: determining, based on the target space stream, the encoding of short symbols for each user in the target space stream, the number of short symbol data carried by each user in the target space stream, and / or the number of overflow bits from the last OFDM symbol that overflows in the target space stream.

[0243] Method 3:

[0244] Besides the two methods mentioned above, interpolation can also be used to locate the overflowing spatial flow. The interpolation method finds an initial point close to the final answer by roughly estimating the target number, which can greatly simplify the iterative process. A specific demonstration is shown below.

[0245] According to Table 2, we can obtain: N SCBPS,1,u =108 N SCBPS,8,u =648

[0246] The interpolation formula is as follows:

[0247] Assume N Excess,u =500, then the result can be calculated using the interpolation formula:

[0248] Thus, N is obtained. SCBPS,6,u =540>500=N Excess,u

[0249] According to the fourth rule algorithm, x2 N needs to be updated. SCBPS,2,u =m=6

[0250] Since x0 = 1, the new difference can be recalculated using the interpolation formula as follows:

[0251] Thus, N is obtained. SCBPS,5,u =468<500=N Excess,u

[0252] According to the interpolation algorithm described above, x0 needs to be updated: x0 = 1 + m = 1 + 5 = 6

[0253] Since x0 = x2 = 6

[0254] Terminate the algorithm and derive the final result x0 = 6

[0255] As can be seen, the interpolation method obtains the final answer in just two iterations, while the traditional binary search method requires three iterations to calculate the answer.

[0256] In some embodiments, the method further includes step S202,

[0257] If N Excess,u If the value is 0, the user's Pre-FEC padding coefficient a and total symbol number N can be calculated using traditional methods (e.g., formulas (36-48) and (36-49) in the IEEE 802.11be standard draft). SYM,u The initial value is determined, and the process jumps directly to step S500.

[0258] In some embodiments, the method further includes step S203.

[0259] When the number of overflow bits equals the first preset value, determine the initial value of the Pre-FEC padding coefficients and / or the initial value of the total number of symbols for each user before the overflow bits are filled into all space streams, and directly jump to step S500.

[0260] Specifically, in addition to complementing a single spatial stream, the last OFDM symbol can also be used to complement all spatial streams, as shown in Figure 6. DBPS,short,u =R u ·N CBPS,short,u

[0261] Because a (that is, a) init There are 4 states, and N is needed. Excess,u From a*N DBPS,short,uTo compare. Therefore, the initial value of the Pre-FEC padding coefficients for each user's control forward error correction coding before padding all space streams with the overflow bits can be determined using any of the following methods:

[0262] Method 1: Dichotomy

[0263] Method 2: Traversal Method

[0264] After this method determines 'a', the traditional method is used afterwards, that is, S500 is executed.

[0265] The initial value of the total number of symbols can be determined using traditional methods, namely, the following formula:

[0266] In some embodiments, the method further includes step S300,

[0267] The first device determines, based on the target space stream, the encoding of short symbols for each user in the target space stream, the number of short symbol data carried by each user in the target space stream, and / or the number of overflow bits of each user in the last OFDM symbol that overflows in the target space stream.

[0268] Specifically, after determining the target space stream x0 to which the overflow bits will be filled in the previous step, assuming the overflow occurs in the m0th space stream, and setting m0 = x0, the number of encoded bits N for each user's short symbol can be calculated using the following formula. CBPS,short,u The number of short symbols N carried by each user DBPS,short,u The number of encoded bits for each user on the short symbol in the x0th spatial stream. And / or the number of short symbols carried by each user on the x0th spatial stream In addition, it is necessary to calculate the number of bits that overflowed in the x0th space stream. N DBPS,short,u =R u ·N CBPS,short,u

[0269] in, The sum of the number of data bits for the u-th user in an OFDM symbol across the first x0-1 spatial streams. Where, N SD,short,u N is the u-th user SD,short The value corresponds to the size of the RU, MRU, or DRU it occupies. Let be the number of coded bits for the u-th user on each subcarrier in the x0-th spatial stream.

[0270] In some embodiments, the method further includes step S400,

[0271] The first device determines the initial values ​​of the Pre-FEC padding coefficients and / or the initial value of the total number of symbols before controlling the forward error correction coding based on the number of bits overflowed by user u on the x0th spatial stream.

[0272] Specifically, based on Based on the calculation results, the first device (e.g., the transmitter) can calculate the initial value of the number of symbol segments in the last OFDM symbol, which is the initial value of the Pre-FEC padding coefficient 'a', and the initial value of the total number of symbols N. SYM,init,u The formula is as follows.

[0273] in,

[0274] Among them, R u It is the bitrate of the u-th user;

[0275] Where N CBPSS,m,u It is the number of encoded bits of the u-th user in the m-th spatial stream in an OFDM symbol.

[0276] The Pre-FEC padding coefficient 'a' is calculated based on the number of coded bits of the short symbol in the x0th spatial stream and / or the number of data carried by the short symbol in the x0th spatial stream, thereby determining that the x0th spatial stream needs to be padded to the ath OFDM symbol segment.

[0277] In some embodiments, the method further includes step S500,

[0278] The first device determines the longest-lived user and calculates -S = u_max. The specific process can follow existing technology (ETH MU PPDU).

[0279] In some embodiments, the method further includes step S600,

[0280] Determine the first parameter and the second parameter; wherein the first parameter indicates the initial value of the number of data bits for user u on the last OFDM symbol, and the second parameter indicates the initial value of the number of coded bits for user u on the last OFDM symbol;

[0281] The third and fourth parameters are determined based on the first and second parameters, where the third parameter indicates the number of bits before encoding and the fourth parameter indicates the number of bits after encoding.

[0282] It is worth noting that the third and fourth parameters can be the third and fourth parameters of binary convolutional codes (BCC), polar codes, and low-density parity-check (LDPC) codes, and this disclosure does not impose any restrictions on them.

[0283] Specifically, based on the initial Pre-FEC padding coefficients a and the total number of symbols N calculated in step S400. SYM Then, the first parameter (the initial value of the number of data bits per user on the last OFDM symbol) N can be calculated. DBPS,last,init,u The second parameter (the initial value of the number of coded bits per user on the last OFDM symbol) N CBPS,last,init,u The calculation formula is as follows:

[0284] It should be noted that the first parameter N DBPS,last,init,u Second parameter N CBPS,last,init,u According to a init Calculate the value of a based on the obtained a. init Fill with the value, up to the a-th value. init A segment of symbols. If a init =4, needs to fill the entire space flow, if a init If the value is less than 4, then the space stream needs to be filled up to the a-th position. init A symbol segment.

[0285] Furthermore, during the encoding process of each user's LDPC, the third parameter N... pld,u and the fourth parameter N avbits,u It can be calculated using the following two formulas: N pld,u =(N SYM -1)N DBPS,u +N DBPS,last,init,u N avbits,u =(N SYM -1)N CBPS,u +N CBPS,last,init,u

[0286] It is worth noting that N pld,u N is the number of bits in the data payload. avbits,u The number of bits after LDPC encoding.

[0287] In some embodiments, the method further includes step S700: determining whether excessive drilling has occurred;

[0288] In some embodiments, the method further includes step S700a: when excessive punching is determined, the fifth parameter and the sixth parameter are re-determined, wherein the fifth parameter is used to indicate the number of bits after encoding, and the sixth parameter is used to indicate the number of bits punched.

[0289] In one implementation, the number of punctured bits can be the same as the number of punctured bits in LDPC.

[0290] Specifically, after calculating the third parameter N pld,u and the fourth parameter N avbits,u Afterwards, each user using LDPC can obtain the third parameter N. pld,u and the fourth parameter N avbits,u The LDPC encoding process continues from part d) of the LDPC encoding process. If at least one user in part d) of the LDPC encoding process meets at least one of the following conditions:

[0291] N punc,u >0.1×N CW,u ×L LDPC,u ×(1-R u )and If true,

[0292] or

[0293] N punc,u >0.3×N CW,u ×L LDPC,u ×(1-R u () is true.

[0294] Where N punc,u N CW,u L LDPC,u and N shrt,u R is the LDPC encoding parameter of user u. u This refers to the bitrate of user u. Therefore, the LDPC Extra Symbol Segment field in UHR-SIG should be set to 1, and all users using LDPC need to increment N. avbits,u And recalculate N punc,u The formula used is as follows: N punc,u =max(0,(N) CW,u *L LDPC,u )-N avbits -N shrt,u

[0295] It's worth noting that if excessive puncturing occurs, the number of punctures needs to be reduced, therefore LDPC encoding requires an additional symbol segment. In practice, the specific padding method varies depending on the initial value of 'a', and will differ on the spatial stream at the m = x0 level. First, if the initial value of 'a' is 3, adding a symbol segment makes 'a' = 4, requiring the encoding to be padded to a complete OFDM symbol in the corresponding spatial stream. Due to the existence of partial RUs, the actual number of data subcarriers in the corresponding symbol segment is not exactly equal to 1 / 4 of the data subcarriers in a complete OFDM symbol. Therefore, when padding from 'a' = 3 to 'a' = 4, the three symbol segments corresponding to 'a' = 3' need to be subtracted first, and then a complete OFDM symbol needs to be added to avoid the possibility that directly adding a symbol segment might result in insufficient encoding for the data subcarriers of a complete OFDM symbol. Then, if the initial value of 'a' is 4 and x0 = N... SS This means that the initial two's complement is exactly enough to fill a complete OFDM symbol, so the newly added symbol segment needs to be placed in the first space stream of the newly added OFDM symbol. Furthermore, if the initial value of a is 4 and x0... <N SS This means that the initial two's complement is just enough to fill a complete space stream, so the newly added symbol segment needs to be placed in the next space stream. If the initial value of 'a' is 1 or 2, then a symbol segment can be added directly to the original encoding.

[0296] Based on the above calculations, update the pre-FEC padding coefficients a, m0, and N that are applicable to all users. SYM The values ​​are as follows:

[0297] It's worth noting that if excessive punching occurs, the total number of OFDM symbols, resulting from adjusting for the additional symbol segment added due to excessive punching, also needs to be adjusted based on the specific circumstances. If the initial value of 'a' is 4 and x0 = N... SS This means that the initial two's complement is just enough to fill a complete OFDM symbol. Therefore, the newly added symbol segment needs to be placed in the first space stream of the newly added OFDM symbol, thus requiring an adjustment to the total number of OFDM symbols. Furthermore, if the initial value of 'a' is 4 and x0... <N SS This indicates that the initial two's complement is just enough to fill a complete space stream, so the newly added symbol segment needs to be placed in the next space stream. Therefore, the space stream m0 to which the overflow bits terminate needs to be adjusted. If it is not one of the two candidate space streams filled with the above overflow bits, then simply increase a by 1.

[0298] In some embodiments, the method further includes step S700b: if it is determined that there is no excessive punching, no parameters are adjusted, such as setting the preamble UHR-SIG LDPC Extra Symbol Segment field = 0,N SYM =N SYM,init a=a init For details, please refer to existing technologies.

[0299] In some embodiments, the method further includes step S800, determining a seventh parameter and an eighth parameter, wherein the seventh parameter is used to indicate the number of coded bits of the last orthogonal frequency division multiplexing (OFDM) symbol, and the eighth parameter is used to indicate the number of data bits of the last OFDM symbol.

[0300] Specifically, since the user's excessive punching may change the two's complement coefficient a and the space stream m0 filled with the overflow bits, the eighth parameter N is adjusted in step S800. DBPS,last,u and the seventh parameter N CBPS,last,u The value is then confirmed. Conversely, this calculation is unnecessary for users who have not experienced excessive drilling.

[0301] For users using LDPC encoding, N DBPS,last,u =N DBPS,last,init,u

[0302] For each user, the N of the last OFDM symbol needs to be updated. CBPS ,

[0303] In some embodiments, the method further includes: S900, calculating the Post-FEC padding N_PAD_Post-FEC,u, that is, calculating the pre-FEC and Post-FEC complement N. PAD,Pre-FEC,u And calculate N PAD,Post-FEC,u For details, please refer to existing technologies.

[0304] The Packet Extension mechanism requires determining the actual extension duration based on the Pre-FEC padding coefficient 'a' and the nominal packet padding values. However, the differentiated modulation levels in UEQM require the packet body to determine the modulation level of the PE and the Pre-FEC padding coefficient 'a' according to the spatial flow of the highest modulation level. Therefore, this disclosure provides the following method to update the Packet Extension mechanism.

[0305] Figure 6 illustrates one of the flowcharts of a method for processing Physical Layer Protocol Data Units (PPDUs) provided in this disclosure. As shown in Figure 7, this method can be applied to a first device, and the method includes:

[0306] Step H100: The first device determines the target space stream to which the overflow bits are filled and the Pre-FEC padding coefficients.

[0307] Specifically, the first device can be a transmitter. The target space stream to which the overflow bits are filled and the Pre-FEC padding coefficient can be determined by the method shown in Figure 4, or by other methods (AI model). This embodiment of the present disclosure does not limit this. After the first device determines the target space stream to which the overflow bits are filled and the Pre-FEC padding coefficient, it can determine the actual duration of packet expansion.

[0308] Step H200: Determine whether the target space stream to which the overflow bits are filled is the first space stream (i.e., the space stream corresponding to the highest modulation level of the modulation and coding scheme).

[0309] Step H200a: If the target spatial stream is the spatial stream corresponding to the highest modulation level of the modulation and coding scheme, then the Pre-FEC padding coefficients remain unchanged. That is, if the Pre-FEC padding coefficients a can be obtained directly using the encoding and complementation process of UEQM MU PPDU;

[0310] Step H200b: If the target spatial stream is not the spatial stream corresponding to the highest modulation level of the modulation and coding scheme, determine the processing method for the Pre-FEC padding coefficients.

[0311] If the target spatial stream is not the spatial stream corresponding to the highest modulation level of the modulation and coding scheme, the processing method for determining the Pre-FEC padding coefficients controls two aspects:

[0312] Method 1: If the target spatial stream is not the spatial stream corresponding to the highest modulation level of the modulation and coding scheme, and the target spatial stream is the first spatial stream, then the Pre-FEC padding coefficients corresponding to the first spatial stream are assigned to the Pre-FEC padding coefficients.

[0313] If the target spatial stream is not the spatial stream corresponding to the highest modulation level of the modulation and coding scheme, and the target spatial stream is not the first spatial stream, the Pre-FEC padding coefficient is assigned a second preset value.

[0314] It is worth noting that the second preset value can be 4.

[0315] Specifically, let the coefficient a used for PE be a PE According to the requirements of existing technology, a PE The pre-FEC padding coefficient 'a' must be the first spatial stream (m=1). To satisfy this requirement, it can be achieved by classifying the target spatial stream (the m0th spatial stream) according to specific circumstances during PPDU encoding and complementation:

[0316] The advantage of the above method is that the value of PE can be set according to the actual situation of the two's complement. This method satisfies the requirements of relevant mechanisms in the prior art while preserving a PE The flexibility of its value selection.

[0317] Method 2: If the target spatial stream is not the spatial stream corresponding to the highest modulation level of the modulation and coding scheme, and the target spatial stream is not the first spatial stream, the Pre-FEC padding coefficient is assigned a third preset value, wherein the third preset value belongs to a preset set.

[0318] It is worth noting that the preset set is {1,2,3,4}.

[0319] Specifically, let the coefficient a used for PE be a PE According to the requirements of existing technology, a PE It must be the Pre-FEC padding coefficient 'a' of the first spatial flow (m=1). To satisfy this requirement, 'a' can be directly set... PE =c, c∈1,2,3,4

[0320] Let a PE For example, when c = 4, a is a constant. PE =4, the value of PE can be directly determined, which has the advantage of avoiding additional calculations and meeting the requirements of existing technology mechanisms.

[0321] In some embodiments, the method further includes step H300, obtaining the nominal packet padding value, as detailed in the prior art;

[0322] In some embodiments, the method further includes step H400, determining the PE value, that is, determining the actual duration of PE based on the nominal padding value and the finally determined Pre-FEC padding coefficient a.

[0323] Through the above embodiments, this disclosure solves at least one of the following technical effects: the traditional PPDU encoding and complement code mechanism can be applied to UEQM technology to realize encoding and complement code with unbalanced encoding capacity on different spatial streams; and allows devices using UEQM technology to encode and complement PPDU through LDPC.

[0324] This document describes a method for processing Physical Layer Protocol Data Units (PPDUs) applicable to a first device (such as a transmitter of an AP or STA). However, these inventive concepts, methods, apparatuses, devices, computer-readable storage media, chips, and computer program products are not limited to WiFi communication and can be extended to other communication scenarios to achieve the same technical benefits and effects.

[0325] Therefore, although this article describes methods and devices for WiFi communication, the inventive concepts and techniques contained herein can be extended to other communication scenarios and are expected to achieve the same technical benefits and effects. It is readily apparent that these inventive concepts have broad applicability and scalability, whether for communication between different types of APs and STAs or for communication in different deployment environments.

[0326] It should be noted that the above steps are merely examples and do not limit the scope of the invention. Various modifications and variations can be made to the steps without departing from the spirit and scope of the invention.

[0327] The order of the described steps (signaling / boxes) is not intended to be construed as a limitation, and any number of the described steps (signaling / boxes) can be skipped or combined in any order to implement the method or an alternative method.

[0328] This disclosure describes examples of communication between terminals and network element components in the network architecture described in the above embodiments, which are primarily for illustrative purposes and not for limitation.

[0329] The order of the described steps (signaling / blocks) is not intended to be construed as limiting, and any number of the described steps (signaling / blocks) can be skipped or combined in any order to implement the method or alternative methods. Generally, any of the components, modules, methods, and operations described herein can be implemented using software, firmware, hardware (e.g., fixed logic circuitry), manual processing, or any combination thereof. Some operations of the example methods can be described in the general context of executable instructions stored on computer-readable storage located locally and / or remotely on a computer processing system, and implementations can include software applications, programs, functions, etc. Alternatively or additionally, any functionality described herein can be performed at least in part by one or more hardware logic components, such as, but not limited to, field-programmable gate arrays (FPGAs), application-specific integrated circuits (ASICs), application-specific standard products (ASSPs), system-on-a-chip (SoCs), complex programmable logic devices (CPLDs), etc.

[0330] Furthermore, the signaling transmission described in the embodiments of this disclosure can be implemented in any manner known in the art. For example, signaling transmission can be explicit and / or implicit. Moreover, the illustrated steps (signaling / blocks) are for illustrative purposes only and are not intended to limit this application.

[0331] Figure 8 is a schematic structural diagram of a wireless communication device 900 provided in this disclosure. The wireless communication device includes a processor and a memory, the memory for storing computer programs, and the processor for calling and running the computer programs stored in the memory, executing instructions for at least one of the operations described above.

[0332] The wireless communication device can be an AP or a STA. The wireless communication device 900 shown in FIG8 includes a processor 910, which can call and run computer programs from memory to implement the methods in the embodiments of this application.

[0333] Optionally, as shown in FIG8, the wireless communication device 900 may further include a memory 920. The processor 910 can call and run computer programs from the memory 920 to implement the methods in the embodiments of this application. The memory 920 may be a separate device independent of the processor 910, or it may be integrated into the processor 910.

[0334] Optionally, as shown in Figure 8, the wireless communication device 900 may further include a transceiver 930. The processor 910 can control the transceiver 930 to communicate with other devices. Specifically, it can send information or data to other devices or receive information or data sent by other devices. The transceiver 930 may include a transmitter and a receiver. The transceiver 930 may further include an antenna, and the number of antennas may be one or more.

[0335] Optionally, the wireless communication device 900 may specifically be a station (such as an AP) in the embodiments of this application, and the wireless communication device 900 may implement the corresponding processes implemented by the station (such as an AP) in the various methods of the embodiments of this application. For the sake of brevity, it will not be described in detail here.

[0336] Optionally, the wireless communication device 900 may specifically be a station (such as a STA) in the embodiments of this application, and the wireless communication device 900 may implement the corresponding processes implemented by the station (such as a STA) in the various methods of the embodiments of this application. For the sake of brevity, it will not be described in detail here.

[0337] Optionally, the wireless communication device 900 may specifically be a network element or module in the embodiments of this application, and the wireless communication device 900 may implement the corresponding processes implemented by the network element or module in the various methods of the embodiments of this application. For the sake of brevity, it will not be described in detail here.

[0338] According to an example embodiment, a chip is provided, the chip including: a processor for calling and running a computer program from a memory, causing a device on which the chip is installed to perform the method according to any one of the above embodiments, examples, or example embodiments.

[0339] According to an example embodiment, a computer-readable storage medium is provided for storing a computer program that causes a computer to perform a method according to any one of the above embodiments, examples, or example embodiments.

[0340] According to an example embodiment, a computer program product is provided, including a computer program / instructions that, when executed by a processor (e.g., by the processor or an apparatus, device, computer, or machine including the processor), implement the method according to any one of the above embodiments, examples, or example embodiments.

[0341] Embodiments of this disclosure are combinations of technologies / processes that can be employed in the Wi-Fi specification to create a final product.

[0342] While this disclosure has been described in conjunction with what are considered to be the most practical and preferred embodiments, it should be understood that this disclosure is not limited to the disclosed embodiments, but is intended to cover various arrangements made without departing from the broadest interpretation of the appended claims.

Claims

1. A method for processing Physical Layer Protocol Data Units (PPDUs), executed in a first device, the method comprising: Determine the number of overflow bits; wherein, the number of overflow bits is the number of data bits remaining in the data portion of the PPDU within the last OFDM symbol; Determine whether the number of overflow bits is greater than or equal to the first preset value.

2. The method according to claim 1, wherein, The method further includes: When the number of overflow bits is greater than the first preset value, the target space stream to which the overflow bits are filled is determined.

3. The method according to claim 2, wherein, Determining the target space stream to which the overflow bits are filled includes: Based on the first rule, the second rule, the third rule, and / or the fourth rule, determine the target space stream to which the overflow bits are filled.

4. The method according to claim 2, wherein, When the number of space streams is a first value, determining the target space stream to which the overflow bits are filled includes: If the number of overflow bits is less than or equal to the number of data bits carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream; If the number of overflow bits is greater than the number of data bits carried by the first spatial stream, then the overflow bits are filled into the second spatial stream.

5. The method according to claim 2, wherein, When the number of space streams is a first value, determining the target space stream to which the overflow bits are filled includes: If the number of overflow bits is greater than the amount of data that user u can carry in one OFDM symbol on the first spatial stream, then the number of overflow bits is filled into the second spatial stream; If the number of overflow bits is less than or equal to the number of data that user u can carry in one OFDM symbol on the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

6. The method according to claim 2, wherein, When the number of space streams is the second value, determining the target space stream to which the overflow bits are filled includes: If the number of overflow bits is greater than the sum of the data carried by the first two spatial streams, then the number of overflow bits is filled into the third spatial stream; If the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than the data carried by the first spatial stream, then the number of overflow bits is filled into the second spatial stream; If the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is less than or equal to the data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

7. The method according to claim 2, wherein, When the number of space streams is the second value, determining the target space stream to which the overflow bits are filled includes: If the number of overflow bits is less than the amount of data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream; If the number of overflow bits is greater than or equal to the amount of data carried by the first spatial stream, and the number of overflow bits is less than the sum of the amounts of data carried by the first two spatial streams, then the number of overflow bits is filled into the second spatial stream; If the number of overflow bits is greater than or equal to the sum of the data carried by the first two spatial streams, then the number of overflow bits is filled into the third spatial stream.

8. The method according to claim 2, wherein, When the number of space streams is a third value, determining the target space stream to which the overflow bits are filled includes: If the number of overflow bits is greater than the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the fourth spatial stream; If the number of overflow bits is greater than the sum of the data carried by the first two spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the third spatial stream; If the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than the data carried by the first spatial stream, then the number of overflow bits is filled into the second spatial stream; If the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is less than or equal to the data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

9. The method according to claim 2, wherein, When the number of space streams is a third value, determining the target space stream to which the overflow bits are filled includes: If the number of overflow bits is greater than the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the fourth spatial stream; If the number of overflow bits is less than the sum of the data carried by the first three spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first two spatial streams, then the number of overflow bits is filled into the third spatial stream; If the number of overflow bits is less than the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than or equal to the data carried by the first spatial stream, then the number of overflow bits is filled into the second spatial stream; If the number of overflow bits is less than the amount of data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

10. The method according to claim 2, wherein, When the number of space streams is the fourth value, determining the target space stream to which the overflow bits are filled includes: If the number of overflow bits is greater than the sum of the data carried by the first three spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, then the number of overflow bits is filled into the fifth spatial stream; If the number of overflow bits is greater than the sum of the data carried by the first three spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, then the number of overflow bits is filled into the fourth spatial stream; If the number of overflow bits is less than or equal to the sum of the data carried by the first three spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first two spatial streams, then the number of overflow bits is filled into the third spatial stream; If the number of overflow bits is less than or equal to the sum of the data carried by the first three spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than the data carried by the first spatial stream, then the number of overflow bits is filled into the second spatial stream. If the number of overflow bits is less than or equal to the amount of data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

11. The method according to claim 2, wherein, When the number of space streams is the fourth value, determining the target space stream to which the overflow bits are filled includes: If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, then the number of overflow bits is filled into the fifth spatial stream; If the number of overflow bits is less than the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the fourth spatial stream; If the number of overflow bits is less than the sum of the data carried by the first three spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first two spatial streams, then the number of overflow bits is filled into the third spatial stream; If the number of overflow bits is less than the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than or equal to the data carried by the first spatial stream, then the number of overflow bits is filled into the second spatial stream; If the number of overflow bits is less than the amount of data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

12. The method according to claim 2, wherein, When the number of space streams is the fifth value, determining the target space stream to which the overflow bits are filled includes: If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first five spatial streams, then the number of overflow bits is filled into the sixth spatial stream; If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first five spatial streams, then the number of overflow bits is filled into the fifth spatial stream; If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first five spatial streams, then the number of overflow bits is filled into the fifth spatial stream; If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the fourth spatial stream. If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first two spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the third spatial stream. If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than the data carried by the first spatial stream, then the number of overflow bits is filled into the second spatial stream. If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is less than or equal to the data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

13. The method according to claim 2, wherein, When the number of space streams is the fifth value, determining the target space stream to which the overflow bits are filled includes: If the number of overflow bits is greater than the sum of the data carried by the first five spatial streams, then the number of overflow bits is filled into the sixth spatial stream; If the number of overflow bits is less than or equal to the sum of the data carried by the first five spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first four spatial streams, then the number of overflow bits is filled into the fifth spatial stream; If the number of overflow bits is less than the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the fourth spatial stream; If the number of overflow bits is less than the sum of the data carried by the first three spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first two spatial streams, then the number of overflow bits is filled into the third spatial stream; If the number of overflow bits is less than the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than or equal to the data carried by the first spatial stream, then the number of overflow bits is filled into the second spatial stream; If the number of overflow bits is less than the amount of data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

14. The method according to claim 2, wherein, When the number of space streams is the sixth value, determining the target space stream to which the overflow bits are filled includes: If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first six spatial streams, then the number of overflow bits is filled into the seventh spatial stream; If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first six spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first five spatial streams, then the number of overflow bits is filled into the sixth spatial stream. If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first six spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first five spatial streams, then the number of overflow bits is filled into the fifth spatial stream. If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the fourth spatial stream. If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first two spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the third spatial stream. If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than the data carried by the first spatial stream, then the number of overflow bits is filled into the second spatial stream. If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is less than or equal to the data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

15. The method according to claim 2, wherein, When the number of space streams is the sixth value, determining the target space stream to which the overflow bits are filled includes: If the number of overflow bits is greater than the sum of the data carried by the first six spatial streams, then the number of overflow bits is filled into the seventh spatial stream; If the number of overflow bits is greater than or equal to the sum of the data carried by the first five spatial streams, and the number of overflow bits is less than the sum of the data carried by the first six spatial streams, then the number of overflow bits is filled into the sixth spatial stream; If the number of overflow bits is greater than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than the sum of the data carried by the first five spatial streams, then the number of overflow bits is filled into the fifth spatial stream; If the number of overflow bits is greater than or equal to the sum of the data carried by the first three spatial streams, and the number of overflow bits is less than the sum of the data carried by the first four spatial streams, then the number of overflow bits is filled into the fourth spatial stream. If the number of overflow bits is greater than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is less than the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the third spatial stream; If the number of overflow bits is greater than or equal to the amount of data carried by the first spatial stream, and the number of overflow bits is less than the sum of the amounts of data carried by the first two spatial streams, then the number of overflow bits is filled into the second spatial stream; If the number of overflow bits is less than the amount of data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

16. The method according to claim 2, wherein, When the number of space streams is the sixth value, determining the target space stream to which the overflow bits are filled includes: determining the target space stream to which the overflow bits are filled based on a jump lookup method.

17. The method according to claim 2, wherein, When the number of space streams is the seventh value, determining the target space stream to which the overflow bits are filled includes: If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first six spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first seven spatial streams, then the number of overflow bits is filled into the eighth spatial stream. If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first six spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first seven spatial streams, then the number of overflow bits is filled into the seventh spatial stream. If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first six spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first five spatial streams, then the number of overflow bits is filled into the sixth spatial stream. If the number of overflow bits is greater than the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first six spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first five spatial streams, then the number of overflow bits is filled into the fifth spatial stream. If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the fourth spatial stream. If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than the sum of the data carried by the first two spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the third spatial stream. If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than the data carried by the first spatial stream, then the number of overflow bits is filled into the second spatial stream. If the number of overflow bits is less than or equal to the sum of the data carried by the first four spatial streams, and the number of overflow bits is less than or equal to the sum of the data carried by the first two spatial streams, and the number of overflow bits is less than or equal to the data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

18. The method according to claim 2, wherein, When the number of space streams is the seventh value, determining the target space stream to which the overflow bits are filled includes: If the number of overflow bits is greater than the sum of the data carried by the first seven spatial streams, then the number of overflow bits is filled into the eighth spatial stream; If the number of overflow bits is less than the sum of the data carried by the first seven spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first six spatial streams, then the number of overflow bits is filled into the seventh spatial stream; If the number of overflow bits is less than the sum of the data carried by the first six spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first five spatial streams, then the number of overflow bits is filled into the sixth spatial stream; If the number of overflow bits is less than the sum of the data carried by the first five spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first four spatial streams, then the number of overflow bits is filled into the fifth spatial stream; If the number of overflow bits is less than the sum of the data carried by the first four spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first three spatial streams, then the number of overflow bits is filled into the fourth spatial stream; If the number of overflow bits is less than the sum of the data carried by the first three spatial streams, and the number of overflow bits is greater than or equal to the sum of the data carried by the first two spatial streams, then the number of overflow bits is filled into the third spatial stream; If the number of overflow bits is less than the sum of the data carried by the first two spatial streams, and the number of overflow bits is greater than or equal to the data carried by the first spatial stream, then the number of overflow bits is filled into the second spatial stream; If the number of overflow bits is less than the amount of data carried by the first spatial stream, then the number of overflow bits is filled into the first spatial stream.

19. The method according to claim 2, wherein, When the number of space streams is the seventh value, determining the target space stream to which the overflow bits are filled includes: determining the target space stream to which the overflow bits are filled based on interpolation.

20. The method according to claim 2, wherein, The method further includes: determining, based on the target space stream, the encoding of short symbols for each user in the target space stream, the number of short symbol data carried by each user in the target space stream, and / or the number of overflow bits from the last OFDM symbol that overflows in the target space stream.

21. The method according to claim 2, wherein, The method further includes: determining the initial values ​​of the Pre-FEC padding coefficients and / or the initial value of the total number of symbols based on the number of bits overflowed by user u on the x0th spatial stream.

22. The method according to claim 1, wherein, The method further includes: Determine the first parameter and the second parameter; wherein the first parameter indicates the initial value of the number of data bits for user u on the last OFDM symbol, and the second parameter indicates the initial value of the number of coded bits for user u on the last OFDM symbol; The third and fourth parameters are determined based on the first and second parameters, where the third parameter indicates the number of bits before encoding and the fourth parameter indicates the number of bits after encoding.

23. The method according to claim 1, wherein, The method further includes: when excessive punching is determined, re-determining the fifth parameter and the sixth parameter, wherein the fifth parameter is used to indicate the number of bits after encoding, and the sixth parameter is used to indicate the number of bits punched.

24. The method according to claim 1, wherein, The method further includes: determining a seventh parameter and an eighth parameter, wherein the seventh parameter is used to indicate the number of coded bits of the last OFDM symbol, and the eighth parameter is used to indicate the number of data bits of the last OFDM symbol.

25. The method according to claim 21, wherein, The method further includes: if the target spatial stream is the spatial stream corresponding to the highest modulation level of the modulation and coding scheme, then the Pre-FEC padding coefficients are kept unchanged.

26. The method according to claim 21, wherein, The method further includes: If the target spatial stream is not the spatial stream corresponding to the highest modulation level of the modulation and coding scheme, and the target spatial stream is the first spatial stream, then the Pre-FEC padding coefficients corresponding to the first spatial stream are assigned to the Pre-FEC padding coefficients. If the target spatial stream is not the spatial stream corresponding to the highest modulation level of the modulation and coding scheme, and the target spatial stream is not the first spatial stream, the Pre-FEC padding coefficient is assigned a second preset value.

27. The method according to claim 21, wherein, The method further includes: if the target spatial stream is not the spatial stream corresponding to the highest modulation level of the modulation coding scheme, and the target spatial stream is not the first spatial stream, the Pre-FEC padding coefficient is assigned a third preset value, wherein the third preset value belongs to a preset set.

28. The method according to claim 1, wherein, The method further includes: When the number of overflow bits equals the first preset value, the initial value of the Pre-FEC padding coefficients and / or the initial value of the total number of symbols for each user are determined when the number of overflow bits is filled into all space streams.

29. A wireless communication device, wherein, The wireless communication device includes a processor and a memory for storing computer programs, the processor for calling and running the computer programs stored in the memory to perform the method as described in any one of claims 1 to 28.

30. A readable storage medium for storing a computer program that is invoked and executed by a processor to perform the method as described in any one of 1-28.