• Journal of information and communication convergence engineering
• /
• 제9권4호
• /
• pp.435-440
• /
• 2011

This paper propose the method of constructing the highly efficiency adder and multiplier systems over finite fields. The addition arithmetic operation over finite field is simple comparatively because that addition arithmetic operation is analyzed by each digit modP summation independently. But in case of multiplication arithmetic operation, we generate maximum k=2m-2 degree of ${\alpha}^k$ terms, therefore we decrease k into m-1 degree using irreducible primitive polynomial. We propose two method of control signal generation for the purpose of performing above decrease process. One method is the combinational logic expression and the other method is universal signal generation. The proposed method of constructing the highly adder/multiplier systems is as following. First of all, we obtain algorithms for addition and multiplication arithmetic operation based on the mathematical properties over finite fields, next we construct basic cell of A-cell and M-cell using T-gate and modP cyclic gate. Finally we construct adder module and multiplier module over finite fields after synthesizing ${\alpha}^k$ generation module and control signal CSt generation module with A-cell and M-cell. Next, we constructing the arithmetic operation unit over finite fields. Then, we propose the future research and prospects.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 I
• /
• pp.214-217
• /
• 2003

In this paper, we deal with implementing design for a correlator access code generator module which they are used for setting up a connection between units, a packet decision, a clock syncronization, by FPGA. The orrelator module which is composed of the Wallace Tree's CSA and threshold value decision device decides useful a packet and syncronizes a clock, after it correlates an input signal of 1 Mbps transmission rate by a sliding window. An access code generator module which is composed of a BCH (Bose-Chadhuri-Hocquenghem) cyclic encoder and control device was designed according as a four steps' generation process proposed in the bluetooth standard. The pseudo random sequence which solves syncronization problem saved a voluntary device Proposed the module was designed by VHDL. An simulation and test are inspected by Xilinx FPGA.

• Steel and Composite Structures
• /
• 제31권3호
• /
• pp.217-232
• /
• 2019

Modular steel buildings consist of prefabricated room-sized structural units that are manufactured offsite and installed onsite. The inter-module connections must fulfill the assembly construction requirements and soundly transfer the external loads. This work proposes an innovative assembled connection suitable for modular buildings with concrete-filled steel tube columns. The connection uses pretensioned strands and plugin bars to vertically connect the adjacent modular columns. The moment-transferring performance of this inter-module connection was studied through monotonic and cyclic loading tests. The results showed that because of the assembly construction, the connected sections were separated under lateral bending, and the prestressed inter-module connection performed as a weak semirigid connection. The moment strength at the early loading stage originated primarily from the contact bonding mechanism with the infilled concrete, and the postyield strength depended mainly on the tensioned strands. The connection displayed a self-centering-like behavior that the induced deformation was reversed during unloading. The energy dissipation originated primarily from frictional slipping of the plugin bars and steel strands. The moment transferring ability was closely related to the section dimension and the arrangements of the plugin bars and steel strands. A simplified strength calculation and evaluation method was also proposed, and the effectiveness was validated with the test data.

• Design & Manufacturing
• /
• 제16권4호
• /
• pp.67-74
• /
• 2022

Injection molding is a cyclic process comprising of cooling phase as the largest part of this cycle. Providing efficient cooling in lesser cycle times is of significant importance in the molding industry. Recently, lots of researches have been done for rapid cooling of a hot-spot area using CO2 in injection molding. The CO2 flows under high pressure through small, flexible capillary tubes to the point of use, where it expands to create a snow and gas mixture at a temperature of -79℃. The gaseous CO2 removes heat from the mold and releases it into the atmosphere. In this paper, a CO2 cooling module was applied to an injection mold in order to cool a large area cavity uniformly and quickly, and the cooling performance of the injection mold was investigated. The product was a high-curvature molded part with a molding area of 300x100mm. Heat cartridges were installed in a stationary mold, and CO2 cooling module was inserted inside a movable mold. Through structural analysis, it was confirmed that the maximum deformation of mold with CO2 cooling module was 0.09mm. A CO2 feed system with a heat exchanger was used for cooling experiments. The CO2 was injected into the holes on both sides of the supply pipe of the cooling module and discharged through hexagon blocks to cool the mold. It took 5.8 seconds to cool the mold from an average temperature of 140℃ to 70℃. Through the experiment using CO2 cooling module, it was found that a cooling rate of up to 12.98℃/s and an average of 10.18℃/s could be achieved.

• 대한수학회지
• /
• 제46권1호
• /
• pp.13-30
• /
• 2009

A subset of n tuples of elements of ${\mathbb{Z}}_9$ is said to be a code over ${\mathbb{Z}}_9$ if it is a ${\mathbb{Z}}_9$-module. In this paper we consider an special family of cyclic codes over ${\mathbb{Z}}_9$, namely quadratic residue codes. We define these codes in term of their idempotent generators and show that these codes also have many good properties which are analogous in many respects to properties of quadratic residue codes over finite fields.

• 충청수학회지
• /
• 제19권4호
• /
• pp.319-324
• /
• 2006

Let K be a finite cyclic extension of $k=\mathbb{F}_q(T)$ of prime degree ${\ell}$. Let ${\tilde{\mathcal{C}}}l_{K,{\ell}}$ be the Sylow ${\ell}$-subgroup of the ideal class group ${\tilde{\mathcal{C}}}l_K$ of $\mathcal{O}_K$. The structure of ${\tilde{\mathcal{C}}}l_{K,{\ell}}$ as $\mathbb{Z}_{\ell}[G]$/<$N_G$>-module is determined the dimensions $${\lambda}_i\;:=dim_{\mathbb{F}_{\ell}}({\tilde{\mathcal{C}}}l_{K,{\ell}}^{({\sigma}-1)^{i-1}}/{\tilde{\mathcal{C}}}l_{K,{\ell}}^{({\sigma}-1)^i})$$ for $i{\geq}1$. In this paper we investigate the dimensions ${\lambda}_1$ and ${\lambda}_2$.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2009년도 춘계학술대회
• /
• pp.903-906
• /
• 2009

본 연구에서는 임베디드 시스템, 특히 블루투스 베이스밴드에서 사용이 가능한 고속 직렬 포트 인터페이스를 설계하였다. 인터페이스는 ARM 프로세서를 응용할 수 있는 AMBA APB에 호환될 수 있도록 설계하였으며, 8비트 형태로 외부 디바이스와 코프로세서 간 데이터와 명령을 전송할 수 있다. 오류 정정을 위하여, CRC를 적용하였고 멀티미디어 카드를 위한 인터페이스도 제공하였다. 설계한 직렬 포트 인터페이스는 자동합성하여 P&R을 수행하였다. 결과물은 Altera FPGA로 구현하였으며 25MHz에서 정상동작하였다.

• 반도체디스플레이기술학회지
• /
• 제21권1호
• /
• pp.85-90
• /
• 2022

In this paper, an asynchronous nonvolatile memory module using a self-diagnosis function was designed. For the system to work, a lot of data must be input/output, and memory that can be stored is required. The volatile memory is fast, but data is erased without power, and the nonvolatile memory is slow, but data can be stored semi-permanently without power. The non-volatile static random-access memory is designed to solve these memory problems. However, the non-volatile static random-access memory is weak external noise or electrical shock, data can be some error. To solve these data errors, self-diagnosis algorithms were applied to non-volatile static random-access memory using error correction code, cyclic redundancy check 32 and data check sum to increase the reliability and accuracy of data retention. In addition, the possibility of application to an asynchronous non-volatile storage system requiring reliability was suggested.

• 대한수학회보
• /
• 제51권4호
• /
• pp.1205-1210
• /
• 2014

Let E be a free product of a finite number of cyclic groups, and S a normal subgroup of E such that $$E/S{\sim_=}G$$ is finite. For a prime p, $\hat{S}=S/S^{\prime}S^p$ may be regarded as an $F_pG$-module via conjugation in E. The aim of this article is to prove that $\hat{S}$ is decomposable into two indecomposable modules for finite elementary abelian p-groups G.

• 대한수학회보
• /
• 제61권2호
• /
• pp.291-299
• /
• 2024

We study some factorization properties of the idealization R(+)M of a module M in a commutative ring R which is not necessarily a domain. We show that R(+)M is ACCP if and only if R is ACCP and M satisfies ACC on its cyclic submodules. We give an example to show that the BF property is not necessarily preserved in idealization, and give some conditions under which R(+)M is a BFR. We also characterize the idealization rings which are UFRs.