• International Journal of Internet, Broadcasting and Communication
• /
• v.13 no.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
• /
• v.10 no.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
• /
• v.1 no.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.

• Journal of IKEEE
• /
• v.24 no.2
• /
• pp.550-558
• /
• 2020

Successive cancellation (SC) decoding that is one of the decoding algorithms for polar codes has long decoding latency and low throughput because of the nature of successive decoding. To reduce the latency and increase the throughput, various decoding structures for polar codes are presented. In this paper, we compare the previous decoding structures and analyze them by dividing into two types, pruning and multi-path decoders. Decoders for applying pruning are representative of SSC (simplified SC), Fast-SSC and redundant-LLR structures, and decoders with multi-path are representative of 2-bit SC and redundant-LLR structures. All the previous structures are compared in terms decoding latency and hardware area, and according to the comparison, the syndrome check based decoder has the lowest latency and redundant-LLR decoder has the highest hardware efficiency.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.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
• /
• v.15 no.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)
• /
• v.18 no.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.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.5
• /
• pp.917-922
• /
• 2018

In the conventional interchannel interference self-cancellation (ICI-SC) schemes, the length of sampling window is the same as the symbol length of orthogonal frequency division multiplexing (OFDM). Thus, the number of complex operations to compute the interference coefficient of each subchannel is significantly increased. To solve this problem, we present an approximated mathematical model for the coefficients of ICI-SC schemes. Based on the proposed approximation, we analyze mean squared error (MSE) and computational complexity of the ICI-SC schemes with the length of sampling window. As a result, the presented approximation has an error of less than 0.01% on the MSE compared to the original equation. When the number of subchannels is 1024, the number of complex computations for the interference coefficients is reduced by 98% or more. Since the computational complexity can be remarkably reduced without sacrificing the self-cancellation capability, it is considered that the proposed approximation is very useful to develop an algorithm for the ICI-SC scheme.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.6
• /
• pp.1150-1155
• /
• 2007

Orthogonal Frequency Division Multiplexing (OFDM) is an emerging multi-carrier modulation scheme, which has been adopted for several wireless standards such as IEEE 802.11a and HiperLAN2. A well-known problem of OFDM is its sensitivity to frequency offset between the transmitted and received carrier frequencies. This frequency offset introduces inter-carrier interference (ICI) in the OFDM symbol. This paper investigates three methods for combating the effects of ICI: ICI self-cancellation (SC), maximum likelihood (ML) estimation, and extended Kalman filter (EKF) method. These three methods are compared in terms of bit error rate performance.

• International journal of advanced smart convergence
• /
• v.9 no.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.