IP Library › Granted Patent US 12,621,714
Granted Patent B2
US 12,621,714 · App. 18/143,081 · Granted May 5, 2026

Device and method of performing content channel generation

Inventors: Jhe-Yi Lin (HsinChu, TW); Wun-Ci Su (HsinChu, TW); Yu-Jhao Yang (HsinChu, TW)
Assignee: Realtek Semiconductor Corp.
H04W28/082H04W28/0252H04W72/52
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,621,714
App. No.
18/143,081
Granted
May 5, 2026
Kind
B2
Abstract

A content channel generation device includes: a splitting circuit for generating resource units according to resource assignments; a resource unit assignment circuit for generating a full binary tree according to the resource units; a node computing circuit for generating a minimum full binary tree according to the full binary tree; a load balance circuit for generating user field numbers corresponding to content channels according to the minimum full binary tree and a load balance function; a merging circuit for generating a traversal result of the minimum full binary tree according to a traversal algorithm, and for generating a merged traversal result according to the traversal result; and a common field generation circuit for generating a resource assignment indicator according to the merged traversal result to generate a common field.

Claims (44)

1 . A content channel generation device, comprising:

a splitting circuit, for generating a plurality of resource units (RUs) according to a plurality of resource assignments;

an RU assignment circuit, coupled to the splitting circuit, for generating a full binary tree according to the plurality of RUs;

a node computing circuit, coupled to the RU assignment circuit, for generating a minimum full binary tree according to the full binary tree;

a load balance circuit, coupled to the node computing circuit, for generating a plurality of user field numbers corresponding to a plurality of content channels according to the minimum full binary tree and a load balance function;

a merging circuit, coupled to the load balance circuit, for generating a traversal result of the minimum full binary tree according to a traversal algorithm, and for generating a merged traversal result according to the traversal result; and

a common field generation circuit, coupled to the merging circuit, for generating a resource assignment indicator according to the merged traversal result to generate a common field;

wherein the traversal result comprises a plurality of leaf nodes, and the operation of the merging circuit to generate the merged traversal result according to the traversal result comprises:

merging at least one leaf node of the plurality of leaf nodes to generate the merged traversal result when at least one first scheduled STA identity (ID) stored by the at least one leaf node is the same.

2 . The content channel generation device of claim 1 , further comprising:

a receiving circuit, coupled to the splitting circuit, for receiving the plurality of resource assignments of a plurality of scheduled stations (STAs).

3 . The content channel generation device of claim 1 , wherein the operation of the common field generation circuit to generate the resource assignment indicator according to the merged traversal result comprises:

checking a resource assignment table according to the merged traversal result; and

generating the resource assignment indicator according to the merged traversal result and a comparison result of the resource assignment table.

4 . The content channel generation device of claim 1 , further comprising:

a user field generation circuit, coupled to the merging circuit, for generating a plurality of user fields corresponding to the plurality of content channels according to the traversal result.

5 . The content channel generation device of claim 4 , wherein the traversal result comprises a plurality of leaf nodes, and the operation of the user field generation circuit to generate the plurality of user fields according to the traversal result comprises:

maintaining a first leaf node of the plurality of leaf nodes according to a plurality of scheduled STA IDs stored by the plurality of leaf nodes and a plurality of multiple RUs (MRU) information, and generating the plurality of user fields according to the first leaf node.

6 . The content channel generation device of claim 5 , wherein the operation of the user field generation circuit to generate the plurality of user field further comprises:

deleting at least one second leaf node of the plurality of leaf nodes according to the plurality of scheduled STA IDs stored by the plurality of leaf nodes and the plurality of MRU information.

7 . The content channel generation device of claim 5 , wherein each of the plurality of MRU information comprises an MRU flag.

8 . The content channel generation device of claim 1 , wherein the traversal algorithm comprises a binary tree pre-order traversal algorithm.

9 . A method for performing a content channel generation, comprising:

generating a plurality of resource units (RUs) according to a plurality of resource assignments;

generating a full binary tree according to the plurality of RUs;

generating a minimum full binary tree according to the full binary tree;

generating a plurality of user field numbers corresponding to a plurality of content channels according to the minimum full binary tree and a load balance function;

generating a traversal result of the minimum full binary tree according to a traversal algorithm, and generating a merged traversal result according to the traversal result; and

generating a resource assignment indicator according to the merged traversal result, to generate a common field;

wherein the traversal result comprises a plurality of leaf nodes, and the operation of generating the merged traversal result according to the traversal result comprises:

merging at least one leaf node of the plurality of leaf nodes to generate the merged traversal result when at least one first scheduled STA identity (ID) stored by the at least one leaf node is the same.

10 . The method of claim 9 , further comprising:

receiving the plurality of resource assignments of a plurality of scheduled stations (STAs).

11 . The method of claim 9 , wherein the operation of generating the resource assignment indicator according to the merged traversal result comprises:

checking a resource assignment table according to the merged traversal result; and

generating the resource assignment indicator according to the merged traversal result and a comparison result of the resource assignment table.

12 . The method of claim 9 , further comprising:

generating a plurality of user fields corresponding to the plurality of content channels according to the traversal result.

13 . The method of claim 12 , wherein the traversal result comprises a plurality of leaf nodes, and the operation of generating the plurality of user field according to the traversal result comprises:

maintaining a first leaf node of the plurality of leaf nodes according to a plurality of scheduled STA IDs stored by the plurality of leaf nodes and a plurality of multiple RUs (MRU) information, and generating the plurality of user fields according to the first leaf node.

14 . The method of claim 13 , wherein the operation of generating the plurality of user field further comprises:

deleting at least one second leaf node of the plurality of leaf nodes according to the plurality of scheduled STA IDs stored by the plurality of leaf nodes and the plurality of MRU information.

15 . The method of claim 13 , wherein each of the plurality of MRU information comprises a MRU flag.

16 . The method of claim 9 , wherein the traversal algorithm comprises a binary tree pre-order traversal algorithm.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 4, 2023
From: LIN, JHE-YI; SU, WUN-CI; YANG, YU-JHAO
To: REALTEK SEMICONDUCTOR CORP.
Reel/Frame 063525/0809 →
Priority Claims (1)
TW 111116750 · May 4, 2022 · national
Continuity (1)
Related Publication 20230362724A1 · Nov 9, 2023
References Cited (19)
US 6912229B1 · Lauro · 2005 [cited by applicant]
US 7260716B1 · Srivastava · 2007 [cited by applicant]
US 7710963B1 · Jain · 2010 [cited by examiner]
US 9867189B2 · Lee · 2018 [cited by examiner]
US 10123330B2 · Josiam · 2018 [cited by applicant]
US 10841647B2 · Zavesky · 2020 [cited by examiner]
US 12229590B2 · Lin · 2025 [cited by examiner]
US 20170094664A1 · Lee · 2017 [cited by applicant]
US 20210349754A1 · Lin · 2021 [cited by applicant]
US 20230198696A1 · Huang · 2023 [cited by examiner]
US 20230359502A1 · Su · 2023 [cited by examiner]
US 20250031214A1 · Huang · 2025 [cited by examiner]
US 20250182967A1 · Yamashita · 2025 [cited by examiner]
US 20250192958A1 · Park · 2025 [cited by examiner]
TW 201713160A · 2017 [cited by applicant]
TW 202143770A · 2021 [cited by applicant]
WO 2021204209A1 · 2021 [cited by applicant]
Su et al., the specification, including the claims, and drawings in the U.S. Appl. No. 18/143,048, filed May 3, 2023. [cited by applicant]
IEEE Computer Society, IEEE P802.11be TM/D1.1 Draft Standard for Information technology—Telecommunications and information exchange between systems Local and metropolitan area networks—Specific requirements, Part 11: Wi… [cited by applicant]