18511690. ACCELERATION OF S-POLAR ECC THROUGHPUT BY SCHEDULER simplified abstract (Samsung Electronics Co., Ltd.)
Contents
ACCELERATION OF S-POLAR ECC THROUGHPUT BY SCHEDULER
Organization Name
Inventor(s)
SARIT Buzaglo of TEL-AVIV (IL)
ARIEL Doubchak of TEL-AVIV (IL)
ACCELERATION OF S-POLAR ECC THROUGHPUT BY SCHEDULER - A simplified explanation of the abstract
This abstract first appeared for US patent application 18511690 titled 'ACCELERATION OF S-POLAR ECC THROUGHPUT BY SCHEDULER
Simplified Explanation
The method described in the abstract is a simplified successive cancellation list (SSCL) error decoding technique for S-polar codes. Here are the key points of the innovation:
- Representing an S-polar code as a perfect binary tree
- Providing soft information vectors to nodes based on parent nodes
- Computing soft information vectors for left child nodes
- Passing soft information vectors to right child nodes based on hard decisions from left child nodes
- Creating hard decision vectors for parent nodes based on hard decisions from right child nodes
- Updating path metrics and selecting paths with the lowest metric when a leaf node is reached
Potential Applications: This technology can be applied in wireless communication systems, satellite communication, and error correction in data transmission.
Problems Solved: This innovation helps in improving the error correction capabilities of S-polar codes, leading to more reliable communication systems.
Benefits: The method offers enhanced error decoding performance, increased reliability in data transmission, and improved overall communication system efficiency.
Potential Commercial Applications: This technology can be utilized in 5G networks, IoT devices, satellite communication systems, and any application requiring efficient error correction in data transmission.
Possible Prior Art: Prior art may include other error decoding techniques for polar codes, such as successive cancellation decoding or belief propagation decoding.
Unanswered Questions: 1. How does this SSCL error decoding method compare to other existing error decoding techniques for S-polar codes in terms of complexity and performance? 2. Are there any specific hardware or software requirements for implementing this SSCL error decoding method in practical communication systems?
Original Abstract Submitted
A method of simplified successive cancellation list (SSCL) error decoding of S-polar codes includes representing an S-polar code as a perfect binary tree; providing a node v a vector αof soft information from a parent node; computing a vector αof soft information for a left child of node v; providing node v with a vector βof hard decisions from the left child and using it with αto create a soft information vector αand passing it to a right child of node v; providing node v with a vector βof hard decisions from its right child and using it with βto create a hard decision vector, βof hard decisions, and passing it to its parent node; updating, when v is a ileaf of the perfect tree, two path metrics, and selecting paths obtained by expanding current paths with a lowest path metric.
