• 한국컴퓨터정보학회논문지
• /
• 제3권4호
• /
• pp.97-102
• /
• 1998

본 논문에서는 영상을 효과적으로 부호화하고 높은 압축률에서도 원 영상을 잘 복원할 수 있는 프랙탈 압축방법을 제안하였다. 주어진 SNR 허용오차에 대해 Fisher l)방법과본 논문에서 제안한 방법이 모든 문턱치에서 압축비가 기존의 방법보다 더 높음을 보여준다. 이 지역적인 반복함수계가 PIFS 정보기억용량을 레인지 블록당 48비트에서 40비트로 줄일수 있어 압축시간이 개선됨을 보인다.

• 산업공학
• /
• 제7권3호
• /
• pp.155-168
• /
• 1994

In computer integrated manufacturing environment, tool management plays an important role in controlling tool performance for machining operations. Knowledge of tool behavior during the cutting process and effective tool-behavior prediction contribute to controlling machine costs by avioding production delays and off-target parts due to tool failure. The purpose of this paper is to review and develop the tool condition monitoring scheme for drilling operation to assure a fast corrective response to minimize the damage if tool failures occur. If one desires to maximize system through-put and product quality as well as tooling resources, within an economic environment, real-time tool sensing system and information processing system can be coupled to provide the necessary information for the effective tool management. The example is demonstrated as to drilling operation when the aluminum composites are drilled with carbide-tipped HSS drill bits. The example above is limited to the situation that the tool failure mode of drill bits is wear.

• 한국통신학회논문지
• /
• 제25권3B호
• /
• pp.464-471
• /
• 2000

The number of quantization bits of the input signals $X_k$,$Y_k$ need to be optimally determined through the trade-off between the H/W complexity and the BER performance in Turbo codes applications. Also, an effective means to incorporate a channel reliability $L_c$ in the Log-MAP-based Turbo decoding is highly required. because it has a major effect on both the complexity and the performance. In this paper, a novel bit-shifting approach that substitutes for the multiplying is proposed so as to effectively incorporate. $L_c$ in Turbo decoding. The optimal number of quantization bits of $X_k$,$Y_k$ is investigated through Monte-Carlo simulations assuming that bit-shifting approach is adopted. In addition. The effects of an incorrect estimation of noise variance on the performance of Turbo codes is investigated. There is a confined range in which the effects of an incorrect estimation can be ignored.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 B
• /
• pp.361-364
• /
• 2003

In this paper, a high-resolution multibit sigma-delta modulator implemented in a.0.35-um CMOS technology is introduced. This modulator consists of two switched capacitor integrators, 3-bits A/D converter, and 3-bits D/A converter For the verification of the internal function blocks, HSPICE simulator is used. This circuit is normally operated at 130 MHz clock and the total power dissapation is 70 mW.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2012년도 한국컴퓨터종합학술대회논문집 Vol.39 No.1(C)
• /
• pp.286-288
• /
• 2012

Facing the counterfeiting acts towards various products, many manufacturers implement ePedigree system to secure their supply chain. Using ePedigree, a distribution history including a valid product identifier from the manufacturer until the final retailer is recorded. And this ePedigree is signed by each involved supply chain party using digital signature. With this digital signature, any unauthorized alteration to the ePedigree document would generate a failed verification process. If there is a counterfeit product using a fake ePedigree document, it wouldn't be able to pass the verification process either. Hence, there wouldn't be any counterfeit product that could enter the legal supply chain and bought by the consumer. We are proposing to use ECDSA instead of RSA since it has faster performance and shorter key size. At a certain same security level, ECDSA only needs 163 bits, while RSA needs 1024 bits.

• ETRI Journal
• /
• 제43권2호
• /
• pp.344-356
• /
• 2021

CRAFT is a tweakable block cipher introduced in 2019 that aims to provide strong protection against differential fault analysis. In this paper, we show that CRAFT is vulnerable to side-channel cube attacks. We apply side-channel cube attacks to CRAFT with the Hamming weight leakage assumption. We found that the first half of the secret key can be recovered from the Hamming weight leakage after the first round. Next, using the recovered key bits, we continue our attack to recover the second half of the secret key. We show that the set of equations that are solvable varies depending on the value of the key bits. Our result shows that 99.90% of the key space can be fully recovered within a practical time.

• 전기전자학회논문지
• /
• 제22권4호
• /
• pp.1163-1167
• /
• 2018

비트 값의 반전을 이용하여 정규 허프만 코드의 선택적인 암호화 방법을 제안하였다. 심벌들을 일정한 크기의 블록으로 나누어 블록안의 각 심벌들을 정규 허프만 코딩으로 압축한다. 블록별로 원 코드로 보낼 것인지 암호화하여 보낼것인지 결정하고 암호화 블록은 전제 비트들의 값을 반전시키고 암호화하지 않는 블록들은 원 코딩 데이터를 암호화 정보와 함께 전송한다. 수신측에서 압축된 데이터를 암호화 정보를 이용하여 해독가능하다.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2014년도 춘계학술대회
• /
• pp.550-552
• /
• 2014

본 논문에서는 천공 채널 부호화된 신호에 대한 인터리버 복원 기법을 제시한다. 이를 위해 우선, 판단 행렬을 구성하여 가우스 소거를 적용하고, 추정 행렬 내 '0' 비트의 개수에 대한 '1' 비트의 개수 비율을 계산한다. 그리고 임의의 인터리버 주기에 대해 최소 비율이 문턱값보다 작은 값을 확인하여 인터리버를 복원한다. 컴퓨터 모의실험을 통해 제안된 기법을 검증한다.

• 디지털산업정보학회논문지
• /
• 제10권4호
• /
• pp.117-125
• /
• 2014

In this paper, a novel hardware architecture of the LT codec is presented where non-BP based decoding algorithm is applied. Novel LT codec architecture is designed with an efficient degree distribution unit using Verilog HDL. To perform permutation operation, different initial valued or time shifted counters have been used to get pretty well permutations and an effect of randomness. The codec will take 128 bits as input and produce 256 encoded output bits. The simulation results show expected performances as the implemented distribution and the original distribution are pretty same. The proposed LT codec takes 257.5 cycle counts and $2.575{\mu}s$ for encoding and decoding instead of 5,204,861 minimum cycle counts and 4.43s of the design mentioned in the previous works where iterative soft BP decoding was used in ASIC and ASIP implementation of the LT codec.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권4호
• /
• pp.1521-1537
• /
• 2021

Through information hiding technique, secret message can be hidden in pictures. Stego-image quality and hiding capacity are two important metrics for information hiding. To enhance these metrics, many schemes were proposed by scholars in recent years. Some of them are effective and successful, but there is still a room for further improvement. A high capacity information hiding scheme (PAMO, Pixel-value Adjustment with Modulus Operation Algorithm) is introduced in this paper. PAMO scheme uses pixel value adjustment with modulus operation to hide confidential data in cover-image. PAMO scheme and some referenced schemes are implemented in Python and experiments are carried out to evaluate their performance. In the experiments, PAMO scheme shows better performance than other methods do. When secret message length is less than 72000 bits, the highest hiding capacity of PAMO can reach 7 bits per pixel, at the same time the PSNR of stego-images is greater than 30 dB.