• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.21 no.9
• /
• pp.965-970
• /
• 2010

Because of a large number of subcarriers, the high PAPR(Peak-to-Average Power Ratio) is the major drawback of NC-OFDM system used for wireless communication system. Comb type pilot assignment is more efficient and lower computational complexity for the channel estimation than the block type pilot. However, even if the CAZAC(Constant Amplitude Zero Autocorrelation) matrix transform is used for the PAPR reduction of the data symbols, PAPR increases when the pilot is inserted in comb type with the data symbols. Therefore, in this paper, we additionally use a new SLM technique in order to lower the PAPR again even in the comb type pilot. Also, a new SLM technique suggested in this paper does not need any additional bandwidth for sending selection information for SLM. This combined method has good PAPR reduction performance and efficient data transmission.

• Journal of IKEEE
• /
• v.24 no.3
• /
• pp.838-844
• /
• 2020

In this paper, we propose an efficient Viterbi processor using Joint Viterbi detection and decoding (JVDD) algorithm for a for bluetooth low energy (BLE) system. Since the convolutional coded Gaussian minimum-shift keying (GMSK) signal is specified in the BLE 5.0 standard, two Viterbi processors are needed for detection and decoding. However, the proposed JVDD scheme uses only one Viterbi processor by modifying the branch metric with inter-symbol interference information from GMSK modulation; therefore, the hardware complexity can be significantly reduced without performance degradation. Low-latency and low-complexity hardware architecture for the proposed JVDD algorithm was proposed, which makes Viterbi decoding completed within one clock cycle. Viterbi Processor RTL synthesis results on a GF55nm process show that the gate count is 12K and the memory unit and the initial latency is reduced by 33% compared to the modified state exchange (MSE).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12C
• /
• pp.1135-1141
• /
• 2007

In this paper, an adaptive bit-reliability mapping is proposed for the bit-level Chase combining in LDPC-coded high-order modulation systems. Contrary to the previously known bit-reliability mapping that assigns the information (or parity) bits to more (or less) reliable bit positions, the proposed mapping adaptively assigns codeword bits to the bit positions of various reliabilities by considering the characteristics of code and protection levels of bits in high-order modulation symbol. Compared with the symbol-level Chase combining and the constellation rearrangement bit mapping, the proposed mapping gives $0.7{\sim}1.3$ dB and $0.1{\sim}1.0$ dB performance gain at $FER=10^{-3}$ with no additional complexity, respectively. Adaptive bit-reliability mappings are derived for various environments and the validity of them is confirmed through simulation.

• Journal of Broadcast Engineering
• /
• v.10 no.2
• /
• pp.166-173
• /
• 2005

In this paper, we propose a mobile channel estimation algorithm using matching pursuit algorithm for orthogonal frequency division multiplexing (OFDM) systems. Least square (LS) algorithm, which is used as a conventional channel estimation algorithm for OFDM systems, has error probability of channel estimation affected by effects of noise. By estimating the channel of sparse type, the proposed algorithm reduces effects of noise during time intervals that multi-path signal doesn't exist. The proposed algorithm estimates a mobile receivingchannel using pilot information transmitted consequently. We compare performance of the proposed algorithm with the LS algorithm by measuring symbol error rate with 64QAM under a mobile multi-path fading channel model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4A
• /
• pp.322-331
• /
• 2010

This paper introduces a new efficient design scheme for spatial multiplexing (SM) systems over closed loop multiple-input multiple-output (MIMO) wireless channels. Extending the orthogonalized spatial multiplexing (OSM) scheme which was developed recently for transmitting two data streams, we propose a new SM scheme where a larger number of data streams can be supported. To achieve this goal, we partition the data streams into several subblocks and execute the block-diagonalization process at the receiver. The proposed scheme still guarantees single-symbol maximum likelihood (ML) detection with small feedback information. Simulation results verify that the proposed scheme achieves a huge performance gain at a bit error rate (BER) of $10^{-4}$ over conventional closed-loop schemes based on minimum mean-square error (MSE) or bit error rate (BER) criterion. We also show that an additional 2.5dB gain can be obtained by optimizing the group selection with extra feedback information.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.9 s.339
• /
• pp.41-48
• /
• 2005

In this paper, we suggest the scheme combining long-term feedback and short-term feedback in MIMO multi-user system and analyze its system performance. At the beginning of communication, long-term feedback is fed back to transmitter such as the number of active antennas, constellations, and transmission powers which are determined to satisfy the given target symbol error and target data rate for each user. After this, short-term feedback of active antenna index is fed back periodically Simulation results show the proposed scheme outperforms better than long-term feedback or short-term feedback information scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.9C
• /
• pp.855-862
• /
• 2009

The path key establishment phase in the wireless sensor network is vulnerable to Byzantine attack. Huang and Hedhi proposed a Byzantine resilient multi-key establishment scheme using a systematic RS code, which has shortcomings of exposing a part of message symbols and inefficient transmission. In this paper, we propose a new Byzantine resilient multi-path key establishment scheme in which direct message symbols are not exposed to an adversary and are more efficiently transmitted the RS-encoded symbols to the destination node. In the Proposed scheme, a non-systematic RS code is used to transmit a generated indirect secret key and each encoded symbol is relayed through available paths between two sensor nodes. If enough symbols are collected at the destination node, it is possible to reconstruct the secret message through RS decoding.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.5
• /
• pp.723-729
• /
• 2011

In this paper, we simulate and evaluate the performance of MIMO systems adopting MMSE-OSUC receiver algorithm under Rayleigh fading channel environment. In the simulation, BPSK, QPSK, 16QAM, and 64QAM modulation is used with frame length of 100 symbols. First, the concept of MIMO is introduced by the analytical basis of the channel capacity of MIMO system. From the performance analysis results, the channel capacity is identified by the function of channel and it is affected by the channel characteristic. Next, based on this approach, the algorithm for performance evaluation over MIMO channel was analyzed. From the performance analysis results, it is found that MMSE-OSUC receiver algorithm generally outperform conventional ZF-OUSC receiver algorithm in performance but the performance difference between the two algorithms is reduced as modulation scheme with larger constellation point is used.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.1
• /
• pp.35-47
• /
• 2002

This paper proposes a self organizing RBF neural network equalizer for the equalization of digital communications. It is the most important for the equalizer using the RBF neural network to estimate the RBF centers correctly and quickly, which are the desired channel states. However, the previous RBF equalizers are not used in the actual communication system because of some drawbacks that the number of channel states has to be known in advance and many centers are necessary. Self organizing neural network equalizer proposed in this paper can implement the equalization without prior information regarding the number of channel states because it selects RBF centers among the signals that are transmitted to the equalizer by the new addition and removal criteria. Furthermore, the proposed equalizer has a merit that is able to make a equalization with fewer centers than those of prior one by the course of the training using LMS and clustering algorithm. In the linear, nonlinear and standard telephone channel, the proposed equalizer is compared with the optimal Bayesian equalizer for the BER performance, the symbol decision boundary and the number of centers. As a result of the comparison, we can confirm that the proposed equalizer has almost similar performance with the Bavesian enualizer.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.2
• /
• pp.56-68
• /
• 2002

The Universal Variable Length Coding(UVLC) scheme in H.26L has nice features such as error resiliency and two-way decodability. However, it has lower coding efficiency than the conventional Huffman coding. To improve the coding efficiency of UVLC, we Propose to use a dynamic codeword mapping that changes association between symbols and codewords in order to utilize the statistical characteristics of symbols as much as possible but without losing any features of the UVLC. Both encoder and decoder use the same re-association table, and hence the encoder need not send additional overhead for the re-mapping relationship to the decoder. Simulation results show that without significant change of the current H.26L coding scheme, the proposed method additionally attains up to about 8% and about 5% bit reductions respectively in intra and inter frames over the current H.26L encoding method.