• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10A
• /
• pp.1123-1130
• /
• 2004

This paper proposes the fast OVSF code generation method using the multi-stage spreading scheme based on the single code indexing scheme. The conventional OVSF indexing scheme based on the code-tree structure uses two numbers as the codeword indices, the layer number and the code number of the corresponding layer. However, the single code index number implicitly includes the information of the spreading factor as well as the code number. Since the binary representation of the single code indices shows the pattern of the codeword, the orthogonality between two different codewords can be determined by comparing their code indices instead of much longer codewords. The above useful property also makes the codeword can be generated directly kom its single code index. In this paper, the multi-stage spreading scheme is applied to generate the long code by spreading two shorter codewords with the appropriate code indices. The proposed fast code generation algorithm is designed for 3GPP UMTS systems and verified by the simulations.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1995.04a
• /
• pp.187-194
• /
• 1995

Traditional genetic algorithms(GA) have mostly used binary code for representing design variable. The binary code GA has many difficulties to solve optimization problems with continuous design variables because of its targe computer core memory size, inefficiency of its computing time, and its bad performance on local search. In this paper, a real code GA is proposed for dealing with the above problems. So, new crossover and mutation processes of read code GA are developed to use continuous design variables directly. The results of real code GA are compared with those of binary code GA for several single and multiple objective optimization problems. As results of comparisons, it is found that the performance of the real code GA is better than that of the binary code GA, and concluded that the rent code GA developed here can be used for the general optimization problem.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.191-194
• /
• 1998

본 논문에서는 OFDM 시스템에서 사용되는 부 반송파의 수와 동일한 길이의 complementary code를 사용하여 각 부 반송파 데이터를 frequency 영역에서 scrambling하는 PAPR 감소 방안을 제안한다. 이 방법은 부 반송파의 수와 동일한 길이의 complementary code 집합을 이용하여 주어진 데이터에 부과해서 PAPR 값이 가장 적은 complementary code를 사용하여 scrambled된 데이터를 송신함으로서 PAPR 값을 감소시키는 방법이다. 수신기에서의 복호를 위하여 Nc개의 complementary code에 해당하는 log2Nc 비트의 code 인덱스를 데이터와 함께 전송한다. 이때 code 인덱스 비트가 PAPR 값에 영향을 주지 않도록 하기 위하여 CODE인덱스와 데이터가 함께 complementary code로 scrambling되어진다. 제안된 이 방법을 사용하면 주파수 대역효율을 높이면서 PAPR 값을 크게 줄일 수 있다.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.2
• /
• pp.1-10
• /
• 1997

In this paper, an improved lower bound on the burst-error correcting capability of th ecyclic product code is presented and through the analysis of this new bound clustered cyclic product (CCP abbr.)code is proposed. The CCP code, to improve the burst-error correcting capability, combines the idea of clustering and the transmission method of cyclic product code. That is, a cluster which is defined in this paper as a group of consecutive code symbols is employed as a new transmission unit to the code array transmission of cyclic product code. the burst-error correcting capability of the CCP code is improved without a loss in the random-error correcting capability and performance comparison in the digital video camera records (DVCR) system shows the superiority of the proposed CCP code over conventional product codes.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.5
• /
• pp.10-15
• /
• 2010

Good performance of spectral-amplitude-coding optical CDMA can be obtained using codes based upon Hadamard matrices, but Hadamard codes have very restrictive code lengths of $2^n$. In this paper a new code family, namely extended Hadamard code, is proposed to relax the code length restriction and the number of simultaneous users. The improved performance of the proposed system is analysed with the consideration of phase-induced intensity noise(PIIN).

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.8
• /
• pp.5-9
• /
• 2011

Spectral-amplitude-coding optical CDMA systems using codes based upon Hadamard matrices have very restrictive code lengths of $2^n$ and high phase-induced intensity noise(PIIN). In this paper a new code family, namely modified Hadamard code, is proposed to relax the code length restriction and the number of simultaneous users. The improved performance of the proposed system is analysed with the consideration of noise.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1491-1499
• /
• 2000

This paper is designed and implemented the data recovery mechanism for 2-D (2-dimensional) bar code system. The data recovery algorithm used the modified Reed-Solomon algorithm and it is implemented into 2-D bar code system. There are 7 types of 2-D bar code system, which are 21x21, 25x25, 41x41, 73x73, 101x101, 177x177. This paper has been experimented that how many data is saved among several 2-D bar code types and how many data re recovered. In the first experiment, the big size 2-D bar code system has many ECC codeword. Therefore, original data cannot be assigned to 2-D bar code system. In the second experiment, even if 35∼40% loss dta for the 2-D bar code system, the 2-D bar code system could have been recovered to original data.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.209-212
• /
• 2002

The realization for code domain analyzing system on WCDMA is presented. This system is realized with the RF, FPGA and DSP processor. The FPGA firgures out the scambling code, and DSP produces the power of code domain using OVSF. The experiment results allow the code domain power accuracy to keep $\pm$1dB low. This system leads to split the text, sound and image signal.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.8
• /
• pp.111-121
• /
• 1994

This paper proposes a memory testable code called MTA(Memory TestAble) code which is based on error correcting code technique for testing functional faults in semiconductor memories. The characteristics of this code are analyzed and compared with those of conventional codes. The developed decoding technique for this code can reduce the decoder circuits up to 70% and obtain two-times faster decoding speed than other codes such as hamming code or Hsiao code. The MTA code is eccectively applicable to parallel testing of semiconductor memories because it has the same information length and parity length. It can detect from single error functional faults to triple error in semiconductor memories.

• Nuclear Engineering and Technology
• /
• v.42 no.6
• /
• pp.636-655
• /
• 2010

A thermal-hydraulic code, named CUPID, has been being developed for the realistic analysis of transient two-phase flows in nuclear reactor components. The CUPID code development was motivated from very practical needs, including the analyses of a downcomer boiling, a two-phase flow mixing in a pool, and a two-phase flow in a direct vessel injection system. The CUPID code adopts a two-fluid, three-field model for two-phase flows, and the governing equations are solved over unstructured grids with a semi-implicit two-step method. This paper presents an overview of the CUPID code development and assessment strategy. It also presents the code couplings with a system code, MARS, and, a three-dimensional reactor kinetics code, MASTER.