• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.6
• /
• pp.431-441
• /
• 2003

This paper presents the design of 32 bit microprocessor for a sequence control using a field programmable gate array(FPGA). The microprocessor was designed by a VHDL with top down method, the program memory was separated from the data memory for high speed execution of sequence instructions. Therefore it was possible that sequence instructions could be operated at the same time during the instruction fetch cycle. In order to reduce the instruction decoding time and the interface time of the data memory interface, an instruction code size was implemented by 32 bits. And the real time debug operation was implemented for easeful debugging the designed processor with a single step run, PC break point run, data memory break point run. Also in this designed microprocessor, pulse instructions, step controllers, master controllers, BM and BCD type arithmetic instructions, barrel shift instructions were implemented for sequence logic control. The FPGA was synthesized under a Xilinx's Foundation 4.2i Project Manager using a V600EHQ240 which contains 600,000 gates. Finally simulation and experiment were successfully performed respectively. For showing good performance, the designed microprocessor for the sequence logic control was compared with the H8S/2148 microprocessor which contained many bit instructions for sequence logic control. The designed processor for the sequence logic showed good performance.

• Journal of the Korean Society for Precision Engineering
• /
• v.24 no.7 s.196
• /
• pp.39-48
• /
• 2007

This paper presents a method of a line balanced assembly sequence generation based on the verification of a disassemblability and a work time. To derive the disassemblability for a part to be disassembled, first we inference collision free assembly directions by extracting separable directions fur the part. And we determine the disassemblability defined by the separability and stability cost. The separability cost represents a facility of the part disassembly operation, and the stability cost which represents a degree of the stability for the base assembly motion. Based upon the results, we propose a new approach of evaluating work time using neural networks. The proposed assembly sequence generation provides an effective means of solving the line balancing problem and gives a design guidance of planning assembly lay-out in flexible manufacturing application. Example study is given to illustrate the concepts and procedure of the proposed schemes.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.4
• /
• pp.444-452
• /
• 2003

An integration system with multi-measurement sets can be realized via combined application of a centralized and federated Kalman filter. It is difficult for the centralized Kalman filter to remove a failed sensor in comparison with the federated Kalman filter. All varieties of Kalman filters monitor innovation sequence (residual) for detection and isolation of a failed sensor. The innovation sequence, which is selected as an indicator of real time estimation error plays an important role in adaptive mechanism design. In this study, the centralized Kalman filter with adaptive measurement fusion is introduced by means of innovation sequence. The objectives of adaptive measurement fusion are automatic isolation and recovery of some sensor failures as well as inherent monitoring capability. The proposed adaptive filter is applied to the GPS/SDINS integration system with an additional sensor. Simulation studies attest that the proposed adaptive scheme is effective for isolation and recovery of immediate sensor failures.

• Journal of applied mathematics & informatics
• /
• v.3 no.1
• /
• pp.11-24
• /
• 1996

The focus of this research is the class of sequential al-gorithms called predictive sorting algorithms for sorting a given set of n elements using pairwise comparisons. The order in which these pairwise comparisons are made is defined by a fixed sequence of all un-ordered pairs of distinct integers{1,2 ···,n} called a sort sequence. A predictive sorting algorithm associated with a sort sequence spec-ifies pairwise comparisons of elements in the input set in the order defined by the sort sequence except that the comparisons whose out-comes can be inferred from the preceding pairs of comparisons are not performed. in this paper predictive sorting algorithms are obtained based on known sorting algorithms and are shown to be required on the average O(n log n) comparisons.

• Genomics & Informatics
• /
• v.9 no.4
• /
• pp.189-193
• /
• 2011

Simple sequence repeats (SSRs) are ubiquitous short tandem duplications found within eukaryotic genomes. Their length variability and abundance throughout the genome has led them to be widely used as molecular markers for crop-breeding programs, facilitating the use of marker-assisted selection as well as estimation of genetic population structure. Here, we report a software application, "SSR-Primer Generator " for SSR discovery, SSR-primer design, and homology-based search of in silico amplicons from a DNA sequence dataset. On submission of multiple FASTA-format DNA sequences, those analyses are batch processed in a Java runtime environment (JRE) platform, in a pipeline, and the resulting data are visualized in HTML tabular format. This application will be a useful tool for reducing the time and costs associated with the development and application of SSR markers.

• Nuclear Engineering and Technology
• /
• v.42 no.3
• /
• pp.305-312
• /
• 2010

The protection sequence of an AC/DC converter for an ITER PF coil system is developed in this study. Possible faults in the coil system are simulated and the results reflected in the design of a sequence to protect the coil and converter. The inductances of the current sharing reactors and thyristor numbers in parallel with the bridge arms are optimized with the designed protection sequence.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.11
• /
• pp.2033-2035
• /
• 2007

This paper proposes a novel iterative LMS-based decision feedback equalizer for short burst transmission with relatively short training sequence. In the proposed equalizer, the longer concatenated training sequence can provide the more sufficient channel information and the reused original training sequence can provide the correct decision feedback information. In addition, the overall adaptive processing is performed using the low complexity LMS algorithm. The study shows the performance of the proposed method is enhanced with the number of iterations and, furthermore, better than that of the conventional LMS-based DFEs with the training sequence of longer or equal length. Computational complexity is increased linearly with the number of iterations.

• Industrial Engineering and Management Systems
• /
• v.1 no.1
• /
• pp.19-28
• /
• 2002

An operation sequence of parts is one of the most important production factors in the design of cellular manufacturing systems. Many similarity coefficient method (SCM) based approaches have been proposed to solve cell formation problems in the literature. However, most of them do not consider the operation sequence factor. This study presents an operation sequence ratio (OSR) and modifies some existing similarity coefficients using the OSR to solver cell formation problems considering operation sequences. The computational results show that the OSR ratio is useful and robust in solving cell formation problems with operation sequences.

• Proceedings of the KIEE Conference
• /
• 2005.07b
• /
• pp.1104-1107
• /
• 2005

This paper presents a comparison of core losses for the four cases of Switched Reluctance Motors (SRM) with different winding method and switching sequence. With concentrated winding SRM, two kinds of switching sequence are considered for one-phase exciting and two-phase simultaneously exciting driving. With both distributed winding and toroidal winding, two-phase exciting driving is considered. The ratio of calculated core losses to input power is able to be used a guide or reference for deciding the winding method and switching sequence of in the initial design stage of SRM.

• Journal of the Institute of Convergence Signal Processing
• /
• v.13 no.4
• /
• pp.194-200
• /
• 2012

In this paper we analyze the code sequence generating algorism defined on $GF(2^n)$ proposed by S.Bostas and V.Kumar[7] and derive the implementation functions of code sequence generator using Boolean functions which can map the vector space $F_2^n$ of all binary vectors of length n, to the finite field with two elements $F_2$. We find the code sequence generating boolean functions based on two kinds of the primitive polynomials of degree, n=5 and n=7 from trace function. We then design and implement the code sequence generators using these functions, and produce two code sequence groups. The two groups have the period 31 and 127 and the magnitudes of out of phase(${\tau}{\neq}0$) autocorrelation and crosscorrelation functions {-9, -1, 7} and {-17, -1, 15}, satisfying the period $L=2^n-1$ and the correlation functions $R_{ij}({\tau})=\{-2^{(n+1)/2}-1,-1,2^{(n+l)/2}-1\}$ respectively. Through these results, we confirm that the code sequence generators using boolean functions are designed and implemented correctly.