• ETRI Journal
• /
• 제25권2호
• /
• pp.144-147
• /
• 2003

We propose a new serial concatenation scheme for space-time and recursive convolutional codes, in which a space-time code is used as the outer code and a single recursive convolutional code as the inner code. We discuss previously proposed serial concatenation schemes employing multiple inner codes and compare them with the new one. The proposed method and the previous one with joint decoding, both performing a combined decoding of the simultaneous output signals from multiple antennas, give a large performance gain over the separate decoding method. In decoding complexity, the new concatenation scheme has a lower complexity compared with the multiple encoding/joint decoding scheme due to the use of the single inner code. Simulation results for a communication system with two transmit and one receive antennas in a quasi-static Rayleigh fading channel show that the proposed scheme outperforms the previous schemes.

• ETRI Journal
• /
• 제34권4호
• /
• pp.637-640
• /
• 2012

The Davey-MacKay construction is a promising concatenated coding scheme involving an outer $2^k$-ary code and an inner code of rate k/n, for insertion-deletion-substitution channels. Recently, a lookup table (LUT)-based inner decoder for this coding scheme was proposed to reduce the computational complexity of the inner decoder, albeit at the expense of a slight degradation in word error rate (WER) performance. In this letter, we show that negligible deterioration in WER performance can be achieved with an LUT as small as $7{\cdot}2^{k+n-1}$, but no smaller, when the probability of receiving less than n-1 or greater than n+1 bits corresponding to one outer code symbol is at least an order of magnitude smaller than the WER when no LUT is used.

• 한국컴퓨터정보학회논문지
• /
• 제24권4호
• /
• pp.107-112
• /
• 2019

Failure testing is a test that verifies that the system is operating in accordance with failure response requirements. A typical failure test approaches the operating system by identifying and testing system problems caused by unexpected errors during the operational phase. In this paper, we study how to evaluate these Failure at the software development stage. Evaluate the probability of failure due to code changes through the complexity and duplication of the code, and evaluate the probability of failure due to exceptional situations with bugs and test coverage extracted from static analysis. This paper studies the possibility of failure based on the code quality of software development stage.

• Journal of Positioning, Navigation, and Timing
• /
• 제2권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.

• 대한전자공학회논문지SD
• /
• 제40권2호
• /
• pp.117-125
• /
• 2003

본 논문에서는 저전력 및 고속의 특성을 갖는 MC-CDMA 시스템용의 동기획득 구조를 제안한다. 이를 위해 탐색핑거라는 새로운 구조를 설계하였다. 제안한 탐색핑거는 기존의 핑거를 수정한 구조로써, 원래의 핑거 기능 이외에 탐색기의 기능을 갖고 있다. 초기 동기획득시 탐색핑거는 탐색기와 함께 탐색기의 기능을 수행함으로써 초기 동기획득 시간을 단축시킨다. 그리고 초기 동기획득이 끝난 후에 본래의 핑거로 동작한다. 제안한 구조를 5㎒ MC-CAMA 시스템에 적용할 경우, 동기회득을 수행하는 블록에서 게이트카운트론 비교하였을 때, 약 63%의 하드웨어 복잡도 감소와 동시에 동기획득 시간을 5배 단축할 수 있었다.또한, 20㎒ MC-CDMA에서는, 약 75%의 하드웨어 복잡도를 감소시키면서 평균 동기 획득 시간을 최대 19배 단축할 수 있었다.

• The Journal of the Acoustical Society of Korea
• /
• 제17권3E호
• /
• pp.53-57
• /
• 1998

Spectral information at a speech coder should be quantized with sufficient accuracy to keep perceptually transparent output speech. Spectral information at a low bit rate speech coder is usually transformed into corresponding line spectrum pair parameters and is often quantized with a vector quantization algorithm. As the vector quantization algorithm generally has high complexity in the optimal code vector searching routine, the complexity reduction in that routine is investigated using the ordering property of the line spectrum pair. When the proposed complexity reduction algorithm is applied to the well-known split vector quantization algorithm, the 46% complexity reduction is achieved in the distortion measure compu-tation.

• 한국인터넷방송통신학회논문지
• /
• 제24권4호
• /
• pp.49-55
• /
• 2024

코드 스멜은 Kent Beck에 의해 사용된 개념으로, 잠재적인 품질 문제를 나타내며 리팩토링의 필요성을 제시한다. 본 논문은 LEA 코드베이스에서 코드 스멜을 평가하며, 분류와 관련된 메트릭에 중점을 둔다. 연구에서는 LEA_core.c와 LEA.cpp를 분석하여 코드 품질과 복잡성의 차이를 강조한다. 또한 연구에서는 LOC, NOM, NOA, CYCLO, MAXNESTING, FANOUT와 같은 메트릭을 사용하여 크기, 복잡성, 결합도, 캡슐화, 상속, 응집도를 평가한다. 연구 결과에서는 LEA_core.c가 LEA.cpp에 비해 더 복잡하고 유지보수가 어려운 것으로 나타났다. 우리는 향후 연구에서 실시간 코드 스멜 탐지 및 리팩토링 제안을 위한 자동화 도구를 개발할 것이다.

• 한국IT서비스학회지
• /
• 제10권3호
• /
• pp.167-177
• /
• 2011

Code obfuscation is a technique that protects the abstract data contained in a program from malicious reverse engineering and various obfuscation methods have been proposed for obfuscating intention. As the abstract data of control flow about programs is important to clearly understand whole program, many control flow obfuscation transformations have been introduced. Generally, inlining is a compiler optimization which improves the performance of programs by reducing the overhead of calling invocation. In code obfuscation, inlining is used to protect the abstract data of control flow. In this paper, we define new control flow complexity metric based on entropy theory and N-Scope metric, and then apply genetic algorithm to obtain optimal inlining results, based on the defined metric.

• ETRI Journal
• /
• 제37권5호
• /
• pp.940-944
• /
• 2015

We present a frame synchronization algorithm for lowdensity parity-check (LDPC) coded burst transmissions, which combines a conventional pilots-assisted frame synchronization algorithm and a code-aided algorithm based on the mean magnitude of the soft outputs from the LDPC decoder. With moderate computational complexity, the proposed algorithm is more efficient in bandwidth than conventional pilots-assisted algorithms. When compared with other code-aided algorithms, the proposed algorithm offers a better trade-off between complexity and performance. Simulation results in the case of an 8-PSK system with (1944, 972) LDPC code show that the proposed algorithm can achieve a performance equivalent to that of the perfect frame synchronization, with a bandwidth efficiency loss of 0.06 dB due to the use of pilot symbols.

• Journal of Communications and Networks
• /
• 제10권4호
• /
• pp.384-395
• /
• 2008

Random network coding can be viewed as a single block code applied to all source packets. To manage the concomitant high coding complexity, source packets can be partitioned into generations; block coding is then performed on each set. To reach a better performance-complexity tradeoff, we propose a novel concatenated network code which mixes generations while retaining the desirable properties of generation-based coding. Focusing on the code's erasure performance, we show that the probability of successfully decoding a generation on erasure channels can increase substantially for any erasure rate. Using both analysis (for small networks) and simulations (for larger networks), we show how the code's parameters can be tuned to extract best performance. As a result, the probability of failing to decode a generation is reduced by nearly one order of magnitude.