• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.8
• /
• pp.3550-3566
• /
• 2020

As a widely used way to exfiltrate information, wireless covert channel (WCC) brings a serious threat to communication security, which enables the wireless communication process to bypass the authorized access control mechanism to disclose information. Unlike the covert channel on the network layer, wireless covert channels on the physical layer (WCC-P) is a new covert communication mode to implement and improve covert wireless communication. Existing WCC-P scheme modulates the secret message bits into the Gaussian noise, which is also called covert digital communication system based on the joint normal distribution (CJND). Finding the existence of this type of covert channel remains a challenging work due to its high undetectability. In this paper, we exploit the square autocorrelation coefficient (SAC) characteristic of the CJND signal to distinguish the covert communication from legitimate communication. We study the sharp increase of the SAC value when the offset is equal to the symbol length, which is caused by embedding secret information. Then, the SAC value of the measured sample is compared with the threshold value to determine whether the measured sample is CJND sample. When the signal-to-noise ratio reaches 20db, the detection accuracy can reach more than 90%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.7
• /
• pp.1427-1436
• /
• 1997

Turbo codes, decoded through an iterative decoding algorithm, habe recently been shown to yidel remarkable coding gains close to theoretical limits in the Gaussian channel environment. This thesis presents the performance of Turbo code through the computer simulation. The performance of modified Turbo code is compared to that of the conventional Turbo codes. The modified Turbo code reduces the time delay in decoding with minimal effect to the performance for voice transmission sytems. To achieve the same performance, random interleaver the size of which is no less than the square root of the original one should be used. Also, the modified Turbo code is applied to MC-CDMA system, and its performance is analyzed under the Rayleigh Fading channel environment. In Rayleigh fading channel environment, due to the amplitude distortion caused by fading, the interleaver of the size twice no less than that in the Gaussian channel enironment was required. In overall, the modified Turbo code maintained the performance of the conventional Turbo code while the time delay in transmission and decoding was reduced at the rate of multiples of two times the squared root of the interleaver size.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.297-298
• /
• 2008

A new equalization method for perpendicular magnetic recording channels is proposed. The proposed equalizer incorporates the Gaussian sum approximation into a Kalman filtering framework to mitigate inter-symbol interference in perpendicular magnetic recording systems. The proposed equalizer consists of a bank of linear equalizers using the Kalman filtering algorithm and its output is obtained by combining the outputs of linear equalizers through the Gaussian sum approximation.

• Journal of Satellite, Information and Communications
• /
• v.9 no.2
• /
• pp.110-113
• /
• 2014

In this paper, we address a problem of finding the optimum inner and outer code rates for a concatenated code in Gaussian binary symmetric channels. Clearly, as the inner code rate decreases, the error detection capability of the inner code increases. However, decreasing the inner code rate implies a decrease in error-correction capability of the outer code when overall code rate is fixed. With this notion in mind, we examine the optimum distribution of redundancy on the outer and inner codes to achieve a maximum performance gain in the concatenated coding scheme. Our analysis shows that the maximum coding gain can be obtained when the inner code rate is maximized and the outer code rate is minimized under the constraint of total code rate is fixed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8B
• /
• pp.1445-1452
• /
• 2000

In general, the communication channel can be modeled as inter-symbol interference(ISI) and additive white gaussian noise channel. Viterbi algorithm is optimum detector for transmitted data at transmitter, but it needs large computational complexity. For the sake of this problem, adaptive equalizers are employed for channel equalization which is not attractive for mixed phase channel. In this paper, we propose the effective new channel equalizer for mixed phase channel and show the better performance than previous equalizers.

• ETRI Journal
• /
• v.26 no.6
• /
• pp.635-640
• /
• 2004

A new low-complexity differential detection technique, fractional multi-bit differential detection (FMDD), is proposed in order to improve the performance of continuous phase modulation (CPM) signals such as Gaussian minimum shift keying (GMSK) and Gaussian frequency shift keying (GFSK). In comparison to conventional one-bit differential detected (1DD) GFSK, the FMDD-employed GFSK provides a signal-to-noise ratio advantage of up to 1.8 dB in an AWGN channel. Thus, the bit-error rate performance of the proposed FMDD is brought close to that of an ideal coherent detection while avoiding the implementation complexity associated with the carrier recovery. In the adjacent channel interference environment, FMDD achieves an even larger SNR advantage compared to 1DD.

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.2E
• /
• pp.47-54
• /
• 1997

This paper presents two results on intersymbol interferences in baseband digital communication over an additive white Gaussian noise channel-the interferences due to mismatched square-root raised-cosine filters, in which the filters have different roll-off factors, and / or due to sampling-time jitter. The result for the mismatched filters is that even the jitter-free sampling causes intersymbol interference and it is negligibly small for a wide range of signal-to-noise ratio up to 10dB, for the roll-off factor ranging from 0.2 to 0.5, the mismatch loss being within 0.1dB from the optimum at around 10-6 .For jitter interference an approximation formula for the bit error probability is derived in case of the matched filters, which shows how the roll-off factors and the amount of jitter affect the system performance. The formula is reasonably accurate.

• ETRI Journal
• /
• v.34 no.4
• /
• pp.641-644
• /
• 2012

The problem of sinusoidal parameter estimation at two channels with common frequency in white Gaussian noise is addressed. By making use of the linear prediction property, an iterative linear least squares (LLS) algorithm for accurate frequency estimation is devised. The remaining parameters are then determined according to the LLS fit with the use of the frequency estimate. It is proven that the variance of the frequency estimate achieves Cram$\acute{e}$r-Rao lower bound at sufficiently small noise conditions.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.198-204
• /
• 2007

For parallel and serially concatenated trellis coded modulation (TCM), improved iterative decoding schemes with a simple mechanism are proposed and their performances are compared with those of conventional decoding schemes. Simulation results have shown that the proposed schemes have provided a considerable decoding gain in additive white Gaussian noise (AWGN) channels and Rayleigh fading channels, even if they can be implemented by a simple modification of conventional decoding algorithms.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.9
• /
• pp.18-25
• /
• 1994

Previously. TCM decoder has been using the Viterbi algorithm that was complex. In order to reduce the complexity of decoder. we proposed the “modified decoding algorithm using the path back method” and the modified decoding algorithm which extends the previous decoding algorithm to be able to applied to TCM decoder in this paper. On the gaussian and impulsive noise channel. Monte-Carlo simulation is used for analyzing the TCM performance and proving the efficiency of proposed decoding algorithm.