• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.3A
• /
• pp.172-178
• /
• 2012

This paper studies the application of a fuzzy-ARTMAP (FAM) neural network to multi-user detector (MUD) for direct sequence (DS)-code division multiple access (CDMA) system. This method shows new solution for solving the problems, such as complexity and long training, which is found when implementing the previously developed neural-basis MUDs. The proposed FAM based MUD is fast and easy to train and includes capabilities not found in other neural network approaches; a small number of parameters, no requirements for the choice of initial weights, automatic increase of hidden units, no risk of getting trapped in local minima, and the capabilities of adding new data without retraining previously trained data. In simulation studies, binary signals were generated at random in a linear channel with Gaussian noise. The performance of FAM based MUD is compared with other neural net based MUDs in terms of the bit error rate.

• ETRI Journal
• /
• v.20 no.1
• /
• pp.16-27
• /
• 1998

In this paper, we consider the acquisition performance of an IS-95 reverse link access channel slot as a function of system design parameters such as postdetection integration length and the number of access channel message block repetitons. The uncertainty region of the reverse link spreading codes compared to that of forward link is very small, since the uncertainty region of the reverse link is determined by a cell radius. Thus, the parallel acquisiton technique in the reverse link is more efficient than a serial acquisition technique in terms of implementation and of acquisition time. The parallel acquisition is achieved by a bank of N parallel I/Q noncoherent correlator are analyzed for band-limited noise and the Rayleigh fast fading channel. The detection probability is derived for multiple correct code-phase offsets and multipath fading. The probability of no message error is derived when rake combining, access channel message block combining, and Viterbi decoding are applied. Numerical results provide the acquisition performance for system design parameters such as postdetection integration length and number of access channel message block repetitions in case of a random access on a mobile station.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.64 no.7
• /
• pp.1026-1030
• /
• 2015

In this paper, we propose a signal processing board of an optical delay simulator for evaluating a long-range laser range finder and a laser target designator. We improved the accuracy by applying the clock multiplication and the correction of error gradient. To evaluate the performance of the proposed method, we implemented a prototype board and performed experiments. As a result, we implemented the optical delay simulator with resolution less than 0.7m in measuring distance 60km and a standard deviation of 0.041m. The PRF code detection logic and generation logic have a stability less than 0.03% and 0.08% compared to the NATO standard, respectively.

• Journal of information and communication convergence engineering
• /
• v.2 no.2
• /
• pp.67-70
• /
• 2004

In this paper, we propose two novel high-rate high-performance space-time codes for multiple-input multiple-output (MIMO) systems. When $n_T$ transmit antennas and When $n_R$ ＝ When $n_T$ receive antennas are deployed, the two proposed codes respectively offer transmission rates of (When $n_T$ -1) and (When $n_T$ -2) symbols per channel use and diversity orders of 3 and 5. As a consequence, our proposed codes allow the MIMO systems to employ a simple detection technique based on QR decomposition. Moreover, for equal or even higher spectral efficiencies, our proposed codes always provide much better bit error rate (BER) performances than V-BLAST architecture does when When $n_R$ ＝ When $n_T$. Computer simulation is given to verify performances of our proposed codes.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.19 no.1
• /
• pp.50-56
• /
• 2016

This paper is about the implementation of the OFDM-based border guard/reconnaissance communication terminal systems. We have implemented Real-time Dynamic DL/UL symbol rate control function using the DL-MAP message, and proposed error detection method caused by malfunctioning and timing optimization method. The proposed scheme detects the variable rate symbol decoding timing without increasing additional physical layer logic, and also provides a wide variety of DL/UL data transfer rate. Furthermore, the proposed scheme applies to the current border guard/reconnaissance equipment and confirms a operation performance through field tests and demonstration at home and abroad.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.4 no.4
• /
• pp.286-294
• /
• 2011

Cable modems typically are implemented by a forward error correction(FEC) scheme. The ITU-T Recommendation J-38 Annex B specifies using 64- and 256- quadrature amplitude modulation (QAM) and extended RS coding scheme. In implementing the cable modem, there are some problems to fabricate and fitting on FPGA chip. First, many clocks are needed in implementing cable modem because of different code rate and different modulation types. To reduce the number of clocks, we use the two memories, which are different clock speed for reading and writing data. Second, this system lost the bit-synchronization and frame-synchronization in decoder, the system recognize that all data is error. This paper solves the problems by using simple 5-stage registers and unique sync-word. Based on solutions for about problems, the cable modem is fabricated on FPGA chip name as Vertex II pro xc2vp30-5 by Xilinx, and we confirmed the effectiveness of the results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.1
• /
• pp.109-117
• /
• 2013

Polar codes are the first provable error correcting code achieving the symmetric channel capacity in a wide case of binary input discrete memoryless channel(BI-DMC). However, finite length polar codes have an error floor problem with successive-cancellation list(SCL) decoder. From previous works, we can solve this problem by concatenating CRC(Cyclic Redundancy Check) codes. In this paper we propose to make polar codes having extended-minimum distance from original polar codes without outer codes using correlation with generate matrix of polar codes and that of RM(Reed-Muller) codes. And we compare performance of proposed polar codes with that of polar codes concatenating CRC codes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.938-941
• /
• 2010

Though a compiler checks memory errors, it is difficult for the compiler to detect function pointer errors in code level. Thus, in this paper, we propose a method for effectively detecting Invalid function pointer access errors, by analyzing assembly codes that are obtained by disassembling an executable file. To detect the errors, assembly codes in disassembled files are checked out based on the instruction transition diagrams which are constructed through analyzing normal usage patterns of function pointer access. When applying the proposed method to various programs having no compilation error, a total of about 500 potential errors including the ones of well-known open source programs such as Apache web server and PHP script interpreter are detected among 1 million lines of assembly codes corresponding to a total of about 10 thousand functions.

• 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.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.21 no.1
• /
• pp.1-11
• /
• 2008

Stiffness estimation of a shear building due to local damages is usually achieved though structural analysis based on the assumed material properties and idealized numerical modeling of structure. Conventional numerical modeling, however, frequently causes an inevitable error in the structural response and this makes it difficult to exactly predict the damage state in structure. To solve this problem, this paper introduces a damage detection technique for shear building using genetic algorithm. The introduced algorithm evaluates the damage in structure using a flexibility matrix since the flexibility matrix can exactly be obtained from the field test in spite of using a few lower dynamic modes of structure. The introduced algorithm is expected to be more effectively used in damage detection of structures rather than conventional method using the stiffness matrix. Moreover, even in cases when an accurate measurement of structural stiffness cannot be expected, the proposed technique makes it possible to estimate the absolute change in stiffness of the structure on the basis of genetic algorithm. The validity of the proposed technique is demonstrated though numerical analysis using OPENSEES.