• Proceedings of the IEEK Conference
• /
• 2003.07d
• /
• pp.1363-1366
• /
• 2003

This paper introduces computerized version of Hangout(Korean Language) Standard Pronunciation Rule that can be used in Korean processing systems such as Korean voice synthesis system and Korean voice recognition system. For this purpose, we build Petri net models for each items of the Standard Pronunciation Rule, and then integrate them into the vocal sound conversion table. The reversion of Hangul Standard Pronunciation Rule regulates the way of matching vocal sounds into grammatically correct written characters. This paper presents not only the vocal sound conversion table but also character conversion table obtained by reversely converting the vocal sound conversion table. Making use of these tables, we have implemented a Hangeul character into a vocal sound system and a Korean vocal sound into character conversion system, and tested them with various data sets reflecting all the items of the Standard Pronunciation Rule to verify the soundness and completeness of our tables. The test results shows that the tables improves the process speed in addition to the soundness and completeness.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.2
• /
• pp.254-263
• /
• 1995

In this paper we discuss Moore and Mealy-model Time-stationary control schemes of pipelined data paths of Application Specific, Integrated Circuits (ASICs). We developed a method to synthesize both a Moore and a Mealy-style Finite State Machine(FSM) controller specifications given a pipelined data path with conditional branches. The control synthesis task consists of the generation of control specification and the FSM synthesis. The control specification procedure generates a FSM specification in the form of a state table. The different partitioning schemes are applied to each FSM controller so as to minimize the total area. Experimental results show the characteristics of the two different control styles and the effects of these two models on cost and performance.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.787-790
• /
• 1998

In this paper, we presents a method for multi-level logic mainmization which is suitable for the minimization of look-up table type FPGAs. A pattern extraction algorithm is minimized AND/XOR multi-level circuits. The circuits apply to Roth-Karp decomposition which is most commonly used technique in the FPGA technology mapping. We tested the FPGA synthesis method using pattern extraction on a set of benchmark. The proposed method achieved reductions on the number of LUTs in mapping soultion as compared with MISII(or SIS) or previous results〔5〕

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.10
• /
• pp.73-80
• /
• 1995

In this paper, a synthesis tool using matrix operations for designing multi-level Reed Muller circuits is described which has been named as MRM (Multi-level Reed Muller Minimizer). The synthesis method which uses matrix operations has advantages in effectively minimizing chip area, delay optimization and fault detection capability. However, it uses only truth-table type maps for inputs, synthesizing only small circuits. To overcome the weakness, our method accepts two-level description of a logic function. Since the number of cubes in the two-level description is small, the input matrix becomes small and large circuits can be synthesized. To convert two-level representations into multi-level ones, different input patterns are extracted to make a map which can be fed to the matrix operation procedure. Experimental results show better performance than previous methods. The matrix operation method presented in this paper is new to the society of Reed Muller circuits synthesis and provides solid mathematical foundations.

• Proceedings of the Korean Society of Life Science Conference
• /
• 2007.10a
• /
• pp.32.2-32.2
• /
• 2007

See Full Text

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.4
• /
• pp.43-48
• /
• 2008

This paper presents a design of 8B/10B encoder by the coding table reduction. The proposed encoder has reduced coding table modified disparity control block. Logic simulation and synthesis have been done for the proposed design. After synthesized using Magna CMOS $0.18{\mu}m$ process, the proposed design achieved the operating frequency of 343MHz and chip area of $1886{\mu}m^2$.

• Journal of Life Science
• /
• v.12 no.6
• /
• pp.649-653
• /
• 2002

The vegetation of Seoimal-lighthouse area was investigated from August, 2001 to July, 2002. In order to analyze the vegetation of this area, synthesis table, actual vegetation map were prepared. The main community structures of this area represent evergreen broad-leaf community(about 48%), which are very good condition(nearly last sere) to preserve and 11communities(Camellia japonica community, Castanopsis cuspidnta var. thunbergii community, Neolitsea sericea community, Quercus serrata community, Quercus variabilis community, Carpinus corenna community, Srtrax japonica community, Pinus thunbergii community, Quercus acutissima community, Zelkova serrata community, Cinnamimum japonicum community) were classified by vegetation type. And Daphne kiusiana, Asirum maculatum, Cymbidium goeringii, Chloranthus glaber, Ligularia taguetii should be worthwhile species to conserve in this area.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.5
• /
• pp.44-57
• /
• 2001

In order to synthesize grammatically correct Korean voices, we have to refer to the 'Standard Pronunciation Rules(SPR)' stated in the 'Standard Grammar of Korean Language.' Therefore, the rules that is used for a Korean-voice-synthesis system to find Korean voices corresponding to a given Korean sentence must completely reflect the SPR and must be sound. However, in the field of computer science they have just used the SPR without proving the completeness and soundness of their rules. In this paper, we construct a Petri net model for each rule of SPR, integrate all the Petri net models to build one big Petri net completely representing SPR, and analyse the Petri net to prove the consistency of it. Then, we transfer the Petri net model into a look-up table for Korean voice. Using this table, we can avoid the drawbacks of existing approaches such as going through several stages or repetitively applying a converting process.

• ETRI Journal
• /
• v.44 no.1
• /
• pp.51-61
• /
• 2022

In this paper, we introduced a novel voxel-wise UV parameterization and view-dependent texture synthesis for the immersive rendering of a truncated signed distance field (TSDF) scene model. The proposed UV parameterization delegates a precomputed UV map to each voxel using the UV map lookup table and consequently, enabling efficient and high-quality texture mapping without a complex process. By leveraging the convenient UV parameterization, our view-dependent texture synthesis method extracts a set of local texture maps for each voxel from the multiview color images and separates them into a single view-independent diffuse map and a set of weight coefficients for an orthogonal specular map basis. Furthermore, the view-dependent specular maps for an arbitrary view are estimated by combining the specular weights of each source view using the location of the arbitrary and source viewpoints to generate the view-dependent textures for arbitrary views. The experimental results demonstrate that the proposed method effectively synthesizes texture for an arbitrary view, thereby enabling the visualization of view-dependent effects, such as specularity and mirror reflection.

• Proceedings of the IEEK Conference
• /
• 2002.06b
• /
• pp.281-284
• /
• 2002

Rijndael algorithm is known to a new private key block cipher which is substitute for DES. Rijndael algorithm is adequate to both hardware and software implementation, so hardware implementation of Rijndael algorithm is applied to high speed data encryption and decryption. This paper describes three implementation methods of Rijndael S-box, which is important factor in performance of Rijndael coprocessor. It shows synthesis results of each S-box implementation in Xilinx FPGA. Tllc lilree S-box implementation methods are implementation using lookup table only, implementation using both lookup table and combinational logic, and implementation using combinational logic only.