• Title/Summary/Keyword: 비트 수정

Search Result 136, Processing Time 0.033 seconds

A New Reseeding Methodology Using a Variable-Length Multiple-Polynomial LFSR (가변 길이의 다중 특성 다항식을 사용하는 LFSR을 이용한 새로운 Reseeding 방법)

  • Yang Myung-Hoon;Kim Youbean;Lee Yong;Park Hyuntae;Kang Sungho
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.42 no.3 s.333
    • /
    • pp.35-42
    • /
    • 2005
  • This paper proposes a new reseeding methodology using a variable-rank multiple-polynomial linear feedback shift register (MP-LFSR). In the proposed reseeding scheme, a test cube with large number of specified bits is encoded with a high-rank polynomial, while a test cube with a small number of specified bits is encoded with a low-rank polynomial. Therefore, according to the number of specified bits in each test cube, the size of the encoded data can be optimally reduced. A variable-rank MP-LFSR can be implemented with a slight modification of a conventional MP-LFSR and Multiple Polynomial can be represented by adding just 1 bit to encoding data. The experimental results on the largest ISCAS'89 benchmark circuits show that the proposed methodology can provide much better encoding efficiency than the previous methods with adequate hardware overhead.

EAP-AKA Authentication without UICC for Interworking Authentication in Heterogeneous Wireless Networks (이질적인 무선 네트워크 환경에서 인증 연동을 위한 비 UICC 방식의 EAP-AKA 인증)

  • Choi, Jae-Duck;Jung, Sou-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.5
    • /
    • pp.168-177
    • /
    • 2009
  • This paper proposes the EAP-AKA scheme without UICC for extending its usage to existing WLAN/WiBro devices. To apply the current EAP-AKA scheme, the WLAN/WiBro devices require an external Universal Integrated Circuit Card (UICC) reader. If they don't use UICC due to cost overhead and architectural problem of device, the EAP-AKA scheme loses its own advantages in security and portability aspects. The proposed scheme uses the DH key algorithm and a password for non-UICC devices instead of using the long-term key stored in UICC. The main contribution is to maintain the security and portability of the EAP-AKA while being applied to non-3GPP network devices not equipped with UICC. Furthermore, it does not require major modifications of authentication architecture in 3GPP.

The Calculation of the Exact BER of UWB-TH BPSK Communication systems with the Multiple User Interference (다중 사용자 간섭을 고려한 TH-BPSK UWB 통신 시스템의 정확한 BER 계산)

  • Park, Jang-Woo;Choi, Yong-Seok;Cho, Kyung-Ryong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.5
    • /
    • pp.951-957
    • /
    • 2005
  • The bit error probability of UWB Time-Hopping(TH) multiple access communication systems combined with BPSK is calculated with a high accuracy including the multiple user interference(MUI). This paper finds that with some manipulations, the TH-BPSK UWB signal can be modified to the similar form of the DS-CDMA signal. The MUI in the system is explained by the characteristic function technique. Above two descriptions have been bases on the derivation of the exact BER expression of the system. We also propose the approximate expression for the BER, which has enough accuracy compared with the expression from the Gaussian approximation of the MUI. The comparison of the results from the proposed expressions with the simulation results gives the confirmation for the validity and accuracy of the proposed expressions.

Design of a Variable Shortened and Punctured RS Decoder (단축 및 펑처링 기반의 가변형 RS 복호기 설계)

  • Song Moon-Kyou;Kong Min-Han;Lim Myoung-Seob
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.8C
    • /
    • pp.763-770
    • /
    • 2006
  • In this paper, a variable Reed-Solomon(RS) decoder with erasure decoding functionality is designed based on the modified Euclid's algorithm(MEA). The variability of the decoder is implemented through shortening and puncturing based on the RS(124, 108, 8) code, other than the primitive RS(255, 239, 8) code. This leads to shortening the decoding latency. The decoder performs 4-step pipelined operation, where each step is designed to be clocked by an independent clock. Thus by using a faster clock for the MEA block, the complexity and the decoding latency can be reduced. It can support both continuous- and burst-mode decoding. It has been designed in VHDL and synthesized in an FPGA chip, consuming 3,717 logic cells and 2,048-bit memories. The maximum decoding throughput is 33 MByte/sec.

Design of New Quasi-Orthogonal Space-Time Block Code with Minimum Decoding Complexity (최소 복호 복잡도를 갖는 새로운 준직교 시중간블록부호 설계)

  • Chae, Chang-Hyeon;Choi, Dae-Won;Jung, Tae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.12A
    • /
    • pp.1219-1225
    • /
    • 2007
  • In this paper, we propose a new quasi-orthogonal space-time block code(QO-STBC) achieving full rate and full diversity for general QAM and quasi-static Rayleigh fading channels with four transmit antennas. This code possesses the quasi orthogonal property like the conventional minimum decoding complexity QO-STBC(MDC-QO-STBC), which allows independently a maximum likelihood(ML) decoding to only require joint detection of two real symbols. By computer simulation results, we show that the proposed code exhibits the identical BER performance with the existing MDC-QO-STBC. However, the proposed code has an advantage in the transceiver implementation since the original coding scheme may be modified so that increases of peak-to-average power ratio occur at only two transmit antennas, but the MDC-QO-STBC does at all of transmit antennas.

Half-Pixel Accuracy Motion Estimation Algorithm in the Transform Domain for H.264 (H.264를 위한 주파수 영역에서의 반화소 정밀도 움직임 예측 알고리듬)

  • Kang, Min-Jung;Heo, Jae-Seong;Ryu, Chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.11C
    • /
    • pp.917-924
    • /
    • 2008
  • Motion estimation and compensation in the spatial domain check the searching area of specified size in the previous frame and search block to minimize the difference with current block. When we check the searching area, it consumes the most encoding times due to increasing the complexity. We can solve this fault by means of motion estimation using shifting matrix in the transform domain instead of the spatial domain. We derive so the existed shifting matrix to a new recursion equation that we decrease more computations. We modify simply vertical shifting matrix and horizontal shifting matrix in the transform domain for motion estimation of half-pixel accuracy. So, we solve increasing computation due to bilinear interpolation in the spatial domain. Simulation results prove that motion estimation by the proposed algorithm in DCT-based transform domain provides higher PSNR using fewer bits than results in the spatial domain.

The Design and Implementation of a Graphical Education System on the Structure and the Operation of ALU (ALU 구조와 단계별 연산과정을 그래픽 형태로 학습하는 교육 시스템의 설계 및 구현)

  • Ahn, Syung-Og;Nam, Soo-Jeong
    • The Journal of Engineering Research
    • /
    • v.2 no.1
    • /
    • pp.31-37
    • /
    • 1997
  • This paper describes the design and implementation of 8 bit ALU graphic simulator which helps students who study the structure and operation course of general ALU. ALU of this paper consists of three parts, arithmetic circuit, logic circuit, and shifter. Each of them performs as follows. Arithmetic circuit performs arithmetic operation such as addition, subtraction, 1 increment, 1 decrement, 2's complement, logic circuit performs logic operation such as OR, AND, XOR, NOT, and shifter performs shift operation and transfers the result of circuits of arithmetic, logic to data bus. The instructions which relate to these basic ALU functions was selected from Z80 instructions and ALU circuit was designed with those instructions and this designed ALU circuit was implemented on graphic screen. And all state of this data operation course in ALU was showed by bit and logic gate unit.

  • PDF

An Adaptive Decision-Directed Equalizer using Iterative Hyperplane Projection for SIMO systems (IHP 알고리즘을 이용한 SIMO 시스템용 적응 직접 결정 등화기 연구)

  • Lee Won-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.1C
    • /
    • pp.82-91
    • /
    • 2005
  • This paper introduces an efficient affine projection algorithm(APA) using iterative hyperplane projection. Among various fast converging adaptation algorithms, APA has been preferred to be employed for various applications due to its inherent effectiveness against the rank deficient problem. However, the amount of complexity of the conventional APA could not be negligible because of the accomplishment of sample matrix inversion(SMI). Moreover, the 'shifting invariance property' usually exploited in single channel case does not hold for the application of space-time decision-directed equalizer(STDE) deployed in single-input-multi-output(SIMO) systems. Thus, it is impossible to utilize the fast adaptation schemes such as fast transversal filter(FlF) having low-complexity. To accomplish such tasks, this paper introduces the low-complexity APA by employing hyperplane projection algorithm, which shows the excellent tracking capability as well as the fast convergence. In order to confirm th validity of the proposed method, its performance is evaluated under wireless SIMO channel in respect to bit error rate(BER) behavior and computational complexity.

Compression of Medical Examination Data Based on Modified Gamma-Coding (수정된 감마 코딩 기반 의료 검진 데이터 압축)

  • Ku, Dong Youn;Park, Jae Wook;Lee, Yong Kyu
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.2
    • /
    • pp.133-142
    • /
    • 2014
  • According to the development of medical information systems, shortened examination time per patient could increase the number of treatments, resulting in the rapid growth of the amount of medical data. Studies on how to efficiently compress and store medical text data of increasing patients are in progress. However, previous methods have the shortcoming of compressing medical text data as it is, resulting in low compression rate. This research tries to overcome the problem by using the gamma coding method which enables compression in bit unit. We propose a new compression scheme which encodes the deviations between measured values and normal range values. Furthermore, we suggest to use the previous value with the least deviation from the measurement as the standard value to encode that deviation. Even though the suggested methods are simple, they have high compression rates. Through performance evaluation, we show that the suggested methods are more efficient than the previous methods.

Recovery of Missing Motion Vectors Using Modified ALA Clustering Algorithm (수정된 ALA 클러스터링 알고리즘을 이용한 손실된 움직임 벡터 복원 방법)

  • Son, Nam-Rye;Lee, Guee-Sang
    • The KIPS Transactions:PartB
    • /
    • v.12B no.7 s.103
    • /
    • pp.755-760
    • /
    • 2005
  • To transmit a video bit stream over low bandwith, such as mobile, channels, encoding algorithms for high bit rate like H.263+ are used. In transmitting video bit-streams, packet losses cause severe degradation in image quality. This paper proposes a new algorithm for the recovery of missing or erroneous motion vectors when H.263+ bit-stream is transmitted. Considering that the missing or erroneous motion vectors are closely related with those of neighboring blocks, this paper proposes a temporal-spatial error concealment algorithm. The proposed approach is that missing or erroneous Motion Vectors(MVs) are recovered by clustering the movements of neighboring blocks by their homogeneity. MVs of neighboring blocks we clustered according to ALA(Average Linkage Algorithm) clustering and a representative value for each cluster is determined to obtain the candidate MV set. By computing the distortion of the candidates, a MV with the minimum distortion is selected. Experimental results show that the proposed algorithm exhibits better performance in subjective and objective evaluation than existing methods.