Samsung electronics co., ltd. (20240157933). ACCELERATION OF S-POLAR ECC THROUGHPUT BY SCHEDULER simplified abstract

From WikiPatents
Jump to navigation Jump to search

ACCELERATION OF S-POLAR ECC THROUGHPUT BY SCHEDULER

Organization Name

samsung electronics co., ltd.

Inventor(s)

AMIT Berman of TEL-AVIV (IL)

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 20240157933 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 from parent nodes to child nodes
  • Computing soft information vectors for left child nodes
  • Using hard decision vectors from child nodes to create soft information vectors for parent nodes
  • Updating path metrics and selecting paths with the lowest metric at leaf nodes

Potential Applications: This technology can be applied in wireless communication systems, satellite communication, and error correction in data transmission.

Problems Solved: This innovation addresses the challenge of efficient error decoding in s-polar codes, improving the reliability and accuracy of data transmission.

Benefits: The method offers improved error correction capabilities, increased data transmission efficiency, and enhanced overall system performance.

Potential Commercial Applications: This technology can be utilized in 5G networks, IoT devices, satellite communication systems, and other wireless communication applications.

Possible Prior Art: Prior art in error decoding techniques for polar codes, list decoding methods, and tree-based decoding algorithms may exist in the field.

Unanswered Questions: 1. How does this method compare to existing error decoding techniques in terms of complexity and performance? 2. Are there any limitations or constraints in 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.