• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.1
• /
• pp.53-63
• /
• 1986

In this paper the decoder of nonbinary code satisfying R>1/t has been designed and constructed, where R is the code rate and t is the error correcting capability. In order to design the error trapping decoder, the concept of covering monomial is used and them the decoder system using the (15, 11) Reed-Solomon code is implemented. Without Galois Fiedl multiplication and division circuits, the decoder system is simply constructed. In the decoding process, it takes 60clocks to decode one code word. Two symbol errors and eight binary burst errors are simultaneously corrected. This coding system is shown to be efficient when the channel error probability is approximately from $5{\times}10^-4$~$5{\times}10^-5$.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.5 no.3 s.11
• /
• pp.13-23
• /
• 2006

The system using UWB is processing brisk study with Bluetooth among the wireless access that is major technology in Telematics. The low complexity and cost for realization is advantage of UWB have communication of high speed. Mamy papers have published on the timing jitter effect on system performance except for the UWB system. In this paper, we analyze the effect of timing jitter on M-ary UWB system using orthogonal Hermite pulse and perform the simulation to show symbol error rate performance. For theoretical analysis, we derive correlation function of orthogonal Hermits pulse with closed form, and as well upper bound of Symbol Error Probability for M-ary orthogonal Hermite pulse system mathematically. It is found that numerical analysis is accurate enough through simulation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.4
• /
• pp.1-8
• /
• 2012

This paper presents a method for obtaining an exact average symbol error rate (ASER) of M-ary Phase Shift Keying (MPSK) for opportunistic amplify-and-forward (OAF) relay systems over Rayleigh fading channels. This is based on the relay selection probability when a relay is selected as the best one with respect to the received signal-to-noise ratio. We then derive the modified moment generating function (MGF) for OAF relay systems by taking the given relay selection probability into consideration. Based on the modified MGF, we derive the exact ASER which accurately explicates OAF relay system characteristics. Our results confirm that the derived ASER provides a tight upper bound for OAF relay systems.

• International Journal of Computer Science & Network Security
• /
• v.24 no.2
• /
• pp.95-100
• /
• 2024

Cyclic Delay Diversity (CDD) is a diversity scheme used in OFDM-based telecommunication systems, transforming spatial diversity into frequency diversity and thus avoiding intersymbol interference without entailing the receiver to be aware of the transmission strategy making the signal more reliable achieving full diversity gain in cooperative systems. Here the analyzation of the influence of CDD-SC scheme in Cognitive Radio Network (CRN) is done with the challenge of overcoming the complication called channel estimation along with overhead in CNR. More specifically, the closed-form expressions for outage probability and symbol error rate are divided under different frequencies among independent and identically distributed (i.i.d.) frequency selective fading channel model i.e., the signal is divided into different frequencies and transmitted among several narrow band channels of different characteristics. It is useful in the reduction of interference and crosstalk. The results reveal the diversity order of the proposed system to be mainly affected by the number of multipath components that are available in the CNR.

• International Journal of Computer Science & Network Security
• /
• v.21 no.3
• /
• pp.48-54
• /
• 2021

Security is an important issue for wireless communications and poses many challenges. Most security schemes have been applied to the upper layers of communications networks. Since in a typical wireless communication, transmission of data is over the air, third party receiver(s) may have easy access to the transmitted data. This work examines a new security technique at the physical layer for the sake of enhancing the protection of wireless communications against eavesdroppers. We examine the issue of secret communication through Rayleigh fading channel in the presence of an eavesdropper in which the transmitter knows the channel state information of both the main and eavesdropper channel. Then, we analyze the capacity of the main channel and eavesdropper channel we also analyze for the symbol error rate of the main channel, and the outage probability is obtained for the main transmission. This work elucidate that the proposed security technique can safely complement other Security approaches implemented in the upper layers of the communication network. Lastly, we implement the results in Mat lab

• ETRI Journal
• /
• v.34 no.4
• /
• pp.637-640
• /
• 2012

The Davey-MacKay construction is a promising concatenated coding scheme involving an outer $2^k$-ary code and an inner code of rate k/n, for insertion-deletion-substitution channels. Recently, a lookup table (LUT)-based inner decoder for this coding scheme was proposed to reduce the computational complexity of the inner decoder, albeit at the expense of a slight degradation in word error rate (WER) performance. In this letter, we show that negligible deterioration in WER performance can be achieved with an LUT as small as $7{\cdot}2^{k+n-1}$, but no smaller, when the probability of receiving less than n-1 or greater than n+1 bits corresponding to one outer code symbol is at least an order of magnitude smaller than the WER when no LUT is used.

• Journal of electromagnetic engineering and science
• /
• v.4 no.4
• /
• pp.190-196
• /
• 2004

An alternative solution to the problem of obtaining acceptable performances on a fading channel is the diversity technique, which is widely used to combat the fading effects of time-variant channels. The symbol error probability of M-ary DPSK(MDPSK), PSK(MPSK) and QAM(MQAM) systems using 2 branches from the branch with the largest signal-to-noise ratio(SNR) at the output of L-branch selection combining(SC), i.e., SC2 in frequency- nonselective slow Nakagami fading channels with an additive white Gaussian noise(AWGN) is derived theoretically. These performance evaluations allow designers to determine M-ary modulation methods for Nakagami fading channels.

• Journal of electromagnetic engineering and science
• /
• v.7 no.1
• /
• pp.35-41
• /
• 2007

An alternative solution to the problem of obtaining acceptable performances on a fading channel is the diversity technique, which is widely used to combat the fading effects of time-variant channels. The symbol error probability of M-ary DPSK (MDPSK), PSK (MPSK) and QAM (MQAM) systems using 2 branches from the branch with the largest signal-to-noise ratio(SNR) at the output of L-branch selection combining(SC), i.e., SC2 in frequency-nonselective slow Nakagami fading channels with an additive white Gaussian noise(AWGN) is derived theoretically. These performance evaluations allow designers to determine M-ary modulation methods against Nakagami fading channels.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.42-45
• /
• 1998

Adaptive array antenas have emerged as a useful technique to enhance the cell capacity of mobile communications. In this research, to analyze the noncoherent CDMA systems employing adaptive array antennas, we modeled the transmitting signal of CDMA systems using M-ary orthogonal modulation. And we induced the conditional probability density function about the decision variable, the output of 2D-RAKE receiver and mean symbol error prabability through statistical analysis about MAI(Multiple Access Interference), SI(Self Interference) and Noise. Also, we analyzed the charateristics of adaptive array antenna for noncoherent CDMA systems using M-ary orthogonal modulation according to the distance between the array elements, doppler frequency and AOS(Angle of Spread).

• Journal of Communications and Networks
• /
• v.11 no.6
• /
• pp.564-573
• /
• 2009

In this paper, we consider a wireless multiple path network in which a transmitting node would like to send a message to the receiving node with a certain probability of success. These two nodes are separated by N erasure paths, and we devise two algorithms to determine minimum redundancy and optimal symbol allocation for this setup. We discuss the case with N = 3 and then extend the case to an arbitrary number of paths. One of the algorithms minimum redundancy algorithm in exponential time is shown to be optimal in several cases, but has exponential running time. The other algorithm, minimum redundancy algorithm in polynomial time, is sub-optimal but has polynomial worstcase running time. These algorithms are based off the theory of maximum-distance separable codes. We apply the MRAET algorithm on maximum-distance separable, Luby transform, and Raptor codes and compare their performance.