• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.2
• /
• pp.65-72
• /
• 2004

In this paper, we propose a new blind image watermarking method in wavelet domain. It is necessary to find out watermark insertion location in blind watermark. To select the watermark embedding locations, we use the increment and decrement information of the successive approximation coefficients after discrete wavelet transformed. In order to evaluate the proposed algorithm we embed watermark into test images and detect the watermark after attacks like JPEG lossy compression and performing of various liters. Experimental results show that the proposed method is robust against various kinds of attacks and still remains transparency.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.10a
• /
• pp.940-941
• /
• 2016

The compensation effects of the distroted WDM channels in dispersion-managed optical links with the linear/nonlinear increments/decrements of adjacent residual dispersions per span (RDPSs) as the numer of fiber span is more increased are evaluated through numerical simulation.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.219-222
• /
• 2002

In this paper, we propose a new blind image watermarking method in wavelet domain. It is necessary to find out watermark insertion location in blind watermark. We use horizontal and vertical difference of LL components to select watermark insertion location, because increment or decrement of successive components is rarely changed in LL band. A pseudo-random sequence is used as a watermark. Experimental results show that the proposed method is robust to various kinds of attacks such as JPEG lossy compression, averaging, median filtering, resizing, histogram equalization, and additive Gaussian noise.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.1965-1970
• /
• 2011

This paper proposes the method of switching function implementation using switching function extraction based on graph over finite fields. After we deduce the matrix equation from path number of directional graph, we propose the switching function circuit algorithm, also we propose the code assignment algorithm for nodes which is satisfied the directional graph characteristics with designed circuits. We can implement more optimal switching function compare with former algorithm, also we can design the switching function circuit which have any natural number path through the proposed switching function circuit implementation algorithms. Also the proposed switching function implementation using graph theory over finite fields have decrement number of input-output, circuit construction simplification, increment arithmetic speed and decrement cost etc.

• ETRI Journal
• /
• v.25 no.5
• /
• pp.305-314
• /
• 2003

In this paper, we present a soft IP compiler for the Reed-Solomon decoder that generates a fully synthesizable VHDL core exploiting characteristic parameters and design constraints that we newly classify for the soft IP. It produces a structural design with an estimable regular architecture based on a finite state machine with a datapath (FSMD). Since characteristic parameters provide different design points on the design space, using one of two simple procedures called the constructive search with area increment (CSAI) and constructive search with speed decrement (CSSD) for design space exploration, the core compiler makes it possible for an IP user to create the Reed-Solomon decoder with appropriate sub-architectures without synthesizing many models. Experimental results show that the IP compiler can apply to several industry standards.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.7
• /
• pp.110-116
• /
• 1994

In this paper a Duty Effective Overlap Scanning method (DEOS) for the improvement of driving efficiency of LC displays which have the RMS voltage responding characteristics is proposed and new processing method of data signals for optimum application of this method is also proposed. Proposed method has a few advantages such as the increment of duty ratio the increment of driving power loaded on LC cell and the decrement of RMS voltage error rate caused by signal attenuation on electrodes composing of display when compared with the conventional method which is called as optimum voltage amplitude selection method. And also by adopting new data signal processing method which has 3 kinds of voltage levels additional advantage much improving crosstalk phenomenon which is the most serious problems of simple matrix structured display is obtained. For the characteristic estimation new mathematical representation for new overlap scanning method and data signal processing method are induced and defined. And by the defined formula and simulation the characteristics of the proposed method and the conventional method are compared and analyzed. As a result of estimation this new method being able to optimize the overlap rate of scan signal and using 3 levels of data signals has the characteristic which can improve the driving efficiency of LC displays.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.857-862
• /
• 2004

This paper analyzes properties of the recently developed nonlinear optimization method, Dynamic Encoding Algorithm for Searches (DEAS) [1]. DEAS locates local minima with binary strings (or binary matrices for multi-dimensional problems) by iterating the two operators; bisectional search (BSS) and unidirectional search (UDS). BSS increases binary strings by one digit (i.e., zero or one), while UDS performs increment or decrement to binary strings with no change of string length. Owing to these search routines, DEAS retains the optimization capability that combines the special features of several conventional optimization methods. In this paper, a special feature of BSS and UDS in DEAS is analyzed. In addition, a effective global search strategy is established by using information of DEAS. Effectiveness of the proposed global search strategy is validated through the well-known benchmark functions.

• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.43-51
• /
• 2010

IEEE 802.11 defines distributed coordination function (DCF), which is characterized by CSMA/CA and binary exponential backoff (BEB) algorithm. Most modifications on DCF so far have focused on updating of the contention window (CW) size depending on the outcome of own frame transmission without considering freezing periods experienced in the backoff interval. We propose two simple but novel schemes which effectively utilize the number of freezing periods sensed during the current backoff interval. The proposed schemes can be applied to DCF and its family, such as double increment double decrement (DIDD). Saturation throughput of the proposed schemes is analyzed by means of Bianchi's Markovian model. Computer simulation validates the accuracy of the analysis. Numerical results based on IEEE 802.11b show that up to about 20% improvement of saturation throughput can be achieved by combining the proposed scheme with conventional schemes when applied to the basic access procedure.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.41 no.6
• /
• pp.11-16
• /
• 2004

The integral term of PID controller have the advantage of reduced steady state error and the disadvantage of accumulated errors. We proposed a method that maintains its advantage and improvs the disadvantage in transient response. The proposed PID control method with modified integral parameter accumulates errors in increment section and ignores errors in decrement section. Therefore, the proposed PID control method decreases overshoot, and makes settling time faster than conventional PID control method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.5
• /
• pp.939-948
• /
• 1997

In this paper, we propose the new rate-based transmission rates control algorithm that allocates the fair band-width for ABR service in ATM network. In the traditional ABR service, bandwidth is allocated with constant rate increment or decrement, but in the proposed algorithm, it is allocated fairly to the connected calls by the fuzzy inference of the available bandwidth. The fuzzy inference uses buffer state and the buffer variant rate as the input variables, and uses the total transmission rate as a output variable. This inference a bandwidth is fairly distributed over all ABR calls in service. By simmulation, we showed that the proposed method improved 0.17% in link effectiveness when RIF, RDF is 1/4, 38.6% when RIF, RDF 1/16, and 82.4% when RIF, RDF 1/32 than that of the traditional EFPCA.