BROWSE
Detail
Conference Paper
짧은 오류정정부호를 위한 OSD 알고리즘의 복잡도 분석
Cited - time in 
Share 
Share
- Issue Date
- 2020-08
- Citation
- 대한전자공학회 학술 대회 (하계) 2020, pp.127-130
- Publisher
- 대한전자공학회
- Language
- Korean
- Type
- Conference Paper
- Abstract
- In this paper, we analyze the hardware complexity of the ordered statistics decoding (OSD) algorithm, which is considered as one of the future shortlength error-correction codes due to its MLachieving performance. For fair comparisons, the conventional OSD method is compared to the 5G polar code associated with the same length and rate. By considering the practical systems, in addition, we perform the quantization for each decoding method, presenting the design challenges for realizing OSD approaches in terms of the decoding complexity.
- KSP Keywords
- Error Correction Code(ECC), Hardware Complexity, Polar codes, decoding complexity, decoding method, design challenges, ordered statistics