• Journal of Electrical Engineering and information Science
• /
• v.1 no.1
• /
• pp.23-28
• /
• 1996

In this series of two papers, adaptive code rate change schemes in DS-SSMA systems are proposed. In the proposed schemes the error correcting code rate is changed according to the channel states. Two channel states having significant effects on the bit error probability are considered: one is the effective number of users considered in Part 1, and the other is the fading environment considered in Part 2. These channel states are estimated based on retransmission requests. The criterion for the change of the code rate is to maximize the throughput under given error bound. Simulation results show that we can transmit maximum amount of information if we change the code rate based on the channel states.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1A
• /
• pp.34-42
• /
• 2012

Low density parity check (LDPC) code is widely used, since it shows superior performance close to Shannon limit and its decoding complexity is lower than turbo code. Recently, it is used as a channel code to decode Wyner-Ziv frames in distributed video coding (DVC) system. In this paper, we propose an efficient method to design the parity check matrix H of LDPC codes. In order to apply LDPC code to DVC system, the LDPC code should have rate compatibility. Thus, we also propose a method to merge check nodes of LDPC code to attain the rate compatibility. LDPC code is designed using ACE algorithm and check nodes are merged for a given code rate to maximize the error correction capability. The performance of the designed LDPC code is analyzed extensively by computer simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.8
• /
• pp.3749-3768
• /
• 2018

As one of the most potential types of low-density parity-check (LDPC) codes, CPM-QC-LDPC code has considerable advantages but there still exist some limitations in practical application, for example, the existing decoding algorithm has a low convergence rate and a high decoding complexity. According to the structural property of this code, we propose a new method based on a CPM-RID decoding algorithm that decodes block-by-block with weights, which are obtained by neural network training. From the simulation results, we can conclude that our proposed method not only improves the bit error rate and frame error rate performance but also increases the convergence rate, when compared with the original CPM-RID decoding algorithm and scaled MSA algorithm.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.4
• /
• pp.112-120
• /
• 2006

Multicarrier code division multiple access(MC-CDMA) system that combines multicarrier modulation with CDMA offers robustness to frequency selective fading and can support higher rate data transmission with higher spectral efficiency. A new asynchronous MC-CDMA system to implement multiple data rate communications is proposed in this paper. In a W-CDMA downlink the orthogonal variable spreading factor(OVSF) code is used for variable spreading factor for various multimedia traffic. Proposed system utilizes the OVSF code that generated by generation property for spreading. The proposed MC-CDMA system use different lengths of OVSF code as a spreading code according to their data rate. The groupwise processing is accomplished by code grouping in OVSF code generation tree. For the analysis of average BER performance, numerical method and computer simulation were used. We also compare the system performance with that of a single rate MC-CDMA system used orthogonal code as a spreading code.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.649-652
• /
• 2004

In this paper, a concatenated RS and Turbo code is proposed for OFDM system over burst error channel. The concatenated code used in this study is a RS(255,2D2) code and a rate 1/2 turbo code. The turbo code uses 2 recursive systematic convolutional (RSC) code as the constituent codes and the parity bit are punctured to get the desired code rate. It is shown by simulation that the conventional OFDM system fails when there exists burst noise. The concatenated RS and turbo code obtains at least 5dB gain over the turbo code at the bit error probability of $10^{-3}$.

• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.2
• /
• pp.17-22
• /
• 2004

In this paper, a concatenated RS and Turbo code is proposed for OFDM system over burst error channel. The concatenated code used in this study is a RS(255,202) code and a rate 1/2 turbo code. The turbo code uses 2 recursive systematic convolutional (RSC) code as the constituent codes and the parity bit are punctured to get the desired code rate. It is shown by simulation that the conventional OFDM system fails when there exists burst noise. The concatenated RS and turbo code obtains at least 5dB gain over the turbo code at the bit error probability of 10/sup -3/.

• Journal of Korea Multimedia Society
• /
• v.24 no.8
• /
• pp.1012-1019
• /
• 2021

Currently, since the black-white QR (Quick Response) codes have limited storage capacity, color QR codes have been actively being studied. By multiplexing 3 colors, the color QR codes can allow the code capacity to be increased by three times, however, the color multiplexing brings about the possibility of crosstalk and noises in the acquisition process of the final image, incurring the decrease of bit-recognition rate. In order to improve the bit recognition rate, while keeping the storage capacity high, this paper proposes a new type of color QR code which uses the pattern information as well as the color information, and then analyzes how to increase the bit recognition rate. For this aim, the paper presents an efficient system which extracts embedded information from color QR code and then, through practical experiments, it is shown that the proposed color QR codes improves the bit recognition rate and are useful for commercial applications, compared to the conventional color codes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4C
• /
• pp.200-206
• /
• 2005

Adaptive transmission techniques can improve the performance of wireless communication system by adaptively changing the transmission parameter such as modulation, code-rate, and power according to the channel state. For orthogonal frequency division multiplexing (OFDM) system, the adaptive transmission techniques can be applied to each subcarrier unit. In this paper, we consider the adaptive code-rate OFDM system in which optimal code-rate is applied to each subcarrier according to the subchannel state. Performance analysis show that $3\sim6$dB gain of SNR or up to $30\sim50\%$ increase of data rate are achieved in the condition of bit error rate $10^{-6}$.

• Journal of electromagnetic engineering and science
• /
• v.11 no.2
• /
• pp.133-142
• /
• 2011

Coded cooperation that integrates channel coding in cooperative transmission has gained a great deal of interest in wireless relay networks. The performance analysis of coded cooperation protocol with multiple relays is investigated in this paper. We show that the diversity order achieved by the coded cooperation in a multi-relay wireless network is not only dependent on the number of cooperating relays but is also dependent on the code-rate of the system. We derive the code-rate bound, which is required to achieve the full diversity gain of the order of cooperating nodes. The code-rate required to achieve full diversity is a linearly decreasing function of the number of available relays in the network. We show that the instantaneous channel state information (CSI)-based relay selection can effectively alleviate this code-rate bound. Analysis shows that the coded cooperation with instantaneous CSI-based relay selection can achieve the full diversity, for an arbitrary number of relays, with a fixed code-rate. Finally, we develop tight upper bounds for the bit error rate (BER) and frame error rate (FER) of the relay selection based on coded cooperation under a Rayleigh fading environment. The analytical upper bounds are verified with simulation results.

• Nuclear Engineering and Technology
• /
• v.55 no.6
• /
• pp.1966-1973
• /
• 2023

Virtual reality technology has been widely used in the field of nuclear and radiation safety, dose rate computing in virtual environment is essential for optimizing radiation protection and planning the work in radioactive-controlled area. Because the CPU-based gamma dose rate computing takes up a large amount of time and computing power for voxelization of volumetric radioactive source, it is inefficient and limited in its applied scope. This study is to develop an efficient gamma dose rate computing code and apply into fast virtual simulation. To improve the computing efficiency of the point kernel algorithm in the reference (Li et al., 2020), we design a GPU-based computing framework for taking full advantage of computing power of virtual engine, propose a novel voxelization algorithm of volumetric radioactive source. According to the framework, we develop the GPPK(GPU-based point kernel gamma dose rate computing) code using GPU programming, to realize the fast dose rate computing in virtual world. The test results show that the GPPK code is play and plug for different scenarios of virtual simulation, has a better performance than CPU-based gamma dose rate computing code, especially on the voxelization of three-dimensional (3D) model. The accuracy of dose rates from the proposed method is in the acceptable range.