• The Journal of Engineering Research
• /
• v.3 no.1
• /
• pp.65-73
• /
• 1998

One approach to improved image restoration methods has been the incorporation of additional source information via Gibbs priors that assume a source that is piecewise smooth. A natural Gibbs prior for expressing such constraints is an energy function defined on binary valued line processes as well as source intensities. However, the estimation of both continuous variables and binary variables is known to be a difficult problem. In this work, we consider the application of the deterministic annealing method. Unlike other methods, the deterministic annealing method offers a principled and efficient means of handling the problems associated with mixed continuous and binary variable objectives. The application of the deterministic annealing method results in a sequence of objective functions (defined only on the continuous variables) whose sequence of solutions approaches that of the original mixed variable objective function. The sequence is indexed by a control parameter (the temperature). The energy functions at high temperatures are smooth approximations of the energy functions at lower temperatures. Consequently, it is easier to minimize the energy functions at high temperatures and then track the minimum through the variation of the temperature. This is the essence of a continuation method. We show experimental results, which demonstrate the efficacy of the continuation method applied to a Bayesian restoration model.

• Journal of IKEEE
• /
• v.13 no.1
• /
• pp.65-70
• /
• 2009

We propose an ultrashort pulse optical code-division multiple-access (O-CDMA) scheme based on a pseudorandom binary M-sequence spectral phase encoding and decoding of coherent mode-locked laser pulses and perform a numerical simulation to analyze its feasibility. We demonstrate the ability to properly decode any of the multiple (eight) 10 Gbit/s users by the matched code selection of the spectral phase decoder. The peak power signal to noise ratio of properly and improperly decoded $8{\times}10 Gb/s$ signals could be greater than 15 for 127 M-sequence coding.

• ETRI Journal
• /
• v.35 no.5
• /
• pp.739-747
• /
• 2013

This paper investigates the multifarious nature of the long-term evolution (LTE) scheme and that of the modified LTE scheme for symbol timing synchronization (STS). This investigation allows us to propose a new replica correlation-based STS scheme to overcome the inherent weaknesses of the other two schemes. The proposed STS signal combines a gold sequence and a half sine wave in the time domain, whereas conventional STS signals specify either binary sequences or complex sequences in the time domain or in the frequency domain. In the proposed scheme, a sufficient correlation property is realized by the gold sequence, and robustness against the frequency offset (FO) is achieved through the sine wave. Compared to the existing LTE-related schemes, the proposed scheme can better achieve immunity to FO and reduction in detector complexity, as well as a low peak-to-average power ratio and a low detection error rate. Performance evaluations through analysis and simulation are provided in the paper to demonstrate these attributes.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.15-27
• /
• 1998

In the parallel processing systems, a compiler partitions a loaded program into tasks, allocates the tasks on multiple processors and schedules the tasks on each allocated processor. In this paper we suggest a Genetic Algorithm(GA) based scheduling method to find an optimal allocation and sequence of tasks on each Processor. The suggested method uses a chromosome which consists of task sequence and binary string that represent the number and order of tasks on each processor respectively. Two correction algorithms are used to maintain precedency constraints of the tasks in the chromosome. This scheduling method determines the optimal number of processors within limited numbers, and then finds the optimal schedule for each processor. A result from computational experiment of the suggested method is given.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.20 no.9
• /
• pp.32-39
• /
• 2006

In this paper, an iterative subspace-based calibration algorithm for a CDMA-based antenna array in the presence of unknown gain and phase error is presented. The algorithm does not depend on the array geometry and does not require a prior knowledge of the Directions Of Arrival (DOA) of the signals. The method requires the code sequence of a reference user only. The proposed algorithm is based on the subspace method and root finding approach, and it provides estimates of the calibration vector, the DOA and the channel impulse response, by using the code sequence of a reference user. The performance of the proposed algorithm was investigated by means of computer simulations and was verified using field data measured through a custom-built W-CDMA test-bed. The data show that experimental results match well with the theoretical calibration algorithm. Also, teh study propose an efficient algorithm using the simulated annealing technique. This algorithm overcomes the requirement of initial guessing in the subspace-based approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.8
• /
• pp.1128-1135
• /
• 1993

In this paper, new binary cyclic codes (hereafter, refered to as GMW code) which are generated by using GMW sequence, g(t) = tr((trk(a))r), and its cyclic shifts are introduced. Code length of GMW codes is 2a-1, where k is composite integer, e·J. Dimension of the GMW codes is k(k/j)w-1, where w is a Hamming weight of r. Several properties of GMW codes such as designed distance, minimum distance, and weights of code words are obtained in terms of parameters of GMW sequences. And expansion of GMW sequences in terms of m-sequence and its decimation sequences are introduced and characteristic polynomials of GMW sequences are also derived.

• East Asian mathematical journal
• /
• v.36 no.1
• /
• pp.61-71
• /
• 2020

Up to the present day, the best solution we can get to the truncated moment problem (TMP) is probably the Flat Extension Theorem. It says that if the corresponding moment matrix of a moment sequence admits a rank-preserving positive extension, then the sequence has a representing measure. However, constructing a flat extension for most higher-order moment sequences cannot be executed easily because it requires to allow many parameters. Recently, the author has considered various decompositions of a moment matrix to find a solution to TMP instead of an extension. Using a new approach with the Hadamard product, the author would like to introduce more techniques related to moment matrix decompositions.

• Journal of The Korean Astronomical Society
• /
• v.38 no.4
• /
• pp.415-422
• /
• 2005

UBVIJHK photometry of the open cluster NGC 2194 are presented. Color-Magnitude diagrams of this cluster show well-defined main sequence and red giant clump. The main sequence also contains clear evidence of binary populations. Based on color-color diagrams, absolute magnitude of red giant clump, ZAMS fitting, and comparisons of observed color-magnitude diagrams with theoretical models, we derive following parameters for the cluster; reddening $E(B-V)=0.44{\pm}0.04$, age of log $t{\sim}8.8$, and finally distance of $(m-M)_0=12.20{\pm}0.18$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.9A
• /
• pp.2240-2247
• /
• 1998

This paper presents a new method for channel impulse response measurment with a suitably designed binary sounding sequence. This method results in ideal channel estimation using three correlators instead of one. This system complexity can be easily overcome by the present technologies. The class of sounding sequences used in this method are the training sequence for channel impulse response measurment with the zero values of autocorrelation function at all shifts except zero and middle shifts in digital cellular mobile telephone system based on GSM. Computer searches are carried out to find the suitable sounding sequences.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.4
• /
• pp.304-311
• /
• 2003

This paper considers a new variation of scheduling problems where jobs are dispatched in batches. The variation is the case where the batch sequence is fixed. The objective is to minimize the sum of the completion times of the batches. This simple environment has a variety of real world applications such as part kitting and customer order scheduling. We show that this problem is binary NP-complete when there exist two machines. For the same problem, we develop an optimal dynamic programming (DP) algorithm which runs in pseudo-polynomial time. We finally prove the optimality of the DP algorithm.