• Title/Summary/Keyword: 연산 지도

Search Result 3,998, Processing Time 0.027 seconds

A study on the design of a 32-bit ALU (32비트 ALU 설계에 대한 연구)

  • 황복식;이영훈
    • Journal of the Korea Society of Computer and Information
    • /
    • v.7 no.4
    • /
    • pp.89-93
    • /
    • 2002
  • This paper describes an ALU core which is suitable for 32-bit DSP This ALU operates in 32-bit data and occupies the third stage, execution, among 5 stage pipeline structure. The supplied functions of the ALU are arithmetic operations, logical operations, shifting, and so on. For the implementation of this ALU core, each functional block is described by HDL. And the functional verification of the ALU core is performed through HDL simulation. This ALU is designed to use the 32-bit DSP.

  • PDF

Structuring FFT Algorithm for Dataflow Computation (Dataflow 연산에 의한 FFT 앨고리즘의 구성)

  • 이상범;박찬정
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.10 no.4
    • /
    • pp.175-183
    • /
    • 1985
  • Dataflow computers exhibit a high degree of parallelism which can not be obtained easily with the conventional von-Neumann architecture. Since many instructions are ready for execution simultaneously, concurrency can be easily achieved by the multiple processors modified the dataflow machine. This paper describes a FFT Butterfly algorithm for dataflow computation and evaluates the performance by the speed up factor of that algorithm through the simulation approach by the time-accelation method.

  • PDF

Collision Attack of a Hash Function based on 2D Cellular Automata (이차원 셀룰라 오토마타 기반 해쉬함수에 대한 충돌쌍 공격)

  • Choi, Joon-Geun;Ryu, Han-Seong;Lee, Je-Sang;Hong, Seok-Hie
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2008.02a
    • /
    • pp.81-84
    • /
    • 2008
  • 김재겸은 2005년 한국 멀티미디어 학회 논문지에 새로운 이차원 셀룰라 오토마타 설계 방법을 소개하고 이 설계 방법으로 구성된 이차원 셀룰라 오토마타를 이용한 해쉬함수를 제안하였다. 본 논문에서는 이 해쉬함수에 대한 첫 번째 분석 결과를 소개한다. 이 해쉬함수는 8 라운드로 구성되고 한 라운드는 두 개의 비선형 연산 부분을 포함하고 있으며, 메시지는 두 비선형 연산 부분에 모두 사용된다. 메시지 차분이 비선형 연산 부분을 거친 뒤 사라질 확률은 $2^{-14}$이다. 따라서 1 라운드 후 약 $2^{-28}$의 확률로 이 해쉬함수의 충돌쌍을 찾을 수 있다. 본 논문의 분석 결과를 통하여 이 해쉬함수는 매우 취약함을 알 수 있다.

  • PDF

Improve of FGA Frequency Charateristics for Active RC Filters (능동RC여파기를 위한 유한이득증복기의 주파수 특성 개선)

  • 권갑현;최흥문
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.18 no.6
    • /
    • pp.38-43
    • /
    • 1981
  • In this paper an actively compensatedfinite gain amplifie. (FGA) with positive gain using 4 operational amplifiers and resistors is propo sod, and an application is considered in an active RC filter. By cancelling the effect of the GB's up to the third-order term of s on the transfer function, the proposed FGA has the extended frequency range over that of the FGA using 3 operational amplifiers. When this FGA is applied to an active RC filter with Pole frequncy of 100kHz, the magnitude error of the frequency characteristics of the filter is less than 2%.

  • PDF

A NEW DETAIL EXTRACTION TECHNIQUE FOR VIDEO SEQUENCE CODING USING MORPHOLOGICAL LAPLACIAN OPERATOR (수리형태학적 Laplacian 연산을 이용한 새로운 동영상 Detail 추출 방법)

  • Eo, Jin-Woo;Kim, Hui-Jun
    • Journal of IKEEE
    • /
    • v.4 no.2 s.7
    • /
    • pp.288-294
    • /
    • 2000
  • In this paper, an efficient detail extraction technique for a progressive coding scheme is proposed. The existing technique using the top-hat transformation yields an efficient extraction scheme for isolated and visually important details, but yields an inefficient results containing significant redundancy extracting the contour information. The proposed technique using the strong edge feature extraction property of the morphological Laplacian in this paper can reduce the redundancy, and thus provides lower bit-rate. Experimental results show that the proposed technique is more efficient than the existing one, and promise the applicability of the morphological Laplacian operator.

  • PDF

Complexity Reduced Blind Subspace Channel Estimation for DS/CDMA DMB Downlink (DS/CDMA DMB 하향 링크에서 복잡도가 감소된 블라인드 부분 공간 채널 추정)

  • Yang Wan-Chul;Lee Byung-Seub
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.15 no.9
    • /
    • pp.863-871
    • /
    • 2004
  • In this paper, we propose a subspace channel estimation technique for DS/CDMA DMB down link system, which can obtain reduction in numerical complexity by using of matched filtering outputs. The complexity reduction is considerable when the channel length is small and the system is moderately loaded. Previously proposed subspace-based blind channel estimation algorithm suffer from high numerical complexity for systems with large spreading gains. Although the proposed algerian suffers a slight performance loss, it becomes negligible for large observation length. Performance is evaluated through simulations and the derivation of the analytical MSE.

Fast Durable Storage Module based on Non-Volatile Memory (비휘발성 메로리를 이용한 빠르고 지속성 있는 저장장치 모듈 설계 및 구현)

  • Jang, Hyeongwon;Rhee, Sang Youp;Cho, Kwangil;Jung, Hyungsoo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2016.10a
    • /
    • pp.12-15
    • /
    • 2016
  • 데이터베이스 시스템의 트랜잭션 로깅이나 파일 시스템의 저널링에서 데이터 저장시 입출력 동기화(Synchronous I/O)는 올바른 프로르램 동작에 필수적이다. 하지만 입출력 동기화로 인한 프로그램의 지연 혹은 기다림은 응용 프로그램 성능의 저하를 가져온다. 본 논문에서는 차세대 저장장치인 비휘발성 메모리를 사용하여 지속성을 보장하며 쓰기 연산의 응답성을 개선하는 사용자 수준의 스토리지 모듈을 제안하고 기존의 동기화된 쓰기 연산과 성능을 비교하였다. 특히 멀티코어 환경에서 동시에 들어오는 여러 입출력 쓰기 연산 요청에 대하여 효율적으로 처리하였다.

Improved SE SD Algorithm based on MMSE for MIMO Detection (MIMO 검파를 위한 MMSE 기반의 향상된 SE SD 알고리듬)

  • Cho, Hye-Min;Park, Soon-Chul;Han, Dong-Seog
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.3A
    • /
    • pp.231-237
    • /
    • 2010
  • Multi-input multi-output (MIMO) systems are used to improve the transmission rate in proportion to the number of antennas. However, their computational complexity is very high for the detection in the receiver. The sphere decoding (SD) is a detection algorithm with reduced complexity. In this paper, an improved Schnorr-Euchner SD (SE SD) is proposed based on the minimum mean square error (MMSE) and the Euclidean distance criteria without additional complexity.

A hybrid ZF-SD method for MIMO Systems (다중 안테나 시스템에서 Zero-Forcing(ZF)과 Sphere Decoding(SD)을 결합한 향상된 성능의 복호 방법)

  • Lee, Hong-Ju;Bae, Jeong-Min;Kim, Dong-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.10A
    • /
    • pp.976-981
    • /
    • 2006
  • In this paper, we describe a hybrid ZF-SD method. The method is based on dimensionality reduction via predecoding and cancellation of those symbols that can be quickly and reliably detected by a linear decoder. The proposed method shows BER performance similar to SD but with much lower computational complexity than SD.

Design of SIMD-DSP/PPU for a High-Performance Embedded Microprocessor (고성능 내장형 마이크로프로세서를 위한 SIMD-DSP/FPU의 설계)

  • 정우경;홍인표;이용주;이용석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.4C
    • /
    • pp.388-397
    • /
    • 2002
  • We designed a SIMD-DSP/FPU that can efficiently improve multimedia processing performance when integrated into high-performance embedded microprocessors. We proposed partitioned architectures and new schemes for several functional units to reduce chip area. Sharing functional units reduces the area of FPU significantly. The proposed architecture is modeled in HDL and synthesized with a 0.35$\mu\textrm{m}$ standard cell library. The chip area is estimated to be about 100,000 equivalent gates. The designed unit can run at higher than 50MHz clock frequency of CPU core under the worst-case operating conditions.