Patent Description:
The present disclosure is generally related to wireless communications and, more particularly, to leftover bits processing for proportional round-robin resource unit (RU) parsing in extreme high-throughput (EHT) systems.

In next-generation EHT systems such as wireless local area network (WLAN) systems in accordance with the upcoming Institute of Electrical and Electronics Engineers (IEEE) <NUM>. 11be standard, it is permissible to assign an aggregated RU (herein interchangeably referred to as multi-RU) comprising multiple RUs to a single station (STA) to improve spectral efficiency. However, after filling up bits for RU(s) of smaller size(s) (e.g., RU484, which denotes a RU of <NUM> tones) in certain RU aggregation scenarios, there may be some leftover bits for larger RU(s) (e.g., RU996, which denotes of a RU of <NUM> tones). There is, therefore, a need for a solution to handle leftover bits processing for such scenarios.

<CIT> discloses a method of parsing of bits to multiple RUs and parsing of remaining bits in case of unequal segment sizes. The <NPL>, discloses various combinations of multiple RU aggregation for a PPDU transmission in all of the bandwidths.

The following summary is illustrative only and is not intended to be limiting in any way. That is, the following summary is provided to introduce concepts, highlights, benefits and advantages of the novel and non-obvious techniques described herein. Select implementations are further described below in the detailed description. Thus, the following summary is not intended to identify essential features of the claimed subject matter, nor is it intended for use in determining the scope of the claimed subject matter.

An objective of the present disclosure is to provide schemes, concepts, designs, techniques, methods and apparatuses pertaining to leftover bits processing for proportional round-robin RU parsing in EHT systems. Methods according to the invention are defined in the independent claims. The dependent claims define preferred embodiments thereof.

In one aspect, a method may involve processing a stream of bits to provide processed bits. The method may also involve transmitting the processed bits to a STA over a combination of multiple RUs assigned to the STA. In processing the stream of bits, the method may involve parsing the stream of bits to the combination of multiple RUs. Moreover, in an event of leftover bits remaining from the parsing, the method may further involve distributing the leftover bits to one or more RUs but not all RUs of the combination of multiple RUs. The combination of multiple RUs comprises at least one smaller RU and at least two larger RUs with each of the at least two larger RUs having more tones than the at least one smaller RU. The distributing of the leftover bits to one or more RUs but not all RUs of the combination of multiple RUs comprises distributing the leftover bits to the at least two larger RUs. The distributing of the leftover bits to the at least two larger RUs comprises proportionally distributing the leftover bits over last predefined number of tones on each of the at least two larger RUs. The proportionally distributing of the leftover bits over last predefined number of tones on each of the at least two larger RUs comprises proportionally distributing the leftover bits over last <NUM> tones on each of the at least two larger RUs.

In another aspect, a method may involve processing a stream of bits to provide processed bits. The method may also involve transmitting the processed bits to a STA over a combination of multiple RUs assigned to the STA. The combination of multiple RUs may include at least one smaller RU and at least two larger RUs with each of the at least two larger RUs having more tones than the at least one smaller RU. In such cases, in processing the stream of bits, the method may involve parsing the stream of bits to the combination of multiple RUs in a proportional round-robin fashion. Moreover, in an event of leftover bits remaining from the parsing in the proportional round-robin fashion, the method may further involve distributing the leftover bits to the at least two larger RUs. The distributing of the leftover bits to the at least two larger RUs comprises evenly distributing the leftover bits over each of the larger RUs. The evenly distributing of the leftover bits over each of the at least two larger RUs comprises, for every N iterations of parsing the stream of bits to the combination of multiple RUs in the proportional round-robin fashion, distributing the leftover bits over each of the at least two larger RUs, and wherein N is an integer equal to or greater than <NUM>.

It is noteworthy that, although description provided herein may be in the context of certain radio access technologies, networks and network topologies such as, Wi-Fi, the proposed concepts, schemes and any variation(s)/derivative(s) thereof may be implemented in, for and by other types of radio access technologies, networks and network topologies such as, for example and without limitation, Bluetooth, ZigBee, <NUM>th Generation (<NUM>)/New Radio (NR), Long-Term Evolution (LTE), LTE-Advanced, LTE-Advanced Pro, Internet-of-Things (IoT), Industrial loT (lloT) and narrowband loT (NB-loT). Thus, the scope of the present disclosure is not limited to the examples described herein.

Implementations in accordance with the present disclosure relate to various techniques, methods, schemes and/or solutions pertaining to leftover bits processing for proportional round-robin RU parsing in EHT systems. According to the present disclosure, a number of possible solutions may be implemented separately or jointly. That is, although these possible solutions may be described below separately, two or more of these possible solutions may be implemented in one combination or another.

Referring to <FIG>, network environment <NUM> may involve at least a STA <NUM> communicating wirelessly with a STA <NUM>. Each of STA <NUM> and STA <NUM> may be a non-access point (non-AP) STA or, alternatively, either of STA <NUM> and STA <NUM> may function as an AP. In some cases, STA <NUM> and STA <NUM> may be associated with a basic service set (BSS) in accordance with one or more IEEE <NUM> standards (e.g., IEEE <NUM>. 11be and future-developed standards). Each of STA <NUM> and STA <NUM> may be configured to communicate with each other with leftover bits processing for proportional round-robin RU parsing in EHT systems in accordance with various proposed schemes described below.

<FIG> illustrates an example design <NUM> in accordance with the present disclosure. In general, a fundamental operation of multi-RU transmission may involve a number of operations described below with reference to <FIG>. For instance, data for one STA (e.g., STA <NUM> or STA <NUM>) to be transmitted over multiple RUs using one physical layer (PHY) service data unit (PSDU) may be provided by a medium access control layer (MAC) <NUM>. Information bits for the multiple RUs may be jointly encoded by a joint encoder <NUM> to provide an encoded bit sequence to a stream parser <NUM> which may perform stream parsing to split or otherwise parse an input stream of encoded bits into different spatial streams. Then, depending on bandwidth and/or RU assignments and interleaving/tone-mapping schemes, a bit-level RU and segment (RU/segment) parser <NUM> may be operated per stream at bit level to allocate, distribute or otherwise parse the encoded bits onto each RU of the multiple RUs to be modulated and tone-mapped/interleaved for transmission on the assigned RUs.

Under a proposed scheme in accordance with the present disclosure, with respect to proportional round-robin RU parsing, a parameter s = max{<NUM>, Nbpscs/<NUM>} (herein referred to as the "s-bits") may be defined, where Nbpscs denotes the number of coded bits per subcarrier per spatial stream. Thus, the value of s-bits may depend on the type of modulation used as Nbpscs varies depending on the type of modulation used (e.g., Nbpscs = <NUM> for quadrature phase shift keying (QPSK), Nbpscs = <NUM> for <NUM> quadrature amplitude modulation (QAM)). Accordingly, parsing of coded bits to multiple RUs may be performed in a proportional round-robin fashion, with the parser ratio depending on the size (or number of tones) of each RU in the RU aggregation. For instance, the parser ratio may be defined in the format of m<NUM>:m<NUM>:m<NUM>. (or <NUM>s:<NUM>s:<NUM>s. ), and each of m<NUM>, m<NUM> and m<NUM> may be in units of s-bits. The proportional round-robin parser may operate as follows: first the parser may parse m<NUM>-bits to a first RU (RU1), then parse m1 s-bits to a second RU (RU2),. and so on by alternatively distributing coded bits to each RU of multiple RUs. For some multi-RU combinations, in case there are remaining bits after alternatively allocating coded bits to each RU in the ratio of m<NUM>:m<NUM>:. (or <NUM>:<NUM>:. ), the remaining (leftover) bits may be assigned to each RU of relatively larger size(s). Moreover, the remaining/leftover bits may be further alternatively distributed to larger RU(s) (in case a number of larger RU(s) is equal to or greater than <NUM>) with m<NUM>:m<NUM>:m<NUM> (or <NUM>:<NUM>:<NUM>) ratio (in unit of s-bits, in case the larger RUs have equal size) to further improve system performance. Otherwise, the remaining/leftover bits may be sequentially or evenly distributed to each of the larger RU(s), as described below.

<FIG> illustrates an example scenario <NUM> in accordance with the present disclosure. In <FIG>, a set of example combinations of RUs and corresponding parameters are shown in a table. For instance, for each example combination of multiple RUs, one corresponding parameter may be a total number of tones or data subcarriers (Nsd). Another corresponding parameter may be a proportional ratio between the RUs in the combination expressed as Nsd,<NUM>:Nsd,<NUM>:Nsd,<NUM>:. which is approximated to be m0:m1:m2:. with mi being an integer in units of s-bits, <NUM> ≤ i ≤ number of RUs combined - <NUM>. Thus, in the present disclosure, each expression of ratio such as m<NUM>:. :mn may be interchangeably replaced with an alternative expression of <NUM>:. :ns, with n > <NUM>. A further corresponding parameter may be a number of leftover (or remaining) bits (per symbol), if any, after a stream of coded bits have been parsed to the combination of multiple RUs in a round-robin fashion.

Referring to <FIG>, for some of the combinations of RUs, there may be leftover bits after parsing in a round-robin fashion while, for some other combinations of RUs, there may be no leftover bits after parsing in a round-robin fashion. In each of those combinations of multiple RUs having leftover bits, there may be at least one smaller RU and at least one larger RU in terms of number of tones. For instance, among the listed examples of combinations of multiple RUs, the following combinations may have leftover bits after parsing in a round-robin fashion: a combination of a smaller RU of <NUM> tones (RU484) plus a larger RU of <NUM> tones (RU996), a combination of an aggregate RU (having one RU of <NUM> tones (RU242) and one RU of <NUM> tones (RU484)), as a smaller RU, and a larger RU of <NUM> tones (RU996), a combination of one smaller RU of <NUM> tones (RU484) plus two larger RUs of <NUM> tones (RU996), a combination of one smaller RU of <NUM> tones (RU484) plus three larger RUs of <NUM> tones (RU996), and a combination of one smaller RU of <NUM> tones (RU242) plus one larger RU of <NUM> tones (RU996).

Under a proposed scheme in accordance with the present disclosure, for a combination of multiple RUs having leftover bits after parsing in a round-robin fashion, the leftover bits may be distributed to the at least one larger RU of the combination of multiple RUs. For instance, under a first approach, the leftover bits may be proportionally distributed over last predefined number of tones (e.g., <NUM> tones) with the proportional ratio of m<NUM>:m<NUM>:. between the larger RUs (e.g., RU996's) of the combination of multiple RUs, as shown in <FIG>. Under a second approach, the leftover bits may be sequentially distributed over last predefined number of tones (e.g., <NUM> tones) on each of the larger RUs (e.g., RU996's) of the combination of multiple RUs, as shown in <FIG>. Under a third approach, the leftover bits may be evenly distributed over each of the larger RUs (e.g., RU996's) of the combination of multiple RUs, as shown in <FIG>.

<FIG> illustrates an example scenario <NUM> in accordance with the present invention. In scenario <NUM>, a stream of bits (e.g., coded bits of input data) may be parsed to a combination of multiple RUs having at least one smaller RU and at least one larger RU in a proportional round-robin fashion. Then, in an event of leftover bits remaining from the parsing in the proportional round-robin fashion, the leftover bits may be distributed to the at least one larger RU of the combination of multiple RUs. For instance, in the example shown in <FIG>, the combination of multiple RUs may include one smaller RU (e.g., RU484) and two larger RUs (e.g., a first RU996 and a second RU996), with a proportional ratio of m<NUM>:m<NUM>:m<NUM> being <NUM>:<NUM>:<NUM> or <NUM>:<NUM>:<NUM>. Thus, initially, the stream of bits may be parsed to the RU484, the first RU996 and the second RU996 of the combination of multiple RUs in a proportional round-robin fashion according to the proportional ratio of <NUM>:<NUM>:<NUM>. Afterwards, under a proposed scheme in accordance with the present disclosure, the remaining leftover bits may be distributed over the last <NUM> tones between the first RU996 and the second RU996.

<FIG> illustrates an example scenario <NUM> in accordance with the present disclosure. In scenario <NUM>, a stream of bits (e.g., coded bits of input data) may be parsed to a combination of multiple RUs having at least one smaller RU and at least one larger RU in a proportional round-robin fashion. Then, in an event of leftover bits remaining from the parsing in the proportional round-robin fashion, the leftover bits may be distributed to the at least one larger RU of the combination of multiple RUs. For instance, in the example shown in <FIG>, the combination of multiple RUs may include one smaller RU (e.g., RU484) and two larger RUs (e.g., a first RU996 and a second RU996), with a proportional ratio of m<NUM>:m<NUM>:m<NUM> being <NUM>:<NUM>:<NUM> or <NUM>:<NUM>:<NUM>. Thus, initially, the stream of bits may be parsed to the RU484, the first RU996 and the second RU996 of the combination of multiple RUs in a proportional round-robin fashion according to the proportional ratio of <NUM>:<NUM>:<NUM>. Afterwards, under a proposed scheme in accordance with the present disclosure, the remaining leftover bits may be distributed over the last <NUM> tones on each of the first RU996 and the second RU996.

<FIG> illustrates an example scenario <NUM> in accordance with the present invention. In scenario <NUM>, a stream of bits (e.g., coded bits of input data) may be parsed to a combination of multiple RUs having at least one smaller RU and at least one larger RU in a proportional round-robin fashion. Then, in an event of leftover bits remaining from the parsing in the proportional round-robin fashion, the leftover bits may be distributed to the at least one larger RU of the combination of multiple RUs. For instance, in the example shown in <FIG>, the combination of multiple RUs may include one smaller RU (e.g., RU484) and two larger RUs (e.g., a first RU996 and a second RU996), with a proportional ratio of m<NUM>:m<NUM>:m<NUM> being <NUM>:<NUM>:<NUM> or <NUM>:<NUM>:<NUM>. Thus, under a proposed scheme in accordance with the present disclosure, for every N iterations (N > <NUM>) of parsing the stream of bits to the RU484, the first RU996 and the second RU996 of the combination of multiple RUs in a proportional round-robin fashion according to the proportional ratio of <NUM>:<NUM>:<NUM>, one or more extra m<NUM> s-bits may be distributed to the first RU996 and one or more extra m<NUM> s-bits may be distributed to the second RU996.

<FIG> illustrates an example system <NUM> having at least an example apparatus <NUM> and an example apparatus <NUM> in accordance with an implementation of the present disclosure. Each of apparatus <NUM> and apparatus <NUM> may perform various functions to implement schemes, techniques, processes and methods described herein pertaining to leftover bits processing for proportional round-robin RU parsing in EHT systems, including the various schemes described above with respect to various proposed designs, concepts, schemes, systems and methods described above as well as processes described below. For instance, apparatus <NUM> may be implemented in STA <NUM> and apparatus <NUM> may be implemented in STA <NUM>, or vice versa.

Each of apparatus <NUM> and apparatus <NUM> may be a part of an electronic apparatus, which may be a STA or an AP, such as a portable or mobile apparatus, a wearable apparatus, a wireless communication apparatus or a computing apparatus. When implemented in a STA, each of apparatus <NUM> and apparatus <NUM> may be implemented in a smartphone, a smart watch, a personal digital assistant, a digital camera, or a computing equipment such as a tablet computer, a laptop computer or a notebook computer. Each of apparatus <NUM> and apparatus <NUM> may also be a part of a machine type apparatus, which may be an IoT apparatus such as an immobile or a stationary apparatus, a home apparatus, a wire communication apparatus or a computing apparatus. For instance, each of apparatus <NUM> and apparatus <NUM> may be implemented in a smart thermostat, a smart fridge, a smart door lock, a wireless speaker or a home control center. When implemented in or as a network apparatus, apparatus <NUM> and/or apparatus <NUM> may be implemented in a network node, such as an AP in a WLAN.

In some implementations, each of apparatus <NUM> and apparatus <NUM> may be implemented in the form of one or more integrated-circuit (IC) chips such as, for example and without limitation, one or more single-core processors, one or more multi-core processors, one or more reduced-instruction set computing (RISC) processors, or one or more complex-instruction-set-computing (CISC) processors. In the various schemes described above, each of apparatus <NUM> and apparatus <NUM> may be implemented in or as a STA or an AP. Each of apparatus <NUM> and apparatus <NUM> may include at least some of those components shown in <FIG> such as a processor <NUM> and a processor <NUM>, respectively, for example. Each of apparatus <NUM> and apparatus <NUM> may further include one or more other components not pertinent to the proposed scheme of the present disclosure (e.g., internal power supply, display device and/or user interface device), and, thus, such component(s) of apparatus <NUM> and apparatus <NUM> are neither shown in <FIG> nor described below in the interest of simplicity and brevity.

In one aspect, each of processor <NUM> and processor <NUM> may be implemented in the form of one or more single-core processors, one or more multi-core processors, one or more RISC processors or one or more CISC processors. That is, even though a singular term "a processor" is used herein to refer to processor <NUM> and processor <NUM>, each of processor <NUM> and processor <NUM> may include multiple processors in some implementations and a single processor in other implementations in accordance with the present disclosure. In another aspect, each of processor <NUM> and processor <NUM> may be implemented in the form of hardware (and, optionally, firmware) with electronic components including, for example and without limitation, one or more transistors, one or more diodes, one or more capacitors, one or more resistors, one or more inductors, one or more memristors and/or one or more varactors that are configured and arranged to achieve specific purposes in accordance with the present disclosure. In other words, in at least some implementations, each of processor <NUM> and processor <NUM> is a special-purpose machine specifically designed, arranged and configured to perform specific tasks including those pertaining to leftover bits processing for proportional round-robin RU parsing in EHT systems in accordance with various implementations of the present disclosure.

In some implementations, apparatus <NUM> may also include a transceiver <NUM> coupled to processor <NUM>. Transceiver <NUM> may include a transmitter capable of wirelessly transmitting and a receiver capable of wirelessly receiving data. In some implementations, apparatus <NUM> may also include a transceiver <NUM> coupled to processor <NUM>. Transceiver <NUM> may include a transmitter capable of wirelessly transmitting and a receiver capable of wirelessly receiving data. It is noteworthy that, although transceiver <NUM> and transceiver <NUM> are illustrated as being external to and separate from processor <NUM> and processor <NUM>, respectively, in some implementations, transceiver <NUM> may be an integral part of processor <NUM> as a system on chip (SoC) and/or transceiver <NUM> may be an integral part of processor <NUM> as a SoC.

Each of apparatus <NUM> and apparatus <NUM> may be a communication entity capable of communicating with each other using various proposed schemes in accordance with the present disclosure. For illustrative purposes and without limitation, a description of capabilities of apparatus <NUM>, as STA <NUM>, and apparatus <NUM>, as STA <NUM>, is provided below. It is noteworthy that, although a detailed description of capabilities, functionalities and/or technical features of apparatus <NUM> is provided below, the same may be applied to apparatus <NUM> although a detailed description thereof is not provided solely in the interest of brevity. It is also noteworthy that, although the example implementations described below are provided in the context of WLAN, the same may be implemented in other types of networks.

Under a proposed scheme pertaining to leftover bits processing for proportional round-robin RU parsing in EHT systems in accordance with the present disclosure, with apparatus <NUM> implemented in or as STA <NUM> and apparatus <NUM> implemented in or as STA <NUM> in network environment <NUM>, processor <NUM> of apparatus <NUM> may code data for a STA (e.g., STA <NUM>) to provide a stream of bits. Additionally, processor <NUM> may process the stream of bits to provide processed bits. For instance, processor <NUM> may parse the stream of bits to a combination of multiple RUs which are assigned to the STA and, in an event of leftover bits remaining from the parsing, processor <NUM> may distribute the leftover bits to one or more RUs but not all RUs of the combination of multiple RUs. Moreover, processor <NUM> may wirelessly transmit, via transceiver <NUM>, the processed bits to the STA over the combination of multiple RUs.

In some implementations, in parsing the stream of bits to the combination of multiple RUs, processor <NUM> may parse the stream of bits to the combination of multiple RUs in a proportional round-robin fashion.

In some implementations, the combination of multiple RUs may include at least one smaller RU and at least one larger RU with each of the at least one larger RU having more tones than the at least one smaller RU. In such cases, in distributing the leftover bits to one or more RUs but not all RUs of the combination of multiple RUs, processor <NUM> may distribute the leftover bits to the at least one larger RU.

In some implementations, in distributing the leftover bits to the at least one larger RU, processor <NUM> may proportionally distribute the leftover bits over last predefined number of tones on each of the at least one larger RU. For instance, processor <NUM> may proportionally distribute the leftover bits over last <NUM> tones on each of the at least one larger RU.

In some implementations, the combination of multiple RUs may include one smaller RU of <NUM> tones and one larger RU of <NUM> tones. In such cases, a proportional ratio of the multiple RUs may be <NUM>:<NUM> in units of s-bits and alternatively expressed as <NUM>:<NUM>, with the remaining leftover bits distributed to the large RU of <NUM> tones.

In some implementations, the combination of multiple RUs may include one smaller RU of <NUM> tones and two larger RUs of <NUM> tones. In such cases, a proportional ratio of the multiple RUs may be <NUM>:<NUM>:<NUM> in units of s-bits or alternatively expressed as <NUM>:<NUM>:<NUM>, with the remaining leftover bits distributed to the two large RUs of <NUM> tones with a proportional ratio of <NUM>:<NUM> in units of s-bits or alternatively expressed as <NUM>:<NUM>.

In some implementations, the combination of multiple RUs may include one smaller RU of <NUM> tones and three larger RUs of <NUM> tones. In such cases, a proportional ratio of the multiple RUs may be <NUM>:<NUM>:<NUM>:<NUM> in units of s-bits or alternatively expressed as <NUM>:<NUM>:<NUM>:<NUM>, with the remaining leftover bits distributed to the three large RUs of <NUM> tones with a proportional ratio of <NUM>:<NUM>:<NUM> in units of s-bits or alternatively expressed as <NUM>:<NUM>:<NUM>.

In some implementations, the combination of multiple RUs may include one aggregated RU and one larger RU of <NUM> tones with the aggregated RU comprising one smaller RU of <NUM> tones and one smaller RU of <NUM> tones. In such cases, a proportional ratio of the multiple RUs may be <NUM>:<NUM> in units of s-bits or alternatively expressed as <NUM>:<NUM>, with the remaining leftover bits distributed to the large RU of <NUM> tones.

In some implementations, the combination of multiple RUs may include one smaller RU of <NUM> tones and one larger RU of <NUM> tones. In such cases, a proportional ratio of the multiple RUs may be <NUM>:<NUM> in units of s-bits and alternatively expressed as <NUM>:<NUM>.

Under a proposed scheme pertaining to leftover bits processing for proportional round-robin RU parsing in EHT systems in accordance with the present disclosure, with apparatus <NUM> implemented in or as STA <NUM> and apparatus <NUM> implemented in or as STA <NUM> in network environment <NUM>, processor <NUM> of apparatus <NUM> may code data for a STA (e.g., STA <NUM>) to provide a stream of bits. Additionally, processor <NUM> may process the stream of bits to provide processed bits. For instance, processor <NUM> may parse, in a proportional round-robin fashion, the stream of bits to a combination of multiple RUs which are assigned to the STA and may include at least one smaller RU and at least one larger RU with each of the at least one larger RU having more tones than the at least one smaller RU. Moreover, in an event of leftover bits remaining from the parsing in the proportional round-robin fashion, processor <NUM> may distribute the leftover bits to one or more RUs but not all RUs of the combination of multiple RUs. Furthermore, processor <NUM> may wirelessly transmit, via transceiver <NUM>, the processed bits to the STA over the combination of multiple RUs.

In some implementations, in distributing the leftover bits to the at least one larger RU, processor <NUM> may proportionally distribute the leftover bits over last <NUM> tones on each of the at least one larger RU.

In some implementations, in distributing the leftover bits to the at least one larger RU, processor <NUM> may sequentially distribute the leftover bits over last <NUM> tones on each of the at least one larger RU.

In some implementations, in distributing the leftover bits to the at least one larger RU, processor <NUM> may evenly distribute the leftover bits over each of the at least one larger RU. For instance, in evenly distributing the leftover bits over each of the at least one larger RU, processor <NUM> may, for every N iterations of parsing the stream of bits to the combination of multiple RUs in the proportional round-robin fashion, distribute the leftover bits over each of the at least one larger RU, with N being an integer equal to or greater than <NUM>.

<FIG> illustrates an example process <NUM> in accordance with an implementation of the present disclosure. Process <NUM> may represent an aspect of implementing various proposed designs, concepts, schemes, systems and methods described above. More specifically, process <NUM> may represent an aspect of the proposed concepts and schemes pertaining to leftover bits processing for proportional round-robin RU parsing in EHT systems in accordance with the present disclosure. Process <NUM> may include one or more operations, actions, or functions as illustrated by one or more of blocks <NUM>, <NUM> and <NUM> as well as sub-blocks <NUM> and <NUM>. Although illustrated as discrete blocks, various blocks of process <NUM> may be divided into additional blocks, combined into fewer blocks, or eliminated, depending on the desired implementation. Moreover, the blocks/sub-blocks of process <NUM> may be executed in the order shown in <FIG> or, alternatively in a different order. Furthermore, one or more of the blocks/sub-blocks of process <NUM> may be executed repeatedly or iteratively. Process <NUM> may be implemented by or in apparatus <NUM> and apparatus <NUM> as well as any variations thereof. Solely for illustrative purposes and without limiting the scope, process <NUM> is described below in the context of apparatus <NUM> implemented in or as STA <NUM> and apparatus <NUM> implemented in or as STA <NUM> of a wireless network such as a WLAN in network environment <NUM> in accordance with one or more of IEEE <NUM> standards. Process <NUM> may begin at block <NUM>.

At <NUM>, process <NUM> may involve processor <NUM> of apparatus <NUM> (e.g., STA <NUM>) coding data for a STA (e.g., STA <NUM>) to provide a stream of bits. Process <NUM> may proceed from <NUM> to <NUM>.

At <NUM>, process <NUM> may involve processor <NUM> processing the stream of bits to provide processed bits by performing operations represented by <NUM> and <NUM>. Process <NUM> may proceed from <NUM> to <NUM>.

At <NUM>, process <NUM> may involve processor <NUM> transmitting, via transceiver <NUM>, the processed bits to the STA over a combination of multiple RUs which are assigned to the STA.

At <NUM>, process <NUM> may involve processor <NUM> parsing the stream of bits to the combination of multiple RUs. Process <NUM> may proceed from <NUM> to <NUM>.

At <NUM>, in an event of leftover bits remaining from the parsing, process <NUM> may involve processor <NUM> distributing the leftover bits to one or more RUs but not all RUs of the combination of multiple RUs.

In some implementations, in parsing the stream of bits to the combination of multiple RUs, process <NUM> may involve processor <NUM> parsing the stream of bits to the combination of multiple RUs in a proportional round-robin fashion.

In some implementations, the combination of multiple RUs may include at least one smaller RU and at least one larger RU with each of the at least one larger RU having more tones than the at least one smaller RU. In such cases, in distributing the leftover bits to one or more RUs but not all RUs of the combination of multiple RUs, process <NUM> may involve processor <NUM> distributing the leftover bits to the at least one larger RU.

In some implementations, in distributing the leftover bits to the at least one larger RU, process <NUM> may involve processor <NUM> proportionally distributing the leftover bits over last predefined number of tones on each of the at least one larger RU. For instance, process <NUM> may involve processor <NUM> proportionally distributing the leftover bits over last <NUM> tones on each of the at least one larger RU.

At <NUM>, process <NUM> may involve processor <NUM> transmitting, via transceiver <NUM>, the processed bits to the STA over a combination of multiple RUs which are assigned to the STA and may include at least one smaller RU and at least one larger RU with each of the at least one larger RU having more tones than the at least one smaller RU.

At <NUM>, process <NUM> may involve processor <NUM> parsing the stream of bits to the combination of multiple RUs in a proportional round-robin fashion. Process <NUM> may proceed from <NUM> to <NUM>.

At <NUM>, in an event of leftover bits remaining from the parsing in the proportional round-robin fashion, process <NUM> may involve processor <NUM> distributing the leftover bits to one or more RUs but not all RUs of the combination of multiple RUs (e.g., to the at least one larger RU).

In some implementations, in distributing the leftover bits to the at least one larger RU, process <NUM> may involve processor <NUM> proportionally distributing the leftover bits over last <NUM> tones on each of the at least one larger RU.

In some implementations, in distributing the leftover bits to the at least one larger RU, process <NUM> may involve processor <NUM> sequentially distributing the leftover bits over last <NUM> tones on each of the at least one larger RU.

In some implementations, in distributing the leftover bits to the at least one larger RU, process <NUM> may involve processor <NUM> evenly distributing the leftover bits over each of the at least one larger RU. For instance, in evenly distributing the leftover bits over each of the at least one larger RU, process <NUM> may involve processor <NUM>, for every N iterations of parsing the stream of bits to the combination of multiple RUs in the proportional round-robin fashion, distributing the leftover bits over each of the at least one larger RU, with N being an integer equal to or greater than <NUM>.

Claim 1:
A method, performed by an apparatus, comprising:
processing a stream of bits to provide processed bits (<NUM>); and
transmitting the processed bits to a station, in the following also referred to as STA, over a combination of multiple resource units, in the following also referred to as RUs, assigned to the STA (<NUM>),
wherein the processing of the stream of bits (<NUM>) comprises:
parsing the stream of bits to the combination of multiple RUs in a proportional round-robin fashion (<NUM>);
wherein
the combination of multiple RUs comprises at least one smaller RU and at least two larger RUs with each of the at least two larger RUs having more tones than the at least one smaller RU; and
the processing of the stream of bits (<NUM>) further comprises:
in an event of leftover bits remaining from the parsing in the proportional round-robin fashion, distributing the leftover bits to one or more RUs but not all RUs of the combination of multiple RUs (<NUM>);
wherein the distributing of the leftover bits to one or more RUs but not all RUs of the combination of multiple RUs comprises distributing the leftover bits to the at least two larger RUs;
wherein the distributing of the leftover bits to the at least two larger RUs comprises proportionally distributing the leftover bits over last predefined number of tones on each of the at least two larger RUs; and
wherein the proportionally distributing of the leftover bits over last predefined number of tones on each of the at least two larger RUs comprises proportionally distributing the leftover bits over last <NUM> tones on each of the at least two larger RUs.