• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.299-310
• /
• 2016

In practical wireless relay communication systems, non-destination nodes are assumed to be idle not receiving signals while the relay sends messages to a particular destination node, which results in reduced bandwidth efficiency. To improve the bandwidth efficiency, we relax the idle assumption of non-destination nodes and assume that non-destination nodes may receive signals from sources. We note that the message relayed to a particular node in such a system gives rise to interference to other nodes. To study such a more general relay system, we consider, in this paper, a relay system in which the relay first listens to the source, then routes the source message to the destination, and finally produces interference to the destination in sending messages for other systems. We obtain capacity upper and lower bounds and study the optimal method to deal with the interference as well as the optimal routing schemes. From analytic results obtained, we find the conditions on which the direct transmission provides higher transmission rate. Next, we find the conditions, by numerical evaluation of the theoretical results, on which it is better for the destination to cancel and decode the interference. Also we find the optimal source power allocation scheme that achieves the lower bound depending on various channel conditions. We believe that the results provided in this paper will provide useful insights to system designers in strategically choosing the optimal routing algorithms depending on the channel conditions.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.9
• /
• pp.1-10
• /
• 2000

This paper proposes symbol decoding schemes combined with channel estimation techniques for coded orthogonal frequency division multiplexing (COFDM) systems in fading channels. sThe proposed symbol decoding schemes are consisted of a symbol decoding technique and channel estimation techniques. The symbol decoding based on Viterbi algorithm is achieved by matching the length of branch word from encoder trellis to the codeword length of symbol candidate on decoder trellis. Three combination schemes are described and their error performances are compared. The first scheme is to combine a symbol decoding technique with a training channel estimation technique. The second scheme joins a decision directed channel estimation technique to the first scheme. The time varying channel transfer functions are tracked by the decision directed channel estimation technique and the channel transfer functions used in the symbol decoder are updated every COFDM symbol. Finally, In order to reduce the effect of additive white Gaussian noise (AWGN) between adjacent subchannels, deinterleaved average channel estimation technique is combined. The error performances of the three schemes are significantly improved being compared with that of zero forcing equalizing schemes.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.326-329
• /
• 2011

안개나 스모그 등으로 인한 영상의 왜곡에 대해 Dark Channel Prior 를 이용해 안개제거를 하면 깨끗한 결과 영상을 얻을 수 있다. 하지만 이 기법에서 전달량을 정련할 때 많은 시간이 걸리는데 계산 속도 면을 개선하기 위해 Gaussian Filter 를 사용해 정련한다. 이 때 단순한 Gaussian Filter 를 사용하게 되면 결과영상에서 후광효과가 생기게 된다. 후광효과를 줄이기 위해 본 논문에서 제안한 적응 Gaussian Filter 를 사용해 영상을 복원시킨다.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.663-666
• /
• 2004

In this paper, a modified-SOYA (soft output viterbi algorithm) of turbo codes is proposed for quantized channel receiver filter outputs. We derive optimum branch values for the Viterbi algorithm. Here we assume that received filter outputs are quantized and the channel is additive white Gaussian noise. The optimum non-uniform quantizer is used to quantize channel receiver filter outputs. To compare the BER (bit error rate) performance we perform simulations for the modified SOYA algorithm and the general SOYA

• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.17-20
• /
• 2000

This paper addresses a novel algorithm for variable rate channel coding with interleaver punctured convolutional code for wireless communication. In other to increase the coding performance and achieve the variable channel coding rate, serially concatenated convolutional coding scheme will be applied. In this paper, we characterize the effect of interleaver puncturing on the effectiveness of the proposed scheme some simulation results are presented, in which the channel model of additive Gaussian noise is assumed.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.165-168
• /
• 2000

The bit error rate(BER)of the data passed through Wideband-Code Division Multiple Access (W-CDMA) system with turbo-codes structure is presented. The performance of turbo-codes under W-CDMA system is estimated for various users and iteration numbers of decoding. The channel model is Additive White Gaussian Noise(AWGN) and Rayleigh fading channel. When iteration number increases, bit error probability of turbo-codes decreases. and when the number of users increase, bit error probability of turbo-codes increases.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.173-176
• /
• 2000

The fact that the channel coding methode with property of the source coder is better than using the channel characteristics is well known. In this paper We propose the UEP channel coding scheme using IP-SCCC and DCT-based embedded coder for image transmission. Moreover, to evaluate the effectiveness of the proposed scheme some simulation results are presented, in which the channel models of additive white Gaussian noise and Rayleigh fading are assumed.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1986.04a
• /
• pp.1-3
• /
• 1986

We are concerned with transmitting numerical source data of {0, 1, 2, ..., 2k-1} through a channel coding system. The rate 1/v dual-k convolutional code with the orthogonal MFSK modulation and the Viterbl decoding is employed for the implementation of the channel coding system. The mean square error of the dual-k convolutional code is evaluated for the numerical source transmitted over an additive white Gaussian noise channel with Rayleigh fading.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.655-658
• /
• 1999

In this study, We derived Recursive Least Squares(RLS) algorithm with adaptive maximum -likelihood channel estimate for digital pulse amplitude modulated sequence in the presence of intersymbol interference and additive white Gaussian noise. RLS algorithms have better convergence characteristics than conventional algorithms, LMS Least Mean Squares) algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.3
• /
• pp.651-656
• /
• 2014

This paper analyzed the change of subthreshold swing for channel doping of asymmetric double gate(DG) MOSFET. The subthreshold swing is the factor to describe the decreasing rate of off current in the subthreshold region, and plays a very important role in application of digital circuits. Poisson's equation was used to analyze the subthreshold swing for asymmetric DGMOSFET. Asymmetric DGMOSFET could be fabricated with the different top and bottom gate oxide thickness and bias voltage unlike symmetric DGMOSFET. It is investigated in this paper how the doping in channel, gate oxide thickness and gate bias voltages for asymmetric DGMOSFET influenced on subthreshold swing. Gaussian function had been used as doping distribution in solving the Poisson's equation, and the change of subthreshold swing was observed for projected range and standard projected deviation used as parameters of Gaussian distribution. Resultly, the subthreshold swing was greatly changed for doping concentration and profiles, and gate oxide thickness and bias voltage had a big impact on subthreshold swing.