• ETRI Journal
• /
• v.34 no.1
• /
• pp.110-113
• /
• 2012

We propose a very-low-complexity lattice-reduction (LR) algorithm for multi-input multi-output detection in time-varying channels. The proposed scheme reduces the complexity by performing LR in a block-wise manner. The proposed scheme takes advantage of the temporal correlation of the channel matrices in a block and its impact on the lattice transformation matrices during the LR process. From this, the proposed scheme can skip a number of redundant LR processes for consecutive channel matrices and performs a single LR in a block. As the Doppler frequency decreases, the complexity reduction efficiency becomes more significant.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.411-412
• /
• 2006

In this paper, we proposed a fast algorithm for inter prediction included the most complexity in H.264/AVC. It decide search range according to direction of predicted motion vector, and then perform adaptive candidate spiral search. Simultaneously, it perform motion estimation of variable loop with threshold for variable block size. Conclusively, it is implemented in JM FME with high complexity applying to rate-distortion optimization. Experimental results show that significant complexity reduction is achieved while the degradation in video quality is negligible.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.2
• /
• pp.673-694
• /
• 2021

In this paper, we intend to study the energy efficiency (EE) optimization for a simultaneous wireless information and power transfer (SWIPT)-based distributed antenna system (DAS). Firstly, a DAS-SWIPT model is formulated, whose goal is to maximize the EE of the system. Next, we propose an optimal resource allocation method by means of the Karush-Kuhn-Tucker condition as well as an ergodic method. Considering the complexity of the ergodic method, a suboptimal scheme with lower complexity is proposed by using an antenna selection scheme. Numerical results illustrate that our suboptimal method is able to achieve satisfactory performance of EE similar to an optimal one while reducing the calculation complexity.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.14 no.5
• /
• pp.977-984
• /
• 2019

This paper proposes a single image dehazing that utilizes the transmission estimation with low complexity and the pixel-based JBDCP (Joint Bright and Dark Channel Prior) for the effective application of hazy outdoor images. The conventional transmission estimation includes the refinement process with high computational complexity and memory requirements. We propose the transmission estimation using combination of pixel- and block-based dark channel information and it significantly reduces the complexity while preserving the edge information accurately. Moreover, it is possible to estimate the transmission reflecting the image characteristics, by obtaining a different air-light for each pixel position of the image using the pixel-based JBDCP. Experimental results on various hazy images illustrate that the proposed method exhibits excellent dehazing performance with low complexity compared to the conventional methods; thus, it can be applied in various fields including real-time devices.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.6
• /
• pp.1055-1062
• /
• 2022

In order to use the Massive MIMO (Multi Input Multi Output) technology using the massive array antenna, it is essential to know the angle of arrival (AOA) of the signal. When using a massive array antenna, the existing AOA estimation algorithm has excellent estimation performance, but also has a disadvantage in that computational complexity increases in proportion to the number of antenna elements. To solve this problem, a cascade AOA estimation algorithm has been proposed and the performance of a single-shaped (non)massive array antenna has been proven through a number of papers. However, the computational complexity of the cascade AOA estimation algorithm to which single and double rim array antennas are applied has not been compared. In this paper, we compare and analyze the computational complexity for AOA estimation when single and double rim array antennas are applied to the cascade AOA estimation algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.6
• /
• pp.1195-1201
• /
• 2005

This paper deals with procedures and results for teal time implementation of G.729 speech coder and channel coder including convolution codec, viterbi decoder, and interleaver using a fixed point DSP chip for radio communication systems. We described the method for real-time implementation based on integer simulation results and explained the implemented results by quality performance and required complexity for real-time operation. The required complexity was 24MIPS and 9MIPS in computational load, and 12K words and 4K words in execution code length for speech and channel. The functional evaluation was performed into two steps. The one was bit exact comparison with a fixed point C code, the other was executed by actual speech samples and error test vectors. Unlik other results such as individual implementation, We implemented speech and channel coders on a DSP chip with 160MIPS computation capability and 64 K words memory on chip. This results outweigh the conventional methods in the point of system complexity and implementation cost for radio communication system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.8
• /
• pp.975-980
• /
• 2019

In this paper, we propose a deep learning-based scheduling scheme for user selection in multi-user multi-antenna networks which is considered one of key technologies for the next generation mobile communication systems. We obtained 90,000 data samples from the conventional optimal scheme to train the proposed neural network and verified the trained neural network to check if the trained neural network is over-fitted. Although the proposed neural network-based scheduling algorithm requires considerable complexity and time for training in the initial stage, it does not cause any extra complexity once it has been trained successfully. On the other hand, the conventional optimal scheme continuously requires the same complexity of computations for every scheduling. According to extensive computer-simulations, the proposed deep learning-based scheduling algorithm yields about 88~96% average sum-rates of the conventional scheme for SNRs lower than 10dB, while it can achieve optimal average sum-rates for SNRs higher than 10dB.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.3
• /
• pp.79-89
• /
• 2011

Recent development of embedded processors makes it possible to play back video contents in real-time on portable devices. Because of their limited battery capacity and low computational performance, however, portable devices still have significant problems in real-time decoding of high quality or high resolution compressed video. Although previous approaches are successful in achieving complexity-scalable decoder by controlling computational complexity of decoding elements, they cause significant objective quality loss coming from mismatch between encoder and decoder. In this paper, we propose a selective B slice skip-decoding method to implement a low complexity video decoder. The proposed method performs selective skip decoding process of B slice which satisfies the proposed conditions. The skipped slices are reconstructed by simple reconstruction method utilizing adjacent reconstructed pictures. Experimental result shows that proposed method not only reduces computational complexity but also maintains subjective visual quality.

• Journal of Positioning, Navigation, and Timing
• /
• v.2 no.1
• /
• pp.1-8
• /
• 2013

A signal system for improving the code acquisition complexity of Global Navigation Satellite System (GNSS) receiver is proposed and the receiving correlator scheme is presented accordingly. The proposed signal system is a hierarchical code type with a duplexing configuration which consists of the Zadoff-Chu (ZC) code having a good auto-correlation characteristic and the Pseudo Random Noise (PRN) code for distinguishing satellites. The receiving correlator has the scheme that consists of the primary correlator for the ZC code and the secondary correlator which uses the PRN code for the primary correlation results. The simulation results of code acquisition using the receiving correlator of the proposed signal system show that the proposed signal scheme improves the complexity of GNSS receiver and has the code acquisition performance comparable to the existing GNSS signal system using Coarse/Acquisition (C/A) code.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.1198-1212
• /
• 2013

Network virtualization enables autonomous and heterogeneous Virtual Networks (VNs) to co-exist on a shared physical substrate. In a Network Virtualization Environment (NVE), the fact that individual VNs are underpinned by diverse naming mechanisms brings about an obvious challenge for transparent communication across multiple VN domains due to the complexity of uniquely identifying users. Existing solutions were mainly proposed compatible to Internet paradigm with little consideration of their applications in a virtualized environment. This calls for a scalable and efficient naming framework to enable consistent communication across a large user population (fixed or mobile) hosted by multiple VNs. This paper highlights the underlying technical requirements and presents a scalable Global Naming Framework (GNF), which (1) enables transparent communication across multiple VNs owned by the same or different SPs; (2) supports communication in the presence of dynamics induced from both VN and end users; and (3) greatly reduces the network operational complexity (space and time). The suggested approach is assessed through extensive simulation experiments for a range of network scenarios. The numerical result clearly verifies its effectiveness and scalability which enables its application in a large-scale NVE without significant deployment and management hurdles.