• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.458-461
• /
• 2000

Variable length codes are often used in entropy coding, but are very vulnerable in noisy environments. Reversible variable length codes, however, muse possible to decode instantaneously in both forward and backward directions, so that more usable data can be retrieved when bit errors occur via transmission. Furthermore, partial decodability is desirable to introduce in the reversible variable length code because ROI (Region Of Interest) decoding function is sometimes required in recent image information systems such as the medical imaging, the digital museum and so on. In this paper, we propose a partially decodable and reversible variable length code by modifying Golomb-Rice code.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.07a
• /
• pp.101-103
• /
• 2010

본 논문에서는 다중 셀 환경의 OFDMA 기반 복호 후 재전송 중계 네트워크를 위한 새로운 부반송파 할당 기법에 대해서 제안한다. 제안된 기법에서는 기지국 간의 채널 정보 공유를 통해 공평성 제한을 가지면서 전체 통신 용량이 최대가 되도록 중계단말기와 수신단말기에 부반송파를 할당한다. 공평성 제한은 각 중계단말기의 최대 전송 전력과 각 수신단말기의 최소 통신 용량에 부과되어 중계단말기가 전력을 과도하게 사용하는 것을 막고 수신단말기가 채널 상태가 좋지 않더라도 최소한의 통신 용량을 확보할 수 있도록 한다. 모의실험 결과 제안된 기법이 대조군인 static기법에 비하여 부반송파 당 더 높은 주파수 효율을 얻는 다는 것을 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3C
• /
• pp.170-174
• /
• 2011

We introduce the network coding which cooperative communication for two-way relay channel. We propose a new network coding scheme using orthogonality for cooperative communication system. The proposed network coding scheme via orthogonal mapping shows better BER performance because proposed scheme weakens error propagation which is disadvantage of DF scheme. And proposed scheme maintains same throughput compared to conventional scheme.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.22 no.3
• /
• pp.354-361
• /
• 2011

In this paper, we propose a spectrum sharing system that enable secondary user's spectrum access in cooperative communication scheme. At phase 1, a transmitter in primary system broadcasts signals to the rest nodes. And then, at phase 2, a transmitter in secondary system combines the decoded signals after received from a transmitter in primary system and its own signal. And then transmitter of secondary system broadcasts the combined signals to receivers of primary and secondary systems. At this time, due to the process of combining signals, receivers of primary and secondary systems experiences a performance degradation. Therefore, we propose a novel adaptive incremental decode-andforward(AIDF) protocol to overcome this problem. By using AIDF protocol, we show performance improvement of total system through various simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1594-1617
• /
• 2018

In this paper, we consider a spectrum access scenario which consists of two groups of users, namely Primary Users (PUs) and Secondary Users (SUs) in Cooperative Cognitive Radio Networks (CCRNs). SUs cooperatively relay PUs messages based on Amplify-and-Forward (AF) and Decode-and-Forward (DF) cooperative techniques, in exchange for accessing some of the spectrum for their secondary communications. From the literatures, we found that the Conventional Distributed Algorithm (CDA) and Pragmatic Distributed Algorithm (PDA) aim to maximize the PU sum-rate resulting in a lower sum-rate for the SU. In this contribution, we have investigated a suit of distributed matching algorithms. More specifically, we investigated SU-based CDA (CDA-SU) and SU-based PDA (PDA-SU) that maximize the SU sum-rate. We have also proposed the All User-based PDA (PDA-ALL), for maximizing the sum-rates of both PU and SU groups. A comparative study of CDA, PDA, CDA-SU, PDA-SU and PDA-ALL is conducted, and the strength of each scheme is highlighted. Different schemes may be suitable for different applications. All schemes are investigated under the idealistic scenario involving perfect coding and perfect modulation, as well as under practical scenario involving actual coding and actual modulation. Explicitly, our practical scenario considers the adaptive coded modulation based DF schemes for transmission flexibility and efficiency. More specifically, we have considered the Self-Concatenated Convolutional Code (SECCC), which exhibits low complexity, since it invokes only a single encoder and a single decoder. Furthermore, puncturing has been employed for enhancing the bandwidth efficiency of SECCC. As another enhancement, physical layer security has been applied to our system by introducing a unique Advanced Encryption Standard (AES) based puncturing to our SECCC scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7B
• /
• pp.517-527
• /
• 2012

This paper considers a cooperative communication system with a single relay node, where two-layer superposition coding and successive decoding is employed to reduce the expected distortion of a Gaussian source delivered. For the system, we propose a relay scheme which forwards an appropriate relay signal at the relay node, based on the local decoding result of layers and the decoding result of layers at the destination node fed back to the relay node. In the scheme, the relay signal is designed not only by applying decode-and-forward but also by applying amplify-and-forward to reduce the outage probability in final decoding of each layer. The performance of the proposed scheme is evaluated numerically in terms of the expected distortion at various relay locations using outage probabilities derived. The results show that the proposed scheme outperforms the conventional schemes in most cases of the relay location and the gain gets larger when the relay node is closer to the source node in particular.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.6
• /
• pp.99-105
• /
• 2010

The most frequently used noise model for the performance analysis of a communication system is additive white Gaussian noise. However impulsive noise model is more practical for the real communication environments, currently the performance analysis of a communication system in impulsive noise is increasing. In this paper, therefore, the performance of a cooperative system, which is recently one of the most intensive research topics, is derived in impulsive noise. We analytically derive and compare the performance of two opportunistic cooperative diversity systems which have an amplify-and-forward (AF) relaying or a decode-and-forward (DF) relaying. It is noticed that the impulsive noise component is increases with decreasing the average number of impulses in impulsive noise, consequently the performance of two systems is degraded in high SNR region. Also it is shown that the performance of the opportunistic cooperative system with DF relaying is superior to that with AF relaying.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.11
• /
• pp.3026-3045
• /
• 2012

In this paper, diversity-multiplexing tradeoff (DMT) of three-user wireless multiple-antenna cooperative systems is investigated in general fading channels when half-duplex and decode-and-forward relay is employed. Three protocols, i.e., adaptive protocol, receive diversity protocol, and dual-hop relaying protocol, are considered. The general fading channels may include transmit and/or receive correlation and nonzero channel means, and are extensions of independent and identically distributed Rayleigh or Rician fading channels. Firstly, simple DMT expressions are derived for general fading channels with zero channel means and no correlation when users employ arbitrary number of antennas. Explicit DMT expressions are also obtained when all users employ the same number of antennas and the channels between any two users are of the same fading statistics. Finally, the impact of nonzero channel means and/or correlation on DMT is evaluated. It is revealed theoretically that the DMTs depend on the number of antennas at each user, channel means (except for Rayleigh and Rician fading statistics), transmit and/or receive correlation, and the polynomial behavior near zero of the channel gain probability density function. Examples are also provided to illustrate the analysis and results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12A
• /
• pp.1333-1339
• /
• 2004

In IS-95 and IMT-2000 systems using variable code rates and constraint lengths, this paper limits code rate 1/2 and constraint length 3 and states the effective reduction of PM(Path Metric) and BM(Branch Metric) memories and arithmetic comparative calculations with appling PVSL(Prototype Vector Selecting Logic) and LVQ(Learning Vector Quantization) in neural network to simplify systems and to decode forwardly. Regardless of extension of constraint length, this paper presents the new Vierbi decoder and the appied algorithm because new structure and algorithm can apply to the existing Viterbi decoder using only uncomplicated application and verifies the rationality of the proposed Viterbi decoder through VHDL simulation and compares the performance between the proposed Viterbi decoder and the existing.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5943-5962
• /
• 2017

A resource allocation algorithm based on simultaneous wireless information and power transfer (SWIPT) to maximize the system throughput is proposed in orthogonal frequency division multiplexing (OFDM) relay networks. The algorithm formulates the problem under the peak power constraints of the source and each subcarrier (SC), and the energy causality constraint of the relay. With the given SC allocation of the source, we give and prove the optimal propositions of the formulated problem. Then, the formulated problem could be decomposed into two separate throughput maximization sub-problems by setting the total power to transfer energy. Finally, several SC allocation schemes are proposed, which are energy priority scheme, information priority scheme, balanced allocation scheme and exhaustive scheme. The simulation results reveal that the energy priority scheme can significantly reduce computational complexity and achieve approximate performance with the exhaustive scheme.