• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.5
• /
• pp.160-166
• /
• 2018

This paper proposes an advanced suspension system and reports its performance in the framework of the preview control algorithm based on the RPS (road profile sensing) system and MSD system with the multi-stage damping characteristics. Typical disturbance inputs that cause excessive vibration and steering instability of an automobile are irregular obstacles that protrude or sink into the road surface to be driven. The control performance can be improved if information on the existence and shape function of its obstacle is known. Based on the results of the previous study, advanced research that uses the actuating system has been processed to be commercialized practically. For this purpose, a switching algorithm between the control logic and the multi-stage damping system was developed and its connectivity is presented. To verify the applicability of an actual vehicle, the proposed control system was implemented in full vehicle models and simulations were performed. The proposed system using the 3-DS actuator system, which is applied for structural simplicity, can improve the ride comfort and steering stability. In addition, the results indicate the feasibility of the intelligently controlled suspension system.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.243-247
• /
• 2005

We propose an efficient block least-mean-square (BLMS) adaptive algorithm, in conjunction with error control coding, for direct-sequence code division multiple access (DS-CDMA) systems. The proposed adaptive receiver incorporates decision feedback detection and channel encoding in order to improve the performance of the standard LMS algorithm in convolutionally coded systems. The BLMS algorithm involves two modes of operation: (i) The training mode where an uncoded training sequence is used for initial filter tap-weights adaptation, and (ii) the decision-directed where the filter weights are adapted, using the BLMS algorithm, after decoding/encoding operation. It is shown that the proposed adaptive receiver structure is able to compensate for the signal-to­noise ratio (SNR) loss incurred due to the switching from uncoded training mode to coded decision-directed mode. Our results show that by using the proposed adaptive receiver (with decision feed­back block adaptation) one can achieve a much better performance than both the coded LMS with no decision feedback employed. The convergence behavior of the proposed BLMS receiver is simulated and compared to the standard LMS with and without channel coding. We also examine the steady-state bit-error rate (BER) performance of the proposed adaptive BLMS and standard LMS, both with convolutional coding, where we show that the former is more superior than the latter especially at large SNRs ($SNR\;\geq\;9\;dB$).

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.12 no.3
• /
• pp.360-369
• /
• 2001

This paper proposes the groupwise serial cross interference cancellation(GSCIC) algorithm for coherent detection and analyzes the groupwise serial block interference cancellation(GSBIC) and GSCIC algorithm for an asynchronous wideband DS-CDMA system in a single cell over multipath fading channels. In general, the GSIC algorithm can be grouped into two classes: i.e., GSBIC and GSCIC algorithm. In this paper, the proposed GSCIC algorithm is to improve the performance of the GSBIC algorithm. We compare the performance of the GSCIC and existing GSBIC algorithm in a multipath fading channel to that of the existing SIC algorithm. As a result, the performance of GSCIC algorithm is somewhat better compared with the GSBIC algorithm according to reduction factor $R_{f}$ and is similar to that of the SIC algorithm. And also, the GSBIC and GSCIC algorithms have the advantage that it can be analyzed system performance easily, changing the number of users within a user group according to system capacity.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.96-102
• /
• 1995

This paper presents the VHSIC Hardware Description Language(VHDL) implementation of the Fixed Point Covariance Lattice(FLAT) algorithm for an Linear Predictive Coding(LPC) analysis and its related algorithms, such as the forth order high pass Infinite Impulse Response(IIR) filter, covariance matrix calculation, and Spectral Smoothing Technique(SST) in the Vector Sum Exited Linear Predictive(VSELP) speech coder that has been Selected as the standard speech coder for the North America and Japanese digital cellular. Existing Digital Signal Processor(DSP) chips used in digital cellular phones are derived from general purpose DSP chips, and thus, these DSP chips may not be optimal and effective architectures are to be designed for the above mentioned algorithms. Then we implemented the VHDL code based on the C code, Finally, we verified that VHDL results are the same as C code results for real speech data. The implemented VHDL code can be used for performing logic synthesis and for designing an LPC Application Specific Integrated Circuit(ASOC) chip and DsP chips. We first developed the C language code to investigate the correctness of algorithms and to compare C code results with VHDL code results block by block.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1948-1951
• /
• 2002

In this paper, we propose a chip timing recovery algorithm that is robust to frequency offset and time variant fading environments for DS/CDMA. The proposed structure is a modified non-coherent Delay Locked Loop (DLL) that employs a decimator. Analytical expression for the proposed non-coherent DLL S-curve and steady-state timing jitter is derived and confirmed by computer simulation. The results show that the proposed structure can reduce a steady-state timing jitter of the regenerated spreading code replica to frequency offset and time-variant fading in mobile radio channel, especially in very low SNR.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.4
• /
• pp.961-971
• /
• 1996

The effect of inband TDMA narrow band jammers to DS-CDMA system performance and the suppression techniques are investigated using Monte Carlo simulations. TIA stantard North American Digital Cellular wea used as jammer. Levinson Dubin and conventional recursive least square algorithm were emphasized since these techniques can be implemented with a few DSPs for CDMA application. Two filter structures, i.e., complex suppression filter and real suppression filter in each inphase and quadrature channels, are investigated and their performances are compared. Complex suppression filter with Levinson Durbin algorithm of 20msec updata rate is the most promising with respect to implementation and performance poit of view. Implementation feasibility is discussed and the channel capacity lost by suppression is computed.

• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.1086-1087
• /
• 2007

This paper presents a implementation of speed sensorless vector control algorithm of induction motor using MATLAB/SIMULINK. The proposed method utilize the combination of the voltage model based on stator equivalent model and the current model based on rotor equivalent model, which enables stable estimation of rotor flux. Estimated rotor speed, which is used to speed controller of induction motor, is based on estimated flux. The overall system consisted of speed controller with the most general PI controller, current controller, flux controller. Speed sensorless vector control algorithm is implemeted as block diagrams using MATLAB/SIMULINK. Realtime control is perform by dSPACE DS1104 control board and Real-Time-Interface(RTI).

• Journal of Korea Multimedia Society
• /
• v.9 no.9
• /
• pp.1118-1130
• /
• 2006

Existed pattern analysis algorithms in data streams environment have researched performance improvement and effective memory usage. But when new data streams come, existed pattern analysis algorithms have to analyze patterns again and have to generate pattern tree again. This approach needs many calculations in real situation that needs real time pattern analysis. This paper proposes a method that continuously analyzes patterns of incoming data streams in real time. This method analyzes patterns fast, and thereafter obtains real time patterns by updating previously analyzed patterns. The incoming data streams are divided into several sequences based on time based window. Informations of the sequences are inputted into a hash table. When the number of the sequences are over predefined bound, patterns are analyzed from the hash table. The patterns form a pattern tree, and later created new patterns update the pattern tree. In this way, real time patterns are always maintained in the pattern tree. During pattern analysis, suffixes of both new pattern and existed pattern in the tree can be same. Then a pointer is created from the new pattern to the existed pattern. This method reduce calculation time during duplicated pattern analysis. And old patterns in the tree are deleted easily by FIFO method. The advantage of our algorithm is proved by performance comparison with existed method, MILE, in a condition that pattern is changed continuously. And we look around performance variation by changing several variable in the algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3B
• /
• pp.179-187
• /
• 2002

This paper proposes and analyzes the iterative groupwise equal-delay interference cancellation(IGEIC) algorithm for coherent detection of an asynchronous wideband DS-CDMA system in a single cell over multipath fading channels. The IGEIC algorithm divide users in a system into several groups, and subtract out interference signal from the received signal as many as the number of users within a user group, iteratively. The IGEIC algorithm is also classified into the iterative groupwise equal-delay serial interference cancellation(IGESIC) algorithm and the iterative groupwise equal-delay parallel interference cancellation(IGEPIC) algorithm. In the case of perfect correlation for spreading codes, it shows that the performance of IGESIC and IGEPIC algorithm is the same after interference cancellation of as many as the number of users within a user group, but the performance of IGEPIC algorithm is superior to the IGESIC algorithm just before fecal cancellation within a user group. The results show that (he performance of the two proposed algorithms are also superior to the SIC algorithm by 3dB.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.309-316
• /
• 2004

In this paper, we proposed the TDS(T-shape Diamond Search) based on the directions of above, below, left and right points to estimate the motion vector fast and more correctly in this method, we exploit the facts that most motion vectors are enclosed in a circular region with a radius of 2 fixels around search center(0,0). At first, the 4 points in the above, below, left and right around the search center is calculated to decide the point of the MBD(Minimum Block Distortion). And then w. above point of the MBD is checked to calculate the SAD. If the SAD of the above point is less than the previous MBD, this process is repeated. Otherwise, the right and left points of MBD are calculated to decide The points that have the MBD between right point and left point. Above processes are repeated to the predicted direction for motion estimation. Especially, if the motions of image are concentrated in the crossing directions, the points of other directions are omitted. As a result, we can estimate motion vectors fast. Experiments show that the speedup improvement of the proposed algorithm over Diamond Search algorithm(DS) and HEXgon Based Search(HEXBS) can be up to 38∼50％ while maintaining similar image Quality.