• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3C
• /
• pp.322-328
• /
• 2009

This paper proposes new simplified sum-product (SSP) decoding algorithm to improve BER performance for low-density parity-check codes. The proposed SSP algorithm can replace multiplications and divisions with additions and subtractions without extra computations. In addition, the proposed SSP algorithm can simplify both the In[tanh(x)] and tanh-1 [exp(x)] by using two quantization tables which can reduce tremendous computational complexity. Moreover, the simulation results show that the proposed SSP algorithm can improve about $0.3\;{\sim}\;0.8\;dB$ of BER performance compared with the existing modified sum-product algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.9
• /
• pp.2134-2153
• /
• 2013

A network-coding-based scheme is proposed to improve the energy efficiency of distributed storage systems in WSNs (Wireless Sensor Networks). We mainly focus on two problems: firstly, consideration is given to effective distributed storage technology; secondly, we address how to effectively repair the data in failed storage nodes. For the first problem, we propose a method to obtain a sparse generator matrix to construct network codes, and this sparse generator matrix is proven to be the sparsest. Benefiting from this matrix, the energy consumption required to implement distributed storage is reduced. For the second problem, we designed a network-coding-based iterative repair method, which adequately utilizes the idea of re-encoding at intermediate nodes from network coding theory. Benefiting from the re-encoding, the energy consumption required by data repair is significantly reduced. Moreover, we provide an explicit lower bound of field size required by this scheme, which implies that it can work over a small field and the required computation overhead is very low. The simulation result verifies that the proposed scheme not only reduces the total energy consumption required to implement distributed storage system in WSNs, but also balances energy consumption of the networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6C
• /
• pp.562-571
• /
• 2010

Forward error correction (FEC) coding schemes using iterative soft decision detection (SDD) information are mandatory in most of the next generation wireless communication system, in order to combat inevitable channel imparirnents. At the same time, space-time block coding (STBC) schemes are used for the diversity gain. Therefore, SDD information has to be fed into FEC decoder. In this paper, we propose efficient SDD methods for turbo-coded STBC system using high order modulation such as QAM. We present simulation results of various SDD schemes for turbo-coded STBC systems, and show that the proposed methods can provide almost approximating performance to maximum likelihood detection with much less computational load.

• Journal of the Korean Society of Systems Engineering
• /
• v.1 no.1
• /
• pp.14-19
• /
• 2005

High temperature vacuum furnaces or high standard electric furnaces demand high technology level and high production cost. Therefore, an iterative design process and the optimization approach under integrated computing environment are required to reduce the development risk. Moreover, it also required to develop an integrated design software that can manage the centralized database system between factory and design department, and the automated furnace design and analysis. The developed software is dedicated to the development of the vacuum (electric) furnaces. Based on the distribute middleware system, the GUI module, the CAD module, the thermal analysis module and the optimization module are integrated. For the DBMS, Microsoft Access is employed, the GUI is developed using Visual Basic language, and AutoCAD is utilized for the configuration design. By investigating the analysis code interface, the analysis and optimization process, and the data communication method, the overall system architecture, the method to integrate the optimizer and ana lysis codes, and the method to manage the data flow are proposed and verified through the optimal furnace design.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.3
• /
• pp.142-152
• /
• 2014

Vehicular Ad-hoc Networks (VANETs) are comprised of wireless mobile nodes characterized by a randomly changing topology, high mobility, availability of geographic position, and fewer power constraints. Orthogonal Frequency Division Multiplexing (OFDM) is a promising candidate for the physical layer of VANET because of the inherent characteristics of the spectral efficiency and robustness to channel impairments. The susceptibility of OFDM to Inter-Carrier Interference (ICI) is a challenging issue. The high mobility of nodes in VANET causes higher Doppler shifts, which results in ICI in the OFDM system. In this paper, a frequency domain com-btype channel estimation was used to cancel out ICI. The channel frequency response at the pilot tones was estimated using a Least Square (LS) estimator. An efficient interpolation technique is required to estimate the channel at the data tones with low interpolation error. This paper proposes a robust interpolation technique to estimate the channel frequency response at the data subcarriers. The channel induced noise tended to degrade the Bit Error Rate (BER) performance of the system. Parallel concatenated Convolutional codes were used for error correction. At the decoding end, different decoding algorithms were considered for the component decoders of the iterative Turbo decoder. A performance and complexity comparison among the various decoding algorithms was also carried out.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.41 no.6
• /
• pp.27-35
• /
• 2004

Finite or Galois fields have been used in numerous applications such as error correcting codes, digital signal processing and cryptography. These applications often require exponetiation on GF(2$^{m}$ ) which is a very computationally intensive operation. Most of the existing methods implemented the exponetiation by iterative methods using repeated multiplications, which leads to much computational load, or needed much hardware cost because of their structural complexity in implementing. In this paper, we present an effective VLSI architecture for exponentiation on GF(2$^{m}$ ). This circuit computes the exponentiation by multiplying product terms, each of which corresponds to an exponent bit. Until now use of this type algorithm has been confined to a primitive element but we generalize it to any elements in GF(2$^{m}$ ).

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1C
• /
• pp.15-20
• /
• 2009

For perpendicular magnetic recording (PMR) channels, noise-predictive maximum likelihood (NPML) detection method has been used. But, it is hard to expect improving the performance when the bit density is increased. Hence, we exploit the coding methods which has good performance. In this paper, we show the performance of the recursive systematic convolutional (RSC) codes with turbo-equalization method with different channel bit densities. The noise model is 80% jitter noise and 20% AWGN.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.12
• /
• pp.1-12
• /
• 1998

In this paper, a design and implementation of VHDL-to-C mapping in the VHDL compiler back-end is described. The analyzed data in an intermediate format(IF), produced by the compiler front-end, is transformed into a C-code model of VHDL semantics by the VHDL-to-C mapper. The C-code model for VHDL semantics is based on a functional template, including declaration, elaboration, initialization and execution parts. The mapping is carried out by utilizing C mapping templates of 129 types classified by mapping units and functional semantics, and iterative algorithms, which are combined with terminal information, to produce C codes. In order to generate the C program, the C codes are output to the functional template either directly or by combining the higher mapping result with intermediate mapping codes in the data queue. In experiments, it is shown that the VHDL-to-C mapper could completely deal with the VHDL analyzed programs from the compiler front-end, which deal with about 96% of major VHDL syntactic programs in the Validation Suite. As for the performance, it is found that the code size of VHDL-to-C is less than that of interpreter and worse than direct code compiler of which generated code is increased more rapidly with the size of VHDL design, and that the VHDL-to-C timing overhead is needed to be improved by the optimized implementation of mapping mechanism.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.1
• /
• pp.1-10
• /
• 2002

A space-time concatenated convolutional and differential coding scheme is employed in a multiuser direct-sequence code-division multiple-access(DS-CDMA) system. The system consists of single-user detectors (SUD), which are used to suppress multiple-access interference(MAI) with no requirement of other users' spreading codes, timing, or phase information. The space-time differential code, treated as a convolutional code of code rate 1 and memory 1, does not sacrifice the coding efficiency and has the least number of states. In addition, it brings a diversity gain through the space-time processing with a simple decoding process. The iterative process exchanges information between the differential decoder and the convolutional decoder. Numerical results show that this space-time concatenated coding scheme provides better performance and more flexibility than conventional convolutional codes in DS-CDMA systems, even in the sense of similar complexity Further study shows that the performance of this coding scheme applying to DS-CDMA systems with SUDs improves by increasing the processing gain or the number of taps of the interference suppression filter, and degrades for higher near-far interfering power or additional near-far interfering users.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.9 no.5 s.45
• /
• pp.75-86
• /
• 2005

In performance-based design methods, it is clear that the evaluation of the nonlinear response is required. Analysis methods available to the design engineer today are nonlinear time history analyses, or monotonic static nonlinear analyses, or equivalent static analyses with simulated inelastic influences. The nonlinear time analysis is the most accurate method in computing the nonlinear response of structures, but it is time-consuming and necessitate more efforts. Some codes proposed the capacity spectrum method based on the nonlinear static analysis to determine earthquake-induced demand. The nonlinear direct spectrum method is proposed and studied to evaluate nonlinear response of structures, without iterative computations, given by the structural linear vibration period and yield strength from pushover analysis. The purpose of this paper is to compare the accuracy and the reliability of approximate nonlinear methods with respect to shear buildings and various earthquakes. The conclusions of this study are summarized as follows: 1) Linear capacity spectrum method may fail to find a convergent answer or make a divergence. Even if a convergent answer is found, it has a large error in some cases and the error varies greatly depending on earthquakes. 2) Although nonlinear capacity spectrum method need much less calculation than capacity spectrum method and find an answer in any case, it may be difficult to obtain an accurate answer and generally large error occurs. 3) The nonlinear direct spectrum method is thought to have good applicability because it produce relatively correct answer than other methods directly from pushover curves and nonlinear response spectrums without additional and iterative calculations.