CN113672773A

CN113672773A - Apparatus and method for performing content channel generation

Info

Publication number: CN113672773A
Application number: CN202010416643.XA
Authority: CN
Inventors: 林哲毅; 曾俊凯; 李文咏; 郑绍余
Original assignee: Realtek Semiconductor Corp
Current assignee: Realtek Semiconductor Corp
Priority date: 2020-05-15
Filing date: 2020-05-15
Publication date: 2021-11-19

Abstract

The present disclosure relates to an apparatus and method for performing content channel generation, the content channel generation apparatus including: the resource unit configuration circuit is used for configuring the scheduling station as a node in a full binary tree according to a search algorithm; a node operation circuit for determining first connection information of the full binary tree, and a minimum binary tree calculation algorithm for determining second connection information of the minimum full binary tree; a load balancing circuit for determining a number of user fields corresponding to a plurality of content channels according to a load balancing function and the second connection information; and a user field generating circuit for generating a traversal result of the minimum full binary tree according to a traversal algorithm and the second connection information, generating a plurality of user fields corresponding to the plurality of content channels according to the traversal result, and generating the plurality of content channels.

Description

Apparatus and method for performing content channel generation

Technical Field

The present invention relates to a communication apparatus and method for a communication system, and more particularly, to an apparatus and method for performing content channel generation.

Background

In a communication system, a transmitting end uses a sorting algorithm and a linked list to obtain a user field for configuring user resources. However, the sorting algorithm and the linked list have high complexity (e.g., time complexity), making it difficult to implement the sorting algorithm and the linked list in an embedded system. In addition, the user fields obtained from the sorting algorithm and the linked list have varying lengths. However, too long user fields may reduce the efficiency of bandwidth usage. Therefore, how to design a low-complexity algorithm to obtain the user field with the shortest length and generate the shortest content channel is an urgent problem to be solved.

Disclosure of Invention

The present invention provides a method and a communication device thereof for performing content channel generation to solve the above problems.

The invention discloses a content channel (content channel) generating device, comprising a resource unit allocation (resource unit allocation) circuit, which is used for allocating at least one scheduled station (scheduled station) as at least one node (node) in a full binary tree (full binary tree) according to a search algorithm (search algorithm); a node computing (node computing) circuit, coupled to the resource unit allocation circuit, for determining first connection information of the full binary tree, and including a minimum binary tree computing algorithm for determining second connection information of a minimum full binary tree according to the minimum binary tree computing algorithm and the first connection information; a load balance circuit, coupled to the node calculating circuit, for determining a number of user fields corresponding to a plurality of content channels according to a load balance function (function) and the second connection information; and a user field generating circuit, coupled to the load balancing circuit and the node operating circuit, for generating a traversal result of the least full binary tree according to a traversal algorithm (traversal algorithm) and the second connection information, generating a plurality of user fields corresponding to the plurality of content channels according to the traversal result, and generating the plurality of content channels.

The invention also discloses a content channel (content channel) generating method, which is used for a content channel generating device and comprises the steps of configuring at least one scheduling station (scheduled station) into at least one node (node) in a full binary tree (full binary tree) according to a search algorithm (search algorithm); determining first connection information of the full binary tree, and determining second connection information of a minimum full binary tree according to a minimum binary tree calculation algorithm and the first connection information; determining a number of user fields corresponding to a plurality of content channels according to a load balancing function (function) and the second connection information; and generating a traversal result of the least full binary tree according to a traversal algorithm (traversal algorithm) and the second connection information, and generating a plurality of user fields corresponding to the plurality of content channels and generating the plurality of content channels according to the traversal result.

Drawings

Fig. 1 is a schematic diagram of a communication system according to an embodiment of the present invention.

Fig. 2 is a schematic diagram of a content channel generating device according to an embodiment of the invention.

Fig. 3 is a diagram illustrating a correspondence relationship between a resource unit and a node of a full binary tree according to an embodiment of the present invention.

Fig. 4 is a diagram illustrating a correspondence relationship between a resource unit and a node of a full binary tree according to an embodiment of the present invention.

FIG. 5 is a diagram of a traversal order, a traversal result, and a mapping table 50 of content channels according to an embodiment of the invention.

FIG. 6 is a diagram illustrating generation of user fields according to a traversal result and a plurality of content channels according to an embodiment of the present invention.

FIG. 7 is a flowchart of an embodiment of a process.

Detailed Description

Fig. 1 is a diagram of a communication system 10 according to an embodiment of the invention. The communication system 10 may be any communication system using orthogonal frequency-division multiplexing (OFDM) technology (or DMT technology), and is briefly composed of a transmitting end TX and a receiving end RX. In fig. 1, a transmitting end TX and a receiving end RX are used to illustrate the architecture of the communication system 10. For example, the communication system 10 may be an Asymmetric Digital Subscriber Line (ADSL) system, a Power Line Communication (PLC) system, an Ethernet Over Coax (EOC) system, or other wired communication systems. Alternatively, the communication system 10 may be a wireless communication system such as a Wireless Local Area Network (WLAN), a Digital Video Broadcasting (DVB) system, a Long Term Evolution (LTE) system, an LTE-advanced (LTE-a) system, a fifth generation (5th generation, 5G) system, and the like. For example, the transmitting end TX may be an Access Point (AP) in a regional wireless network. In addition, the transmitting terminal TX and the receiving terminal RX may be disposed in a mobile phone, a notebook computer, etc., but are not limited thereto.

In one embodiment, the transmitting side TX and the receiving side RX may support the Institute of Electrical and Electronics Engineers (IEEE) 802.11 standard (e.g., IEEE802.11AX). In one embodiment, the 802.11 standard may support Orthogonal Frequency Division Multiple Access (OFDMA) and/or Multi-User Multiple-Input Multiple-Output (MU-MIMO) techniques. In order to efficiently notify transmission information of all scheduled stations (scheduled STAs) to the receiving end RX, the IEEE802.11 standard defines a field (e.g., HE-SIG-B field) of a high efficiency wireless technology multi-user physical protocol data unit (HE-MU PPDU). In one embodiment, the HE-SIG-B field may include at least one content channel (content channel), and each content channel may include a common field (common field) for informing all scheduling stations of the current resource unit allocation of the full data bandwidth. In one embodiment, each content channel may include at least one user field (user field), each user field carrying transmission information for a particular station. In one embodiment, in the IEEE802.11 standard, each resource unit smaller than 242-frequency (tone) may (for example) be configured with at least one station, and thus, for an empty resource unit, the HE-SIG-B field may be configured with an empty station having a station identity (STA ID) of "2046". For resource units greater than or equal to 242-frequency, the HE-SIG-B field may configure the user field to multiple content channels to ensure that the number of user fields carried by the multiple content channels (i.e., the length (e.g., size) of the content channels) is the same or similar. In one embodiment, load balance (load balance) may be used to balance the length of the content channels. The length of the HE-SIG-B field may be changed according to the result of the resource unit configuration and the result of the load balancing. In one embodiment, the HE-SIG-B field is too long, which may cause the Physical Layer Convergence Procedure (PLCP) to be too long, resulting in a reduced output rate (throughput).

In one embodiment, the resource unit configuration may search for the best combination of resource unit configurations by averaging the data bandwidth, which may result in the lowest complexity, which may result in more empty resource units, resulting in longer user fields (e.g., user-specific fields), which may lead to reduced output rate. In one embodiment, the resource unit configurations may be searched for the best combination of resource unit configurations by exhaustive search (exhaustive search), which may result in the best combination of resource unit configurations, which may be increased according to data bandwidth and search space, such that complexity and runtime of the algorithm are greatly increased, thereby resulting in real-time requirements in practical applications being unable to be met. In one embodiment, in the procedure for generating the user fields, the order of the user fields may (e.g., need to) be arranged in the order of most negative frequency to most positive frequency according to the spectrum location of the data unit in which they are configured. Therefore, a common implementation is to use a linked list (linked list) in combination with a sorting algorithm (sorting algorithm). However, the linked list and the sorting algorithm have high complexity, so that for an embedded system (such as an access point), a long running time is required, and it is difficult to meet the real-time requirement in practical applications.

Fig. 2 is a schematic diagram of a content channel generation apparatus 20 according to an embodiment of the present invention, which can be used in the TX of fig. 1 for generating the user field and generating the content channel. In an embodiment, the content channel may be included in the HE-SIG-B field. In an embodiment, the HE-SIG-B field may contain multiple content channels. In one embodiment, the plurality of content channels may include at least one first content channel and at least one second content channel. In one embodiment, each content channel may include at least one common field and/or at least one user field. In one embodiment, the common field may be used to inform the ue of the current configuration of resource units in the spectrum. In one embodiment, the user field may be used to notify a client or site of the resources it is configured for. In an embodiment, if the smallest resource unit is determined as a leaf node (leaf node) and the adjacent resource unit is determined as a sibling node (sibling node), the content channel generating apparatus 20 (e.g., a node computing circuit (node computing)210 therein) creates (e.g., determines, generates) a binary tree according to a rule that the resource unit size of the child node (child node) is not larger than the resource unit size of the parent node (parent node), and each resource unit may correspond to a node of the binary tree. In one embodiment, the node may correspond to at least one user field. That is, each resource unit may correspond to one or more user fields.

The content channel generating device 20 may include a resource unit configuration circuit 200, a node operation circuit 210, a load balancing circuit 220, and a user field generating circuit 230. In detail, the resource unit configuration circuit 200 may be configured to configure (e.g., locate) at least one scheduling site as at least one node in a full binary tree (full binary tree) according to a search algorithm (search algorithm). The node operation circuit 210, coupled to the resource unit configuration circuit 200, may include a node pool (pool) for determining (e.g., recording) first node connection information in a full binary tree (e.g., a currently existing node), and the node operation circuit 210 may also include a minimum binary tree calculation algorithm for determining (e.g., calculating or updating) second node connection information of a minimum full binary tree (e.g., generated by non-empty nodes in the node pool (i.e., non-empty nodes in the full binary tree)) according to the minimum binary tree calculation algorithm and the first connection information. The load balancing circuit 220, coupled to the node operation circuit 210, is configured to determine (e.g., calculate) a plurality of user field numbers (e.g., the number of user fields that each content channel can (e.g., will) carry) corresponding to a plurality of content channels according to a load balancing function (function) and second node connection information. The user field generating circuit 230, coupled to the load balancing circuit 220 and the node operation circuit 210, may be configured to generate a traversal result of the least full binary tree according to a traversal algorithm (traversal algorithm) and the second node connection information, and generate a plurality of user fields corresponding to the plurality of content channels and generate (e.g., compose) the plurality of content channels according to the traversal result. In one embodiment, the number of the plurality of user fields is the number of the plurality of user fields.

In one embodiment, the node pool may include a memory unit (e.g., Static Random Access Memory (SRAM) or a register file) for storing the node connection information. In one embodiment, the minimum binary tree calculation algorithm may comprise a merge algorithm. Based on the first node connection information in the node pool, the merging algorithm may decide (e.g., calculate) a minimally full binary tree containing all nodes.

In one embodiment, the search algorithm may comprise a binary tree search algorithm (e.g., depth first search algorithm). In one embodiment, the at least one node includes (e.g., is) at least one non-null node. In an embodiment, the resource unit configuration circuit 200 may configure a plurality of empty stations (empty STAs) into a plurality of empty leaf nodes in the full binary tree according to a search algorithm and at least one non-empty node, so that the nodes in the node pool may form a full binary tree. In one embodiment, the node operation circuit 210 may merge the first empty leaf node into at least one non-empty node if a parent node (parent node) connected to the first empty leaf node is the at least one non-empty node. In one embodiment, if the parent node connected to the second empty leaf node of the at least one empty leaf node is not the at least one non-empty node and the parent node is not connected to the at least one non-empty node, the node operation circuit 210 may merge the second empty leaf node into the parent node and determine the parent node as the empty node of the first configuration. In one embodiment, if the parent node connected to the third empty leaf node of the at least one empty leaf node is not the at least one non-empty node and the parent node is connected to the at least one non-empty node, the node operation circuit 210 may determine the third empty leaf node as an empty node of the second configuration. In one embodiment, the node operation circuit 210 may determine a least full binary tree (storing connection information of the least full binary tree) according to at least one non-empty node and at least one empty leaf node. In one embodiment, the node operation circuit 210 may determine (e.g., store) the least full binary tree and the connection information thereof according to at least one non-empty node and at least one configured empty node (e.g., a first configured empty node and/or a second configured empty node).

In one embodiment, the plurality of content channels may include at least one first content channel and at least one second content channel. In one embodiment, the at least one first content channel may include at least one first user field of a plurality of user fields, and the at least one second content channel may include at least one second user field of the plurality of user fields. In one embodiment, at least one of the first content channel or the second content channel may not include a user field. In an embodiment, a plurality of nodes may correspond to a plurality of resource units. In an embodiment, a resource unit of the plurality of resource units may correspond to at least one user field. That is, each resource unit may correspond to (e.g., signal) one or more user fields.

In one embodiment, the traversal algorithm may comprise a binary tree pre-order traversal algorithm (binary tree). In one embodiment, the traversal algorithm may comprise a binary tree mirrored pre-order traversal algorithm (binary tree mirror algorithm). In an embodiment, the arrangement order of the frequencies corresponding to the user fields may be an ascending order (ascending order). That is, the plurality of frequencies corresponding to the plurality of user fields are arranged in order from the smallest frequency to the largest frequency (e.g., from the most negative frequency to the most positive frequency).

Fig. 3 is a diagram illustrating a correspondence relationship between a resource unit and a node of a full binary tree according to an embodiment of the present invention. In fig. 3, the resource units are shown as trapezoids. For example, the bandwidth of 160MHZ is 8 resource units of 242-frequency (e.g., including 242 subcarriers), 4 resource units of 484-frequency (e.g., including 484 subcarriers), 2 resource units of 996-frequency (e.g., including 996 subcarriers), and 1 resource unit of 1992-frequency (e.g., including 1992 subcarriers) from top to bottom. The processing procedure for resource units smaller than 242-frequency is similar and will not be described herein. A resource unit has a resource unit indicator (e.g., defined in the 3 rd Generation Partnership Project (3 GPP) standard, determined by the transmitter TX, or defined in a WiFi standard (e.g., WiFi-6)), which is shown as indicators 1-15 in FIG. 3. Further, in fig. 3, the full binary tree is shown as a tree structure including circles filled with diagonal stripes (hereinafter, diagonal stripe circles), circles filled with a lattice (hereinafter, lattice circles), circles filled with dots (hereinafter, dot circles), and connecting lines therebetween. Where the diagonal striped circles represent empty nodes, the grid circles represent nodes where scheduled sites are configured, and the point circles represent reserved nodes. The arrows shown in fig. 3 represent the incorporation of a node into another node, and the tree structure with the merged nodes may (e.g., if desired) satisfy the structure of a full binary tree. As shown in fig. 3, the corresponding relationship between the resource unit and the node of the full binary tree is a one-to-one correspondence, i.e., one resource unit corresponds to one node in the full binary tree.

Fig. 4 is a diagram illustrating a correspondence relationship between a resource unit and a node of a full binary tree according to an embodiment of the present invention. In fig. 4, the resource units and their pointers are illustrated in the same manner as in fig. 3, and are not described herein again. Unlike fig. 3, the full binary tree includes unfilled circles, mesh circles, circles filled with horizontal stripes (hereinafter, horizontal stripe circles), dot circles and connecting lines therebetween, where unfilled circles represent empty leaf nodes, mesh circles represent nodes where scheduling sites are configured, horizontal stripe circles represent empty nodes where scheduling sites are configured, and dot circles represent reserved nodes. Finally, after removing (e.g., deleting) the empty leaf nodes, the remaining nodes may produce a full binary tree.

How the content channel generation device 20 generates a content channel is illustrated below with reference to fig. 3 and 4.

First, the resource unit configuration circuit 200 receives the

scheduling stations

6 and 9 transmitted by an upper layer (e.g., a Media Access Control (MAC) layer). According to the search algorithm, the resource unit configuration circuit 200 configures the

scheduling stations

6 and 9 as nodes (i.e., grid circles in fig. 3) corresponding to the

resource unit pointers

6 and 9 in the full binary tree, wherein the connection information of the nodes is stored in the node pool of the node operation circuit 210. For simplicity of explanation, the node corresponding to resource unit pointer X will be referred to as node X hereinafter.

According to the search algorithm and the

nodes

6 and 9, the resource unit configuration circuit 200 configures a plurality of empty nodes in a plurality of empty leaf nodes, i.e., the nodes 1 to 5, 7 and 8 (i.e., the slanted bar circles in the leaf nodes in fig. 3), so that the nodes in the node pool can form a full binary tree.

According to the minimum binary tree calculation algorithm, the parent node to which the

nodes

1 and 2 are connected is the node 9, and the node operation circuit 210 incorporates the

nodes

1 and 2 into the node 9 (i.e., the arrow direction in fig. 3). According to the minimum binary tree calculation algorithm, the parent node to which the

nodes

3, 4 are connected is node 10, instead of node 6 or node 9, and node 10 is not connected to node 6 or node 9, the node operation circuit 210 incorporates the

nodes

3, 4 into node 10 (i.e., the arrow direction in fig. 3), and decides node 10 as a null node (i.e., the cross-striped circle in fig. 4) configured to satisfy a structure in which the tree structure is a binary tree (e.g., a structure of a full binary tree). Similarly, according to the minimum binary tree calculation algorithm, the parent node to which the nodes 7, 8 are connected is the node 12, instead of the node 6 or the node 9, and the node 12 is not connected to the node 6 or the node 9, the node operation circuit 210 incorporates the nodes 7, 8 into the node 12 (i.e., the arrow direction in fig. 3), and decides the node 12 as a vacant node (i.e., the horizontally striped circle in fig. 4) configured to satisfy the tree structure as a binary tree (e.g., the structure of a full binary tree). Further, according to the minimum binary tree calculation algorithm, the parent node to which the node 5 is connected is the node 11, instead of the node 6 or the node 9, but the node 11 is connected to the node 6, the node operation circuit 210 decides the node 5 as a vacant node (i.e., a horizontally striped circle in fig. 4) configured to satisfy a structure in which the tree structure is a binary tree (e.g., a structure of a full binary tree). The resource unit configuration circuit 200 configures the scheduled sites as

nodes

6, 9 in a full binary tree according to the search algorithm described above, and the node operation circuit 210 merges the configured empty sites (i.e., nodes 1-5, 7, 8) into

empty nodes

5, 10, 12 according to the minimum binary tree computation algorithm described above. For simplicity of explanation, the

nodes

6, 9 and the configured

empty nodes

5, 10, 12 are hereinafter referred to as configuration nodes.

Then, according to the load balancing function, the load balancing circuit 220 determines (e.g., calculates) at least one user field of the configuration node corresponding to the first content channel and/or the second content channel. That is, each configuration node may correspond to (e.g., signal) one or more user fields. First, the load balancing function may be defined as follows:

wherein

A resource unit indicator (index) that is a resource unit with a frequency (subcarrier) number greater than or equal to 484 (e.g., 484 or 996); n is a radical of_iThe number of user fields configured for resource unit i; x is the number of_iIs a resource unit iA number of user fields configured to the first content channel; y is_iA number of user fields configured to the second content channel for resource unit i; c₁A number of user fields of a first content channel configured (e.g., signaled) to resource units having a frequency amount less than or equal to 242 (e.g., 26, 52, 106, or 242); c₂A number of user fields of a second content channel configured (e.g., signaled) to resource units having a frequency amount less than or equal to 242 (e.g., 26, 52, 106, or 242);

is a natural number.

An embodiment of determining whether the user field of the configuration node corresponds to the first content channel and/or the second content channel according to the load balancing function (equation 1) is described below. First, the number of user fields of the configuration node 5 is 1 (N)₅1), the number of user fields configuring the node 6 is 1 (N)₆1), the number of user fields of the configuration node 9 is 2 (N)₉2), the number of user fields configuring the node 10 is 2 (N)₁₀2) and the number of user fields configuring the node 12 is 2 (N)₁₂2). That is, the number of user fields of the configuration node is 8.

According to the load balancing function, C when the user field of the configuration node 5 corresponds to the first content channel and the user field of the configuration node 6 corresponds to the second content channel, or when the user field of the configuration node 5 corresponds to the second content channel and the user field of the configuration node 6 corresponds to the first content channel ₁1 and C ₂1. When the user fields of the configuration nodes 9, 10, 12 all correspond to the first content channel,

and

when configuring a node 9, 10, 12 in the user field9 corresponds to the second content channel, the other user fields all correspond to the first content channel,

and

when the user field of node 9 and one of the user fields of node 10 of the user fields of nodes 9, 10, 12 are configured to correspond to the second content channel, the other user fields all correspond to the first content channel,

and

when one of the user fields of the nodes 9, 10, 12, one of the user fields of the node 9, one of the user fields of the node 10 and one of the user fields of the node 12 are configured to correspond to the second content channel, and the other user fields all correspond to the first content channel,

and

when the user field of node 9, one of the user fields of node 10 and one of the user fields of node 12 of the user fields of nodes 9, 10, 12 are configured to correspond to the second content channel, the other user fields all corresponding to the first content channel,

and

when the user field of node 9, one of the user fields of node 10 and the user field of node 12 among the user fields of nodes 9, 10, 12 are configured to correspond to the second content channel, the other user fields all corresponding to the first content channel,

and

the minimum value is 4 among the maximum values 4 to 7. Therefore, according to the load function, under the configuration that the number of user fields carried by the first content channel is 4 and the number of user fields carried by the second content channel is 4, because the length of the HE-SIG-B field is based on the content channel carrying more user fields, we can obtain the shortest HE-SIG-B field. Thus, in case a minimum value of 4 has occurred, all correspondence of user fields to the first content channel and/or the second content channel is not stated one by one.

The corresponding manner of the minimum value of 4 is one of the corresponding manners, but not limited thereto. The minimum value of 4 corresponds to when one of the user fields of the

nodes

9, 10, and 12 is configured such that one of the user fields of the node 9, one of the user fields of the node 10, and one of the user fields of the node 12 correspond to the second content channel and the other user fields correspond to the first content channel. The above configuration may satisfy the conditional expression of the load balancing function.

Further, the user field generation circuit 230 may generate a traversal result of a full binary tree according to a traversal algorithm. Referring to fig. 4, only the traversal reservation nodes (i.e., the dot circles of fig. 4) and the allocation nodes (i.e., the grid circles and the horizontal stripe circles of fig. 4) are traversed, and the nodes 1 to 4, 7, and 8 (i.e., the unfilled circles of fig. 4) are not traversed. Thus, the traversal result of the user field generation circuit 230 through the full binary tree is node 15, node 13, node 9, node 10, node 14, node 11, node 5, node 6, and node 12, where the traversal order of the configuration nodes is node 9, node 10, node 5, node 6, and node 12.

The traversal order, the traversal result, and the correspondence relationship of the content channels can be summarized as a correspondence table 50 in fig. 5. Table 50 illustrates configuration nodes and their corresponding first content channels and/or second content channels.

FIG. 6 is a diagram illustrating generation of a user field according to the traversal result of FIG. 5 and the content channel corresponding thereto according to an embodiment of the present invention. In fig. 6, the manner of depicting the resource unit and the resource unit pointer thereof and the manner of depicting the full binary tree are the same as those in fig. 4, and are not described herein again. Furthermore, in fig. 6, the bold-box arrows refer to the user fields corresponding to (contained in) the first content channel, the thin-box arrows refer to the user fields corresponding to (contained in) the second content channel, and "2046" refers to the sites for which the user fields are used for null (i.e., not scheduled). As shown in fig. 6, the first content channel corresponds to (includes) a user field of node 9 (e.g., for scheduling sites), a user field of node 10, a user field of node 5, and a user field of node 12. The second content channel corresponds to (includes) another user field of node 9, another user field of node 10, a user field of node 6 (e.g., for scheduling sites), and another user field of node 12.

The content channel generation method of the content channel generation apparatus 20 can be summarized as a flow 70 of FIG. 7. The process 70 includes the following steps:

step 700: and starting.

Step 702: at least one of the scheduling stations is configured as at least one node in a full binary tree according to a search algorithm.

Step 704: determining first connection information of the full binary tree, and determining second connection information of a minimum full binary tree according to a minimum binary tree calculation algorithm and the first connection information.

Step 706: determining a number of user fields corresponding to a number of content channels based on a load balancing function and the second connection information.

Step 708: generating a traversal result of the least full binary tree according to a traversal algorithm and the second connection information, and generating a plurality of user fields corresponding to the plurality of content channels and generating the plurality of content channels according to the traversal result.

Step 710: and (6) ending.

The process 70 is used to exemplify the content channel generating method of the content channel generating device 20, and the detailed description and variations can refer to the foregoing description, which is not repeated herein.

It should be noted that the content channel generation apparatus 20 (and the resource unit configuration circuit 200, the node operation circuit 210, the load balancing circuit 220, and the user field generation circuit 230 therein) can be implemented in various ways. For example, the above-described devices may be integrated into one or more devices. Furthermore, the content channel generating device 20 can be implemented by hardware (e.g. a circuit), software, firmware (a combination of hardware devices and computer instructions and data belonging to read-only software on hardware devices), an electronic system, or a combination thereof, but is not limited thereto.

In summary, the present invention provides an apparatus and method for performing content channel generation, in which a TX can generate the shortest user field and the shortest content channel more efficiently according to a search algorithm with lower complexity, a minimum binary tree calculation algorithm, a load function, and a traversal algorithm, so as to generate the shortest HE-SIG-B field.

The above description is only a preferred embodiment of the present invention, and all equivalent changes and modifications made within the scope of the claims of the present invention should be covered by the present invention.

[ notation ] to show

10: communication system

20: content channel generation apparatus

200: resource unit configuration circuit

210: node operation circuit

220: load balancing circuit

230: user field generating circuit

50: watch (A)

70: flow path

700. 702, 704, 706, 708, 710: and (5) carrying out the following steps.

Claims

1. A content channel generating apparatus, comprising:

a resource unit configuration circuit for configuring at least one scheduling site as at least one node in a full binary tree according to a search algorithm;

a node operation circuit, coupled to the resource unit allocation circuit, for determining first connection information of the full binary tree, and including a minimum binary tree calculation algorithm for determining second connection information of a minimum full binary tree according to the minimum binary tree calculation algorithm and the first connection information;

a load balancing circuit, coupled to the node computing circuit, for determining a number of user fields corresponding to a plurality of content channels according to a load balancing function and the second connection information; and

a user field generating circuit, coupled to the load balancing circuit and the node operation circuit, for generating a traversal result of the minimum full binary tree according to a traversal algorithm and the second connection information, generating a plurality of user fields corresponding to the plurality of content channels according to the traversal result, and generating the plurality of content channels.

2. The content channel generation apparatus as claimed in claim 1, wherein the search algorithm comprises a binary tree search algorithm.

3. The content channel generating apparatus as claimed in claim 1, wherein the at least one node comprises at least one non-empty node.

4. The content channel generating apparatus according to claim 3, wherein the resource unit configuring circuit configures a plurality of empty nodes into a plurality of empty leaf nodes in the full binary tree according to the search algorithm and the at least one non-empty node.

5. The content channel generation apparatus according to claim 4, wherein the node operation circuit performs the following operations according to the minimum binary tree calculation algorithm:

the node operation circuit merges a first empty leaf node of the plurality of empty leaf nodes into the at least one non-empty node if a parent node to which the first empty leaf node is connected is the at least one non-empty node;

if a parent node to which a second empty leaf node among the plurality of empty leaf nodes is connected is not the at least one non-empty node and the parent node is not connected to the at least one non-empty node, the node operation circuit merges the second empty leaf node into the parent node and decides the parent node as an empty node of a first configuration; and

if a parent node connected to a third empty leaf node of the plurality of empty leaf nodes is not the at least one non-empty node and the parent node is connected to the at least one non-empty node, the node operation circuit determines the third empty leaf node as at least one empty node of a second configuration.

6. The content channel generating device as claimed in claim 4, wherein the node operation circuit determines the minimum full binary tree according to the at least one non-empty node and the plurality of empty leaf nodes.

7. The content channel generation apparatus as claimed in claim 1, wherein the plurality of content channels comprises at least one first content channel and at least one second content channel.

8. The content channel generating apparatus as claimed in claim 7, wherein the at least one first content channel comprises at least one first user field of the plurality of user fields, and the at least one second content channel comprises at least one second user field of the plurality of user fields.

9. The content channel generation apparatus as claimed in claim 1, wherein the traversal algorithm comprises a binary tree preamble traversal algorithm.

10. A content channel generation method is used for a content channel generation device, and comprises the following steps:

configuring at least one scheduling station as at least one node in a full binary tree according to a search algorithm;

determining first connection information of the full binary tree, and determining second connection information of a minimum full binary tree according to a minimum binary tree calculation algorithm and the first connection information;

determining a number of user fields corresponding to a plurality of content channels according to a load balancing function and the second connection information; and

generating a traversal result of the least full binary tree according to a traversal algorithm and the second connection information, and generating a plurality of user fields corresponding to the plurality of content channels and generating the plurality of content channels according to the traversal result.