IP Library Granted Patent US 9,667,381
Granted Patent B2
US 9,667,381 · App. 14/105,930 · Granted May 30, 2017

Packet decoding method and apparatus

Inventors: Hongsil Jeong (Suwon-si, KR); Sang-Hyo Kim (Seoul, KR); Jong-Hwan Kim (Suwon-si, KR); Daehyeon Ryu (Seongnam-si, KR); Seho Myung (Seoul, KR)
Assignees: Samsung Electronics Co., Ltd.; Sungkyunkwan University Research & Business Foundation
H04L1/0046H03M13/09H03M13/1111H03M13/1191H03M13/13H03M13/2906H03M13/451H04L1/0057
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 9,667,381
App. No.
14/105,930
Granted
May 30, 2017
Kind
B2
Abstract

A method and an apparatus for encoding and decoding packets using a polar code is provided. The method includes acquiring a plurality of blocks constituting the packet, extracting a plurality of codeword candidates corresponding to the blocks, selecting some of the codeword candidates in a descending order of posterior probability among the codeword candidates corresponding to the blocks, combining the selected codeword candidates into a plurality of codeword combinations, selecting a codeword combination having the highest posterior probability and passed Cyclic Redundancy Check (CRC) test without error among the plurality of codeword combinations, and decoding the selected codeword combination. The packet encoding and decoding apparatus and method of the present disclosure is capable of encoding and decoding packets in a unit of blocks efficiently.

Claims (41)

1. A method for decoding a packet comprising a plurality of blocks, the method comprising:

acquiring the plurality of blocks constituting the packet;

extracting a plurality of codeword candidates corresponding to the blocks;

selecting some of the plurality of codeword candidates in a descending order based on a posterior probability among the plurality of codeword candidates, that a corresponding codeword is a correct codeword for decoding a corresponding block;

combining the selected codeword candidates into a plurality of codeword combinations;

selecting a codeword combination having a highest posterior probability and having passed a cyclic redundancy check (CRC) test without error, among the plurality of codeword combinations; and

decoding the selected codeword combination.

2. The method of claim 1 ,

wherein the packet comprises K blocks, K being an integer greater than 1, and

wherein the combination of the selected codeword candidates into the plurality of codeword combinations comprises:

combining first codeword candidates selected in the descending order of posterior probability among the codeword candidates corresponding to a first block of the K blocks and combining second codeword candidates selected in the descending order of posterior probability among the codeword candidates corresponding to a second block of the K blocks, into codeword combinations; and

acquiring entire codeword combinations for first to K th blocks by repeating the combining of the combined codeword combinations and next codeword candidates.

3. The method of claim 2 ,

wherein the combining of the selected codeword candidates into the plurality of codeword combinations further comprises selecting some codeword candidate combination in the descending order of the posterior probability among the codeword candidates combined after combining the first and second codeword candidates, and

wherein the combining of the selected codeword combination and the next codeword candidates is repeated to generate the entire codeword combinations for the first to K th blocks.

4. The method of claim 1 , wherein the selecting of some of the codeword candidates comprises:

determining a number of codeword candidates to be selected per block (M) based on the posterior probability, M being an integer greater than 1; and

selecting M codeword candidates in the descending order of the posterior probability among the plurality of codeword candidates.

5. The method of claim 4 , wherein the determining of the number of codeword candidates to be selected per block (M) based on the posterior probability comprises determining M based on highest and second highest posterior probabilities of the codeword candidates among the posterior probabilities of the plurality of codeword candidates.

6. The method of claim 1 , wherein the combining of the selected codeword candidates into the plurality of codeword combinations is performed in a reverse order.

7. An apparatus for decoding a packet comprising a plurality of blocks, the apparatus comprising:

a receiver configured to receive the plurality of blocks constituting the packet; and

at least one processor configured to:

acquire the plurality of blocks constituting the packet,

extract a plurality of codeword candidates corresponding to the blocks,

select some of the plurality of codeword candidates in a descending order based on a posterior probability among the plurality of codeword candidates, that a corresponding codeword is a correct codeword for decoding a corresponding block,

combine the selected codeword candidates into a plurality of codeword combinations,

select a codeword combination having a highest posterior probability and having passed a cyclic redundancy check (CRC) test without error among the plural codeword combinations, and

decode the selected codeword combination.

8. The apparatus of claim 7 , wherein the packet comprises K blocks, K being an integer greater than 1, and the at least one processor is further configured to:

combine first codeword candidates selected in the descending order of posterior probability among the codeword candidates corresponding to a first block of the K blocks,

combine second codeword candidates selected in the descending order of posterior probability among the codeword candidates corresponding to a second block of the K blocks into codeword combinations, and

acquire entire codeword combinations for first to K th blocks by repeating the combining of the combined codeword combinations and next codeword candidates.

9. The apparatus of claim 8 , wherein the at least one processor is further configured to:

select some codeword candidate combination in the descending order of the posterior probability among the codeword candidates combined after combining the first and second codeword candidates, and

repeat combining of the selected codeword combination and the next codeword candidates to generate the entire codeword combinations for the first to K th blocks.

10. The apparatus of claim 7 , wherein the at least one processor is further configured to:

determine a number of codeword candidates to be selected per block (M) based on the probability among the plurality of codeword candidates, M being an integer greater than 1, and

select M codeword candidates in the descending order of the posterior probability among the plurality of codeword candidates.

11. The apparatus of claim 10 , wherein the at least one processor is further configured to determine the number of codeword candidates to be selected per block (M) based on the posterior probability by determining M based on highest and second highest posterior probabilities of the codeword candidates among the posterior probabilities of the plurality of codeword candidates.

12. The apparatus of claim 7 , wherein the selected codeword candidates are combined into the plurality of codeword combinations in a reverse order.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 13, 2013
From: JEONG, HONGSIL; KIM, SANG-HYO; KIM, JONG-HWAN; RYU, DAEHYEON; MYUNG, SEHO
To: SAMSUNG ELECTRONICS CO., LTD.; SUNGKYUNKWAN UNIVERSITY RESEARCH & BUSINESS FOUNDATION
Reel/Frame 031780/0858 →
Priority Claims (1)
KR 10-2012-0146579 · Dec 14, 2012 · national
Continuity (1)
Related Publication 20140169388A1 · Jun 19, 2014