• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.12-20
• /
• 2015

Convolutional codes which are terminated by direct truncation (DT) and zero tail termination provide unequal error protection. When DT terminated convolutional codes are used to encode short messages, they have interesting error protection properties. Such codes match the significance of the output bits of common quantizers and therefore lead to a low mean square error (MSE) when they are used to encode quantizer outputs which are transmitted via a noisy digital communication system. A code construction method that allows adapting the code to the channel is introduced, which is based on time-varying convolutional codes. We can show by simulations that DT terminated convolutional codes lead to a lower MSE than standard block codes for all channel conditions. Furthermore, we develop an MSE approximation which is based on an upper bound on the error probability per information bit. By means of this MSE approximation, we compare the convolutional codes to linear unequal error protection code construction methods from the literature for code dimensions which are relevant in analog to digital conversion systems. In numerous situations, the DT terminated convolutional codes have the lowest MSE among all codes.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.187-196
• /
• 2003

We consider the use of error control coding in direct sequence-code-division multiple access (OS-COMA) systems that employ multiuser detection (MUO) and space diversity. The relative performance gain between Reed-Solomon (RS) code and convolutional code (CC) is well known in [1] for the single user, additive white Gaussian noise (AWGN) channel. In this case, RS codes outperform CC's at high signal-to-noise ratios. We find that this is not the case for the multiuser interference channel mentioned above. For useful error rates, we find that soft-decision CC's to be uniformly better than RS codes when used with DS-COMA modulation in multiuser space-time channels. In our development, we use the Gaussian approximation on the interference to determine performance error bounds for systems with low number of users. Then, we check their accuracy in error rate estimation via system's simulation. These performance bounds will in turn allow us to consider a large number of users where we can estimate the gain in user-capacity due to channel coding. Lastly, the use of turbo codes is considered where it is shown that they offer a coding gain of 2.5 dB relative to soft-decision CC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2074-2079
• /
• 1997

Much recent work has been done in the two related areas of source coding for data compression, and channel coding for data storage, respectively. We propose two (0, k) run-lengh limited(RLL) data compression codes for the storage that combine source and channel coding. It was shown that the propsoed codes approach the maximum code rate of (0, k) code as k increase. Thus, the overall code rate of storage system can be increased by using the combined source/channel coding as compared to the conventional 8/9 code which is popular in hard drive systems Functhermore, one can also reduce the complexity of modulation coding procedure by using already RLL constrained data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.9
• /
• pp.739-743
• /
• 2013

In this paper, a two-dimensional (2-D) channel code for magnetic patterned media is proposed. Patterned media records an information bit on a magnetized dot. Since the space between adjacent tracks is narrow in order to increase the storage density, inter-track interference (ITI) and inter-symbol interference (ISI) can be problems. The amplitude of a bit signal can be corrupted by the 2-D ISI. The signal of the bit surrounded by the same value can be especially destructive, i.e. when its value is the same as the values of the eight surrounding bits. The proposed modulation coding scheme improves the decoding performance of patterned media by preventing this worst case and provides a better code rate than conventional channel codes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.941-955
• /
• 2015

In dual-channel networks (DCNs), all frequency hopping (FH) sequences used for data channels are chosen from the original FH sequence used for the control channel by shifting different initial phases. As the number of data channels increases, the hitting frequency point problem becomes considerably serious because DCNs is non-orthogonal synchronization network and FH sequences are non-orthogonal. The increasing severity of the hitting frequency point problem consequently reduces the resource utilization efficiency. To solve this problem, we propose a novel hitting frequency point collision avoidance method, which consists of a sequence-selection strategy called sliding correlation (SC) and a collision avoidance strategy called keeping silent on hitting frequency point (KSHF). SC is used to find the optimal phase-shifted FH sequence with the minimum number of hitting frequency points for a new data channel. The hitting frequency points and their locations in this optimal sequence are also derived for KSHF according to SC strategy. In KSHF, the transceivers transmit or receive symbol information not on the hitting frequency point, but on the next frequency point during the next FH period. Analytical and simulation results demonstrate that unlike the traditional method, the proposed method can effectively reduce the number of hitting frequency points and improve the efficiency of the code resource utilization.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.6
• /
• pp.175-185
• /
• 2009

In this paper, performance of OFDM systems with turbo code is analyzed and simulated in a satellite broadcasting channel. The performance is evaluated in terms of bit error probability. The satellite channel is modeled as a combination of Rayleigh fading with shadowing and Rician fading channels. As turbo decoding algorithms, MAP (maximum a posteriori), Max-Log-MAP, and SOVA (soft decision Viterbi output) algorithms are chosen and their performances are compared. From simulation results, it is demonstrated that Max-Log-MAP algorithm is promising in terms of performance and complexity. It is shown that performance is substantially improved by increasing the number of iterations and interleaver length of a turbo encoder. The results in this paper can be applied to OFDM-based satellite broadcasting systems.

• Journal of Broadcast Engineering
• /
• v.16 no.2
• /
• pp.226-236
• /
• 2011

In this paper, we propose the channel estimation for the space time coded-orthogonal frequency division multiplexing (ST-OFDM) muti-input multi-output (MIMO) system with comb type pilot arrangements. In the conventional method, specially constructed pilots are inserted in the OFDM symbols at all transmit antennas separately. The proposed algorithm multiplies the orthogonal code to be transmitted OFDM symbols to estimate channels at the receiver. This algorithm can estimate a long channel delay with high accuracy. It is proved by computer simulations.

• Journal of Communications and Networks
• /
• v.15 no.1
• /
• pp.8-14
• /
• 2013

For alleviating the low spectrum efficiency problem of orthogonal frequency division multiplexing (OFDM), due to the strong inter-cell-interference (ICI) at cell's edge, we introduce comb-spectrum code division multiple access (CS-CDMA) into broadband OFDM system at downlink channel for enabling the use of entire spectrum for seamless coverage. In addition, we develop a new method, called orthogonal cell code (OCC) scheme, to assist CS-CDMA for nullifying the ICI from contiguous cells. In system operation, each of the conventional cells is divided into an outer cell and an inner cell, and a mobile station (MS) should access to the CS-CDMA when it is in the outer cell and access to OFDM when it is in the inner cell. This study investigates the spectrum efficiency of using CS-CDMA and makes a comparison with that of long term evolution (LTE) in the following cases; (1) under an assumption of perfect channel state information and (2) based on channel estimates at a MS station. The results show the great advantage of utilizing the proposed system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.05a
• /
• pp.199-204
• /
• 2000

In this paper, we study single-user receiver, which applicable to DS-CDMA downlink. DS-CDMA downlink mainly use wallsh code, its orthogonality may be lost by the multiple access interference(MAI) caused by the multipath channel. In this paper, we use linear channel equalizer to eliminate the interference due to multipath channel and then to recover orthogonalit and use code-matched filter to detect transmitted data. Unlike existing research, which mainly assumed ideal channel information, we use pilot channel to estimate the channel coefficients. Especially we use guard symbols which are inserted periodically to estimate channel coefficients exactly without interference from user signal, and we accept an approximately ideal. The results show that improvement can be achieved using proposed detectors compared with that of that conventional RAKE receiver, especially when the user population is high we accepts excellent performance improvement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.5
• /
• pp.951-958
• /
• 2017

In an attack context, the adversary wants to retrieve the message from the intercepted noisy bit stream without any prior knowledge of the channel codes used. The process of finding out the code parameters such as code length, dimension, and generator, for this purpose, is called the blind recognition of channel codes or the reconstruction of channel codes. In this paper, we suggest an improved algorithm of the blind recovery of rate k/n convolutional encoders in a noisy environment. The suggested algorithm improves the existing algorithm by Marazin, et. al. by evaluating the threshold value through the estimation of the channel error probability of the BSC. By applying the soft decision method by Shaojing, et. al., we considerably enhance the success rate of the channel reconstruction.