• Proceedings of the KIEE Conference
• /
• summer
• /
• pp.325-326
• /
• 2004

전력선통신(PLC: Power Line Communication)은 기존의 전기선을 이용하여 별도의 전용선 설치 없이 통신이 가능한 기술로서 효율적인 PLC 통신을 위해서는 가장 기본적인 기저대역의 송, 수신부상 의 원활한 데이터 전송이 이루어져야 한다. 본 논문에서는 확산대역방식의 PLC통신시스템의 수신부의 핵심모듈인 정합필터를 HDL(hardware description language)을 이용한 디지털 하드웨어인 에 위한 디지털 하드웨어인 FPGA(Field Programmable Gate Array)클 이용하여 구현하였다. 즉, 본 논문에서는 BPSK(Binary Phase Shift Keying) 변조 및 256칩 확산코드를 이용한 확산변조파형에 대한 디지털 정합필터를 FPGA로 구현하고 상관특성을 확인함으로서 모의실험상의 파형과 구현된 하드웨어상의 상관파형이 일치함을 확인하였다.

• 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.

• Journal of Broadcast Engineering
• /
• v.16 no.6
• /
• pp.1026-1035
• /
• 2011

This paper presents generalization and application for the conventional SISO decoding algorithm of Block Turbo Codes. R. M. Pyndiah suggested an iterative SISO decoding algorithm for Product Codes, two-dimensionally combined linear block codes, on AWGN channel. It wascalled Block Turbo Codes. Based on decision of Chase algorithm which is SIHO decoding method, SISO decoder for BTC computes soft decision information and transfers the information to next decoder for iterative decoding. Block Turbo Codes show Shannon limit approaching performance with a little iteration at high code rate on AWGN channel. In this paper we generalize the conventional decoding algorithm of Block Turbo Codes, under BPSK modulation and AWGN channel transmission assumption, to the LLR value based algorithm and suggest an application example such as concatenated structure of LDPC codes and Block Turbo Codes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.5
• /
• pp.869-876
• /
• 2001

In modern wireless communication, it has been regarded as a important problem for the spectrum efficiency to utilize the limited frequency-resource efficiently. In addition, the system architecture has been designed for low cost, low power consumption and ultra-lightweight. In this paper, we directly modulated the BCPFSK with a superior spectrum efficiency using the DDS and applied the direct conversion to the system architecture. Finally, we designed a transceiver which has the 433 MHz BCPFSK output and evaluated the system performance. In the measured result, we know that as for spectrum and the power efficiency, BCPFSK method is better than conventional one. Also, the results of the designed system is 433.92 MHz in center frequency and about 33 dBc in carrier suppression ratio. And we get the better results in local oscillator leakage and the spurious of the ISM out-band the same as -69dBc and under 60dBc.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5381-5399
• /
• 2016

Currently, the quantize-and-forward (QF) scheme with high order modulation and quantization has rather high complexity and it is thus impractical, especially in multiple relay cooperative communications. To overcome these deficiencies, an improved low complex QF scheme is proposed by the combination of the low order binary phase shift keying (BPSK) modulation and the 1-bit and 2-bit quantization, respectively. In this scheme, the relay selection is optimized by the best relay position for best bit-error-rate (BER) performance, where the relays are located closely to the destination node. In addition, an optimal power allocation is also suggested on a total power constraint. Finally, the BER and the achievable rate of the low order 1-bit, 2-bit and 3-bit QF schemes are simulated and analyzed. Simulation results indicate that the 3-bit QF scheme has about 1.8~5 dB, 4.5~7.5 dB and 1~2.5 dB performance gains than those of the decode-and-forward (DF), the 1-bit and 2-bit QF schemes, at BER of $10^{-2}$, respectively. For the 2-bit QF, the scheme of the normalized Source-Relay (S-R) distance with 0.9 has about 5dB, 7.5dB, 9dB and 15dB gains than those of the distance with 0.7, 0.5, 0.3 and 0.1, respectively, at BER of $10^{-3}$. In addition, the proposed optimal power allocation saves about 2.5dB much more relay power on an average than that of the fixed power allocation. Therefore, the proposed QF scheme can obtain excellent features, such as good BER performance, low complexity and high power efficiency, which make it much pragmatic in the future cooperative communications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.5
• /
• pp.805-814
• /
• 1994

In this paper, we introduce a new method which is available for analyzing the throughput of the packet radio network by using the auxiliary Markov transient matrix with a failure state and a success state. And we consider the effect of symbol error for the network state(X, R) consisted of the number of transmitting PRU X and receiving PRU R. We examine the packet radio network of a continuous time Markov chain model, and the direct sequence binary phase shift keying CDMA radio channel with hard decision Viterbi decoding and bit-by-bit changing spreading code. For the unslotted distributed multi-hop packet radio network, we assume that the packet error due to a symbol error of radio channel has Poisson process, and the time period of an error occurrence is exponentially distributed. Through the throughputs which are found as a function of radio channel parameters, such as the received signal to noise ratio and chips of spreading code per symbol, and of network parameters, such as the number of PRU and offered traffic rate, it is shown that this composite analysis enables us to combine the Markovian packet radio network model with a coded DS/BPSK CDMA radio channel.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.6
• /
• pp.995-1002
• /
• 2020

This paper investigates the achievable data rate for non-orthogonal multiple access(NOMA) with correlated information sources(CIS), under the binary phase shift keying(BPSK) modulation, in contrast to most of the existing NOMA designs using continuous Gaussian input modulations. First, the closed-form expression for the achievable data rate of NOMA with CIS and BPSK is derived, for both users. Then it is shown by numerical results that for the stronger channel user, the achievable data rate of CIS reduces, compared with that of independent information sources( IIS). We also demonstrate that for the weaker channel user, the achievable data rate of CIS increases, compared with that of IIS. In addition, the intensive analyses of the probability density function(PDF) of the observation and the inter-user interferennce(IUI) are provided to verify our theoretical results.