• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.10
• /
• pp.2100-2112
• /
• 2011

An orthogonal code hopping multiplexing (OCHM) technique has been proposed for accommodating a large number of users with low channel activities than the number of orthogonal codewords through statistical multiplexing in downlink cellular systems. In this paper, a multiple input multiple output (MIMO) antenna based OCHM system is proposed to improve the performance. Each modulated symbol is repeated N times and the N repeated symbols are transmitted simultaneously using N transmit antennas. Through repetitions, the effect of perforations that the OCHM system experiences is decentralized among the repeated symbols and the full perforation probability is significantly reduced. Each receiver detect the transmitted signal using its pre-assigned code hopping pattern. Simulation results show that the proposed scheme saves the required energy for a given frame error rate (FER).

• Journal of Korean Ophthalmic Optics Society
• /
• v.10 no.4
• /
• pp.357-364
• /
• 2005

To develope the assessment equpiments of an optical system using adaptive optics, we developed the program of wavefront reconstruction for an optical system like eye. We used matlab in order to program the wavefront reconstruction for an optical system and presented the wavefront function of optical system by the zemike polynomials using modal method. To test the developed program, we calculated the zemike coefficient(n=7) of cooke triplet using code V, and compared the wavefront shape and the zemike polynomials using code V to those using the developed program. In this case, the used zemike coefficients were n=2, 3, 4, 5, 6, 7, 8, 9, and 10 and the number of sub-aperture were 1,253. From these results, we know that the reconstructed wavefronts were similar to the wavefront of cooke triplet as n was the larger than 4 and the zemike coefficient was equal to that of cooke triplet as n was 7. The developed program is able to be applied to the core technology to develope the assessment equipment of an optical system using the adaptive optics.

• Korean Journal of Mathematics
• /
• v.9 no.2
• /
• pp.129-131
• /
• 2001

Let $q=p^{e1}_1{\cdots}p^{em}_m$ be the product of distinct prime elements. In this short paper, we show that the largest value of M such that there exists an ($n$, M, $n-1$) $q$-ary code is $q^2$ if $n-1{\leq}p^{ei}_i$ for all $i$.

• Proceedings of the KSME Conference
• /
• 2005.11a
• /
• pp.114.2-114.2
• /
• 2005

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8B
• /
• pp.745-756
• /
• 2006

The general packet filtering system using TCAM has some limitations such as range and negation rules filtering, so this paper proposes efficient searching schemes than existing methods. CRG(Converting Range rules using Gray code) algorithm, in the case of range rules, that takes advantage of the gray code and TCAM characteristics to save a number of TCAM entries is proposed, and a nTCAM(TCAM with negation) architecture for negation rules is proposed, implemented using a FPGA design tool, and verified through the wave simulation. According to the simulation with the SNORT rules, the CRG algorithm and nTCAM save TCAM entries about 93% in IPv4 and 98% in IPv6 than the existing method.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.3
• /
• pp.703-714
• /
• 1998

Translation of a Korean text into a braille text causes no problem under the existing Korean braille-code System that maintains I: I correspondence between Korean characters and braille codes. However, reverse translation of a braille text into a Korean text would cause unavoidable mis-translation due to I : N correspondences between braille codes and Korean characters. The analysis shows that in Korean braille-code System, the major reasons for mis-translation are the conflicts between Korean Chosung (initial consonant) letters and numbers, between Korean Jongsung (final consonant) letters and punctuations, between Korean Jongsung (final consonant) letters and English mode delimiter codes, and overlapping use of the same braille code such as opening and closing parentheses. In this paper, we firstly established a reverse translation rule, that is to use an ordinary braille code unless the braille code causes any conflict in braille code sequences. If any ordinary braille code may cause some conflict during the reverse translation, an extended braille code that we propose in this paper must be used. In the experimentation, we cannot get any translation errors with the newly designed braille-code System compared with 25% of errors with the existing braille-code System.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9C
• /
• pp.721-728
• /
• 2010

CAMC (constant amplitude multi-code) has a better performance of error correction in iterative decoding than SPCPC (single parity check product code). CAMC benefits from a processing gain since it belongs to a spread spectrum signal. We show that the processing gain enhances the performance of CAMC. Additional correction of bit errors is achieved in the de-spreading of iteratively decoded signal. If the number of errors which survived the iterative decoding is less than or equal to ($\sqrt{N}/2-1$), all of the bit errors are removed after the de-spreading. We also propose a stopping criterion in the iterative decoding, which is based on the histogram of EI (extrinsic information). The initial values of EI are randomly distributed, and then they converge to ($-E_{max}$) or ($+E_{max}$) over the iterations. The strength of the convergence reflects how successfully error correction process is performed. Experimental results show that the proposed method achieves a gain of 0.2 dB in Eb/No.

• 유체기계공업학회:학술대회논문집
• /
• 2006.08a
• /
• pp.235-238
• /
• 2006

This paper is about the code that realizes the $e^N$-Method for boundary-layer transition prediction. The $e^N$-Method based on the linear stability theory is applied to predicting boundary-layer transition frequently. This paper deals with the construction of code, stability analysis and the calculation of N-factor. The results of transition prediction using the $e^N$-Method for flat plate/cone compressible boundary-layers are presented.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.4 no.5
• /
• pp.1067-1075
• /
• 2000

In this paper, the performance of turbo code using semi random interleaver over the radio communication channel was analyzed. In the result, we proved that the performance of decoder was excellent as increase the interleaver size, constraint length, and iteration number. When the constraint length of turbo code using seim random interleaver and convolutional code is constant, and BER $10^{-4}$ each value of $E_b/N_o$ was 6.4(DB) and 1.7(dB). There(ore, when the constraint length was constant, we proved that the performance of turbo code using semi random interleaver is superior to convolutional code about 4.7(dB) in the case of BER=$10^{-4}$.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.476-477
• /
• 2013

Gadget-2 is a scientific simulation code has been used for many different types of simulations like, Colliding Galaxies, Cluster Formation and the popular Millennium Simulation. The code is parallelized with Message Passing Interface (MPI) and is written in C language. There is also a Java adaptation of the original code written using MPJ Express called Java Gadget. Java Gadget writes a lot of checkpoint data which may or may not use the HDF-5 file format. Since, HDF-5 is MPI-IO compliant, we can use our MPJ-IO library to perform parallel reading and writing of the checkpoint files and improve I/O performance. Additionally, to add reliability to the code execution, we propose the usage of Hadoop Distributed File System (HDFS) for writing the intermediate (checkpoint files) and final data (output files). The current code writes and reads the input, output and checkpoint files sequentially which can easily become bottleneck for large scale simulations. In this paper, we propose Sim-Hadoop, a framework to leverage HDFS and MPJ-IO for improving the I/O performance of Java Gadget code.