• Title/Summary/Keyword: clock cycles

Search Result 148, Processing Time 0.04 seconds

The Architecture of the Frame Memory in MPEG-2 Video Encoder (MPEG-2 비디오 인코더의 프레임 메모리 구조)

  • Seo, Gi-Beom;Jeong, Jeong-Hwa
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.37 no.3
    • /
    • pp.55-61
    • /
    • 2000
  • This paper presents an efficient hardware architecture of frame memory interface in MPEG-2 video encoder. To reduce the size of memory buffers between SDRAM and the frame memory module, the number of clocks needed for each memory access is minimized with dual bank operation and burst length change. By allocating the remaining cycles not used by SDRAM access, to the random access cycle, the internal buffer size, the data bus width, and the size of the control logic can be minimized. The proposed architecture is operated with 54MHz clock and designed with the VT $I^{тм}$ 0.5 ${\mu}{\textrm}{m}$ CMOS TLM standard cell library. It is verified by comparing the test vectors generated by the c-code model with the simulation results of the synthesized circuit. The buffer area of the proposed architecture is reduced to 40 % of the existing architecture.

  • PDF

An Effective Cache Test Algorithm and BIST Architecture (효율적인 캐쉬 테스트 알고리듬 및 BIST 구조)

  • Kim, Hong-Sik;Yoon, Do-Hyun;Kang, Sing-Ho
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.12
    • /
    • pp.47-58
    • /
    • 1999
  • As the performance of processors improves, cache memories are used to overcome the difference of speed between processors and main memories. Generally cache memories are embedded and small sizes, fault coverage is a more important factor than test time in testing point of view. A new test algorithm and a new BIST architecture are developed to detect various fault models with a relatively small overhead. The new concurrent BIST architecture uses the comparator of cache management blocks as response analyzers for tag memories. A modified scan-chain is used for pre-testing of comparators which can reduce test clock cycles. In addition several boundary scan instructions are provided to control the internal test circuitries. The results show that the new algorithm can detect SAFs, AFs, TFs linked with CFs, CFins, CFids, SCFs, CFdyns and DRFs models with O(12N), where N is the memory size and the new BIST architecture has lower overhead than traditional architecture by about 11%.

  • PDF

A Design and Implementation of the Division/square-Root for a Redundant Floating Point Binary Number using High-Speed Quotient Selector (고속 지수 선택기를 이용한 여분 부동 소수점 이진수의 제산/스퀘어-루트 설계 및 구현)

  • 김종섭;조상복
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.37 no.5
    • /
    • pp.7-16
    • /
    • 2000
  • This paper described a design and implementation of the division/square-root for a redundant floating point binary number using high-speed quotient selector. This division/square-root used the method of a redundant binary addition with 25MHz clock speed. The addition of two numbers can be performed in a constant time independent of the word length since carry propagation can be eliminated. We have developed a 16-bit VLSI circuit for division and square-root operations used extensively in each iterative step. It performed the division and square-toot by a redundant binary addition to the shifted binary number every 16 cycles. Also the circuit uses the nonrestoring method to obtain a quotient. The quotient selection logic used a leading three digits of partial remainders in order to be implemented in a simple circuit. As a result, the performance of the proposed scheme is further enhanced in the speed of operation process by applying new quotient selection addition logic which can be parallelly process the quotient decision field. It showed the speed-up of 13% faster than previously presented schemes used the same algorithms.

  • PDF

High-Speed Reed-Solomon Decoder Using New Degree Computationless Modified Euclid´s Algorithm (새로운 DCME 알고리즘을 사용한 고속 Reed-Solomon 복호기)

  • 백재현;선우명훈
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.6
    • /
    • pp.459-468
    • /
    • 2003
  • This paper proposes a novel low-cost and high-speed Reed-Solomon (RS) decoder based on a new degree computationless modified Euclid´s (DCME) algorithm. This architecture has quite low hardware complexity compared with conventional modified Euclid´s (ME) architectures, since it can remove completely the degree computation and comparison circuits. The architecture employing a systolic away requires only the latency of 2t clock cycles to solve the key equation without initial latency. In addition, the DCME architecture using 3t+2 basic cells has regularity and scalability since it uses only one processing element. The RS decoder has been synthesized using the 0.25${\mu}{\textrm}{m}$. Faraday CMOS standard cell library and operates at 200MHz and its data rate suppots up to 1.6Gbps. For tile (255, 239, 8) RS code, the gate counts of the DCME architecture and the whole RS decoder excluding FIFO memory are only 21,760 and 42,213, respectively. The proposed RS decoder can reduce the total fate count at least 23% and the total latency at least 10% compared with conventional ME architectures.

Design of Multibyte-based Streaming XML Hardware Parser (다중바이트 기반 스트리밍 XML 하드웨어 파서의 설계)

  • Lee, Kyu-Hee;Seo, Byeong-Seok
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.9
    • /
    • pp.135-140
    • /
    • 2015
  • Web-services employ XML that is the well-formed structure as a de-facto standard to represent data. SOAP or REST is one of the representative web-services using XML based massage passing systems. The XML parser can be divided into event driven and DOM tree. A streaming parser as an event driven is widely used for high-speed parsing. Since the streaming parser processes XML documents in sequence, they have any limitation to improve system performance. In order to improve speed of streaming XML parser, we present multibyte based streaming XML hardware parser using the element analyzer instead of the state machine. Compared to other parsers, the proposed MStreXHP can achieve about 2.72 times improvement in the number of clock cycles to be consumed in comparison of characters and sustain about 7.8Gbps throughput. Therefore, our MStreXHP is desirable for the streaming XML hardware parser on high-performance systems.

Incremental Delta-Sigma Analog to Digital Converter for Sensor (센서용 Incremental 델타-시그마 아날로그 디지털 변환기 설계)

  • Jeong, Jinyoung;Choi, Danbi;Roh, Jeongjin
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.10
    • /
    • pp.148-158
    • /
    • 2012
  • This paper presents the design of the incremental delta-sigma ADC. The proposed circuit consists of pre-amplifier, S & H circuit, MUX, delta-sigma modulator, and decimation filter. Third-order discrete-time delta-sigma modulator with 1-bit quantization were fabricated by a $0.18{\mu}m$ CMOS technology. The designed circuit show that the modulator achieves 87.8 dB signal-to-noise and distortion ratio (SNDR) over a 5 kHz signal bandwidth and differential nonlinearity (DNL) of ${\pm}0.25$ LSB, integral nonlinearity (INL) of ${\pm}0.2$ LSB. Power consumption of delta-sigma modulator is $941.6{\mu}W$. It was decided that N cycles are 200 clock for 16-bits output.

The Changes of Sleep-Wake Cycle from Jet-Lag by Age (연령에 따른 비행시차 후의 수면-각성주기 변화)

  • Kim, Leen;Lee, Seung-Hwan;Suh, Kwang-Yoon
    • Sleep Medicine and Psychophysiology
    • /
    • v.3 no.2
    • /
    • pp.18-31
    • /
    • 1996
  • Jet-lag can be defined as the cumulative physiological and psychological effects of rapid air travel across multiple time zones. Many reports have suggested that age-related changes in sleep reflect fundamental changes in the circadian system and in significant declines in slow wave sleep. Jet lag is a dramatic situation in which the changes of the phase of circadian process and homeostatic process of sleep occur. Thus the authors evaluatead the changes of sleep-wake cycle from jet lag by age. Thirty-eight healthy travellers were studied for 3 days before and 7 days after jet-flights across seven to ten time zone. They were aged 19-70, They trareled eastbound, Seoul to North America (USA, Canada). Sleep onset time, wake-up time, sleep latency, awakening frequency on night sleep, awakening duration on night sleep, sleepiness at wake-up and nap length were evaluated. Our results suggest that by the 7 to 10 time zone shift, the old age group was significantly influenced in sleep-wake cycles. The date on which subjective physical condition was recovered was $6.23{\pm}83$ day after arrivals for old age group, while for young and middle age group, $4.46{\pm}1.50$ day and $4.83{\pm}1.52$ day, respectively. In old age group, sleep onset time was later than baselines and could not recover untill 7th day. But in other groups, the recovery was within 5th day. Nap dura fion was longer in old age group through jet lag than younger age group. In other parameters, there was no definite difference among three age groups. Our results suggested that the old age was significantly influenced by the disharmony between internal body clock and sleep-wake cycle needed at the travel site. Thus we proved that recovery ability from jet lag was age-dependent as well as travelling direction-dependent. To demonstrate more definite evidence, EEG monitoring and staging of sleep were funthun encouraged.

  • PDF

VLSI Design of an Improved Structure of a $GF(2^m)$ Divider (확장성에 유리한 병렬 알고리즘 방식에 기반한 $GF(2^m)$나눗셈기의 VLSI 설계)

  • Moon San-Gook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.3
    • /
    • pp.633-637
    • /
    • 2005
  • In this contribution, we developed and improved an existing GF (Galois field) dividing algorithm by suggesting a novel architecture for a finite field divider, which is frequently required for the error correction applications and the security-related applications such as the Reed-Solomon code, elliptic curve encryption/ decryption, is proposed. We utilized the VHDL language to verify the design methodology, and implemented the architecture on an FPGA chip. We suggested the n-bit lookup table method to obtain the throughput of 2m/n cycles, where m is the order of the division polynomial and n is the number of the most significant lookup-bits. By doing this, we extracted the advantages in achieving both high-throughput and less cost of the gate areaon the chip. A pilot FPGA chip was implemented with the case of m=4, n=2. We successfully utilized the Altera's EP20K30ETC144-1 to exhibit the maximum operating clock frequency of 77 MHz.

An Efficient Architecture Exploration for Embedded Core Design Exploiting Design Hierarchy (임베디드 코어 설계를 위해 설계 계층을 이용한 효율적인 아키텍처 탐색)

  • Kim, Sang-Woo;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.12B
    • /
    • pp.1758-1765
    • /
    • 2010
  • This paper proposes an architecture exploration methodology for the design of embedded cores exploiting design hierarchy. The proposed method performs systematic architecture exploration by taking different approaches for verifying designs and estimating performances depending on the hierarchy level in design process. Performance estimation tools generate profile having performance data related with design modules of an embedded core. Profile analyzer performs data-mining to acquire association rules between the design modules and performance parameters. Inference engine in the profile analyzer updates the association rules which will be used to improve the design performance at next exploration steps. To show the efficiency of the proposed architecture explorations methodology, experiments had been performed for JPEG encoder, Chen-DCT, and FFT application functions. The embedded cores designed by taking the proposed method show performance improvement by 60.8% in terms of clock cycles on the average when compared with the initial embedded core in MIPS R3000.

New Enhanced Degree Computationless Modified Euclid's Algorithm and its Architecture for Reed-Solomon decoders (Reed-Solomon 복호기를 위한 새로운 E-DCME 알고리즘 및 하드웨어 구조)

  • Baek, Jae-Hyun;SunWoo, Myung-Hoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.8A
    • /
    • pp.820-826
    • /
    • 2007
  • This paper proposes an enhanced degree computationless modified Euclid's(E-DCME) algorithm and its architecture for Reed-Solomon decoders. The proposed E-DCME algorithm has shorter critical path delay that is $T_{mult}+T_{add}+T_{mux}$ compared with the existing modified Euclid's algorithm and the degree computationless modified Euclid's(DCME) algorithm since it uses new initial conditions. The proposed E-DCME architecture employing a systolic array requires only 2t-1 clock cycles to solve the key equation without initial latency. In addition, the E-DCME architecture consisting of 3t basic cells has regularity and scalability since it uses only one processing element. The E-DCME architecture using the $0.18{\mu}m$ Samsung standard cell library consists of 18,000 gates.