• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.8
• /
• pp.1-6
• /
• 1994

In this paper, we introduce the nonlinear combiner structure which improves linear complexity and randomness properties on maximum length sequences generated by LFSR. Choosing the primitive polynomial over GF(2S04T) as feedback tap polynomial, we devise nonlinear combiner structure and analyze the random output sequences generated by LFSR with nonlinear function.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2006.06a
• /
• pp.274-275
• /
• 2006

A linear ultrasonic motor was designed by a combination of the longitudinal and bending mode. Linear ultrasonic motors are based on an elliptical motion on the surface of elastic body, such as bar or plates. The corresponding eigen-mode of one resonance frequency can be excited twice at the same time with a phase shift of 90 degrees in space and time. That is excite symmetric and anti-symmetric modes. Then it determines the thrust and speed of the motor. Linear ultrasonic motors are investigated experimentally in according to be fabricated a general classification to motor structure and material characteristic. There was the first to simulate as use of finite element analysis ANSYS 9.0. The AL-T2W8-ARM14-LEG18-ANGLE80 motor has a maxim efficiency 17 [%] under the speed 0.14 [m/s], thrust 345 [gf] and preload 280 [gf], operating frequency is 57.6 [kHz].

• Journal of Fashion Business
• /
• v.26 no.2
• /
• pp.129-142
• /
• 2022

The purpose of this study is to develop socks to check the range of ankle movement during squats for men in their late 20s. Sensors of 6, 8, and 12 mm were selected, and each sample was impregnated 1 to 3 times. It was prepared using a CNT dispersion, and the GF value was measured using UTM. Among them, the sample with 2 impregnation showed the best GF value. As a result of applying each sample to the socks, the 12 mm sensor was wider than the area of the Achilles tendon, resulting in noise, and the 8 mm sensor was higher than the tensile strength of the socks, resulting in a decrease in the graph. Therefore, testing was performed using a 6 mm sensor. In order to determine the effectiveness of the sensor, the normal operating range was checked through squats, and significant changes were confirmed when the operating range was checked again through squats by performing operations that can increase the operating range through Gastrocnemius, Soleus stretching, and low lunge. Using the results of this study, it is expected that the average value of the ankle movement range of the user is checked prevent injury, to be provided as basic data for the production of shoe products and the promotion of physical health.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.3 s.309
• /
• pp.76-81
• /
• 2006

Recently, Finite field is applied the cryptography in the modern multimedia communication. Especially, block codes such as Elliptic Curve Cryptosystem and Reed-Solomon code among the error correcting codes are defined with finite field. Also, finite field algorithm is conducting the research actively because many kind of application parts need the real time operating ability therefore the exclusive hardware have been implementing. In this paper, we proposed the inverse finite field algorithm over GF($2^8$) using finite composite field and implemented in a hardware, and then compare this hardware with the currently used 'Itoh and Tsujii' hardware in respect to structure, area and computation time. Furthermore, this hardware was inserted into the AES SubBytes block and implemented on FPGA emulator board to confirm that the superiority of the proposed algorithm through the performance evaluation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.2
• /
• pp.15-21
• /
• 2008

This paper discuss the sequential digital logic systems and arithmetic operation algorithms which is the important material in computer architecture using analysis and synthesis which is based on extension logic for binary logic over galois fields. In sequential digital logic systems, we construct the moore model without feedback sequential logic systems after we obtain the next state function and output function using building block T-gate. Also, we obtain each algorithms of the addition, subtraction, multiplication, division based on the finite fields mathematical properties. Especially, in case of P=2 over GF($P^m$), the proposed algorithm have a advantage which will be able to apply traditional binary logic directly.The proposed method can construct more efficiency digital logic systems because it can be extended traditional binary logic to extension logic.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.3212-3214
• /
• 1999

RS(Reed-Solomon)부호는 오류 정정을 위한 채널 코딩기법중의 하나로 특히 연집 오류에 대해 강한 특성을 갖고 있으며, CD-P(Compact Disc Player), DAT(Digital Audio Tape). VTR, DVD(Digital Video Disc), 디지탈 TV 디코더등에서 사용되고 있다. 본 논문은 Galois Field, GF[$2^8$]상에서 (204. 188. 8)의 규격을 갖는 디지탈 TV용 RS 복호기의 구현에 관한 연구로 8개의 심볼 오류까지 정정 가능하다. 오증 계산은 16개의 오증 계산셀로 구성되어 지며, 오류 위치 다항식을 계산하는데 있어서는 Berlekamp-Massey 알고리즘을 사용한다. VHDL로 설계되어 Synopsys를 이용하여 검증 및 합성하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.8A
• /
• pp.1348-1357
• /
• 2001

본 논문에서는 DAB 시스템에서 사용하는 FEC(Forward Error Correction) 블록을 하드웨어 크기를 고려하여 효율적인 구조를 갖도록 설계하였다. DAB 시스템의 FEC 블록은 크게 스크램블러(에너지분산), 리드-솔로몬 코더, 길쌈 인터리버로 구성된다. RS 디코더 블록 중 키 방정식을 계산해 내는 블록과 길쌈 인터리버가 차지하는 하드웨어 비중은 굉장히 크다. 본 논문에서는 스크램블러 부분에서 데이터의 시작을 알려주는 신호의 효율적인 검출기법을 제안하고, 리드-솔로몬 디코더 블록의 수정 유클리드 알고리즘을 효율적인 하드웨어로 구현하기 위한 새로운 구조와 길쌈 인터리버에서 최적의 메모리 구조를 효과적인 구조를 제안한다. 제안한 구조에서는 단지 8개의 GF 곱셈기와 4개의 덧셈기만을 가지고 RS 디코더의 수정 유클리드 알고리즘을 구현하였으며, 2 RAM(128)과 4 RAM(256)을 가지고 컨벌루셔널 인터리버를 구현하였다. 제안한 구조로 설계했을 경우 디코더 블록이 Altera-FPGA 칩(FLEX10K)에 모두 들어갈 수 있었다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.93-101
• /
• 2010

In this paper we generate Gold-sequence by using M-sequence which is made by two primitive polynomial of GF(2). Generally M-sequence is generated by linear feedback shift register code generator. Here we show that this matrix of appropriate permutation has Hadamard matrix property. This matrix proves that Gold-sequence through two M-sequence and additive matrix of one column has one of major properties of Hadamard matrix, orthogonal. and this matrix show another property that multiplication with one matrix and transpose matrix of this matrix have the result of unit matrix. Also M-sequence which is made by linear feedback shift register gets Hadamard matrix property mentioned above by adding matrices of one column and one row. And high-speed conversion is possible through L-matrix and the S-matrix.

• Journal of Periodontal and Implant Science
• /
• v.32 no.3
• /
• pp.603-614
• /
• 2002

Human gingival fibroblasts have proven to useful as a species specific cell culture system in various system on periodontal disease and regeneration. However, their use is limited, since they are hard to obtain and lifespan is short due to replicative senescence. To overcome these disadvantages, we transfected primary human gingival fibroblasts by the E6 and E7 genes of the Human papilloma virus(HPV) 16. The full length of HPV 16 E6 and E7 was cloned from the pBR322 into BamHl and Sal I of a pBabe vector including hygromycin B resistance. Before pBabeE6/E7 plasmid transfection, peak 8 GFP including G418 resistance was transfected into primary GF to check the transfection efficency. PBabe E6/E7 plasmid was transfected using Lipofectamine plus following manufacter's instruction into primary normal human gingival fibroblasts in 60mm dishes with FBS free DMEM. After 2 days of transfection, the cells were treated with hygromycin for 2 weeks until the transfected control cells died. The resulting hygromycin resistant colonies were pooled, and clonned, and sucessful　transfection was established for immortalized gingival fibroblast cell lines. Immoralized GF cells showed stellate shape, that is similar to that of orange grains, and more rapid growth and higher proliferation than that of primary gingival fibroblasts. This cell lines overcame crisis and could be cultured over 30 subcultured, could be use for three dimentional culture, epithelial-mesenchymal interaction study.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.3
• /
• pp.16-33
• /
• 1993

New decoding algorithm of double-error-correction Reed-Solmon codes over GF(2$^{8}$) for optical compact disks is proposed and decoding algorithm of RS codes with triple-error-correcting capability is presented in this paper. First of all. efficient algorithms for estimating the number of errors in the received code words are presented. The most complex circuits in the RS decoder are parts for soving the error-location numbers from error-location polynomial, so the complexity of those circuits has a great influence on overall decoder complexity. One of the most known algorithm for searching the error-location number is Chien's method, in which all the elements of GF(2$^{m}$) are substituted into the error-location polynomial and the error-location number can be found as the elements satisfying the error-location polynomial. But Chien's scheme needs another 1 frame delay in the decoder, which reduces decoding speed as well as require more stroage circuits for the received ocode symbols. The ther is Polkinghorn method, in which the roots can be resolved directly by solving the error-location polynomial. Bur this method needs additional ROM (readonly memory) for storing tthe roots of the all possible coefficients of error-location polynomial or much more complex cicuit. Simple, efficient, and high speed method for solving the error-location number and decoding algorithm of double-error correction RS codes which reudce considerably the complexity of decoder are proposed by using Hilbert theorems in this paper. And the performance of the proposed decoding algorithm is compared with that of conventional decoding algorithms. As a result of comparison, the proposed decoding algorithm is superior to the conventional decoding algorithm with respect to decoding delay and decoder complexity. And decoding algorithm of RS codes with triple-error-correcting capability is presented, which is suitable for error-correction in digital audio tape, also.