• Journal of Electrical Engineering and Technology
• /
• v.13 no.2
• /
• pp.943-952
• /
• 2018

This paper presents a new type of absolute rotary encoder system based on the affine n-digit N-ary gray code. A brief comparison of the existing encoder systems is carried out in terms of resolution, encoding and decoding principles and number of sensor heads needed. Using the proposed method, two different types of encoder disks are designed, namely, color-coded disk and grayscale coded disk. The designed coded disk pattern is used to manufacture 3 digit 3 ary and 2 digit 5 ary grayscale coded disks respectively. The manufactured disk is used with the light emitter and photodetector assembly to design the entire encode system. Experimental analysis is done on the designed prototype with LabVIEW platform for data acquisition. A comparison of the designed system is done with the traditional binary gray code encoder system in terms of resolution, disk diameter, number of tracks and data acquisition system. The resolution of the manufactured system is 3 times higher than the conventional system. Also, for a 5 digit 5 ary coded encoder system, a resolution approximately 100 times better than the conventional binary system can be achieved. In general, the proposed encoder system gives $(N/2)^n$ times better resolution compared with the traditional gray coded disk. The miniaturization in diameter of the coded disk can be achieved compared to the conventional binary systems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.6
• /
• pp.1184-1189
• /
• 2001

In this paper was analyzed the performance of turbo code using semi-random interleaver which proposed a reference numbers 11. Which was analyzed comparison the performance of between the current mobile communication system had been used the viterbe decoding algorithm of convolutional code and turbo codes when fixed constraint length. The result was defined that the performance of turbo code rose a $E_{b/}$ $N_{o}$=4.7[㏈] than convolutional code, when convolutional code and turbo code was fixed by BER = 10$^{-4}$ and constraint length K 5.5.5.

• Journal of Applied and Pure Mathematics
• /
• v.4 no.3_4
• /
• pp.211-219
• /
• 2022

We study MDS(maximum distance separable) self-dual codes over Galois ring R = GR(2^m, r). We prove that there exists an MDS self-dual code over R of length n if (n - 1) divides (2^r - 1), and 2^m divides n. We also provide the current state of the problem for the existence of MDS self-dual codes over Galois rings.

• Journal of electromagnetic engineering and science
• /
• v.7 no.1
• /
• pp.17-27
• /
• 2007

Jacket matrices which are defined to be $n{\times}n$ matrices $A=(a_{jk})$ over a field F with the property $AA^+=nI_n$ where $A^+$ is the transpose matrix of elements inverse of A,i.e., $A^+=(a_{kj}^-)$, was introduced by Lee in 1984 and are used for signal processing and coding theory, which generalized the Hadamard matrices and Center Weighted Hadamard matrices. In this paper, some properties and constructions of Jacket matrices are extensively investigated and small orders of Jacket matrices are characterized, also present the full rate and the 1/2 code rate complex orthogonal space time code with full diversity.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.919-922
• /
• 2001

최근 인터넷의 확산에 따라 여러 가지 침해사고 발생이 증가하고 있어서 시스템을 안전하게 관리하기 위한 노력들이 행해지고 있다. 본 논문에서는 NFR의 N-code언어를 이용하여 Shieh 모델의 침입패턴을 탐지할 수 있는 규칙 기반 침입 탐지를 설계 및 구현한다. 제안하는 침입 탐지는 웹 기반에서 Shieh 침입 탐지 모델을 N-code 언어로 변환하여 침입 탐지여부를 쉽게 발견한다. 그리고 다양한 규칙들을 정의하고 이를 바탕으로 하여 취약점을 보완할 수 있도록 침입 탐지 시스템을 구현한다.

• Journal of the Korean Society of Industry Convergence
• /
• v.25 no.6_2
• /
• pp.1091-1095
• /
• 2022

Dynamic stability of the main spindle system shall be ensured when operating the planer miller for remanufacturing the planer miller. This paper explains the analysis process that determines the stability of the planer miller spindle system in the design stage using ANSYS, an analysis program. First, the dynamic stability of the main spindle system is verified through risk speed analysis in the rated RPM range of the planer miller through ANSYS Modal Analysis, and second, the stability and durability of the main spindle system are verified through ANSYS nCode Analysis.

• ETRI Journal
• /
• v.46 no.3
• /
• pp.485-500
• /
• 2024

A hardware architecture is presented to decode (N, K) polar codes based on a low-density parity-check code-like decoding method. By applying suitable pruning techniques to the dense graph of the polar code, the decoder architectures are optimized using fewer check nodes (CN) and variable nodes (VN). Pipelining is introduced in the CN and VN architectures, reducing the critical path delay. Latency is reduced further by a fully parallelized, single-stage architecture compared with the log N stages in the conventional belief propagation (BP) decoder. The designed decoder for short-to-intermediate code lengths was implemented using the Virtex-7 field-programmable gate array (FPGA). It achieved a throughput of 2.44 Gbps, which is four times and 1.4 times higher than those of the fast-simplified successive cancellation and combinational decoders, respectively. The proposed decoder for the (1024, 512) polar code yielded a negligible bit error rate of 10^-4 at 2.7 E_b/N_o (dB). It converged faster than the BP decoding scheme on a dense parity-check matrix. Moreover, the proposed decoder is also implemented using the Xilinx ultra-scale FPGA and verified with the fifth generation new radio physical downlink control channel specification. The superior error-correcting performance and better hardware efficiency makes our decoder a suitable alternative to the successive cancellation list decoders used in 5G wireless communication.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.8
• /
• pp.2027-2040
• /
• 1998

In this paper, we present efficient reconfigurable mesh algorithms for transforming between a binary image and its corresponding boundary code. These algorithms use $n\timesn\timesn$ processors when the size of the binary image is $n\timesn$. Recent published results show that these transformations can be done in O(1) time using $O(n^4)$ processors. The number of processors used by these algorithms is very large compared to the number of pixels in the image. Here, we present fast transformation algorithms which use $n^3 processors only. the transformation from a houndary code to a binary image takes O(1) time, and the converse transformation takes O(log n) time.

• Phonetics and Speech Sciences
• /
• v.2 no.4
• /
• pp.3-10
• /
• 2010

The present study aims to investigate neural activations according to the level of code switching in English proficient bilinguals and to find the relationship between the performance of language switching and proficiency level using ERPs (event-related potentials). First, when comparing high-proficient (HP) with low-proficient (LP) bilingual performance in a native language environment, the activation level of N2 was observed to be higher in the HP group than in the LP group, but only under two conditions: 1) the language switching (between-language) condition known as indexing attention of code switching and 2) the inhibition of current language for L1. Another effect of N400 can be shown in both groups only in the language non-switching (within-language) condition. This effect suggests that both groups completed the semantic acceptability task well in their native language environment without the burden of language switching, irrespective of high or low performance. The latencies of N400 are only about 100ms earlier in the HP group than in the LP group. This difference can be interpreted as facilitation of the given task. These results suggest that HP showed the differential activation in inhibitory system for L1 in switching condition of L1-to-L2 to be contrary to inactivation of inhibitory system for the LP group. Despite the absence of an N400 effect at the given task in both groups, differential latencies between the peaks were attributed to the differences of efficiency in semantic processing.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.6
• /
• pp.1-7
• /
• 2010

This paper presents a novel implementation on multimedia fingerprinting algorithm based on BCH (Bose-Chaudhuri-Hocquenghem) code. The evaluation is put in force the colluder detection to n-1. In the proposed algorit hm, the used collusion attacks adopt logical combinations (AND, OR and XOR) and average computing (Averaging). The fingerprinting code is generated as below step: 1. BIBD {7,4,1} code is generated with incidence matrix. 2. A new encoding method namely combines BIBD code with BCH code, these 2 kind codes are to be fingerprinting code by BCH encoding process. 3. The generated code in step 2, which would be fingerprinting code, that characteristic is similar BCH {15,7} code. 4. With the fingerprinting code in step 3, the collusion codebook is constructed for the colluder detection. Through an experiment, it confirmed that the ratio of colluder detection is 86.6% for AND collusion, 32.8% for OR collusion, 0% for XOR collusion and 66.4% for Averaging collusion respectively. And also, XOR collusion could not detect entirely colluder and on the other hand, AND and Averaging collusion could detect n-1 colluders and OR collusion could detect k colluders.