• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.4
• /
• pp.51-56
• /
• 2011

In this paper, we propose a CAN message compression method using bit rearrangement to reduce the CAN bus load and the error probability during the transmission of CAN messages. In conventional CAN message compression methods, message compression is accomplished by sending only the differences between the previous data and the current data. In the proposed method, the difference bits are rearranged to further increase the compression efficiency. By simulations in car applications, it is shown that the CAN transmission data is further reduced up to 26% by the proposed method, compared with the conventional method.

• The Journal of the Korea Contents Association
• /
• v.8 no.10
• /
• pp.37-44
• /
• 2008

This paper presented a solution to encryption and decryption problem suffering data transmission error for encrypted message transmission. Block cypher algorithms experience avalanche effect that a single bit error in an encrypted message brings substantial error bits after decryption. The proposed fault tolerant scheme addresses this error avalanche effect exploiting a multi-dimensional data array shuffling process and an error correction code. The shuffling process is to simplify the error correction. The shuffling disperses error bits to many data arrays so that each n-bit data block may comprises only one error bit. Thereby, the error correction scheme can easily restore the one bit error in an n-bit data block. This scheme can be extended on larger data blocks.

• Smart Media Journal
• /
• v.3 no.3
• /
• pp.9-14
• /
• 2014

The increasing number of ECUs in automobiles causes the CAN bus overloaded and consequently the error probability of data transmission increases. Since the time duration for the data transmission is proportional to CAN frame length, it is desirable to reduce the frame length. In this paper, we present a CAN message compression method using Data Length Code (DLC) and bit rearrangement. By simulations using actual CAN data, it is shown that the CAN transmission data is reduced up to 54 % by the proposed method, compared with conventional methods.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.11
• /
• pp.97-104
• /
• 2010

This paper presents a high performance 32-bit single core AES architecture. The proposed architecture employs a 5-stage pipeline: four stages in the ShiftRows/InvShiftRows module, and one stage in the MixColumn/InvMixColumn module. Circuit size reduction has been achieved through merging of the shift rows and inverse shift rows. The mix column and inverse mix column share the same resources. Three 32-bit registers replace the conventional ten 32-bit registers in the RCON architecture. The proposed architecture has been implemented in Verilog HDL, and yields 415 Mbits/s throughput with the circuit size of 13764 gate equivalents on the 0.18um CMOS process technology. This high performance architecture is suitable for wireless network router applications.

• Journal of Broadcast Engineering
• /
• v.2 no.2
• /
• pp.94-104
• /
• 1997

This paper presents a new vertex-based binary shape coding scheme using one-dimensional vertex selection/encoding and vertex reordering. In compared with the conventional object-adaptive vertex encoding(OA VEL the extracted vertices are, firstly, classified into one-dimensional(lD) vertices and two-dimensional (2D) vertices in the proposed method. For lD vertices, new coding method proposed in this paper is performed. For 2D vertices, the vertex reordering and OA VE are carried out. Experimental results show that the proposed vertex-based coding scheme red.uces coding bits up to 12 % compared with the conventional one and its coding gain depends on the characteristics of contour.

• Journal of Korea Society of Industrial Information Systems
• /
• v.19 no.1
• /
• pp.69-75
• /
• 2014

Audio seganography is the art and science of writing hidden messages that evolves as a new secret communication method. And audio steganography is similar to the process of modifying the Least Significant Bit of image files 8th LSB layer embedding has been done for desired binary messages. The effective of steganographic tools is to obtain imperceptible and robust way to conceal high rate of secret data. The objective of this paper is to propose a method for hiding the secret messages in safer manner from external attacks by modified LSB technique and encryption rearrangement key.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.3
• /
• pp.80-80
• /
• 2001

본 논문에서는 가역가변길이 부호를 테이블 메모리에 효율적으로 저장하는 방법을 제안한다. 여러개의 부호들을 적은 개수의 값들로 테이블을 구성하는 새로운 알고리듬으로, 가역가변길이 부호의 부호내의 비트 천이개수와 부호 구성 트리에서의 레벨을 이용하는 TNWT(Transition Number and Weight of Tree)방법을 제안한다. 압축에 앞서 가역가변길이 부호들의 가중치와 천이개수를 구하고, 신장된 값들이 서로 구분이 안되는 경우를 방지하기 위해 테이블의 값들을 재배열한다. 재배열이 끝난 배열의 값들을 세 개씩 묶어 압축된 테이블을 얻는다. 압축된 테이블은 부호의 천이개수와 가중치를 이용하여 복호해 낼 수 있다. 이러한 방법을 통하여 기존의 방법보다 약 20% 적은 크기로 테이블 메모리를 구성하고, 압축된 테이블로 복호가 가능함을 확인하였다.

• Smart Media Journal
• /
• v.3 no.1
• /
• pp.39-45
• /
• 2014

The partial product matrix of a parallel squarer are symmetric about the diagonal. To reduce the number of partial product bits and the depth of partial product matrix, it can be typically folded, shifted and bit-rearranged. In this paper, an efficient design approach for the combined squarer, capable of operating on either unsigned or signed numbers based on a mode selection signal, is presented. By simulations, it is shown that the proposed combined squarers lead to up to 18% reduction in area, 11% reduction in propagation delay and 9% reduction in power consumption compared with the previous combined squarers.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.3
• /
• pp.316-324
• /
• 2001

A table compression method for reversible variable length code is proposed in this paper. TNWT(Transition Number and Weight of Tree) method, which uses the transition number of bits within a symbol and the level of a code tree, is proposed. Compression of table values is performed after arrangment of values that is not distinghishable by transition number and weights. In decoding, the transition number and weight of code are used. In this method, the table for RVLC decoding can be implemented with a smaller memory.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11A
• /
• pp.815-821
• /
• 2009

In this paper, we propose a new type of mutually cooperative relaying (MCR) scheme based on a spatially coordinate-interleaved orthogonal design (SCID), in which two cooperative users are spatially multiplexed without bandwidth expansion. It provides not only diversity gain (with order of two) as in the existing MCR scheme, but also additional coding gain. Our simulation results demonstrate that the proposed SCID scheme is useful for improving the uplink performance as long as one user can find another active user as a close neighbor that is simultaneously communicating with the same destination, e.g., a base station in the cellular network.