Stream parsing method, communication device, and storage medium

Abstract

Embodiments of the present disclosure relate to a stream parsing method, a communication device, and a storage medium. The stream parsing method comprises: separately mapping an input bit sequence of a single path to a plurality of spatial streams, wherein each complete mapping round comprises a first mapping round and a second mapping round; and in either the first mapping round or the second mapping round in each complete mapping round, mapping the input bit sequence to a first spatial stream modulated by means of BPSK, wherein modulation methods of MCSs corresponding to at least two spatial streams are different, and the modulation methods include BPSK modulation. In this way, a UEQM mode is improved, and the case where BPSK modulation is included is taken into account.

Description

Stream parsing methods, communication devices and storage media Technical Field

[0001] This disclosure relates to the field of communication technology, and in particular to a stream parsing method, communication device and storage medium. Background Technology

[0002] Currently, the research on Wi-Fi technology aims to improve the reliability of Wireless Local Area Networks (WLAN) connections, reduce latency, improve manageability, increase throughput at different signal-to-noise ratio (SNR) levels, and reduce device-level power consumption.

[0003] In WLANs, multiple Resource Units (RUs) can be allocated to the same user. To further improve the allocation flexibility and spectrum utilization of wireless communication systems, when a user can be allocated multiple RUs, the multiple RUs of the same user can be configured with different modulation and coding schemes (MCS), that is, multiple RUs support unequal modulation (UEQM).

[0004] Currently, the UEQM mechanism still needs further improvement. Summary of the Invention

[0005] This disclosure provides a stream parsing method, a communication device, and a storage medium to further enhance the UEQM mechanism.

[0006] In a first aspect, embodiments of this disclosure provide a stream parsing method, the method comprising:

[0007] The input bit sequence of a single path is mapped to multiple spatial streams; each complete mapping round includes a first mapping round and a second mapping round.

[0008] In each complete mapping round, in either the first mapping round or the second mapping round, the input bit sequence is mapped to a first spatial stream modulated with BPSK.

[0009] Among them, at least two of the spatial streams have different modulation schemes for their corresponding MCS modes, and the modulation schemes include BPSK modulation.

[0010] Secondly, embodiments of this disclosure also provide a stream parsing method, the method comprising:

[0011] The data stream is sequentially padded with physical layer before frame check sequence, scrambling, low-density parity check encoding, and padded with physical layer before frame check sequence, and then parsed into multiple spatial streams.

[0012] For each spatial stream, constellation point mapping, LDPC subcarrier mapping, cyclic shift diversity, space-frequency mapping, inverse discrete Fourier transform, insertion of guard interval and windowing, as well as analog and radio frequency processing are performed sequentially.

[0013] The process of performing stream parsing and mapping to multiple spatial streams includes:

[0014] The input bit sequence of a single path is mapped to multiple spatial streams; each complete mapping round includes a first mapping round and a second mapping round.

[0015] In each complete mapping round, in either the first mapping round or the second mapping round, the input bit sequence is mapped to a first spatial stream modulated with BPSK.

[0016] Among them, at least two of the spatial streams have different modulation schemes for their corresponding MCS modes, and the modulation schemes include BPSK modulation.

[0017] Thirdly, embodiments of this disclosure also provide a signal processing method, including:

[0018] The data stream is sequentially padded with physical layer before frame check sequence, scrambling, low-density parity check encoding, and padded with physical layer before frame check sequence, and then parsed into multiple spatial streams.

[0019] For each spatial stream, constellation point mapping, LDPC subcarrier mapping, cyclic shift diversity, space-frequency mapping, inverse discrete Fourier transform, insertion of guard interval and windowing, as well as analog and radio frequency processing are performed sequentially.

[0020] The process of performing stream parsing and mapping to multiple spatial streams includes:

[0021] The input bit sequence of a single path is mapped to multiple spatial streams; each complete mapping round includes a first mapping round and a second mapping round.

[0022] In each complete mapping round, in either the first mapping round or the second mapping round, the input bit sequence is mapped to a first spatial stream modulated with BPSK.

[0023] Among them, at least two of the spatial streams have different modulation schemes for their corresponding MCS modes, and the modulation schemes include BPSK modulation.

[0024] Fourthly, embodiments of this disclosure also provide a stream parser, the stream parser comprising:

[0025] The mapping module is used to map the input bit sequence of a single path to multiple spatial streams; each complete mapping round includes a first mapping round and a second mapping round.

[0026] In each complete mapping round, in either the first mapping round or the second mapping round, the input bit sequence is mapped to a first spatial stream modulated with BPSK.

[0027] Among them, at least two of the spatial streams have different modulation schemes for their corresponding MCS modes, and the modulation schemes include BPSK modulation.

[0028] Fifthly, embodiments of this disclosure also provide a signal processing system, including:

[0029] The module includes a physical layer padding module before frame check sequence, a scrambling module, a low-density parity check coding module, a physical layer padding module after frame check sequence, a stream parsing module, a constellation point mapping module, an LDPC subcarrier mapping module, a cyclic shift diversity module, a space-frequency mapping module, a discrete Fourier inverse transform module, a guard interval insertion module, windowing, and analog and radio frequency modules.

[0030] The stream parsing module is used to map the input bit sequence of a single path to multiple spatial streams; wherein each complete mapping round includes a first mapping round and a second mapping round.

[0031] In each complete mapping round, in either the first mapping round or the second mapping round, the input bit sequence is mapped to a first spatial stream modulated with BPSK.

[0032] Among them, at least two of the spatial streams have different modulation schemes for their corresponding MCS modes, and the modulation schemes include BPSK modulation.

[0033] Sixthly, embodiments of this disclosure also provide a communication device, including:

[0034] One or more processors;

[0035] The communication device is used to execute the stream parsing method described in the first or second aspect of the embodiments of this disclosure.

[0036] In a seventh aspect, embodiments of this disclosure also provide a signal processing system, including:

[0037] One or more processors;

[0038] The signal processing system is used to execute the signal processing method described in the third aspect of the embodiments of this disclosure.

[0039] Eighthly, embodiments of this disclosure also provide a storage medium storing instructions that, when executed on a communication device, cause the communication device to perform the stream parsing method as described in the first aspect of this disclosure, or to perform the stream parsing method as described in the second aspect of this disclosure.

[0040] In this embodiment of the disclosure, for cases where BPSK modulation is included in UEQM, in each complete mapping round, in one of the first or second mapping rounds, the input bit sequence is mapped to a first spatial stream using BPSK modulation to complete the UEQM mode while being compatible with cases including BPSK modulation.

[0041] Additional aspects and advantages of embodiments of this disclosure will be set forth in part in the description which follows, and will become apparent from the description or may be learned by practice of this disclosure. Attached Figure Description

[0042] To more clearly illustrate the technical solutions in the embodiments of this disclosure, the accompanying drawings required for the description of the embodiments are introduced below. The following drawings are only some embodiments of this disclosure and do not impose specific limitations on the protection scope of this disclosure.

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

[0044] Figure 2 is one of the flowcharts of the stream parsing method provided in the embodiments of this disclosure;

[0045] Figure 3 is a second schematic flowchart of the stream parsing method provided in the embodiments of this disclosure;

[0046] Figure 4 is a schematic diagram of a first example provided in the embodiments of this disclosure;

[0047] Figure 5 is a third schematic flowchart of the stream parsing method provided in this embodiment of the present disclosure;

[0048] Figure 6 is a fourth flowchart illustrating the stream parsing method provided in this embodiment of the present disclosure;

[0049] Figure 7 is a fifth flowchart illustrating the stream parsing method provided in this embodiment of the present disclosure;

[0050] Figure 8 is a schematic flowchart of one of the signal processing methods provided in the embodiments of this disclosure;

[0051] Figure 9 is a schematic diagram of one of the second examples provided in the embodiments of this disclosure;

[0052] Figure 10 is a second schematic diagram of a second example provided in the embodiments of this disclosure;

[0053] Figure 11 is a fifth flowchart illustrating the stream parsing method provided in this embodiment of the present disclosure;

[0054] Figure 12 is a sixth flowchart illustrating the stream parsing method provided in this embodiment of the present disclosure;

[0055] Figure 13 is a sixth schematic flowchart of the signal processing method provided in the embodiments of this disclosure;

[0056] Figure 14 is a schematic diagram of the structure of the stream parser proposed in an embodiment of this disclosure;

[0057] Figure 15 is a schematic diagram of the structure of the communication device proposed in an embodiment of this disclosure;

[0058] Figure 16 is a schematic diagram of the structure of the terminal device proposed in an embodiment of this disclosure;

[0059] Figure 17 is a schematic diagram of the chip structure proposed in an embodiment of this disclosure. Detailed Implementation

[0060] This disclosure presents a stream parsing method, a communication device, and a storage medium.

[0061] In a first aspect, embodiments of this disclosure propose a stream parsing method, the method comprising:

[0062] The input bit sequence of a single path is mapped to multiple spatial streams; each complete mapping round includes a first mapping round and a second mapping round.

[0063] In each complete mapping round, in either the first mapping round or the second mapping round, the input bit sequence is mapped to a first spatial stream modulated with BPSK.

[0064] Among them, at least two of the spatial streams have different modulation schemes for their corresponding MCS modes, and the modulation schemes include BPSK modulation.

[0065] In the above embodiments, for cases where BPSK modulation is included in UEQM, in each complete mapping round, in one of the first or second mapping rounds, the input bit sequence is mapped to a first spatial stream using BPSK modulation to complete the UEQM mode while being compatible with cases including BPSK modulation.

[0066] Secondly, embodiments of this disclosure propose a stream parsing method, the method comprising:

[0067] The data stream is sequentially padded with physical layer before frame check sequence, scrambling, low-density parity check encoding, and padded with physical layer before frame check sequence, and then parsed into multiple spatial streams.

[0068] For each spatial stream, constellation point mapping, LDPC subcarrier mapping, cyclic shift diversity, space-frequency mapping, inverse discrete Fourier transform, insertion of guard interval and windowing, as well as analog and radio frequency processing are performed sequentially.

[0069] The process of performing stream parsing and mapping to multiple spatial streams includes:

[0070] The input bit sequence of a single path is mapped to multiple spatial streams; each complete mapping round includes a first mapping round and a second mapping round.

[0071] In each complete mapping round, in either the first mapping round or the second mapping round, the input bit sequence is mapped to a first spatial stream modulated with BPSK.

[0072] Among them, at least two of the spatial streams have different modulation schemes for their corresponding MCS modes, and the modulation schemes include BPSK modulation.

[0073] Thirdly, embodiments of this disclosure also provide a signal processing method, including:

[0074] The data stream is sequentially padded with physical layer before frame check sequence, scrambling, low-density parity check encoding, and padded with physical layer before frame check sequence, and then parsed into multiple spatial streams.

[0075] For each spatial stream, constellation point mapping, LDPC subcarrier mapping, cyclic shift diversity, space-frequency mapping, inverse discrete Fourier transform, insertion of guard interval and windowing, as well as analog and radio frequency processing are performed sequentially.

[0076] The process of performing stream parsing and mapping to multiple spatial streams includes:

[0077] The input bit sequence of a single path is mapped to multiple spatial streams; each complete mapping round includes a first mapping round and a second mapping round.

[0078] In each complete mapping round, in either the first mapping round or the second mapping round, the input bit sequence is mapped to a first spatial stream modulated with BPSK.

[0079] Among them, at least two of the spatial streams have different modulation schemes for their corresponding MCS modes, and the modulation schemes include BPSK modulation.

[0080] Fourthly, embodiments of this disclosure also provide a stream parser for performing an optional implementation of the first or second aspect.

[0081] Fifthly, embodiments of this disclosure also provide a signal processing system, including:

[0082] The module includes a physical layer padding module before frame check sequence, a scrambling module, a low-density parity check coding module, a physical layer padding module after frame check sequence, a stream parsing module, a constellation point mapping module, an LDPC subcarrier mapping module, a cyclic shift diversity module, a space-frequency mapping module, a discrete Fourier inverse transform module, a guard interval insertion module, windowing, and analog and radio frequency modules.

[0083] The stream parsing module is used to map the input bit sequence of a single path to multiple spatial streams; wherein each complete mapping round includes a first mapping round and a second mapping round.

[0084] In each complete mapping round, in either the first mapping round or the second mapping round, the input bit sequence is mapped to a first spatial stream modulated with BPSK.

[0085] Among them, at least two of the spatial streams have different modulation schemes for their corresponding MCS modes, and the modulation schemes include BPSK modulation.

[0086] Sixthly, embodiments of this disclosure also provide a communication device, including:

[0087] One or more processors;

[0088] The communication device is used to execute an optional implementation of the first aspect or the second aspect.

[0089] In a seventh aspect, embodiments of this disclosure also provide a communication system including a stream parser, wherein the stream parser is configured to perform an optional implementation as described in the first aspect, or is configured to perform an optional implementation as described in the second aspect.

[0090] Eighthly, embodiments of this disclosure also provide a storage medium storing instructions that, when executed on a communication device, cause the communication device to perform the optional implementations described in the first and second aspects.

[0091] Ninthly, embodiments of this disclosure provide a program product that, when executed by a communication device, causes the communication device to perform the method as described in the optional implementations of the first and second aspects.

[0092] In a tenth aspect, embodiments of this disclosure provide a computer program that, when run on a computer, causes the computer to perform the methods described in the optional implementations of the first and second aspects.

[0093] Eleventhly, embodiments of this disclosure provide a chip or chip system. The chip or chip system includes processing circuitry configured to perform the methods described according to optional implementations of the first and second aspects above.

[0094] It is understood that the aforementioned stream parser, communication device, signal processing system, communication system, storage medium, program product, computer program, chip, or chip system are all used to perform the methods proposed in the embodiments of this disclosure. Therefore, the beneficial effects that can be achieved can be referred to the beneficial effects in the corresponding methods, and will not be repeated here.

[0095] This disclosure provides a stream parsing method, a communication device, and a storage medium. In some embodiments, the terms "stream parsing method" and "signal transmission method," "wireless frame transmission method," etc., can be used interchangeably, as can the terms "information processing system," "communication system," etc.

[0096] This disclosure is not exhaustive, but merely illustrative of some embodiments, and is not intended to limit the scope of protection of this disclosure. Unless otherwise specified, each step in a particular embodiment can be implemented as an independent embodiment, and the steps can be arbitrarily combined. For example, a solution after removing some steps in a particular embodiment can also be implemented as an independent embodiment, and the order of the steps in a particular embodiment can be arbitrarily interchanged. Furthermore, the optional implementation methods in a particular embodiment can be arbitrarily combined; moreover, the embodiments can be arbitrarily combined, for example, some or all steps of different embodiments can be arbitrarily combined, and a particular embodiment can be arbitrarily combined with the optional implementation methods of other embodiments.

[0097] In each of the disclosed embodiments, unless otherwise specified or in case of logical conflict, the terminology and / or descriptions of the embodiments are consistent and can be referenced by each other. Technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships.

[0098] 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 scope of this disclosure.

[0099] In the embodiments of this disclosure, "multiple" refers to two or more.

[0100] In some embodiments, the terms “at least one of A or B, at least one of A and B”, “one or more”, “a plurality of”, “multiple”, etc., may be used interchangeably.

[0101] In some embodiments, the notation "at least one of A and B", "A and / or B", "A in one case, B in another", "in response to one case A, in response to another case B", etc., may include the following technical solutions depending on the situation: in some embodiments, A (execute A regardless of whether there is a branch B); in some embodiments, B (execute B regardless of whether there is a branch A); in some embodiments, execution is selected from A and B (A and B are selectively executed); in some embodiments, both A and B are executed. The same applies when there are more branches such as A, B, C, etc.

[0102] In some embodiments, the notation "A or B" may include the following technical solutions, depending on the situation: in some embodiments, A (execute A regardless of whether a branch B exists); in some embodiments, B (execute B regardless of whether a branch A exists); in some embodiments, execution is selected from A and B (A and B are selectively executed). The same applies when there are more branches such as A, B, and C.

[0103] The prefixes "first," "second," etc., used in the embodiments of this disclosure are merely for distinguishing different descriptive objects and do not impose restrictions on the position, order, priority, quantity, or content of the descriptive objects. The description of the descriptive objects is found in the claims or the context of the embodiments, and the use of prefixes should not constitute unnecessary restrictions. For example, if the descriptive object is a "field," the ordinal numbers preceding "field" in "first field" and "second field" do not restrict the position or order of the "fields." "First" and "second" do not restrict whether the "fields" they modify are in the same message, nor do they restrict the order of "first field" and "second field." Similarly, if the descriptive object is a "level," the ordinal numbers preceding "level" in "first level" and "second level" do not restrict the priority between "levels." Furthermore, the number of descriptive objects is not limited by ordinal numbers and can be one or more. For example, in "first device," the number of "devices" can be one or more. Furthermore, the objects modified by different prefixes can be the same or different. For example, if the object being described is "device", then "first device" and "second device" can be the same device or different devices, and their types can be the same or different. Similarly, if the object being described is "information", then "first information" and "second information" can be the same information or different information, and their content can be the same or different.

[0104] In some embodiments, “including A,” “containing A,” “for indicating A,” and “carrying A” can be interpreted as directly carrying A or indirectly indicating A.

[0105] In some embodiments, terms such as "time / frequency" and "time-frequency domain" refer to the time domain and / or frequency domain.

[0106] In some embodiments, terms such as “in response to…”, “in response to determining…”, “in the case of…”, “when…”, “when…”, “if…”, etc. can be used interchangeably. These descriptions all refer to the device making a corresponding action under certain objective circumstances. They do not necessarily limit the time, nor do they require the device to make a judgment action when implementing it, nor do they mean that there must be other limitations.

[0107] In some embodiments, the terms “greater than,” “greater than or equal to,” “not less than,” “more than,” “more than or equal to,” “not less than,” “higher than,” “higher than or equal to,” “not lower than,” and “above” can be used interchangeably, as can the terms “less than,” “less than or equal to,” “not greater than,” “less than,” “less than or equal to,” “not more than,” “lower than,” “lower than or equal to,” “not higher than,” and “below”.

[0108] In some embodiments, devices, etc., may be interpreted as physical or virtual, and their names are not limited to those described in the embodiments. Terms such as “device,” “equipment,” “circuit,” “network element,” “network function,” “network device,” “function,” “node,” “unit,” “section,” “system,” “network,” “chip,” “chip system,” “entity,” and “subject” are interchangeable.

[0109] In some embodiments, "network" can be interpreted as devices included in a network (e.g., access network devices, core network devices, etc.).

[0110] In addition, terms such as "uplink" and "downlink" can be replaced with terms corresponding to inter-terminal communication (e.g., "side"). For example, uplink channel and downlink channel can be replaced with side channel, and uplink link and downlink link can be replaced with side link.

[0111] In some embodiments, the acquisition of data, information, etc., may comply with the laws and regulations of the country where the location is situated.

[0112] In some embodiments, data, information, etc., may be obtained with the user's consent.

[0113] Furthermore, each element, each row, or each column in the table of this disclosure can be implemented as an independent embodiment, and any combination of any element, any row, or any column can also be implemented as an independent embodiment.

[0114] Figure 1 is a schematic diagram of the architecture of a communication system according to an embodiment of the present disclosure.

[0115] As shown in Figure 1, the communication system 100 includes an Access Point (AP) 101 and a Station (STA) 102. The AP 101 and STA 102 may each include a Physical Layer (PHY) and a Medium Access Control (MAC) layer. In some embodiments, the AP may be multi-antenna / multi-radio frequency (RF) or single-antenna / single-radio frequency (SRF), which is used to transmit / receive Physical Layer Protocol Data Units (PPDUs). The STA may also be multi-antenna / multi-radio frequency (RF) or single-antenna / single-radio frequency (SRF), which is used to transmit / receive data packets.

[0116] In some embodiments, the antenna or radio frequency (RF) portion of the AP can be separated from the main body of the AP, exhibiting a remote layout. In Figure 1, the AP may include physical layer processing circuitry and media access control (MAC) processing circuitry. The physical layer processing circuitry can process physical layer signals, and the MAC layer processing circuitry can process MAC layer signals. In some embodiments, the antenna or RF portion of the STA can be separated from the main body of the STA, exhibiting a remote layout. In Figure 1, the STA may include PHY processing circuitry and MAC processing circuitry. The physical layer processing circuitry can process physical layer signals, and the MAC layer processing circuitry can process MAC layer signals.

[0117] In some embodiments, access point device 101 can be an access point for mobile terminals to access a wired network. An AP acts as a bridge connecting wired and wireless networks, its main function being to connect various wireless network clients together and then connect the wireless network to an Ethernet network. Specifically, an AP can be a terminal device or network device with a Wi-Fi chip. Optionally, the AP can support various WLAN standards such as 802.11ax, 802.11be, 802.11ac, 802.11n, 802.11g, 802.11b, 802.11a, 802.11bf, and 802.11bn, as well as the next-generation 802.11 protocol, but is not limited to these.

[0118] In some embodiments, site device 102 includes, for example, a wireless communication chip, a wireless sensor, or a wireless communication terminal that supports Wi-Fi communication. Optionally, the wireless communication terminal may be at least one of, but is not limited to, a mobile phone, a wearable device, an IoT device that supports Wi-Fi communication, a car with Wi-Fi communication capabilities, a smart car, a tablet computer, a computer with wireless transceiver capabilities, a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal device in industrial control, a wireless terminal device in self-driving, a wireless terminal device in remote medical surgery, a wireless terminal device in a smart grid, a wireless terminal device in transportation safety, a wireless terminal device in a smart city, or a wireless terminal device in a smart home.

[0119] Specifically, site device 102 can be a terminal device or network device with a Wi-Fi chip. Optionally, site device 102 can support various WLAN standards such as 802.11ax, 802.11be, 802.11ac, 802.11n, 802.11g, 802.11b, 802.11a, 802.11bf, and 802.11bn, as well as the next-generation 802.11 protocol, but is not limited to these.

[0120] Optionally, in this embodiment of the disclosure, AP and STA can be devices that support multiple links. For example, they can be represented as Access Point Multi-Link Device (AP MLD) and Non-Access Point Multi-Link Device (Non-AP MLD), respectively. AP MLD can represent an access point that supports multiple link communication functions, and non-AP MLD can represent a site that supports multiple link communication functions.

[0121] It is understood that the communication system described in this disclosure is for the purpose of more clearly illustrating the technical solutions of this disclosure, and does not constitute a limitation on the technical solutions proposed in this disclosure. As those skilled in the art will know, with the evolution of system architecture and the emergence of new business scenarios, the technical solutions proposed in this disclosure are also applicable to similar technical problems.

[0122] The following embodiments of this disclosure can be applied to the communication system 100 shown in FIG1, or to some of the main bodies, but are not limited thereto. The main bodies shown in FIG1 are illustrative. The communication system may include all or some of the main bodies in FIG1, or may include other main bodies outside of FIG1. ​​The number and form of each main body are arbitrary. Each main body may be physical or virtual. The connection relationship between the main bodies is illustrative. The main bodies may not be connected or may be connected. The connection can be in any way, it can be a direct connection or an indirect connection, it can be a wired connection or a wireless connection.

[0123] The embodiments disclosed herein can be applied to Wireless Local Area Networks (WLANs), such as LANs using the 802.11 series of protocols. In a WLAN, a Basic Service Set (BSS) is a fundamental component. An BSS network consists of site devices with some association within a specific coverage area. One type of association is where sites communicate directly with each other in a self-organizing network; this is called an Independent Basic Service Set (IBSS). Another more common scenario is that in a BSS network, there is only one central site dedicated to managing the BSS, called an Access Point (AP) device, while other sites in the BSS network that are not APs are called terminals, also known as non-AP STAs. APs and non-AP STAs are collectively referred to as STAs. When describing STAs, it is not necessary to distinguish between APs and non-AP STAs. Within the same BSS network, due to distance, transmission power, etc., a STA cannot detect other STAs that are far away; they are each other's hidden nodes.

[0124] Figure 2 is one of the interactive schematic diagrams of a stream parsing method according to an embodiment of the present disclosure. As shown in Figure 2, the method includes:

[0125] Step 201: Map the input bit sequence of a single path to multiple spatial streams; wherein each complete mapping round includes a first mapping round and a second mapping round.

[0126] In each complete mapping round, in either the first mapping round or the second mapping round, the input bit sequence is mapped to a first spatial stream modulated with BPSK.

[0127] Among them, at least two of the spatial streams have different modulation schemes for their corresponding MCS modes, and the modulation schemes include BPSK modulation.

[0128] With the continuous evolution of wireless communication technology, the IEEE 802.11 standard (commonly known as "Wi-Fi") continues to release new revisions and extensions to meet the demands for higher throughput, lower latency, and wider application scenarios. Starting with 802.11n, Wi-Fi introduced Multiple-Input Multiple-Output (MIMO) and multi-antenna technology at the Physical Layer (PHY) to significantly improve data transmission rates and spectral efficiency. Subsequent versions (such as 802.11ac, 802.11ax, 802.11be, and later protocols) further improved wireless link capacity and performance through higher-order modulation schemes (such as 256QAM, 1024QAM, and 4096QAM, and even higher), wider bandwidth, and advanced multi-user scheduling algorithms.

[0129] The IEEE 802.11bn series of protocols is considered one of the next-generation Wi-Fi standards, aiming to further improve throughput and optimize spectrum utilization while being compatible with various application requirements, including ultra-high-definition multimedia transmission, industrial IoT, and AR / VR. Because 802.11bn needs to maintain reliability at higher speeds, in addition to continuing to increase the modulation order (such as 1024QAM and 4096QAM), it has also introduced the ability to use different modulation schemes between different spatial streams (SS), namely Unequal Modulation (UEQM). Compared to "all spatial streams using the same modulation scheme," UEQM can independently select the most suitable modulation order for each spatial stream based on the actual channel conditions and device capabilities. For example, a higher-order modulation (such as 4096QAM) can be used for spatial streams with better channel quality, while a relatively lower-order modulation scheme can be selected for spatial streams with poorer channel quality, thereby improving the overall throughput and efficiency of the entire link. Therefore, further improvements are needed in the application of the UEQM mechanism in WLANs.

[0130] In this embodiment of the disclosure, during the stream parsing process of multiple spatial streams, if at least two of the spatial streams have different modulation schemes for their corresponding MCS methods (i.e., the multiple spatial streams employ UEQM), and if at least one spatial stream includes Binary Phase Shift Keying (BPSK) modulation, in each complete mapping round, in either the first mapping round or the second mapping round, the input bit sequence is mapped to the first spatial stream using BPSK modulation, thereby realizing the stream parsing process in UEQM that includes BPSK modulation. Specifically, the first mapping round can be either an odd-numbered mapping round or an even-numbered mapping round, and correspondingly, the second mapping round can be either an even-numbered mapping round or an odd-numbered mapping round; other methods are also possible, and this embodiment of the disclosure does not impose any limitations on this.

[0131] The stream parsing process refers to the process of allocating the encoded bit sequence to various spatial streams. Optionally, in this embodiment of the disclosure, the stream parsing method is applied to a stream parser as an example. The stream parser is the module or device that performs the stream parsing process, and it can also be named in other ways. This embodiment of the disclosure does not limit this.

[0132] In related technologies, stream parsers are often designed based on the assumption of the same modulation order, that is, by default each stream needs the same number of bits on the same symbol in order to be evenly distributed on the I / Q (In-Phase And Quadrature-Phas) axis. However, when BPSK modulation exists in UEQM mode, BPSK has only a single dimension and cannot be polled and placed in the I and Q paths respectively, unlike modulation methods such as Quadrature Phase Shift Keying (QPSK) and 16QAM (Quadrature Amplitude Modulation). Therefore, the stream parsing techniques in related technologies cannot be applied to situations including BPSK modulation.

[0133] In this embodiment of the disclosure, for cases where BPSK modulation is included in UEQM, in each complete mapping round, in one of the first or second mapping rounds, the input bit sequence is mapped to a first spatial stream using BPSK modulation to complete the UEQM mode while being compatible with cases including BPSK modulation.

[0134] In this embodiment of the disclosure, for the first spatial stream using the BPSK modulation, the number of bits mapped for the first spatial stream each time is 1.

[0135] Figure 3 is a second interactive schematic diagram of a stream parsing method according to an embodiment of the present disclosure. As shown in Figure 3, the method includes:

[0136] Step 301: Map the input bit sequence of a single path to multiple spatial streams respectively; in the first mapping round of each complete mapping round, map the input bit sequence to the first spatial stream using BPSK modulation.

[0137] Among them, at least two of the spatial streams correspond to different MCS modulation schemes, and the modulation schemes include BPSK modulation. If a spatial stream uses BPSK modulation, since BPSK actually only has 1 bit (equivalent to only needing a "single axis"), it will cause a mismatch problem in the original "two-round allocation" method. Therefore, in this embodiment of the disclosure, according to the first data relationship, the input bit sequence {e i The i-th bit is mapped to the spatial stream i SS Output bit sequence The j-th position; the first data relationship is as follows

[0138] i = first parameter + second parameter + third parameter + fourth parameter

[0139] Wherein, the first parameter represents the total number of bits mapped in the complete mapping round before mapping to the j-th bit;

[0140] The second parameter represents the spatial flow i within the current first mapping round or the current second mapping round. SS The total number of bits mapped by the previous spatial stream;

[0141] The third parameter represents j divided by the number of times it is mapped to stream i. SS The remainder of the number of bits;

[0142] The fourth parameter represents the total number of bits mapped in the second mapping round before mapping to the j-th bit in the current complete mapping round.

[0143] As a first example, referring to Figure 4, we will introduce the first data relationship using three spatial streams. Specifically, we will use the UEQM transmission mode supported by the IEEE 802.11bn standard as an example. In this transmission mode, the UEQM transmission modes supported between the various spatial streams are as follows: (Nss) ...

[0144] 1. When Nss = 4, there are 4 modes of UEQM, where M represents the modulation order:

[0145] [M, M, M, M-1]

[0146] [M, M, M, M-2]

[0147] [M, M, M-1, M-2]

[0148] [M, M-1, M-1, M-2]

[0149] 2. When Nss = 3, there are 3 UEQM modes:

[0150] [M, M, M-1]

[0151] [M, M, M-2]

[0152] [M, M-1, M-2]

[0153] 3. When Nss = 2, there are two modes of UEQM:

[0154] [M, M-1]

[0155] [M, M-2]

[0156] M-1 and M-2 represent modulation levels one or two levels lower than the M constellation level, respectively. For example, if M is 4096QAM, then M-1 represents 1024QAM, M-2 represents 256QAM, and so on.

[0157] Referring to Figure 4, the input sequence They are sequentially assigned to space stream 0, space stream 1, space stream 2, etc. (i SS =0,1,…,N SS -1), until all bits are divided.

[0158] In each spatial stream, these output bits are sequentially fed into the corresponding modulator for constellation mapping (including BPSK, QPSK, 16-QAM, 64-QAM, etc.); whereby each time a stream i is fed... SS The number of bits allocated s(i) SS The value must be at least 1; as shown in Formula 1 below:

[0159] Formula 1:

[0160] Taking the UEQM transmission mode supported by the IEEE 802.11bn standard as an example, BPSK exists as a spatial stream in the UEQM mode (the last spatial stream in the UEQM mode). In the last spatial stream, it is allocated according to the principle of allocating 1 bit per round. In this way, the spatial stream corresponding to BPSK will be allocated one more round than other streams. Therefore, it will not cause a significant reduction in efficiency, and it is more applicable to traditional stream parsers. Moreover, the extra data allocated to the spatial stream corresponding to BPSK is generally more reliable.

[0161] Assume the input bit sequence {e iThe i-th bit is assigned to space stream i SS Output bit sequence The j-th position, where i is the i SS A function of j, which can be represented as:

[0162] i = first parameter + second parameter + third parameter + fourth parameter

[0163] Among them, the first parameter, the second parameter, the third parameter, and the fourth parameter are respectively related to i SS Related to j; specifically,

[0164] The first parameter represents the total number of bits of all spatial stream mappings completed before mapping to the j-th bit; that is, the total number of bits mapped in all mapping rounds completed before the current mapping round.

[0165] The second parameter represents the spatial flow i within the current first mapping round or the current second mapping round. SS The total number of bits mapped by the previous space stream, i.e., i0 to i SS-1 The total number of bits mapped is the total number of bits mapped in each class of mapping rounds (the first mapping round and the second mapping round are each a class) within a complete mapping round.

[0166] The third parameter represents j divided by the number of times it is mapped to stream i. SS The remainder of the number of bits, i.e., the j-th bit should be placed in stream i. SS Which position in the middle;

[0167] The fourth parameter represents the total number of bits mapped in the second mapping round before mapping to the j-th bit in the current complete mapping round, that is, the total number of bits in a class of mapping rounds that are not mapped to the first spatial stream.

[0168] Therefore, we obtain i and i SS The mapping relationship between j and j.

[0169] In some embodiments, the first data relationship includes Formula 2:

[0170] Formula 2:

[0171] Wherein, s(i SS ) represents each mapping to the spatial flow i within each complete mapping round. SS The number of bits;

[0172] N ss Indicates the number of spatial flows;

[0173] This indicates that s(k) is rounded up;

[0174] Indicates to Round down;

[0175] mod represents the modulo operation.

[0176] in, Equivalent to the first parameter mentioned above, Equivalent to the second parameter mentioned above, j mod Equivalent to the aforementioned third parameter, This is equivalent to the fourth parameter mentioned above.

[0177] Specifically, as shown in Figure 4, the calculation of each flow i is performed. SS The number of bits allocated is denoted by Formula 3:

[0178] Formula 3:

[0179] Where, N BPSCS (i SS ) is flow i SS The total number of bits / constellation points required under this configuration (e.g., "QPSK = 2 Bits / constellation point", "16-QAM = 4 Bits / constellation point").

[0180] Assume the input bit sequence {e i The i-th bit is assigned to space stream i SS Output bit sequence The j-th position, where i is the i SS The mapping function of the function and j can be expressed as:

[0181] See Figure 4, i.e., the input bit sequence {e i In the process, after passing through the stream parser, s0 is assigned to i. SS The output bit sequence s1 = 0 is assigned to i. SS =1 output bit sequence, s2 is assigned to i SS =2 output bit sequence;

[0182] Since the first spatial stream allocates bits only in the first mapping round under BPSK modulation mode, we first define that for modulation above BPSK, a complete I / Q bit allocation round constitutes a complete mapping round, denoted by R(j,i). SS The complete map round count is marked (starting from 0):

[0183] Then R(j,i) SSThe total number of bits allocated to all space streams in all rounds is given by Formula 4:

[0184] Define the indicator variable r(j,i) for the first and second mapping rounds. SS As shown in Formula 5 below:

[0185] It can be seen that for QPSK and higher order modulation, in the first mapping round r(j,i) SS When r(j,i) = 0, in the second mapping round... SS ) = 1; while for BPSK modulation, r(j,i) always holds. SS ) = 0.

[0186] Based on the above definition, the bit indicator variable Bits_R_plus(j,i) allocated in the (R+1)th complete mapping round is... SS As shown in Formula 6 below:

[0187] The simplified formula yields Formula 7:

[0188] Combining all the aforementioned terms, we obtain Formula 2:

[0189] Where i = 0, 1, ..., N CBPS -1, i ss =0,1,…,N ss -1.

[0190] Repeat the above method for multiple rounds until all input bits are allocated. If there are any remaining bits that are not fully allocated to each spatial stream, refer to the fifth disclosed embodiment.

[0191] Figure 5 is a third interactive schematic diagram of the stream parsing method according to an embodiment of the present disclosure. As shown in Figure 5, the above method includes:

[0192] Step 501: Map the input bit sequence of a single path to multiple spatial streams respectively; in the second mapping round of each complete mapping round, map the input bit sequence to a first spatial stream using BPSK modulation.

[0193] At least two of the spatial streams correspond to different MCS modulation schemes, and the modulation scheme includes BPSK modulation. If a spatial stream uses BPSK modulation, since BPSK actually only has 1 bit (equivalent to only needing a "single axis"), it will cause a mismatch problem in the original "two-round allocation" method. Therefore, in this embodiment of the disclosure, according to the second data relationship, the input bit sequence {e i The i-th bit is mapped to the spatial stream i SS Output bit sequence The j-th position; the second data relationship is as follows

[0194] i = fifth parameter + sixth parameter + seventh parameter + eighth parameter

[0195] The fifth parameter represents the total number of bits mapped in the complete mapping rounds before mapping to the j-th bit;

[0196] The sixth parameter represents the total number of bits mapped in the second mapping round before mapping to the j-th bit in the current complete mapping round;

[0197] The seventh parameter represents j divided by the number of times it is mapped to stream i. SS The remainder of the number of bits;

[0198] The eighth parameter represents the total number of bits mapped in the second mapping round before mapping to the j-th bit in the current complete mapping round.

[0199] As a first example, referring to Figure 4, we will introduce the first data relationship using three spatial streams. Specifically, we will use the UEQM transmission mode supported by the IEEE 802.11bn standard as an example. In this transmission mode, the UEQM transmission modes supported between the various spatial streams are as follows: (Nss) ...

[0200] 1. When Nss = 4, there are 4 modes of UEQM, where M represents the modulation order:

[0201] [M, M, M, M-1]

[0202] [M, M, M, M-2]

[0203] [M, M, M-1, M-2]

[0204] [M, M-1, M-1, M-2]

[0205] 2. When Nss = 3, there are 3 UEQM modes:

[0206] [M, M, M-1]

[0207] [M, M, M-2]

[0208] [M, M-1, M-2]

[0209] 3. When Nss = 2, there are two modes of UEQM:

[0210] [M, M-1]

[0211] [M, M-2]

[0212] M-1 and M-2 represent modulation levels one or two levels lower than the M constellation level, respectively. For example, if M is 4096QAM, then M-1 represents 1024QAM, M-2 represents 256QAM, and so on.

[0213] Referring to Figure 4, the input sequence They are sequentially assigned to space stream 0, space stream 1, space stream 2, etc. (i SS =0,1,…,N SS -1), until all bits are divided.

[0214] In each spatial stream, these output bits are sequentially fed into the corresponding modulator for constellation mapping (including BPSK, QPSK, 16-QAM, 64-QAM, etc.); whereby each time a stream i is fed... SS The number of bits allocated s(i) SS The value must be at least 1; as shown in Formula 8 below:

[0215] Formula 8:

[0216] Taking the UEQM transmission mode supported by the IEEE 802.11bn standard as an example, BPSK exists as a spatial stream in the UEQM mode (the last spatial stream in the UEQM mode). In the last spatial stream, it is allocated according to the principle of allocating 1 bit per round. In this way, the spatial stream corresponding to BPSK will be allocated one more round than other streams. Therefore, it will not cause a significant reduction in efficiency, and it is more applicable to traditional stream parsers. Moreover, the extra data allocated to the spatial stream corresponding to BPSK is generally more reliable.

[0217] Assume the input bit sequence {e i The i-th bit is assigned to space stream i SS Output bit sequence The j-th position, where i is the i SS A function of j, which can be represented as:

[0218] i = fifth parameter + sixth parameter + seventh parameter + eighth parameter

[0219] Among them, the fifth, sixth, seventh, and eighth parameters are respectively related to i SS Related to j; specifically,

[0220] The fifth parameter represents the total number of bits mapped in the complete mapping rounds before mapping to the j-th bit;

[0221] The sixth parameter represents the total number of bits mapped in the second mapping round before mapping to the j-th bit in the current complete mapping round;

[0222] The seventh parameter represents the spatial flow i within the current first mapping cycle or the current second mapping cycle. SS The total number of bits mapped in the first mapping round;

[0223] The eighth parameter represents j divided by the number of times it is mapped to stream i. SS The remainder of the number of bits.

[0224] In some embodiments, the second data relationship includes Formula 9:

[0225] Formula 9:

[0226] Wherein, s(i SS ) represents each mapping to the spatial flow i within each complete mapping round. SS The number of bits;

[0227] N SS Indicates the number of spatial flows;

[0228] Indicates to Round up;

[0229] This indicates that s(k) is rounded down;

[0230] mod represents the modulo operation.

[0231] in, Equivalent to the fifth parameter mentioned above, Equivalent to the sixth parameter mentioned above, Equivalent to the seventh parameter mentioned above, j mod This is equivalent to the eighth parameter mentioned above.

[0232] Specifically, as shown in Figure 4, the calculation of each flow i is performed. SS The number of bits allocated is denoted by Formula 10:

[0233] Formula 10:

[0234] Where, N BPSCS (i SS ) is flow i SS The total number of bits / constellation points required under this configuration (e.g., "QPSK = 2 Bits / constellation point", "16-QAM = 4 Bits / constellation point").

[0235] Assume the input bit sequence {e i The i-th bit is assigned to space stream i SS Output bit sequence The j-th position, where i is the i SS The mapping function of the function and j can be expressed as:

[0236] See Figure 4, i.e., the input bit sequence {e i In the process, after passing through the stream parser, s0 is assigned to i. SS The output bit sequence s1 = 0 is assigned to i. SS =1 output bit sequence, s2 is assigned to i SS =2 output bit sequence;

[0237] Since in BPSK modulation mode, the first spatial stream allocates bits only in the second mapping round, we first define that for modulation above BPSK, a complete I / Q bit allocation round constitutes a complete mapping round, denoted by R(j,i). SS The complete map round count is marked (starting from 0):

[0238] Then R(j,i) SS The total number of bits allocated to all space streams in all rounds is given by Formula 11:

[0239] Define the indicator variable r(j,i) for the first and second mapping rounds. SS As shown in Formula 12 below:

[0240] It can be seen that for QPSK and higher order modulation, in the first mapping round r(j,i) SS ) = 1, in the second mapping round r(j,i SS ) = 0; For BPSK modulation, r(j,i) always holds. SS ) = 0.

[0241] Based on the above definition, the bit indicator variable Bits_R_plus(j,i) allocated in the (R+1)th complete mapping round is... SS As shown in Formula 13 below:

[0242] The simplified formula yields Formula 14:

[0243] Combining all the aforementioned terms, we obtain the aforementioned formula 9:

[0244] Where i = 0, 1, ..., N CBPS -1, i ss =0,1,…,N ss -1.

[0245] Repeat the above method for multiple rounds until all input bits are allocated. If there are any remaining bits that are not fully allocated to each spatial stream, refer to the fifth disclosed embodiment.

[0246] Figure 6 is a fourth interactive schematic diagram of a stream parsing method according to an embodiment of the present disclosure. As shown in Figure 5, the above method includes:

[0247] Step 601: Map the input bit sequence of a single path to multiple spatial streams; wherein each complete mapping round includes a first mapping round and a second mapping round.

[0248] In each complete mapping round, in either the first mapping round or the second mapping round, the input bit sequence is mapped to a first spatial stream modulated with BPSK.

[0249] Among them, at least two of the spatial streams have different modulation schemes for their corresponding MCS modes, and the modulation schemes include BPSK modulation.

[0250] Step 602: After the mapping rounds reach the basic number of cycles for each OFDM symbol, if there are unmapped remaining bits, map the remaining bits to the spatial stream in order from high order to low order according to the modulation scheme of the spatial stream;

[0251] Wherein, the basic loop count

[0252] N CBPS Indicates the total number of bits parsed in this stream;

[0253] This indicates the total number of bits mapped in each mapping round.

[0254] The base cycle number for each OFDM symbol represents how many “full mapping rounds” can be performed.

[0255] The number of remaining bits at the end, m, can be calculated using Formula 5:

[0256] Among them, the number of bits carried by the second spatial stream is s(i SS ).

[0257] The remaining m bits at the end are then processed according to the space stream i SS =0 to allocate s(0) bits; then, if there are still bits remaining, allocate them to space stream i. SS =1, allocate s(1) bits; if there are still bits remaining, allocate them to space stream i. SS =2, allocate s(2) bits; and so on until all bits are allocated.

[0258] In some embodiments, step 602 includes:

[0259] If the last m bits of the remaining bits are less than the number of bits carried by the second spatial stream in the spatial stream to be mapped, then the m bits are padded with zeros or additional bits are placed and mapped to the second spatial stream.

[0260] or

[0261] If the value of m is 1, then the m bits are mapped to the first spatial stream modulated by the BPSK.

[0262] If there are m bits remaining at the end, the remaining unallocated space stream can be filled with any padding bits or zeros, or additional bits can be placed. If the value of m is 1, then the m bits are mapped to the first space stream using the BPSK modulation, and the bit is automatically allocated to the space stream corresponding to the BPSK modulation. The QPSK corresponding bit is filled with any padding bits or simply zeros, or additional bits can be placed.

[0263] In some embodiments, mapping the m bits to a first spatial stream modulated by the BPSK includes:

[0264] If the number of spatial streams is 2, and the modulation scheme of the second spatial stream is QPSK or 16QAM, then the m bits are mapped to the first spatial stream using the BPSK modulation, and the second spatial stream is padded with zeros or additional bits are placed.

[0265] If the number of spatial streams is 3 or 4, then the m bits are mapped to the first spatial stream modulated by the BPSK, and the other spatial streams are padded with zeros or additional bits are placed.

[0266] Where, if N ss=2, the first spatial stream modulation method is QPSK, and the second spatial stream modulation method is BPSK. In the last round of allocation, all spatial stream data have only one bit left, that is, m=1. Then, this bit is automatically allocated to the spatial stream corresponding to BPSK modulation. The QPSK corresponding bit is filled with any padding bits or simply zeros, or additional bits are placed.

[0267] If N ss =2, the first spatial stream modulation method is 16QAM, and the second spatial stream modulation method is BPSK. In the last round of allocation, all spatial stream data have only one bit left, that is, m=1. Then, this bit is automatically allocated to the spatial stream corresponding to BPSK modulation. The corresponding bit of 16QAM is filled with any padding bit or simply zeroed, or additional bits are placed.

[0268] If the number of spatial streams is 3 or 4, then referring to the aforementioned method, the m bits are mapped to the first spatial stream using the BPSK modulation, and the other spatial streams are padded with zeros or additional bits are placed.

[0269] Figure 7 is a fifth interactive schematic diagram of a stream parsing method according to an embodiment of the present disclosure. As shown in Figure 7, the method includes:

[0270] Step 701: According to a preset mapping method, the input bit sequence of a single path is mapped to multiple spatial streams respectively; wherein, at least two of the spatial streams have different modulation methods for the MCS mode, and the modulation method includes BPSK modulation.

[0271] After the mapping rounds reach the basic number of cycles for each OFDM symbol, if there are unmapped remaining bits, the remaining bits are mapped to the spatial stream in descending order of the modulation scheme of the spatial stream.

[0272] During the stream parsing process, if the mapping rounds reach the basic cycle count for each OFDM symbol and there are remaining bits that have not been mapped, then the process proceeds according to the spatial stream i. SS =0 to allocate s(0) bits; then, if there are still bits remaining, allocate them to space stream i. sS =1, allocate s(1) bits; if there are still bits remaining, allocate them to space stream i. SS =2, allocate s(2) bits; and so on until all bits are allocated.

[0273] In some embodiments, the base number of loops

[0274] N CBPS Indicates the total number of bits parsed in this stream;

[0275] This indicates the total number of bits mapped in each mapping round.

[0276] In some embodiments, the step of sequentially mapping the remaining bits into the spatial stream includes:

[0277] If the last m bits of the remaining bits are less than the number of bits carried by the second spatial stream in the spatial stream to be mapped, then the m bits are padded with zeros or additional bits are placed and mapped to the second spatial stream.

[0278] or

[0279] If the value of m is 1, then the m bits are mapped to the first spatial stream modulated by the BPSK.

[0280] If there are m bits remaining at the end, the remaining unallocated space stream can be filled with any padding bits or zeros, or additional bits can be placed. If the value of m is 1, then the m bits are mapped to the first space stream using the BPSK modulation, and the bit is automatically allocated to the space stream corresponding to the BPSK modulation. The QPSK corresponding bit is filled with any padding bits or simply zeros, or additional bits can be placed.

[0281] In some embodiments, mapping the m bits to a first spatial stream modulated by the BPSK includes:

[0282] If the number of spatial streams is 2, and the modulation scheme of the second spatial stream is QPSK or 16QAM, then the m bits are mapped to the first spatial stream using the BPSK modulation, and the second spatial stream is padded with zeros or additional bits are placed.

[0283] If the number of spatial streams is 3 or 4, then the m bits are mapped to the first spatial stream modulated by the BPSK, and the other spatial streams are padded with zeros or additional bits are placed.

[0284] Where, if N ss =2, the first spatial stream modulation method is QPSK, and the second spatial stream modulation method is BPSK. In the last round of allocation, all spatial stream data have only one bit left, that is, m=1. Then, this bit is automatically allocated to the spatial stream corresponding to BPSK modulation. The QPSK corresponding bit is filled with any padding bits or simply zeros, or additional bits are placed.

[0285] If N ss=2, the first spatial stream modulation method is 16QAM, and the second spatial stream modulation method is BPSK. In the last round of allocation, all spatial stream data have only one bit left, that is, m=1. Then, this bit is automatically allocated to the spatial stream corresponding to BPSK modulation. The corresponding bit of 16QAM is filled with any padding bit or simply zeroed, or additional bits are placed.

[0286] If the number of spatial streams is 3 or 4, then referring to the aforementioned method, the m bits are mapped to the first spatial stream using the BPSK modulation, and the other spatial streams are padded with zeros or additional bits are placed.

[0287] Figure 8 is an interactive schematic diagram of a signal processing method according to an embodiment of the present disclosure. As shown in Figure 8, the method includes: a signal processing method, comprising:

[0288] Step 801: Perform physical layer padding before frame check sequence, scrambling, low-density parity check encoding, and physical layer padding after frame check sequence on the data stream in sequence, and perform stream parsing to map them to multiple spatial streams respectively.

[0289] For each spatial stream, constellation point mapping, low-density parity check code (LDPC) subcarrier mapping, cyclic shift diversity, space-frequency mapping, discrete Fourier inverse transform, insertion of guard interval and windowing, as well as analog and radio frequency processing are performed sequentially.

[0290] The process of performing stream parsing and mapping to multiple spatial streams includes:

[0291] The input bit sequence of a single path is mapped to multiple spatial streams; each complete mapping round includes a first mapping round and a second mapping round.

[0292] In each complete mapping round, in either the first mapping round or the second mapping round, the input bit sequence is mapped to a first spatial stream modulated with BPSK.

[0293] Among them, at least two of the spatial streams have different modulation schemes for their corresponding MCS modes, and the modulation schemes include BPSK modulation.

[0294] The preset mapping method includes any of the methods described in the foregoing embodiments, and will not be repeated here.

[0295] As a second example, the transmitter (and its working process) applied to the stream parsing method and signal processing method provided in the embodiments of this disclosure are shown in Figures 9 and 10.

[0296] Figure 9 shows an example of a transmitter block diagram for uplink (UL) or downlink (DL) non-MU-MIMO transmission of data fields using LDPC encoding in an RU or MRU (Multi-Resource Unit) with 996 tones (subcarriers) or less than or equal to 996 tones (subcarriers) RU. It mainly includes:

[0297] (1) Pre-FEC PHY Padding.

[0298] (2) Scrambler: Scrambles data bits. This operation reduces the probability of consecutive 0s and 1s in the data sequence.

[0299] (3) Low Density Parity Check Code Encoder (LDPCEncoder): Encodes the data. It should be understood that LDPC encoding here is only an exemplary illustration, and the specific encoding method is not limited in the embodiments of this disclosure.

[0300] (4) Post-FEC Padding.

[0301] (5) Stream Parser: Divides the bits output by the low-density parity-check encoder into a multi-stream bit sequence. The stream parser, based on a first data relationship or a second data relationship, divides the input bit sequence {e...} i The i-th bit is mapped to the spatial stream i SS Output bit sequence The j-th position; the first data relationship is as follows:

[0302] The first data relationship is as follows:

[0303] i = first parameter + second parameter + third parameter + fourth parameter

[0304] Wherein, the first parameter represents the total number of bits mapped in the complete mapping round before mapping to the j-th bit;

[0305] The second parameter represents the spatial flow i within the current first mapping round or the current second mapping round. SS The total number of bits mapped by the previous spatial stream;

[0306] The third parameter represents j divided by the number of times it is mapped to stream i. SS The remainder of the number of bits;

[0307] The fourth parameter represents the total number of bits mapped in the second mapping round before mapping to the j-th bit in the current complete mapping round.

[0308] Furthermore, the first data relationship includes:

[0309] Wherein, s(i SS ) represents each mapping to the spatial flow i within each complete mapping round. SS The number of bits;

[0310] N ss Indicates the number of spatial flows;

[0311] This indicates that s(k) is rounded up;

[0312] Indicates to Round down;

[0313] mod represents the modulo operation.

[0314] i = fifth parameter + sixth parameter + seventh parameter + eighth parameter

[0315] Among them, the fifth, sixth, seventh, and eighth parameters are respectively related to i SS Related to j; specifically,

[0316] The fifth parameter represents the total number of bits mapped in the complete mapping rounds before mapping to the j-th bit;

[0317] The sixth parameter represents the total number of bits mapped in the second mapping round before mapping to the j-th bit in the current complete mapping round;

[0318] The seventh parameter represents the spatial flow i within the current first mapping cycle or the current second mapping cycle. SS The total number of bits mapped in the first mapping round;

[0319] The eighth parameter represents j divided by the number of times it is mapped to stream i. SS The remainder of the number of bits.

[0320] Furthermore, the second data relationship includes:

[0321] Wherein, s(i SS ) represents each mapping to the spatial flow i within each complete mapping round. SS The number of bits;

[0322] Nss Indicates the number of spatial flows;

[0323] Indicates to Round up;

[0324] This indicates that s(k) is rounded down;

[0325] mod represents the modulo operation.

[0326] (6) Constellation Mapper: Maps bit sequences to constellation points.

[0327] (7) Carrier Mapper (LDPC Tone Mapper).

[0328] (8) Cyclic Shift Diversity Per SS.

[0329] (9) Spatial Frequency mapper.

[0330] (10) Inverse Discrete Fourier Transform (IDFT): The inverse discrete Fourier transform is applied to the subcarrier block.

[0331] (11) Guard Interval Insertion and Windowing (GI and Window).

[0332] (12) Analog and Radio Frequency (Analog and RF).

[0333] Figure 10 is an example of a transmitter block diagram for uplink (UL) or downlink (DL) non-MU-MIMO transmission of data fields using LDPC encoding in an RU or MRU (Multi-Resource Unit) with more than 996 tones (subcarriers) of RU. It mainly includes:

[0334] (1) Pre-FEC PHY Padding.

[0335] (2) Scrambler: Scrambles data bits. This operation reduces the probability of consecutive 0s and 1s in the data sequence.

[0336] (3) Low Density Parity Check Code Encoder (LDPCEncoder): Encodes the data. It should be understood that LDPC encoding here is only an exemplary illustration, and the specific encoding method is not limited in the embodiments of this disclosure.

[0337] (4) Post-FEC Padding.

[0338] (5) Stream Parser: Divides the bits output by the low-density parity-check encoder into a multi-stream bit sequence. Specifically, the stream parser divides the bits output by the low-density parity-check encoder into a multi-stream bit sequence based on a first data relationship or a second data relationship. i The i-th bit is mapped to the spatial stream i SS Output bit sequence The j-th position; the first data relationship is as follows:

[0339] The first data relationship is as follows:

[0340] i = first parameter + second parameter + third parameter + fourth parameter

[0341] Wherein, the first parameter represents the total number of bits mapped in the complete mapping round before mapping to the j-th bit;

[0342] The second parameter represents the spatial flow i within the current first mapping round or the current second mapping round. SS The total number of bits mapped by the previous spatial stream;

[0343] The third parameter represents j divided by the number of times it is mapped to stream i. SS The remainder of the number of bits;

[0344] The fourth parameter represents the total number of bits mapped in the second mapping round before mapping to the j-th bit in the current complete mapping round.

[0345] Furthermore, the first data relationship includes:

[0346] Wherein, s(i SS ) represents each mapping to the spatial flow i within each complete mapping round. SS The number of bits;

[0347] N ss Indicates the number of spatial flows;

[0348] This indicates that s(k) is rounded up;

[0349] Indicates to Round down;

[0350] mod represents the modulo operation.

[0351] i = fifth parameter + sixth parameter + seventh parameter + eighth parameter

[0352] Among them, the fifth, sixth, seventh, and eighth parameters are respectively related to i SS Related to j; specifically,

[0353] The fifth parameter represents the total number of bits mapped in the complete mapping rounds before mapping to the j-th bit;

[0354] The sixth parameter represents the total number of bits mapped in the second mapping round before mapping to the j-th bit in the current complete mapping round;

[0355] The seventh parameter represents the spatial flow i within the current first mapping cycle or the current second mapping cycle. SS The total number of bits mapped in the first mapping round;

[0356] The eighth parameter represents j divided by the number of times it is mapped to stream i. SS The remainder of the number of bits.

[0357] Furthermore, the second data relationship includes:

[0358] Wherein, s(i SS ) represents each mapping to the spatial flow i within each complete mapping round. SS The number of bits;

[0359] N ss Indicates the number of spatial flows;

[0360] Indicates to Round up;

[0361] This indicates that s(k) is rounded down;

[0362] mod represents the modulo operation.

[0363] (6) Segment Parser.

[0364] (7) Constellation Mapper: Maps bit sequences to constellation points.

[0365] (8) Carrier Mapper (LDPC Tone Mapper).

[0366] (9) Segment Deparser.

[0367] (10) Cyclic Shift Diversity Per SS.

[0368] (11) Spatial Frequency apper.

[0369] (12) Inverse Discrete Fourier Transform (IDFT): The inverse discrete Fourier transform is applied to the subcarrier block.

[0370] (13) Inserting guard interval and adding window (Guard In this embodiment of the disclosure, for the case where BPSK modulation is included in UEQM, a preset mapping method is adopted to map the input bit sequence of a single path to multiple spatial streams respectively, so as to improve the UEQM mode and at the same time be compatible with the case including BPSK modulation.

[0371] Interval Insertion And Windowing, GI and Window).

[0372] (14) Analog and Radio Frequency (Analog and RF).

[0373] As another implementation of this disclosure, the stream parsing method further includes the following step S:

[0374] Step S1: Map the input bit sequence of a single path to multiple spatial streams; wherein each complete mapping round includes a first mapping round and a second mapping round.

[0375] In each complete mapping round, in either the first mapping round or the second mapping round, the input bit sequence is mapped to a first spatial stream modulated with BPSK.

[0376] Among them, at least two of the spatial streams have different modulation schemes for their corresponding MCS modes, and the modulation schemes include BPSK modulation.

[0377] Step S1 includes:

[0378] Step S11: Each time, the number of bits mapped for the first spatial stream is 1.

[0379] Step S1 includes:

[0380] Step S12, in the first mapping round, mapping the input bit sequence to a first spatial stream modulated by BPSK includes:

[0381] According to the first data relationship, the input bit sequence {e i The i-th bit is mapped to the spatial stream i SS Output bit sequence The j-th position; the first data relationship is as follows:

[0382] Wherein, s(i SS ) represents each mapping to the spatial flow i within each complete mapping round. SS The number of bits;

[0383] N ss Indicates the number of spatial flows;

[0384] This indicates that s(k) is rounded up;

[0385] Indicates to Round down;

[0386] mod represents the modulo operation.

[0387] The method further includes:

[0388] Step S2: After the mapping rounds reach the basic number of cycles for each OFDM symbol, if there are unmapped remaining bits, map the remaining bits to the spatial stream in order from high to low order according to the modulation scheme of the spatial stream.

[0389] Wherein, the basic loop count

[0390] N CBPS Indicates the total number of bits parsed in this stream;

[0391] This indicates the total number of bits mapped in each mapping round.

[0392] Step S2 includes:

[0393] Step S21: If the last m bits of the remaining bits are less than the number of bits carried by the second spatial stream in the spatial stream to be mapped, then the m bits are padded with zeros or additional bits are placed and mapped to the second spatial stream.

[0394] or

[0395] Step S22: If the value of m is 1, then map the m bits to the first spatial stream modulated by the BPSK.

[0396] Step S22 includes:

[0397] Step S221: If the number of spatial streams is 2 and the modulation method of the second spatial stream is QPSK or 16QAM, then the m bits are mapped to the first spatial stream using the BPSK modulation, and the second spatial stream is padded with zeros or additional bits are placed.

[0398] Step S222: If the number of spatial streams is 3 or 4, then the m bits are mapped to the first spatial stream using the BPSK modulation, and the other spatial streams are padded with zeros or additional bits are placed.

[0399] As another implementation of this disclosure, the stream parsing method further includes the following step P:

[0400] Step P1: Map the input bit sequence of a single path to multiple spatial streams; wherein each complete mapping round includes a first mapping round and a second mapping round.

[0401] In each complete mapping round, in one of the first or second mapping rounds, the input bit sequence is mapped to a first spatial stream modulated with BPPK.

[0402] Among them, at least two of the spatial streams have different modulation schemes for their corresponding MCP modes, and the modulation schemes include BPPK modulation.

[0403] Step P1 includes:

[0404] Step P11: Each time, the number of bits mapped for the first spatial stream is 1.

[0405] Step P1 includes:

[0406] Step P12, according to the second data relationship, the input bit sequence {e i The i-th bit is mapped to the spatial stream i SS Output bit sequence The j-th position; the second data relationship is as follows:

[0407] Wherein, s(i SS ) represents each mapping to the spatial flow i within each complete mapping round. SS The number of bits;

[0408] N ss Indicates the number of spatial flows;

[0409] Indicates to Round up;

[0410] This indicates that s(k) is rounded down;

[0411] mod represents the modulo operation.

[0412] The method further includes:

[0413] Step P2: After the mapping rounds reach the basic number of cycles for each OFDM symbol, if there are unmapped remaining bits, map the remaining bits to the spatial stream in order from high to low order according to the modulation scheme of the spatial stream.

[0414] Wherein, the basic loop count

[0415] N CBPS Indicates the total number of bits parsed in this stream;

[0416] This indicates the total number of bits mapped in each mapping round.

[0417] Step P2 includes:

[0418] Step P21: If the last m bits of the remaining bits are less than the number of bits carried by the second spatial stream in the spatial stream to be mapped, then the m bits are padded with zeros or additional bits are placed and mapped to the second spatial stream.

[0419] or

[0420] Step P22: If the value of m is 1, then map the m bits to the first spatial stream modulated by the BPPK.

[0421] Step P22 includes:

[0422] Step P221: If the number of spatial streams is 2 and the modulation scheme of the second spatial stream is QPPK or 16QAM, then map the m bits to the first spatial stream using the BPPK modulation, and fill or pad the second spatial stream with zeros, or place additional bits.

[0423] Step P222: If the number of spatial streams is 3 or 4, then the m bits are mapped to the first spatial stream modulated by the BPPK, and the other spatial streams are padded with zeros or additional bits are placed.

[0424] In this embodiment of the disclosure, for cases where BPSK modulation is included in UEQM, in each complete mapping round, in one of the first or second mapping rounds, the input bit sequence is mapped to a first spatial stream using BPSK modulation to complete the UEQM mode while being compatible with cases including BPSK modulation.

[0425] In some embodiments, the names of information, etc., are not limited to the names described in the embodiments. Terms such as "information", "message", "signal", "signaling", "report", "configuration", "indication", "instruction", "command", "channel", "parameter", "domain", "field", "symbol", "bit", "data", "program", and "chip" can be used interchangeably.

[0426] In some embodiments, terms such as “moment,” “point in time,” “time,” and “time location” can be used interchangeably, as can terms such as “duration,” “segment,” “time window,” “window,” and “time.”

[0427] In some embodiments, terms such as wireless access scheme and waveform can be used interchangeably.

[0428] In some embodiments, terms such as "certain," "preset," "default," "set," "indicated," "a certain," "any," and "first" can be used interchangeably. "Certain A," "preset A," "default A," "set A," "indicated A," "a certain A," "any A," and "first A" can be interpreted as A pre-defined in a protocol or the like, or as A obtained through setting, configuration, or instruction, or as specific A, a certain A, any A, or first A, but are not limited thereto.

[0429] In some embodiments, the determination or judgment can be made by a value represented by 1 bit (0 or 1), or by a true or false value (boolean), or by a comparison of numerical values ​​(e.g., a comparison with a predetermined value), but is not limited thereto.

[0430] In some embodiments, "not expecting to receive" can be interpreted as not receiving on time domain resources and / or frequency domain resources, or as not performing subsequent processing on the data after receiving it; "not expecting to send" can be interpreted as not sending, or as sending but not expecting the receiver to respond to the sent content.

[0431] The stream parsing method disclosed herein may include the foregoing steps and at least one of the embodiments. For example, step 201 may be implemented as a standalone embodiment, step 301 may be implemented as a standalone embodiment, step 501 may be implemented as a standalone embodiment, step 601 may be implemented as a standalone embodiment, step 602 may be implemented as a standalone embodiment, step 701 may be implemented as a standalone embodiment, and step 801 may be implemented as a standalone embodiment; the combination of step 601 and step 602 may be implemented as a standalone embodiment, but is not limited thereto.

[0432] In some embodiments, other alternative implementations described before or after the specification corresponding to Figures 2 to 10 may be referred to.

[0433] Figure 11 is a fifth schematic flowchart of a stream parsing method according to an embodiment of the present disclosure.

[0434] As shown in Figure 11, the above method can be applied to stream parsers, and the method includes:

[0435] Step 1001: Map the input bit sequence of a single path to multiple spatial streams; wherein each complete mapping round includes a first mapping round and a second mapping round.

[0436] In each complete mapping round, in either the first mapping round or the second mapping round, the input bit sequence is mapped to a first spatial stream modulated with BPSK.

[0437] Among them, at least two of the spatial streams have different modulation schemes for their corresponding MCS modes, and the modulation schemes include BPSK modulation.

[0438] Optionally, in this embodiment of the disclosure, mapping the input bit sequence to a first spatial stream modulated by BPSK includes:

[0439] Each time, the number of bits mapped to the first spatial stream is 1.

[0440] Optionally, in this embodiment of the disclosure, mapping the input bit sequence to a first spatial stream modulated by BPSK in the first mapping round includes:

[0441] According to the first data relationship, the input bit sequence {e i The i-th bit is mapped to the spatial stream i SS Output bit sequence The j-th position; the first data relationship is as follows:

[0442] i = first parameter + second parameter + third parameter + fourth parameter

[0443] Wherein, the first parameter represents the total number of bits mapped in the complete mapping round before mapping to the j-th bit;

[0444] The second parameter represents the spatial flow i within the current first mapping round or the current second mapping round. SS The total number of bits mapped by the previous spatial stream;

[0445] The third parameter represents j divided by the number of times it is mapped to stream i. SS The remainder of the number of bits;

[0446] The fourth parameter represents the total number of bits mapped in the second mapping round before mapping to the j-th bit in the current complete mapping round.

[0447] Optionally, in this embodiment of the disclosure, the first data relationship includes:

[0448] Wherein, s(i SS ) represents each mapping to the spatial flow i within each complete mapping round. SS The number of bits;

[0449] N ssIndicates the number of spatial flows;

[0450] This indicates that s(k) is rounded up;

[0451] Indicates to Round down;

[0452] mod represents the modulo operation.

[0453] Optionally, in this embodiment of the disclosure, mapping the input bit sequence to a first spatial stream modulated with BPSK in the second mapping round includes:

[0454] According to the second data relationship, the input bit sequence {e i The i-th bit is mapped to the spatial stream i SS Output bit sequence The j-th position; the second data relationship is as follows:

[0455] i = fifth parameter + sixth parameter + seventh parameter + eighth parameter

[0456] The fifth parameter represents the total number of bits mapped in the complete mapping rounds before mapping to the j-th bit;

[0457] The sixth parameter represents the total number of bits mapped in the second mapping round before mapping to the j-th bit in the current complete mapping round;

[0458] The seventh parameter represents the spatial flow i within the current first mapping cycle or the current second mapping cycle. SS The total number of bits mapped in the first mapping round;

[0459] The eighth parameter represents j divided by the number of times it is mapped to stream i. SS The remainder of the number of bits.

[0460] Optionally, in this embodiment of the disclosure, the second data relationship includes:

[0461] Wherein, s(i SS ) represents each mapping to the spatial flow i within each complete mapping round. SS The number of bits;

[0462] N ss Indicates the number of spatial flows;

[0463] Indicates to Round up;

[0464] This indicates that s(k) is rounded down;

[0465] mod represents the modulo operation.

[0466] Optionally, in this embodiment of the disclosure, the method further includes:

[0467] If there are unmapped bits remaining after the mapping rounds have reached the basic number of cycles for each OFDM symbol, the remaining bits are mapped to the spatial stream in descending order of the modulation scheme of the spatial stream.

[0468] Wherein, the basic loop count

[0469] N CBPS Indicates the total number of bits parsed in this stream;

[0470] This indicates the total number of bits mapped in each mapping round.

[0471] Optionally, in this embodiment of the disclosure, the step of sequentially mapping the remaining bits into the spatial stream includes:

[0472] If the last m bits of the remaining bits are less than the number of bits carried by the second spatial stream in the spatial stream to be mapped, then the m bits are padded with zeros or additional bits are placed and mapped to the second spatial stream.

[0473] or

[0474] If the value of m is 1, then the m bits are mapped to the first spatial stream modulated by the BPSK.

[0475] Optionally, in this embodiment of the disclosure, mapping the m bits to a first spatial stream modulated by the BPSK includes:

[0476] If the number of spatial streams is 2, and the modulation scheme of the second spatial stream is QPSK or 16QAM, then the m bits are mapped to the first spatial stream using the BPSK modulation, and the second spatial stream is padded with zeros or additional bits are placed.

[0477] If the number of spatial streams is 3 or 4, then the m bits are mapped to the first spatial stream modulated by the BPSK, and the other spatial streams are padded with zeros or additional bits are placed.

[0478] The stream parsing method disclosed herein may include the foregoing steps and at least one of the steps described in the embodiments. In some embodiments, other optional implementations may be described before or after the specification corresponding to FIG11.

[0479] Figure 12 is a sixth schematic flowchart of a stream parsing method according to an embodiment of the present disclosure.

[0480] As shown in Figure 12, the above method can be applied to stream parsers, and the method includes:

[0481] Step 1201: According to a preset mapping method, the input bit sequence of a single path is mapped to multiple spatial streams respectively; wherein, at least two of the spatial streams have different modulation methods for the MCS mode, and the modulation method includes BPSK modulation.

[0482] Step 1201: After the mapping rounds reach the basic number of cycles for each OFDM symbol, if there are unmapped remaining bits, the remaining bits are mapped to the spatial stream in order from high to low order according to the modulation scheme of the spatial stream.

[0483] In some embodiments, the base number of loops

[0484] N CBPS Indicates the total number of bits parsed in this stream;

[0485] This indicates the total number of bits mapped in each mapping round.

[0486] In some embodiments, the step of sequentially mapping the remaining bits into the spatial stream includes:

[0487] If the last m bits of the remaining bits are less than the number of bits carried by the second spatial stream in the spatial stream to be mapped, then the m bits are padded with zeros or additional bits are placed and mapped to the second spatial stream.

[0488] or

[0489] If the value of m is 1, then the m bits are mapped to the first spatial stream modulated by the BPSK.

[0490] In some embodiments, mapping the m bits to a first spatial stream modulated by the BPSK includes:

[0491] If the number of spatial streams is 2, and the modulation scheme of the second spatial stream is QPSK or 16QAM, then the m bits are mapped to the first spatial stream using the BPSK modulation, and the second spatial stream is padded with zeros or additional bits are placed.

[0492] If the number of spatial streams is 3 or 4, then the m bits are mapped to the first spatial stream modulated by the BPSK, and the other spatial streams are padded with zeros or additional bits are placed.

[0493] Figure 13 is a second schematic flowchart of a signal processing method according to an embodiment of the present disclosure.

[0494] As shown in Figure 13, the above method can be applied to signal processing systems, and the method includes:

[0495] Step 1301: Perform physical layer padding before frame check sequence, scrambling, low-density parity check encoding, and physical layer padding after frame check sequence on the data stream in sequence, and perform stream parsing to map them to multiple spatial streams respectively.

[0496] For each spatial stream, constellation point mapping, LDPC subcarrier mapping, cyclic shift diversity, space-frequency mapping, inverse discrete Fourier transform, insertion of guard interval and windowing, as well as analog and radio frequency processing are performed sequentially.

[0497] The process of performing stream parsing and mapping to multiple spatial streams includes:

[0498] The input bit sequence of a single path is mapped to multiple spatial streams; each complete mapping round includes a first mapping round and a second mapping round.

[0499] In each complete mapping round, in either the first mapping round or the second mapping round, the input bit sequence is mapped to a first spatial stream modulated with BPSK.

[0500] Among them, at least two of the spatial streams have different modulation schemes for their corresponding MCS modes, and the modulation schemes include BPSK modulation.

[0501] The stream parsing method disclosed herein may include the foregoing steps and at least one of the steps described in the embodiments. In some embodiments, other optional implementations may be described before or after the specification corresponding to FIG13.

[0502] In some embodiments, the steps and their optional implementations in other embodiments described before or after this embodiment, as well as other related parts in the specification, can be referred to, and will not be repeated here.

[0503] This disclosure also proposes an apparatus (also referred to as a communication device, etc.) for implementing any of the above methods. For example, an apparatus is proposed that includes units or modules for implementing the steps performed by the terminal in any of the above methods. Furthermore, another apparatus is proposed that includes units or modules for implementing the steps performed by a network device (e.g., an access network device, a core network functional node, a core network device, etc.) in any of the above methods.

[0504] It should be understood that the division of units or modules in the above device is only a logical functional division. In actual implementation, they can be fully or partially integrated into a single physical entity, or they can be physically separated. Furthermore, the units or modules in the device can be implemented by a processor calling software: for example, the device includes a processor connected to a memory containing instructions. The processor calls the instructions stored in the memory to implement any of the above methods or to implement the functions of the units or modules in the above device. The processor can be, for example, a general-purpose processor, such as a Central Processing Unit (CPU) or a microprocessor, and the memory can be internal or external to the device. Alternatively, the units or modules in the device can be implemented in the form of hardware circuits. The functionality of some or all of the units or modules can be achieved through the design of these hardware circuits, which can be understood as one or more processors. For example, in one implementation, the hardware circuit is an application-specific integrated circuit (ASIC). The functionality of some or all of the units or modules is achieved through the design of the logical relationships between the components within the circuit. In another implementation, the hardware circuit can be implemented using a programmable logic device (PLD). Taking a field-programmable gate array (FPGA) as an example, it can include a large number of logic gates. The connection relationships between the logic gates are configured through configuration files, thereby achieving the functionality of some or all of the units or modules. All units or modules of the above device can be implemented entirely through processor-called software, entirely through hardware circuits, or partially through processor-called software with the remaining parts implemented through hardware circuits.

[0505] In this embodiment, the processor is a circuit with signal processing capabilities. In one implementation, the processor can be a circuit with instruction read and execute capabilities, such as a Central Processing Unit (CPU), a microprocessor, a graphics processing unit (GPU) (which can be understood as a microprocessor), or a digital signal processor (DSP). In another implementation, the processor can implement certain functions through the logical relationships of hardware circuits. The logical relationships of the aforementioned hardware circuits are fixed or reconfigurable. For example, the processor is a hardware circuit implemented using an application-specific integrated circuit (ASIC) or a programmable logic device (PLD), such as an FPGA. In a reconfigurable hardware circuit, the process of the processor loading a configuration document and configuring the hardware circuit can be understood as the process of the processor loading instructions to implement the functions of some or all of the above units or modules. Furthermore, it can also be a hardware circuit designed for artificial intelligence, which can be understood as an ASIC, such as a Neural Network Processing Unit (NPU), a Tensor Processing Unit (TPU), or a Deep Learning Processing Unit (DPU).

[0506] Figure 14 is a schematic diagram of the structure of a stream parser proposed in an embodiment of this disclosure. The stream parser is used to perform any of the above methods. In some embodiments, as shown in Figure 14, the stream parser 1400 may include a mapping module 1401.

[0507] In some embodiments, the mapping module 1401 is used to map the input bit sequence of a single path to multiple spatial streams according to a preset mapping method.

[0508] Among them, at least two of the spatial streams have different modulation schemes for their corresponding MCS modes, and the modulation schemes include BPSK modulation.

[0509] Optionally, the mapping module 1401 is used to execute at least one of the communication steps (e.g., steps 201, 301, 501, 601, 701, 801, 1201, but not limited thereto) executed by the stream parser in any of the above methods, which will not be described in detail here.

[0510] In some embodiments, the mapping module can be interchanged with the processing module or the processor.

[0511] Figure 15 is a schematic diagram of the structure of a communication device according to an embodiment of this disclosure. The communication device can be an AP or a STA. The communication device is used to perform any of the above methods. In some embodiments, as shown in Figure 15, the communication device 1500 may include a stream parsing module 1501.

[0512] In some embodiments, the stream parsing module 1501 is used to map the input bit sequence of a single path to multiple spatial streams according to a preset mapping method.

[0513] Among them, at least two of the spatial streams have different modulation schemes for their corresponding MCS modes, and the modulation schemes include BPSK modulation.

[0514] Optionally, the above-mentioned stream parsing module 1501 is used to execute at least one of the communication steps executed by the stream parser in any of the above methods (e.g., steps 201, 301, 501, 601, 701, 801, 1101, 1201, but not limited thereto), which will not be elaborated here.

[0515] In some embodiments, the stream parsing module can be interchanged with the processing module or the processor.

[0516] Figure 16 is a schematic diagram of the structure of the communication device 1600 proposed in an embodiment of this disclosure. The communication device 1600 can be a network device (e.g., access network device, core network device, etc.), a terminal (e.g., user equipment, etc.), a chip, chip system, or processor that supports the network device in implementing any of the above methods, or a chip, chip system, or processor that supports the terminal in implementing any of the above methods. The communication device 1600 can be used to implement the methods described in the above method embodiments; for details, please refer to the descriptions in the above method embodiments.

[0517] As shown in Figure 16, the communication device 1600 is used to execute any of the above methods. In some embodiments, the communication device 1600 includes one or more processors 1601. The processor 1601 may be a general-purpose processor or a special-purpose processor, such as a baseband processor or a central processing unit. The baseband processor may be used to process communication protocols and communication data, and the central processing unit may be used to control communication devices (e.g., base stations, baseband chips, terminal devices, terminal device chips, DUs or CUs, etc.), execute programs, and process program data. Optionally, the communication device 1600 is used to execute any of the above methods. Optionally, one or more processors 1601 are used to invoke instructions to cause the communication device 1600 to execute any of the above methods.

[0518] In some embodiments, the communication device 1600 further includes one or more transceivers 1602. When the communication device 1600 includes one or more transceivers 1602, the transceivers 1602 perform communication steps such as sending and / or receiving in the above method, and the processor 1601 performs at least one of other steps (e.g., steps 201, 301, 501, 601, 602, 701, 801, 1101, 1201, 1301, but not limited thereto). In optional embodiments, the transceiver may include a receiver and / or a transmitter, which may be separate or integrated. Optionally, the terms transceiver, transceiver unit, transceiver, transceiver circuit, interface circuit, interface, etc., can be used interchangeably; the terms transmitter, transmitting unit, transmitter, transmitting circuit, etc., can be used interchangeably; the terms receiver, receiving unit, receiver, receiving circuit, etc., can be used interchangeably.

[0519] In some embodiments, the communication device 1600 further includes one or more memories 1603 for storing data and / or instructions. Optionally, one or more processors 1601 are used to invoke instructions stored in the memory 1603 to cause the communication device 1600 to perform any of the above methods. Optionally, all or part of the memory 1603 may also be located outside the communication device 1600. In an optional embodiment, the communication device 1600 may include one or more interface circuits 1604. Optionally, the interface circuit 1604 is connected to the memory 1602 and can be used to receive data and / or instructions from the memory 1602 or other devices, and can be used to send data and / or instructions to the memory 1602 or other devices. For example, the interface circuit 1604 can read data and / or instructions stored in the memory 1602 and send the data and / or instructions to the processor 1601.

[0520] The communication device 1600 described in the above embodiments may be a network device or a terminal, but the scope of the communication device 1600 described in this disclosure is not limited thereto, and the structure of the communication device 1600 may not be limited by FIG16. The communication device may be a standalone device or may be part of a larger device. For example, the communication device may be: (1) a standalone integrated circuit IC, or chip, or chip system or subsystem; (2) a collection of one or more ICs, optionally, the IC collection may also include storage components for storing data, programs and / or instructions; (3) an ASIC, such as a modem; (4) a module that can be embedded in other devices; (5) a receiver, terminal device, smart terminal device, cellular phone, wireless device, handheld device, mobile unit, vehicle device, network device, cloud device, artificial intelligence device, etc.; (6) others, etc.

[0521] Figure 17 is a schematic diagram of the structure of chip 1700 according to an embodiment of this disclosure. For cases where the communication device 1600 can be a chip or a chip system, please refer to the schematic diagram of chip 1700 shown in Figure 17, but it is not limited thereto.

[0522] Chip 1700 includes one or more processors 1701. Chip 1700 is used to perform any of the methods described above.

[0523] In some embodiments, chip 1700 further includes one or more interface circuits 1702. Optionally, terms such as interface circuit, interface, and transceiver pin can be used interchangeably. In some embodiments, chip 1700 further includes one or more memories 1703 for storing data and / or instructions. Optionally, all or part of the memories 1703 may be located outside of chip 1700. Optionally, interface circuit 1702 is connected to memory 1703, and interface circuit 1702 can be used to receive data and / or instructions from memory 1703 or other devices, and interface circuit 1702 can be used to send data and / or instructions to memory 1703 or other devices. For example, interface circuit 1702 can read data and / or instructions stored in memory 1703 and send the data and / or instructions to processor 1701.

[0524] In some embodiments, the interface circuit 1702 performs communication steps such as sending and / or receiving in the above-described method. For example, the interface circuit 1702 performing communication steps such as sending and / or receiving in the above-described method means that the interface circuit 1702 performs data and / or instruction interaction between the processor 1701, the chip 1700, the memory 1703, or the transceiver device. In some embodiments, the processor 1701 performs at least one of other steps (e.g., steps 201, 301, 501, 601, 602, 701, 801, 1101, 1201, 1301, but not limited thereto).

[0525] The modules and / or devices described in the various embodiments, such as virtual devices, physical devices, and chips, can be combined or separated arbitrarily as needed. Optionally, some or all steps can also be performed collaboratively by multiple modules and / or devices, which is not limited here.

[0526] This disclosure also proposes a storage medium storing instructions that, when executed on a communication device, cause the communication device to perform any of the above methods. Optionally, the storage medium is an electronic storage medium. Optionally, the storage medium is a computer-readable storage medium, but not limited thereto; it may also be a storage medium readable by other devices. Optionally, the storage medium may be a non-transitory storage medium, but not limited thereto; it may also be a temporary storage medium.

[0527] This disclosure also proposes a program product, including a program and / or instructions, which, when executed by a communication device, cause the communication device to perform any of the above methods. Optionally, the program product is a computer program product. Optionally, the program product is stored on the storage medium.

[0528] This disclosure also proposes a computer program that, when run on a computer, causes the computer to perform any of the above methods.

Claims

A flow parsing method characterized by, include: The input bit sequence of a single path is mapped to multiple spatial streams; each complete mapping round includes a first mapping round and a second mapping round. In each of the complete mapping rounds, in one of the first or second mapping rounds, the input bit sequence is mapped to a first spatial stream modulated by binary phase shift keying (BPSK). Among them, at least two of the spatial streams have different modulation schemes according to the modulation and coding strategy (MCS) method, and the modulation schemes include BPSK modulation. The flow parsing method according to claim 1, characterized in that, The step of mapping the input bit sequence to a first spatial stream modulated by BPSK includes: Each time, the number of bits mapped to the first spatial stream is 1. The flow parsing method according to claim 1 or 2, characterized in that, In the first mapping round, mapping the input bit sequence to a first spatial stream modulated by BPSK includes: According to the first data relationship, the input bit sequence {e i The i-th bit is mapped to the spatial stream i SS Output bit sequence The j-th position; the first data relationship is as follows: i = first parameter + second parameter + third parameter + fourth parameter Wherein, the first parameter represents the total number of bits mapped in the complete mapping round before mapping to the j-th bit; The second parameter represents the number of total bits mapped by the previous spatial stream within the current first mapping round or the current second mapping round. SS total number of bits mapped by the previous spatial stream The third parameter represents the remainder of j divided by the number of bits mapped to stream i each time SS ; The fourth parameter represents the total number of bits mapped in the second mapping round before mapping to the j-th bit in the current complete mapping round. The stream parsing method according to claim 3 is characterized in that, The first data relationship includes: wherein s(i SS ) represents the number of bits mapped to the spatial stream i SS in each of the complete mapping passes. N ss denotes the number of spatial streams; This indicates that s(k) is rounded up; indicates that the Round down; mod represents the modulo operation. The stream parsing method according to claim 1 or 2 is characterized in that, In the second mapping round, mapping the input bit sequence to a first spatial stream modulated by BPSK includes: According to the second data relationship, the input bit sequence {e i The i-th bit is mapped to the spatial stream i SS Output bit sequence The j-th position; the second data relationship is as follows: i = fifth parameter + sixth parameter + seventh parameter + eighth parameter Wherein, the fifth parameter represents the total number of bits mapped in the complete mapping rounds before mapping to the j-th bit; The sixth parameter represents the total number of bits mapped in the second mapping round before mapping to the j-th bit in the current complete mapping round; The seventh parameter represents the number of total bits mapped in the current first mapping round or the current second mapping round for the spatial stream i SS the number of total bits mapped in the previous first mapping round The eighth parameter represents the remainder of j divided by the number of bits mapped to stream i each time. SS The eighth parameter represents the remainder of j divided by the number of bits mapped to stream i each time. The flow parsing method according to claim 3, characterized in that, The second data relationship includes: wherein s(i SS ) represents the number of bits mapped to the spatial stream i SS in each of the complete mapping passes. N ss denotes the number of spatial streams; Indicates to Round up; This indicates that s(k) is rounded down; mod represents the modulo operation. The stream parsing method according to any one of claims 1 to 6 is characterized in that, The method further includes: After the mapping rounds reach the basic number of cycles for each OFDM symbol, if there are unmapped remaining bits, the remaining bits are mapped to the spatial stream in descending order of the modulation scheme of the spatial stream. wherein the base number of cycles N CBPS represents the total number of bits parsed this time; This indicates the total number of bits mapped in each mapping round. The stream parsing method according to claim 7, characterized in that, The step of sequentially mapping the remaining bits into the spatial stream includes: If the last m bits of the remaining bits are less than the number of bits carried by the second spatial stream in the spatial stream to be mapped, then the m bits are padded with zeros or additional bits are placed and mapped to the second spatial stream. or If the value of m is 1, then the m bits are mapped to the first spatial stream modulated by the BPSK. The stream parsing method according to claim 8 is characterized in that, The step of mapping the m bits to a first spatial stream modulated by the BPSK includes: If the number of spatial streams is 2, and the modulation method of the second spatial stream is quadrature phase shift keying (QPSK) or 16 quadrature amplitude modulation (QAM), then the m bits are mapped to the first spatial stream modulated by the BPSK, and the second spatial stream is filled or padded with zeros, or additional bits are placed. If the number of spatial streams is 3 or 4, then the m bits are mapped to the first spatial stream modulated by the BPSK, and the other spatial streams are padded with zeros or additional bits are placed. The stream parsing method according to claim 8 is characterized in that, include: After the mapping rounds reach the basic number of cycles for each OFDM symbol, if there are unmapped remaining bits, the remaining bits are mapped to the spatial stream in descending order of the modulation scheme of the spatial stream. The stream parsing method according to claim 8, characterized in that The stream parsing is mapped to multiple spatial streams, including: The data stream is sequentially padded with physical layer before frame check sequence, scrambling, low-density parity check encoding, and padded with physical layer before frame check sequence, and then parsed into multiple spatial streams. For each spatial stream, constellation point mapping, LDPC subcarrier mapping, cyclic shift diversity, space-frequency mapping, inverse discrete Fourier transform, insertion of guard interval and windowing, as well as analog and radio frequency processing are performed sequentially. A communication device characterized by The communication device is used to execute the stream parsing method according to any one of claims 1 to 11. A storage medium storing instructions, the storage medium storing instructions, characterized in that, When the instruction is executed on the communication device, the communication device performs the stream parsing method as described in any one of claims 1 to 11. A program product comprising at least one of a program and instructions, characterized in that: When at least one of the programs or instructions is executed by a communication device, the signal processing method according to claims 1 to 11 is implemented.

Images