8 July 2019 in IEEE Communications Letters
Ordered statistics-based decoding (OSD), which exhibits a near maximum likelihood decoding performance, suffers from huge computational complexity as the order increases. In this letter, we propose a fast and scalable OSD by considering OSD as a fast searching problem. In the searching process, if the up-to-date minimum cost value is less than a predicted threshold value, then we can safely skip the search for remaining higher orders. The computational complexity of the proposed algorithm converges quickly to that of order one, regardless of the maximum order. Compared with the probabilistic necessary conditions based OSD, the proposed algorithm exhibits speed-up gains of a factor of approximately 2,740 (at 3.0dB) for (127,64) BCH codes, with an indistinguishable decoding performance.
26 July 2021 in IEEE Communications Letters
The Gaussian elimination algorithm is an essential part of the ordered statistics-based decoding (OSD); the algorithm is required to be executed at least once for a typical OSD algorithm, with its computational complexity serving as the lower bound of the total computational complexity. When the signal-to-noise ratio (SNR) is relatively low, the computational complexity of the Gaussian elimination algorithm can be ignored as the decoding process is relatively complex. However, with an increase in the SNR, this cannot be ignored. In this paper, we propose a fast soft decision decoding algorithm using templates that are precalculated and permuted generator matrices, enabling us to decode a received vector without having to perform the OSD algorithm. In particular, if the Hamming distance between the received vector and the candidate codeword generated by one of the templates is less than a certain threshold, we can terminate the decoding process without executing the typical OSD algorithm. This aids in reducing the computational complexity in high SNR regimes without compromising the decoding performance.
19 October 2018 in IEEE Transactions on Aerospace and Electronic Systems
It is well known that the distribution of the ranks of random matrices follows a specific distribution. By partitioning ranks into two possible outcomes, we can transform the estimating interleaver parameters into the counting of success events. Using this probabilistic framework, we can efficiently determine interleaver parameters in a noncooperative context.
1 October 2021 in Digital Signal Processing
21 December 2017 in The Journal of Korean Institute of Information Technology
본 논문에서는 랜덤 정방 행렬의 차원 분포와 쿨백-라이블러 발산을 이용하여, 인터리버의 파라미터들을 추정하는 알고리즘을 제안한다. 특정한 갈루아 필드 위의 랜덤 정방 행렬의 차원 분포는 항상 특정한 분포를 따른다. 오류 정정 부호화되고 인터리빙을 거친 데이터의 경우는 선형 의존성으로 인해서 인터리버 주기 l과 같은 크기의 l×l 정방 행렬을 만들었을 때, 랜덤한 정방 행렬의 차원과는 전혀 다른 차원 분포를 갖게 된다. 이때, 랜덤 정방 행렬의 차원 분포와 가장 다른 차원 분포를 갖는 특정 길이를 찾기 위해서 쿨백-라이블러 발산을 활용한다. 모의 실험 결과를 통해서, 제안하는 방법이 기존의 방법보다 검출 성능 및 오경보 확률에서 월등히 좋은 결과를 나타냄을 확인하였다.