• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3C
• /
• pp.209-214
• /
• 2003

Multi-mode coding method is a reliable DC-suppression method. There are two ways to improve the DC-suppression performance. One is improving scrambler's performance, and the other is improving selection criteria. The latter uses the MRDS(minimum running digital sum) criterion. It is easy to calculate, but its performance goes down when the length of codeword is getting longer. The MSW(mean squared weight) criterion that is known as the best so far regardless of the length of codeword has the high complexity. In this paper, we present the new selection criteria, MPRDS(minimum peak RDS) and A BSRDS(absolute RDS). Their performance are close to the MSW, implementation is simple. And also we present the SC(sign change) that has a subsidiary role with the original selection criteria and improve the capacity.

• The KIPS Transactions:PartD
• /
• v.15D no.4
• /
• pp.549-556
• /
• 2008

Web-based Enterprise Intranet System is developed Object-oriented programming language and data management is constructed using RDBMS. Between Object-oriented programming language and RDBMS bring about "Object-Relational Impedance Mismatch" due to heterogeneous paradigm. To solve this kinds of problems commonly use the ORM Framework that it is converting data between incompatible type systems in databases and object-oriented programming languages, uses complex mapping metadata. It causes difficult to develop and maintain because of inflexible in changes. This paper proposed persistence framework that solve the existing complexity of ORM framework and has more flexible in evolution of database table. This persistence framework is unnecessary meta information that connecting with entity of database table and the objects, it offers users convenience of maintenance and it allows far more flexible and affordable systems to be built because of automatically code generation. The result of testing based on the proposed persistence framework with Hibernate, iBATIS, It is similar response time with iBATIS and it has more about three times faster than Hibernate. But iBATIS has problems of mass data processing.

• Journal of IKEEE
• /
• v.16 no.2
• /
• pp.138-144
• /
• 2012

In this paper, a semi-analytical approach is proposed for DSF(Decode and Selective Forward)-Relay MC-CDMA(MultiCarrier-Code Division Multiple Access) systems over multipath Rayleigh fading channels. Considering BER(bit error rate) performance and complexity, the MMSE-C(Minimum Mean squared Error-per subCarrier) is used as the combining method for MC-CDMA systems. At first, the analytical method based on error-events at relay nodes for DSF-Relay schemes is utilized in order to derive the averaged BER. Then, the averaged BER is expressed as the form considering possible all error-events. Also, proposed semi-analytical expressions have been verified by comparing with simulation results. Finally, it is verified that the derived analytical expressions can be a frame work to cover different multipath Rayleigh fading channel conditions and to measure the upper performance for DSF-Relay MC-CDMA systems.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.7
• /
• pp.1-8
• /
• 2000

In this paper, we introduce a modified interference cancellation scheme for multiuser detection in CDMA(Code Division Multiple Access). This detector uses SIC(Successive Interference Canceller) scheme and divides the received signals to reduce the delay time. In this proposed structure, the active users are divided into a number of groups. Within each group, parallel detection is performed to estimate the output signal of that group. The estimated output signal due to that group is then subtracted from the received signal and the resulting residual signal is used for the parallel detection of the next group. This parallel and serial cancellation process is repeated until the last group in the stage is completed. The estimated output signals due to all groups except -th group are MAI for the user signals in -th group. Therefore, the estimated output signals due to all groups except th group are subtracted from the received signal, and then the obtained signal becomes the input signal of -th SIC. The proposed RDSIC (Reduced Delay time of Successive Interference Canceller) has performance and complexity close to the SIC, but with much less detection delay.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.16 no.4 s.95
• /
• pp.351-358
• /
• 2005

In this paper, STBC(Space Time Block Code) is applied to the UWB system and frequency repeated diversity is used to get the 4-th order space time diversity gain. The performance of UWB STBC-OFDM system is analyzed by computer simulation. As a result of analysis, proposed UWB system can reduce the complexity that is introduced by increaing number of radiator and show the same performance of 4 antennas with that only using 2 radiator. This system at the $10^{-4}$ also shows the enhancement of $7.1\;\cal{dB}$ to the general UWB OFDM and $1.9\;\cal{dB}$ to UWB STBC-OFDM.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.7
• /
• pp.1321-1327
• /
• 2009

In this paper, as the mobile communication service is widely used and the demand for wireless repeaters is rapidly increasing because of the easiness of extending service areas. But a wireless repeater has a problem the oscillation due to feedback signal. We proposed a new hybrid interference canceller using the adaptive filter with CMA(Constant Modulus Algorithm)-Grouped LMS(Least Mean Square) algorithm in the adaptive interference canceller. The proposed interference canceller has better channel adaptive performance and a lower MSE(Mean Square Error) than conventional structure because it uses the cancellation method of Grouped LMS algorithm. The proposed detector uses the LMS algorithms with two different step size to reduce mean square error and to obtain fast convergence. This structure reduces the number of iterations for the same MSE performance and hardware complexity compared to conventional nonlinear interference canceller.

• The KIPS Transactions:PartA
• /
• v.14A no.3 s.107
• /
• pp.151-158
• /
• 2007

Quadtree, which is a hierarchical data structure, is a very important data structure to represent images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The computation of block location is one of important geometry operations in image processing, which extracts a component completely including a given block. In this paper, we present a constant time algorithm to compute the block location of images represented by quadtrees, using three-dimensional $n\times n\times n$ processors on RMESH(Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to deal with the locational codes of quardtree on the hierarchical structure of $n\times n\times n$ RMESH.

• The KIPS Transactions:PartA
• /
• v.10A no.3
• /
• pp.207-214
• /
• 2003

Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The linear translation is one of important operations in image processing, which moves the image by a given distance. In this paper, we present an algorithm to perform the linear translation of binary images represented by quadtrees, using three-dimensional $n{\times}n{\times}n$ processors on RMESH (Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of n${\times}$n${\times}$n RMESH.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.855-864
• /
• 2004

Programmers can be got the test-related information for implementation without interference of source code complexity by use of the formal specification. Especially the external inputs and system responses can be represented precisely by formal specification in testing phase of web-based software systems. This paper suggests a method of extracting test cases by use of formal specification. Object-Z formal specification represents various test-related information for complex functions of web-based applications. State Transition Models could be built from the formal specification so that test scenarios were extracted from STDs from the highest level to detail levels. The target system for verification of this method is a web-based banking system which is necessary to be secured and critical on errors. This method would be an important factor in automatizing test procedure for web-based application software systems combining the user-base test technique.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.6
• /
• pp.541-547
• /
• 2019

Recent developments in hacking technology are continuing to increase the number of new security vulnerabilities. Approximately 80,000 new vulnerabilities have been registered in the Common Vulnerability Enumeration (CVE) database, which is a representative vulnerability database, from 2010 to 2015, and the trend is gradually increasing in recent years. While security vulnerabilities are growing at a rapid pace, responses to security vulnerabilities are slow to respond because they rely on manual analysis. To solve this problem, there is a need for a technology that can automatically detect and patch security vulnerabilities and respond to security vulnerabilities in advance. In this paper, we propose the technology to extract the features of the vulnerability-discovery target binary through complexity analysis, and select a vulnerability-discovery strategy suitable for the feature and automatically explore the vulnerability. The proposed technology was compared to the AFL, ANGR, and Driller tools, with about 6% improvement in code coverage, about 2.4 times increase in crash count, and about 11% improvement in crash incidence.