• International Journal of Internet, Broadcasting and Communication
• /
• 제13권3호
• /
• pp.34-41
• /
• 2021

Recently, a lossless non-successive interference cancellation (SIC) non-orthogonal multiple access (NOMA) implementation has been proposed. Such lossless NOMA without SIC is achieved via correlated superposition coding (SC), in comparison with conventional independent SC. However, only high-correlated SC was investigated in the lossless non-SIC NOMA implementation. Thus, this paper investigates low-correlated SC, especially a lossless interval, owing to low-correlation between signals. First, for the low-correlated SC scheme, we derive the closed-form expressions for the two roots with which the lossless interval is defined. Then, simulations demonstrate that the lossless interval of low-correlated SC NOMA is enlarged, with a degraded middle interval, compared to that of high-correlated SC NOMA. Moreover, we also show that such tendency becomes stronger as the value of the correlation coefficient varies. As a result, the proposed low-correlated SC scheme could be considered as a promising correlated SC scheme, with the enlarged lossless interval in NOMA toward the future sixth-generation (6G) ultra-reliable low-latency communications (URLLC).

• International journal of advanced smart convergence
• /
• 제10권3호
• /
• pp.1-9
• /
• 2021

In the Internet of Thing (IoT) framework, massive machine-type communications (MMTC) have required large spectral efficiency. For this, non-orthogonal multiple access (NOMA) has emerged as an efficient solution. Recently, a non-successive interference cancellation (SIC) NOMA scheme has been implemented without loss. This lossless NOMA without SIC is achieved via correlated superposition coding (SC), in contrast to conventional independent SC. However, conventional minimum high-correlated SC for only 2-user NOMA schemes was investigated in the lossless 2-user non-SIC NOMA implementation. Thus, this paper investigates a 3-user low-correlated SC scheme, especially for an inflated achievable sum rate, with a design of 3-user low-correlated SC. First, we design the 3-user low-correlated SC scheme by taking the minimum sum rate between 3-user SIC NOMA and 3-user non-SIC NOMA, both with correlated SC. Then, simulations demonstrate that the low correlation in the direction of the first user's power allocation inflates the sum rate in the same direction, compared to that of conventional minimum high-correlated SC NOMA, and such inflation due to low correlation is also observed similarly, in the direction of the second user's power allocation. Moreover, we also show that the two low correlations of the first and second users inflates doubly in the both directions of the first and second users' power allocations. As a result, the proposed 3-user low-correlated SC could be considered as a promising scheme, with the inflated sum rate in the future fifth-generation (5G) NOMA networks.

• Journal of Semiconductor Engineering
• /
• 제1권2호
• /
• pp.74-80
• /
• 2020

Due to its superior error correcting performance with affordable hardware complexity, the Polar code becomes one of the most important error correction codes (ECCs) and now intensively examined to check its applicability in various fields. However, Successive Cancellation (SC) decoding that brings the advanced Successive Cancellation List (SCL) decoding suffers from the long latency due to the nature of serial processing limiting the practical implementation. To mitigate this problem, many decoding architectures, mainly divided into pruning and parallel decoding, are presented in previous manuscripts. In this paper, we compare the recent SC decoding architectures and analyze them using a tree structure.

• 전기전자학회논문지
• /
• 제24권2호
• /
• pp.550-558
• /
• 2020

Polar code의 복호 기법 중에 하나인 연속 제거 (successive cancellation; SC) 복호는 순차적으로 복호를 수행해야하는 특성으로 인해 지연시간이 길고, 복호를 위해 필요한 하드웨어 면적이 크다. 이를 극복하기 위하여 다수의 연구들이 진행되었으며, 본 논문에서는 연속 제거 복호를 기반으로 한 복호 기법을 가지치기 (pruning) 복호 기법들과 다중-경로 (multi-path) 복호기법들로 나누어 정리하였다. 가지치기 복호기법에는 SSC (simplified SC), fast-SSC, 신드롬 판단 기반 복호 등이 있으며, 다중-경로 복호 기법에는 2-비트 연속 제거 복호와 redundant-LLR 표현 기반의 복호가 있다. 본 논문에서는 SSC, fast-SSC, 신드롬 판단, 2-비트 연속 제거, 그리고 redundant-LLR 표현 기반의 복호 기법들을 지연시간과 하드웨어 면적 측면에서 비교했으며, 비교 결과 신드롬 판단 기반 복호기법이 지연시간이 가장 짧고, redundant-LLR 표현 기반의 복호가 하드웨어 면적이 가장 작은 복호 기법이다.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제16권5호
• /
• pp.550-556
• /
• 2016

Polar codes are one of the most favorable capacity-achieving codes due to their simple structure and low decoding complexity. However, because of the disappointing decoding performance realized using conventional successive cancellation (SC) decoders, polar codes cannot be used directly in practical applications. In contrast to conventional SC decoders, list SC (SCL) decoders with large list sizes (e.g. 32) achieve performances very close to those of maximum-likelihood (ML) decoders. In SCL decoders with large list sizes, however, hardware increase is a severe problem because an SCL decoder with list size L consists of L copies of an SC decoder. In this paper, we present a low-area SCL decoder architecture that applies the proposed merged processing element-sharing (MPES) algorithm. A merged processing element (MPE) is the basic processing unit in SC decoders, and the required number of MPEs is L(N-1) in conventional SCL decoders. Using the proposed algorithm reduces the number of MPEs by about 70% compared with conventional SCL decoders when the list size is larger than 32.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제15권3호
• /
• pp.427-435
• /
• 2015

This paper presents a high-throughput low-complexity decoder architecture and design technique to implement successive-cancellation (SC) polar decoding. A novel merged processing element with a one's complement scheme, a main frame with optimal internal word length, and optimized feedback part architecture are proposed. Generally, a polar decoder uses a two's complement scheme in merged processing elements, in which a conversion between two's complement and sign-magnitude requires an adder. However, the novel merged processing elements do not require an adder. Moreover, in order to reduce hardware complexity, optimized main frame and feedback part approaches are also presented. A (1024, 512) SC polar decoder was designed and implemented using 40-nm CMOS standard cell technology. Synthesis results show that the proposed SC polar decoder can lead to a 13% reduction in hardware complexity and a higher clock speed compared to conventional decoders.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권5호
• /
• pp.1412-1430
• /
• 2024

The soft cancellation list (SCANL) decoding algorithm for polar codes runs L soft cancellation (SCAN) decoders with different decoding factor graphs. Although it can achieve better decoding performance than SCAN algorithm, it has high latency. In this paper, a fast simplified SCANL (Fast-SSCANL) algorithm that runs L independent Fast-SSCAN decoders is proposed. In Fast-SSCANL decoder, special nodes in each factor graph is identified, and corresponding low-latency decoding approaches for each special node is propose first. Then, syndrome check aided Fast-SSCANL (SC-Fast-SSCANL) algorithm is further put forward. The ordinary nodes satisfied the syndrome check will execute hard decision directly without traversing the factor graph, thereby reducing the decoding latency further. Simulation results show that Fast-SSCANL and SC-Fast-SSCANL algorithms can achieve the same BER performance as the SCANL algorithm with lower latency. Fast-SSCANL algorithm can reduce latency by more than 83% compared with SCANL, and SC-Fast-SSCANL algorithm can reduce more than 85% latency compared with SCANL regardless of code length and code rate.

• 한국전자통신학회논문지
• /
• 제13권5호
• /
• pp.917-922
• /
• 2018

기존의 채널간간섭 자기소거법에서는 표본화창의 길이를 직교 주파수분할다중화의 심볼 길이와 동일하게 정하였다. 이로 인하여 각 부채널의 간섭계수를 구하기 위한 복소연산량이 급격이 증가된다. 이러한 문제점을 해결하기 위하여 본 논문에서는 채널간간섭 자기소거법에서 나타나는 간섭계수에 대한 근사식을 제시한다. 또한, 제시된 근사식을 기반으로 표본화창의 길이를 제한시킬 때 간섭계수의 평균자승오차와 복소연산량을 분석하였다. 그 결과, 제시된 근사식은 원식에 비하여 평균자승오차 면에서 0.01% 미만의 오차를 가지는 것으로 나타났다. 이에 비하여 부채널의 수가 1024인 경우 간섭계수 계산을 위한 연산량은 98% 이상 감소되는 것을 확인하였다. 따라서 제시된 근사식은 자기소거 능력은 거의 변화시키지 않으면서도 연산량을 현저히 감소시킬 수 있으므로 채널간간섭 자기소거법 알고리즘 개발에 유용하게 활용될 수 있을 것으로 기대된다.

• 한국정보통신학회논문지
• /
• 제11권6호
• /
• pp.1150-1155
• /
• 2007

OFDM은 IEEE802.11a와 HiperLAN2와 같은 여러 가지 무선 표준에 적용되고 있는 다중 캐리어 변조 기술이다. OFDM의 문제 중 하나는 송신기와 수신기 캐리어 주파수 사이의 주파수 offset에 민감하다는 것이다. 이러한 주파수 옵셋은 OFDM 심볼에 ICI(Inter-carrier interference)를 유발한다. 본 논문에서는 ICI의 영향을 제거하는 3가지 방법, 즉 ICI self-cancellation(SC), 최대가능도 추정(Maximum Likelihood), 확장 칼만 필터(Extended Kalman Filtering) 방법을 제안하고 성능을 비교 평가한다.

• International journal of advanced smart convergence
• /
• 제9권2호
• /
• pp.68-75
• /
• 2020

Non-orthogonal multiple access (NOMA) has gained the significant attention in the fifth generation (5G) mobile communication, which enables the advanced smart convergence of the artificial intelligence (AI), the internet of things (IoT), and many of the state-of-the-art technologies. Recently, correlated superposition coding (SC) has been proposed in NOMA, to achieve the near-perfect successive interference cancellation (SIC) bit-error rate (BER) performance for the stronger channel users, and to mitigate the severe BER performance degradation for the weaker channel users. In the correlated SC NOMA scheme, the stronger channel user BER performance is even better than the perfect SIC BER performance, for some range of the power allocation factor. However, such excessively good BER performance is not good for the user-fairness, i.e., the more power to the weaker channel user and the less power to the stronger channel user, because the excessively good BER performance of the stronger channel user results in the worse BER performance of the weaker channel user. Therefore, in this paper, we propose the power splitting to establish the user-fairness between both users. First, we derive a closed-form expression for the power splitting factor. Then it is shown that in terms of BER performance, the user-fairness is established between the two users. In result, the power splitting scheme could be considered in correlated SC NOMA for the user-fairness.