• Journal of Communications and Networks
• /
• v.5 no.2
• /
• pp.150-156
• /
• 2003

In this paper, an uplink MC-CDMA system incorporating multiuser detection and smart antennas has been considered. The performance of asynchronous as well as synchronous system is studied over a correlated Rayleigh multipath slow fading channel. A simplified array-processing algorithm suitable for slow fading situation is investigated to overcome the heavy computational complexity associated with Eigen solutions. The effect of variable data rate in the system performance is considered and effectiveness of antenna array to handle high data rate is discussed. A brief investigation on the system performance degradation due to correlated channel is also carried out. Based on the extensive simulation carried out, the performance of the asynchronous uplink system is found dramatically improved with antenna array and multiuser detection. Asynchronicity and channel correlation are found to affect the system performance significantly. The investigated simpli- fied algorithm produces similar results as Eigen solutions in slow fading situation with much reduced complexity.

• ETRI Journal
• /
• v.35 no.6
• /
• pp.949-959
• /
• 2013

Since the recent launch of Microsoft Xbox Kinect, research on 3D human pose estimation has attracted a lot of attention in the computer vision community. Kinect shows impressive estimation accuracy and real-time performance on massive graphics processing unit hardware. In this paper, we focus on further reducing the computation complexity of the existing state-of-the-art method to make the real-time 3D human pose estimation functionality applicable to devices with lower computing power. As a result, we propose two simple approaches to speed up the random-forest-based human pose estimation method. In the original algorithm, the random forest classifier is applied to all pixels of the segmented human depth image. We first use a multi-scale approach to reduce the number of such calculations. Second, the complexity of the random forest classification itself is decreased by the proposed cascade approach. Experiment results for real data show that our method is effective and works in real time (30 fps) without any parallelization efforts.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.15 no.4
• /
• pp.477-483
• /
• 2015

The k-Winners-Take-All (kWTA) is an operation to find the largest k (>1) inputs among N inputs. Parallel search algorithm of kWTA for digital inputs is not invented yet, so most of digital kWTA architectures have O(N) time complexity. A parallel search algorithm for digital kWTA operation and the circuits for its VLSI implementation are presented in this paper. The proposed kWTA architecture can compare all inputs simultaneously in parallel. The time complexity of the new architecture is O(logN), so that it is scalable to a large number of digital data. The high-speed kWTA operation and its O(logN) dependency of the new architecture are verified by simulations. It takes 290 ns in searching for 5 winners among 1024 of 32 bit data, which is more than thousands of times faster than existing digital kWTA circuits, as well as existing analog kWTA circuits.

• Journal of information and communication convergence engineering
• /
• v.13 no.3
• /
• pp.152-158
• /
• 2015

We consider the problem of designing independently operating local quantizers at nodes in distributed estimation systems, where many spatially distributed sensor nodes measure a parameter of interest, quantize these measurements, and send the quantized data to a fusion node, which conducts the parameter estimation. Motivated by the discussion that the estimation accuracy can be improved by using the quantized data with a high probability of occurrence, we propose an iterative algorithm with a simple design rule that produces quantizers by searching boundary values with an increased likelihood. We prove that this design rule generates a considerably reduced interval for finding the next boundary values, yielding a low design complexity. We demonstrate through extensive simulations that the proposed algorithm achieves a significant performance gain with respect to traditional quantizer designs. A comparison with the recently published novel algorithms further illustrates the benefit of the proposed technique in terms of performance and design complexity.

• ETRI Journal
• /
• v.39 no.3
• /
• pp.319-325
• /
• 2017

The decoding process of a quasi-cyclic low-density parity check code requires a unique type of rotator. These rotators, called multi-size cyclic-shifters (MSCSs), rotate input data with various sizes, where the size is the amount of data to be rotated. This paper proposes a low-complexity MSCS structure for the case when the sizes have a nontrivial common divisor. By combining the strong points of two previous structures, the proposed structure achieves the smallest area. The experimental results show that the area reduction was more than 14.7% when the proposed structure was applied to IEEE 802.16e as an example.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.69-72
• /
• 1999

In this paper, an efficient time domain equalization algorithm for discrete wavelet multitone(DWMT) data transmission is developed. In this algorithm, the time domain equalizer(TEQ) consists of two stages, i.e., the channel impulse response shortening equalizer(TEQ-S) in the first stage and the channel frequency flattening equalizer(TEQ-F) in the second stage. TEQ-S reduces the length of transmission channel impulse response to decrease intersymbol interference(ISI) followed by TEQ-F that enhances the channel frequency response characteristics to the level of an ideal channel, hence diminishes the bit error rate. TEQ-S is implemented using the least-squares(LS) method, while TEQ-F is designed by using the least mean-square(LMS) algorithm. Since DWMT system also requires of the frequency domain equalizer in order to further reduce ICI and ISI the hardware complexity is an another concern. However, by adopting an well designed and trained TEQ, the hardware complexity of the whole DWMT system can be greatly reduced.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.15 no.2
• /
• pp.194-201
• /
• 2015

A frequency modulated ultra-wideband (FM-UWB) transmitter with a high-robust relaxation oscillator for subcarrier generation and a dual-path Ring VCO for RF FM is proposed, featuring low power and low complexity. A prototype 3.65-4.25 GHz FM-UWB transceiver employing the presented transmitter is fabricated in $0.18{\mu}m$ CMOS for short-range wireless data transmission. Experimental results show a bit error rate (BER) of $10^{-6}$ at a data rate of 12.5 kb/s with a communication distance of 60 cm is achieved and the power dissipation of 4.3 mW for the proposed transmitter is observed from a 1.8 V supply.

• Proceedings of the KOSOMBE Conference
• /
• v.1998 no.11
• /
• pp.197-198
• /
• 1998

We tested the capability of Pointwise Correlation Dimension(PD2), Approximate Entropy (ApEn) and LZ complexity, as alternative measures of a biological signal. For this purpose, we analyzed standard data and a healthy child's 24-hour heart rate variability. Our conclusion is as follows. First, PD2, ApEn and LZ complexity can be used for discerning chaotic attractor, white noise, and periodic signal. Second, these measures show different characteristics on day and night. Third, these measures can be used for detecting time-varying characteristics of biological signals.

• Journal of the Optical Society of Korea
• /
• v.12 no.3
• /
• pp.136-146
• /
• 2008

We proposed an adaptive steganography of an optical image using bit-planes and multichannel characteristics. The experiment's purpose was to compare the most popular methods used in optical steganography and to examine their advantages and disadvantages. In this paper we describe two digital methods: the first uses less significant bits(LSB) to encode hidden data, and in the other all blocks of $n{\times}n$ pixels are coded by using DCT(Digital Cosine Transformation), and two optical methods: double phase encoding and digital hologram watermarking with double binary phase encoding by using IFTA(Iterative Fourier Transform Algorithm) with phase quantization. Therefore, we investigated the complexity on bit plane and data, similarity insert information into bit planes. As a result, the proposed method increased the insertion capacity and improved the optical image quality as compared to fixing threshold and variable length method.

• IE interfaces
• /
• v.8 no.1
• /
• pp.61-78
• /
• 1995

Warehouse planning or design is not a static, one-time activity. To survive in the constantly changing market warehouse design should be a continuous process in which the anticipated requirment are reflected on the current warehouse status. Thus, the goal of warehouse management is to effectively utilize the various warehouse resources to meet the varying customer requirment. This paper presents an engineering framework for warehousing system analysis and design from the perspective of a total system approach. The complexity pertinent to warehousing system analysis and design is first discussed, which mainly come from the interplay among product data, order data, equipment types, operating strategies, and functional specification of the overall system. The understanding of the complexity leads to a general structure and a conceptual design procedure for a warehousing system. The general structure is comprehensive enough to represent most warehousing and flexible enough to accommodate the more sophisticated ones. The conceptual design procedure portrays the high-level interelationships the design issues.