• ETRI Journal
• /
• v.38 no.4
• /
• pp.612-621
• /
• 2016

A new time-domain decoder for Reed-Solomon (RS) codes is proposed. Because this decoder can correct both errors and erasures without computing the erasure locator, errata locator, or errata evaluator polynomials, the computational complexity can be substantially reduced. Herein, to demonstrate this benefit, complexity comparisons between the proposed decoder and the Truong-Jeng-Hung and Lin-Costello decoders are presented. These comparisons show that the proposed decoder consistently has lower computational requirements when correcting all combinations of ${\nu}$ errors and ${\mu}$ erasures than both of the related decoders under the condition of $2{\nu}+{\mu}{\leq}d_{\min}-1$, where $d_{min}$ denotes the minimum distance of the RS code. Finally, the (255, 223) and (63, 39) RS codes are used as examples for complexity comparisons under the upper bounded condition of min $2{\nu}+{\mu}=d_{\min}-1$. To decode the two RS codes, the new decoder can save about 40% additions and multiplications when min ${\mu}=d_{min}-1$ as compared with the two related decoders. Furthermore, it can also save 50% of the required inverses for min $0{\leq}{\mu}{\leq}d_{\min}-1$.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.10
• /
• pp.11-15
• /
• 2015

In this paper, we introduce three modulation codes of the code rate 1/2 with different minimum distances, respectively, and investigate the performance of the codes according to the minimum distance. We simulate the codes in accordance with blur and misalignment. As the minimum distance increases, the complexity of encoder and decoder also grows. However, it can improve the error correcting capability and shows good performance with blur and misalignment.

• Journal of Communications and Networks
• /
• v.17 no.6
• /
• pp.634-646
• /
• 2015

Assuming perfect channel state information (CSI) at the transmitter and receiver, the optimization problem of maximizing the minimum Euclidean distance between two received signals by a linear precoder is considered for multiple-input multiple-output (MIMO) systems with arbitrary dimensions and arbitraryary quadrature amplitude modulation (QAM) input. A general precoding framework is first presented based on the Gram matrix, which is shown for 2-dimensional (2-D) and 3-dimensional (3-D) MIMO systems when employing the ellipse expanding method (EEM). An extended precoder for high-dimensional MIMO system is proposed following the precoding framework, where the Gram matrix for high-dimensional precoding matrix can be generated through those chosen from 2-D and 3-D results in association with a permutation matrix. A complexity-reduced maximum likelihood detector is also obtained according to the special structure of the proposed precoder. The analytical and numerical results indicate that the proposed precoder outperforms the other precoding schemes in terms of both minimum distance and bit error rate (BER).

• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.7
• /
• pp.621-626
• /
• 2015

This paper presents a camera calibration method in order to estimate the lane detection and inter-vehicle distance estimation system for an automotive safety driving system. In order to implement the lane detection and vision-based inter-vehicle distance estimation to the embedded navigations or black box systems, it is necessary to consider the computation time and algorithm complexity. The process of camera calibration estimates the horizon, the position of the car's hood and the lane width for extraction of region of interest (ROI) from input image sequences. The precision of the calibration method is very important to the lane detection and inter-vehicle distance estimation. The proposed calibration method consists of three main steps: 1) horizon area determination; 2) estimation of the car's hood area; and 3) estimation of initial lane width. Various experimental results show the effectiveness of the proposed method.

• Journal of Korea Multimedia Society
• /
• v.17 no.8
• /
• pp.915-922
• /
• 2014

We propose an adaptive zoom motion estimation method where a picture is divided into two areas based on the distance information with a depth camera : the one is object area and the other is background area. In the proposed method, the zoom motion is only applied to the object area except the background area. Further, the block size of motion estimation for the object area is set to smaller than that of background area. This adaptive zoom motion estimation method can be reduced at the complexity of motion estimation and can be improved at the motion estimation performance by reducing the block size of the object area in comparison with the conventional zoom motion estimation method. Based on the simulation results, the proposed method is compared with the conventional methods in terms of motion estimation accuracy and computational complexity.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.249-252
• /
• 2001

TCM(Trellis Coded Modulation) has soft decision scheme so that BM(Branch Metric) calculates the ED(Euclidean Distance) between the received signal and each code words in signal space. For computing the ED, square and square root computations increase the hardware complexity. Some simplified method is known for convolutional codes with QPSK(Quadrature Phase Shift Keying), PSK(Phase Shift Keying) modulation. But it is not acceptable for QAM (Quadrature Amplitude Modulation)-TCM scheme. In this paper, we suggest that two modified BM computation methods, which is applicable for QAM-TCM. By comparative study, we also assessed two proposed method in the case of hardware complexity and BER (Bit Error Rate) performance.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.3 no.3
• /
• pp.3-7
• /
• 2010

As the distance between signal lines in memories of high density ICs like SoCs decreases rapidly, failure occurs more frequently and effective memory test techniques are needed. In this paper, a new SRAM structure is proposed to decrease test complexity and test time for embedded DRAMs. In the presented technique, because memory test can be handled as a single port testing and read-write operation is possible at dual port without high complexity, test time can be much reduced.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.3
• /
• pp.47-53
• /
• 1998

Multi-dimensional DC-free trellis codes based on two-dimensional constellation which can be omplemented more easily than conventional codes are proposed and their performances are analyzed in this paper. 2N-dimensional constellation of the proposed codes is constructed by concatenating N 2-dimensional constellation. Thus, for the proposed codes, information bits can be assigned easily to each signal point of the 2-dimensional consteellation and DC-free characteristic can be simply obtained by the symmetric structure of the constellation. In addition, since Viterbi decoder can calculate multi-dimensional Euchlidean distance between signals by simple sum of each 2-dimensional Euclidean distanc, decoding complexity can be reduced. The performance analysis shows that the proposed codes have almost same spectral characteristic and error performance as compared with conventional codes. However, the complexity is shown to be reduced further due to the construction method of contellation and the simple decoding algorithm of the proposed codes.

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

• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.90-96
• /
• 2002

We present a family of constant-amplitude constellations of even dimensions 8 and above. These constellations allow trellis coded modulation to be implemented without the usual penalty paid for constellation expansion. The new constellations are generated by concatenating either n QPSK points or n QPSK points rotated by 45 degrees, for any n $\geq$ 4. Our constellations double the number of points available for transmission without decreasing the distance between points and without increasing the average or peak energies, introducing asymmetry, or increasing the modulation level. Effective gains of 2.65 dB with minimum complexity through 6.42 dB with moderate complexity are demonstrated using the 8D constellation.