• Nuclear Engineering and Technology
• /
• v.11 no.3
• /
• pp.219-229
• /
• 1979

The current status of the computational methods and computer codes for the analysis of reactor kinetics is reviewed. Computational methods which have been developed for space-dependent transient analyses are presented and recent progress in the development of methods is discussed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.3
• /
• pp.9-14
• /
• 2009

Recently, a rate-2, $2{\times}2$ space-time code with simple ML decoding has been designed. Though the simple ML decoding algorithm does reduce the ML decoding complexity, there is still need for improvement. In this paper, we propose an efficient decoding algorithm for the rate-2, $2{\times}2$ space-time code using interference cancellation techniques with performance virtually identical to that of ML decoding. Also, the decoding complexity of the proposed algorithm is significantly reduced compared to the conventional simple ML decoding, especially for large modulation orders.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.1-8
• /
• 2004

In this paper, we investigate the properties and performance of space-time bit-interleaved coded modulation (STBICM) systems in fast Rayleigh fading channels. We first show that ST-BICM with QPSK signaling in fast fading channels possesses the uniform distance property, which makes performance analysis tractable. We also derive the probability distribution of the squared Euclidean distance between space-time symbols assuming uniform bit-interleaving. Based on the distribution, we show that the diversity order for each codeword pair becomes maximized as the frame length becomes sufficiently long. This maximum diversity order property implies that the bit-interleaver transforms an ST-BICM system over transmit diversity channels into an equivalent coded BPSK system over independent fading channels. We analyze the performance of ST-BICM in fast fading channels by deriving an FER upper bound. The derived bound turns out very accurate, requiring only the distance spectrum of the binary channel codes of ST-BICM. Numerical results demonstrate that the bound is tight enough to render an accurate estimate of performance of ST-BICM systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3A
• /
• pp.324-330
• /
• 2004

In this paper, we propose the TCM(Trellis coded modulation) decoding scheme that reduces the number of operations in branch metric with STBC(space time block codes) channel information and present the implementation results. The proposed TCM decoding scheme needs only 1 signal point in each TCM subset. Using bias point scheme, It detects the minimum distance symbol. The proposed TCM decoding scheme can reduce the branch metric calculations. In case of 16QAM 8 subset, the reduction ratio is about 50％ and for 64QAM 8 subset, about 80％ reduction can be obtained. The results of logic synthesis for the TCM and STBC decoder with the proposed scheme are 57.6K gate count.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.83-98
• /
• 2014

We reformulate an interpolation-based unique decoding algorithm of AG codes, using the theory of Gr$\ddot{o}$bner bases of modules on the coordinate ring of the base curve. The conceptual description of the reformulated algorithm lets us better understand the majority voting procedure, which is central in the interpolation-based unique decoding. Moreover the smaller Gr$\ddot{o}$bner bases imply smaller space and time complexity of the algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.3
• /
• pp.167-167
• /
• 2004

The system combined layered space-time processing and space-time trellis codes (STTC) provide high transmission rate as well as diversity and coding gain without bandwidth expansion. In this paper, two layered receiver structures are proposed. One is the LSTT-MMSE in which received bit streams are decoupled by interference nulling and then decoded by separate STTC decoders. The decoded outputs are cancelled from the received signal before advancing to the next layer detection. The other is LSTT-Whitening employing whitening rather than nulling. The receiver employing whitening process shows several advantages on diversity gain and the required number of receive antennas compare to the convolutional coded space-time processing. The proposed receivers use different decoding order scheme according to each interference suwression. The (4, 3) LSTT-Whitening receiver still achieves 1㏈ gain over the (4, 4) LSTT-MMSE and the (4, 4) coded layered space-time processing.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.3
• /
• pp.9-14
• /
• 2004

The system combined layered space-time processing and space-time trellis codes (STTC) provide high transmission rate as well as diversity and coding gain without bandwidth expansion. In this paper, two layered receiver structures are proposed. One is the LSTT-MMSE in which received bit streams are decoupled by interference nulling and then decoded by separate STTC decoders. The decoded outputs are cancelled from the received signal before advancing to the next layer detection. The other is LSTT-Whitening employing whitening rather than nulling. The receiver employing whitening process shows several advantages on diversity gain and the required number of receive antennas compare to the convolutional coded space-time processing. The proposed receivers use different decoding order scheme according to each interference suwression. The (4, 3) LSTT-Whitening receiver still achieves 1㏈ gain over the (4, 4) LSTT-MMSE and the (4, 4) coded layered space-time processing.

• ETRI Journal
• /
• v.45 no.1
• /
• pp.7-17
• /
• 2023

The error-rate floor of low-density parity-check (LDPC) codes is attributed to the trapping sets of their Tanner graphs. Among them, fully absorbing sets dominantly affect the error-rate performance, especially for short blocklengths. Efficient methods to identify the dominant trapping sets of LDPC codes were thoroughly researched as exhaustively searching them is NP-hard. However, the existing methods are ineffective for Raptor-like LDPC codes, which have many types of trapping sets. An effective method to identify dominant fully absorbing sets of Raptor-like LDPC codes is proposed. The search space of the proposed algorithm is optimized into the Tanner subgraphs of the codes to afford time-efficiency and search-effectiveness. For 5G New Radio (NR) base graph (BG) 2 LDPC codes for short blocklengths, the proposed algorithm finds more dominant fully absorbing sets within one seventh of the computation time of the existing search algorithm, and its search-effectiveness is verified using importance sampling. The proposed method is also applied to 5G NR BG1 LDPC code and Advanced Television Systems Committee 3.0 type A LDPC code for large blocklengths.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.895-901
• /
• 2016

The next generation wireless and satellite communications require high transmission efficiency and high reliability to provide various services with subscribers. To satisfied these requirements, incorporated MIMO (Multiple Input Multiple Output) system with FTN (Faster Than Nyquist) techniques based on layered space time coded method are considered in the paper. To improve performance, STTC (Space Time Trellis Code) was employed as an inner code. As the same as SISO (Single Input Single Output) system, the outer codes are turbo codes. In receiver side, BCJR algorithm is used for STTC decoding in order to eliminate interferences induced by FTN transmission. They can yield significantly increased the data rates and improved link reliability without additional bandwidth. Therefore, we proposed a new decoding model for MIMO FTN model and confirmed that performance was improved compared to conventional SISO model according to amount of interference for FTN.

• Journal of Advanced Navigation Technology
• /
• v.6 no.2
• /
• pp.130-137
• /
• 2002

We present Space-Time Trellis Coded Code Division Multiple Access systems, which maintain the full diversity and coding gain of Space-Time Trellis Codes(STTC) and have the immunity to performance degradation caused by multipath fading. These STTC CDMA systems are constructed by adding the spreading and despreading processes of PN codes to STTC systems. In multipath fading channels, delay spreaded signals are detected and combined, then decoded. According to the combining and decoding methods, there are four decoding methods. There are optimum ML decoding without combining, adding multipath signals in each receive antenna before decoding, combining multi path signals in each antenna before decoding, and combining all received signals before decoding. Performance of these methods is proportional to complexity. Besides, all methods are shown to compensate the irreducible error rate which appears in multipath fading channels.