• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8C
• /
• pp.645-654
• /
• 2012

In this paper, we consider a two-way relay (TWR) system, where two user nodes exchange their information within two transmission phases, by the help of a relay node adopting physical layer network coding. In the system, two users transmit their binary phase shift keying symbols simultaneously in the first phase, and the relay node decodes the XORed version of two user data and broadcasts it back to two users in the second phase. The performance of the system is analyzed in terms of the average end-to-end symbol error probability in Nakagami-m fading channels, for which a tight upper bound is derived in a closed form to provide an accurate and handy estimate on the performance. The results show that our upper bounds are almost indistinguishable from simulation results for various channel and system configurations. In addition, the optimal relay location and power allocation for various conditions can be obtained quickly with our analysis.

• Proceedings of the KIEE Conference
• /
• 2003.11b
• /
• pp.295-298
• /
• 2003

In this paper, a novel maximum a posterion (MAP) estimation for the channel decoding of H.264 codes in the presence of transmission error is presented. Arithmetic codes with a forbidden symbol and trellis search techniques are employed in order to estimate the best transmitted. And, there has been growing interest of communication, the research about transmission of exact data is increasing. Unlike the case of voice transmission, noise has a fatal effect on the image transmission. The reason is that video coding standards have used the variable length coding. So, only one bit error affects the all video data compressed before resynchronization. For reasons of that, channel needs the channel codec, which is robust to channel error. But, usual channel decoder corrects the error only by channel error probability. So, designing source codec and channel codec, Instead of separating them, it is tried to combine them jointly. And many researches used the information of source redundancy In received data. But, these methods do not match to the video coding standards, because video ceding standards use not only one symbol but also many symbols in same data sequence. In this thesis, We try to design combined source-channel codec that is compatible with video coding standards. This MAP decoder is proposed by adding semantic structure and semantic constraint of video coding standards to the method using redundancy of the MAP decoders proposed previously. Then, We get the better performance than usual channel coder's.

• Journal of electromagnetic engineering and science
• /
• v.12 no.1
• /
• pp.8-12
• /
• 2012

In this paper, we evaluate performances of dual-hop decode-and-forward relaying systems with the $N^{th}$ best-relay selection scheme. In some schemes, such as scheduling or load balancing schemes, the best relay is unavailable and hence the system must resort the second best, third best, or generally the $N^{th}$ best relay. We derive the expressions of the outage probability and symbol error rate (SER) for this scenario over Rayleigh fading channels. Monte-Carlo simulations are presented to verify the analytical results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11C
• /
• pp.885-888
• /
• 2010

It is known that triangular QAM with triangular signal constellations gets better SER gain than square QAM with rectangular signal constellations. In the paper, we propose an exact and general closed-form expression of the probability of symbol error for generalized TQAM, which has been currently researched. We verify that the simulation is consistent with the derived equation of generalized TQAM. And, we also suggest the optimal signal constellation schemes for generalized TQAM at given SNR values.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.450-461
• /
• 2005

In this paper, we derive analytical expressions for the exact pairwise error probability (PEP) of a space-time coded system operating over spatially correlated fast (constant over the duration of a symbol) and slow (constant over the length of a code word) fad­ing channels using a moment-generating function-based approach. We discuss two analytical techniques that can be used to evaluate the exact-PEPs (and therefore, approximate the average bit error probability (BEP)) in closed form. These analytical expressions are more realistic than previously published PEP expressions as they fully account for antenna spacing, antenna geometries (uniform linear array, uniform grid array, uniform circular array, etc.) and scattering models (uniform, Gaussian, Laplacian, Von-mises, etc.). Inclusion of spatial information in these expressions provides valuable insights into the physical factors determining the performance of a space-time code. Using these new PEP expressions, we investigate the effect of antenna spacing, antenna geometries and azimuth power distribution parameters (angle of arrival/departure and angular spread) on the performance of a four-state QPSK space-time trellis code proposed by Tarokh et al. for two transmit antennas.

• International Journal of Computer Science & Network Security
• /
• v.22 no.12
• /
• pp.51-56
• /
• 2022

In space based constellation network, users are allowed to enter or leave the network arbitrarily. Hence, the number, identities and transmitted data of active users vary with time and have considerable impacts on the receiver's performance. The so-called problem of multiuser detection means identifying the identity of each active user and detecting the data transmitted by each active user. Traditional methods assume that the number of active users is equal to the maximum number of users that the network can hold. The model of traditional methods are simple and the performance are suboptimal. In this paper a Maximum A Posteriori Probability (MAP) based multiuser detection method is proposed. The proposed method models the activity state of users as Markov chain and transforms multiuser detection into searching optimal path in grid map with BCJR algorithm. Simulation results indicate that the proposed method obtains 2.6dB and 1dB E_b/N₀ gains respectively when activity detection error rate and symbol error rate reach 10^-3, comparing with reference methods.

• The Journal of the Acoustical Society of Korea
• /
• v.31 no.7
• /
• pp.441-448
• /
• 2012

Spread spectrum provides the minimized inter-symbol interference, the low probability of intercept and the multiple access capability. This paper presents a direct sequence spread spectrum with carrier/timing recovery and equalizer which compensates the delay spread caused by multipath transmission. When the sea trials were performed in Korean East Sea, the bit error rates of QPSK and direct sequence spread spectrum are $1.46{\times}10^{-2}$ and $5.17{\times}10^{-4}$ at 3 km source-receiver range, respectively.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.6
• /
• pp.635-641
• /
• 2010

Time-varying channel characteristics in OFDM systems over doubly selective channels cause inter-carrier interferences(ICI) in the frequency domain. Time domain windowing gives rise to restriction on the bandwidth of the frequency domain channel matrix and makes it possible to approximate the OFDM system as a simplified linear input-output model. When successive interference cancellation based on linear MMSE estimation is employed for channel equalization in OFDM systems, symbol detection ordering produces considerable effects on overall system performances. In this paper, we show the reduction of the residual ICI by time domain windowing and the resultant performance improvements, and investigate the effects of SINR- and CSEP-based symbol detection ordering on the performance of successive interference cancellation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.10
• /
• pp.2121-2128
• /
• 2012

This paper proposed the real time face area detection using Wavelet transform and the strong detection algorithm that satisfies the efficiency of computation and detection performance at the same time was proposed. The detected face image recognizes the face by configuring the low-dimensional face symbol through the principal component analysis. The proposed method is well suited for real-time system construction because it doesn't require a lot of computation compared to the existing geometric feature-based method or appearance-based method and it can maintain high recognition rate using the minimum amount of information. In addition, in order to reduce the wrong recognition or recognition error occurred during face recognition, the input symbol of Hidden Markov Model is used by configuring the feature values projected to the unique space as a certain symbol through clustering algorithm. By doing so, any input face will be recognized as a face model that has the highest probability. As a result of experiment, when comparing the existing method Euclidean and Mahananobis, the proposed method showed superior recognition performance in incorrect matching or matching error.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.4
• /
• pp.285-301
• /
• 1988

The symbol error rate equations of multi-level quadrature PRS(QPRS) system have been derived in the individual and composite environment of Gaussian/impulsive noise, cochannel CW interference, carrier offset, phase jitter and fading. And using the derived error rate equations, the probability of error has been evaluated and shown in graphs as functions of carrier to noise power ratio, carrier to interference power ratio, phase error, impulsive index, the ration of Gaussian noise to impulsive noise power component, signal to noise power ration in phase locked loop(PLL), and fading figures. The rseults show that the error rate performances are generally more more degraded by impulsive noise than by Gaussian noise. But on the contrary the erors occurred more frequently by Gaussian noise than impulsive noise in a fading environment.