• The Journal of the Acoustical Society of Korea
• /
• v.30 no.5
• /
• pp.265-272
• /
• 2011

In most of the ISF (or LSF) based real time speech codec, SVQ (split vector quantization) method is used to decrease the quantizer complexity and memory size of codebook. However, it produces drawback that the level of correlation between code vectors can not be used during vector splits. This paper presents a new method of adaptive ISF vector quantization, which compensates the drawbacks of SVQ structured quantizer for wideband speech codec. In each different frame, the proposed method makes use of the correlation between splitted vectors by adaptively changing codebook distribution according to ordering property of ISF. The algorithm is evaluated in AMR-WB, and shows about 1.5 bit per frame improvement.

• Journal of Korea Multimedia Society
• /
• v.16 no.7
• /
• pp.841-851
• /
• 2013

The infectious information hiding system(IIHS) is proposed for secure distribution of high quality video contents by applying optimized watermark embedding and detection algorithms to video codecs. And the watermark as infectious information is transmitted while target video is displayed or edited by codecs. This paper proposes a fast and effective reversible watermarking and infectious information generation for IIHS. Our reversible watermarking scheme enables video decoder to control video quality and watermark strength actively for by adding control code and expiration date with the watermark. Also, we designed our scheme with low computational complexity to satisfy it's real-time processing in a video codec, and to prevent time or frame delay during watermark detection and video restoration, we embedded one watermark and one side information within a macro-block. Experimental results verify that our scheme satisfy real-time watermark embedding and detection and watermark error is 0% after reversible watermark detection. Finally, we conform that the quality of restored video contens is almost same with compressed video without watermarking algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.757-759
• /
• 2013

Until just a few years ago, digital circuit design techniques in register transfer level using Verilog or VHDL have been recognized as the up-to-date way compared with the traditional schematic design, and truly they have been used as the most popular skill for most chip designs. However, with the advent of era in which the complexity of semiconductor chip counts over billion transistors with advanced manufacturing technology, designing in register transfer level became too complex to meet the requirements of the needs, so the design paradigm has to change so that both design and synthesis can be done in higher level of abstraction. Bluespec SystemVerilog (BSV) is the only HDL which enables both circuit design and generating synthesizable code in the system level developed so far. In this contribution, I survey and analyze the features which supports the new paradigm in the BSV HDL, not very familiar to industry yet.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.1
• /
• pp.141-150
• /
• 2010

In this paper, performance of a turbo-coded OFDM system is analyzed and simulated in a power line communication channel. Since the power line communication system typically operates in a hostile environment, turbo code has been employed to enhance reliability of transmitted data. The performance is evaluated in terms of bit error probability. As turbo decoding algorithms, MAP (maximum a posteriori), Max-Log-MAP, and SOVA (soft decision viterbi output) algorithms are chosen and their performances are compared. From simulation results, it is demonstrated that Max-Log-MAP algorithm is promising in terms of performance and complexity. It is shown that performance is improved 3dB by increasing the number of iterations, 2 to 8, and interleaver length of a turbo encoder, 100 to 5000. The results in this paper can be applied to OFDM-based high-speed power line communication systems.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.1
• /
• pp.23-30
• /
• 2015

Reflection is a feature of the Java programming language that can examine and manipulate components of program itself. If you use the reflection, you can get an obfuscation effect of Java source because it converts sources into complicated structures. However, when using it, strings of components name of program are exposed. Therefore, it cannot prevent static analysis. In this paper, we presents a method and a tool of interfere with static analysis using reflection. And in this case, exposed strings are encoded using Vigen$\acute{e}$re cipher. Experimental results show that this tool is effective in increasing the overall complexity of the source code. Also the tool provides two types decryption method based on server and local. It can be selected based on the importance of the API because it affects the execution speed of the application.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5A
• /
• pp.423-430
• /
• 2010

The performances of turbo-coded space-time block coding (STBC) schemes are subject to how soft decision detection (SDD) information are generated from the STBC decoder. For this reason, we have to pay particular attention to estimation of SDD. In this paper, we evaluate the performance of a turbo coded STBC scheme depending on the accuracy of the SDD. Recently, a new quasi orthogonal STBC (QO-STBC) scheme using a noise whitened filter was proposed in order to reduce noise enhancing effect of zero forcing detection process. This QO-STBC scheme was proven to be efficient in computational complexity compared to the other conventional QO-STBC schemes. In this paper, we first present detailed mathematical analysis on the noise whitened QO-STBC scheme, and by using the result we propose the optimum SDD method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12C
• /
• pp.1135-1141
• /
• 2007

In this paper, an adaptive bit-reliability mapping is proposed for the bit-level Chase combining in LDPC-coded high-order modulation systems. Contrary to the previously known bit-reliability mapping that assigns the information (or parity) bits to more (or less) reliable bit positions, the proposed mapping adaptively assigns codeword bits to the bit positions of various reliabilities by considering the characteristics of code and protection levels of bits in high-order modulation symbol. Compared with the symbol-level Chase combining and the constellation rearrangement bit mapping, the proposed mapping gives $0.7{\sim}1.3$ dB and $0.1{\sim}1.0$ dB performance gain at $FER=10^{-3}$ with no additional complexity, respectively. Adaptive bit-reliability mappings are derived for various environments and the validity of them is confirmed through simulation.

• Journal of Internet Computing and Services
• /
• v.10 no.4
• /
• pp.115-126
• /
• 2009

A software size estimation has to be analyzed in the beginning of the software life-cycle and helpful to the prediction of its size and cost. The software cost has been calculated by estimating software size from the user's point of view since the function point method based on international standards was introduced for the estimation of software size in 2004. However, the current function point method is not easy to be exploited for unfamiliar user, and has a problem that it cannot estimate the proper size for software such as engineering software, scientific calculations and simulation with complicated internal computational logic. This paper presents an improved model which can simplify the existing function point measurement procedure, and perform the estimation of software size in easy and fast way at the initial stage of project. Moreover, it presents a mathematical weighted value calculation model which can solve the problem of the fixed complexity weighted value and reflect the characteristics of organization as its data is pilled up. Our evaluation shows that the presented model has advantage that it can measure the size more rapidly than the existing FPA methods and has more correlation with LOC.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.14 no.8
• /
• pp.816-822
• /
• 2003

In this paper, we propose an efficient iteration control method with low complexity for Turbo TCM(Turbo Trellis Coded Modulation) decoding which will be used fur power-limited environment. As the decoding approaches the performance limit of a given turbo code, any further iteration results in very little improvement. Therefore, it is important to devise an efficient criterion to stop the iteration process and prevent unnecessary computations and decoding delay. This paper presents an efficient algorithm for turbo TCM decoding that can greatly reduce the delay and iteration number. The proposed method use adaptive iteration number according to the criterion using the extrinsic information variance parameter in turbo TCM decoding process. The simulation results show that the proposed technique effectively can reduce the decoding delay and computation with very little performance degradation.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.1
• /
• pp.42-48
• /
• 2010

In this paper, we proposed analysis performance improvement technique for T-DMB watermarking based on MBOK spread spectrum. By applying the proposed scheme to T-DMB system, it allows additional data transmission and improves spectral efficiency of data transmission through watermarking spreading code. Using MBOK spread spectrum technique, data rate improved 2m-times existing direct sequence spread spectrum. However, since hardware complexity increase as the value of m becomes large, the method should be used with optimal situation. We analyze T-DMB watermarking techniques performance with MBOK spread spectrum and averaging. As a result, we confirm DER performance of MBOK spread spectrum scheme and it is shown system performance is improved as the number of averaging increases. The results of the paper can be applied to wireless multimedia digital broadcasting system.