• Title/Summary/Keyword: Perfect Shuffle

Search Result 9, Processing Time 0.029 seconds

Study on Construction of Quinternary Logic Circuits Using Perfect Shuffle (Perfect Shuffle에 의한 5치 논리회로의 구성에 관한 연구)

  • Seong, Hyeon-Kyeong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.3
    • /
    • pp.613-623
    • /
    • 2011
  • In this paper, we present a method on the construction of quinternary logic circuits using Perfect shuffle. First, we discussed the input-output interconnection of quinternary logic function using Perfect Shuffle techniques and Kronecker product, and designed the basic cells of performing the transform matrix and the reverse transform matrix of quinternary Reed-Muller expansions(QRME) using addition circuit and multiplication circuit of GF(5). Using these basic cells and the input-output interconnection technique based on Perfect Shuffle and Kronecker product, we implemented the quinternary logic circuit based on QRME. The proposed design method of QRME is simple and very efficient to reduce addition circuits and multiplication circuits as compared with other methods for same logic function because of using matrix transform based on modular structures. The proposed design method of quinternary logic circuits is simple and regular for wire routing and possess the properties of concurrency and modularity of array.

Scalable FFT Processor Based on Twice Perfect Shuffle Network for Radar Applications (레이다 응용을 위한 이중 완전 셔플 네트워크 기반 Scalable FFT 프로세서)

  • Kim, Geonho;Heo, Jinmoo;Jung, Yongchul;Jung, Yunho
    • Journal of Advanced Navigation Technology
    • /
    • v.22 no.5
    • /
    • pp.429-435
    • /
    • 2018
  • In radar systems, FFT (fast Fourier transform) operation is necessary to obtain the range and velocity of target, and the design of an FFT processor which operates at high speed is required for real-time implementation. The perfect shuffle network is suitable for high-speed FFT processor. In particular, twice perfect shuffle network based on radix-4 is preferred for very high-speed FFT processor. Moreover, radar systems that requires various velocity resolution should support scalable FFT points. In this paper, we propose a 8~1024-point scalable FFT processor based on twice perfect shuffle network algorithm and present hardware design and implementation results. The proposed FFT processor was designed using hardware description language (HDL) and synthesized to gate-level circuits using $0.65{\mu}m$ CMOS process. It is confirmed that the proposed processor includes logic gates of 3,293K.

Study on Construction of Multiple-Valued Logic Circuits Based on Reed-Muller Expansions (Reed-Muller 전개식에 의한 다치 논리회로의 구성에 관한 연구)

  • Seong, Hyeon-Kyeong
    • The KIPS Transactions:PartA
    • /
    • v.14A no.2
    • /
    • pp.107-116
    • /
    • 2007
  • In this paper, we present a method on the construction of multiple-valued circuits using Reed-Muller Expansions(RME). First, we discussed the input output interconnection of multiple valued function using Perfect Shuffle techniques and Kronecker product and designed the basic cells of performing the transform matrix and the reverse transform matrix of multiple valued RME using addition circuit and multiplication circuit of GF(4). Using these basic cells and the input-output interconnection technique based on Perfect Shuffle and Kronecker product, we implemented the multiple valued logic circuit based on RME. The proposed design method of multiple valued RME is simple and very efficient to reduce addition circuits and multiplication circuits as compared with other methods for same function because of using matrix transform based on modular structures. The proposed design method of multiple valued logic circuits is simple and regular for wire routing and possess the properties of concurrency and modularity of array.

Design of Multiple-Valued Logic Circuits on Reed-Muller Expansions Using Perfect Shuffle (Perfect Shuffle에 의한 Reed-Muller 전개식에 관한 다치 논리회로의 설계)

  • Seong, Hyeon-Gyeong
    • The KIPS Transactions:PartA
    • /
    • v.9A no.3
    • /
    • pp.271-280
    • /
    • 2002
  • In this paper, the input-output interconnection method of the multiple-valued signal processing circuit using Perfect Shuffle technique and Kronecker product is discussed. Using this method, the circuit design method of the multiple-valued Reed-Muller Expansions (MRME) which can process the multiple-valued signal easily on finite fields GF$(p^m)$ is presented. The proposed input-output interconnection methods show that the matrix transform is an efficient and the structures are modular. The circuits of multiple-valued signal processing of MRME on GF$(p^m)$ design the basic cells to implement the transform and inverse transform matrix of MRME by using two basic gates on GF(3) and interconnect these cells by the input-output interconnection technique of the multiple-valued signal processing circuits. The proposed multiple-valued signal processing circuits that are simple and regular for wire routing and possess the properties of concurrency and modularity are suitable for VLSI.

Design of Radix-4 FFT Processor Using Twice Perfect Shuffle (이중 완전 Shuffle을 이용한 Radix-4 FFT 프로세서의 설계)

  • Hwang, Myoung-Ha;Hwang, Ho-Jung
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.2
    • /
    • pp.144-150
    • /
    • 1990
  • This paper describes radix-4 Fast Fourier Transform (FFT) Processor designed with the new twice perfect shuffle developed from a perfect shuffle used in radix-2 FFT algorithm. The FFT Processor consists of a butterfly arithmetic circuit, address generators for input, output and coefficient, input and output registers and controller. Also, it requires the external ROM for storage of coefficient and RAM for input and output. The butterfly circuit includes 12 bit-serial ($16{\times}8$) multipliers, adders, subtractors and delay shift registers. Operating on 25 MHz two phase clock, this processor can compute 256 point FFT in 6168 clocks, i.e. 247 us and provides flexibility by allowing the user to select any size among 4,16,64,and256points. Being fabricated with 2-um double metal CMOS process, it includes about 28000 transistors and 55 pads in $8.0{\times}8.2mm^2$area.

  • PDF

An implementation of the efficient optical perfect shuffle interconnection with block-quantized binary phase hologram (Block-Quantized 이진 위상 홀로그램을 이용한 효율적인 광학적 perfect shuffle의 구현)

  • Kim, Hee-Ju;Huh, Hyun;Pan, Jae-Kyung
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.33A no.5
    • /
    • pp.125-131
    • /
    • 1996
  • In this paper, we introduced the BQBPH method for making the grating of high efficiency which was improtant in implementing optical PS. The pattern of graing was obtianed by computer simulations using iterative method, and the diffraction efficeincy of designed grating was about 67% through BPM simulation. The grating was fabricated by laser beam writer, and the diffraction efficiency BPM simulation. The grating was fabricated by laser beam writer, and the diffraction efficiency was 47%. We implemented the optical PS with the grating and showed that optical experimental output patterns were good agreement with PS output patterns and first order was main diffraction order.

  • PDF

A Study on Signal Processing Using Multiple-Valued Logic Functions (디치논리 함수를 이용한 신호처리 연구)

  • 성현경;강성수;김흥수
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.12
    • /
    • pp.1878-1888
    • /
    • 1990
  • In this paper, the input-output interconnection method of the multi-valued signal processing circuit using perfect Shuffle technique and Kronecker product is discussed. Using this method, the design method of circuit of the multi-valued Reed-Muller expansions(MRME) to be used the multi-valued signal processing on finite field GF(p**m) is presented. The proposed input-output interconnection method is shown that the matrix transform is efficient and that the module structure is easy. The circuit design of MRME on FG(p**m) is realized following as` 1) contructing the baisc gates on GF(3) by CMOS T gate, 2) designing the basic cells to be implemented the transform and inverse transform matrix of MRME using these basic gates, 3) interconnecting these cells by the input-output interconnecting method of the multivalued signal processing circuits. Also, the circuit design of the multi-valued signal processing function on GF(3\ulcorner similar to Winograd algorithm of 3x3 array of DFT (discrete fourier transform) is realized by interconnection of Perfect Shuffle technique and Kronecker product. The presented multi-valued signal processing circuits that are simple and regular for wire routing and posses the properties of concurrency and modularity are suitable for VLSI.

  • PDF

BSS: Batcher's sorter with simpler interconnections and its applications for ATM switching (상호 연결망이 단순화된 Batcher의 정렬망과 ATM 교환 시스템에서의 응용)

  • Lee, Jae-Dong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.7
    • /
    • pp.1717-1729
    • /
    • 1998
  • 본 논문에서는 상호 연결망을 단순화시킨 Batcher의 정렬망(sorter)을 설계하고 ATM 교환 시스템에서 그것의 응용에 대하여 살펴본다. 많은 ATM교환기에서 Batcherm이 정렬망을 사용함으로써 조정회로의 구조나 전달망 구조의 설계를 단순화 할 수 있다. 알고리즘 CONSTRUCT-BSS를 설계할 수 있게 하는 패리티 전략을 소개하였다. 내부 상호 연결을 단순화하기 위하여 N/2개의 짝수 패리티 key들을 정렬망(sorter)에서 직선으로 연결하였다. 결과적으로, 이 논문에서 제안된 상호 연결 방법은 Batcher 정렬망의 내부 상호 연결을 단순화하였고 perfect-shuffle 상호 연결망과 비교하여 하드웨어 가격이나 속도 면에서 우위를 점한다. 또한, 여기서 제안한 정렬망은 전달 경로의 반이 직선으로 설계되므로 도안된 회로 보드나 VLSI 집의 레이아웃이 보다 단순화될 수 있다.

  • PDF

Parallel 3-dimensional optical interconnections using liquid crystal devices for B-ISDN electronic switching systems

  • Jeon, Ho-In;Cho, Doo-Jin
    • Journal of the Optical Society of Korea
    • /
    • v.1 no.1
    • /
    • pp.52-59
    • /
    • 1997
  • In this paper, we propose a system design for a parallel3-dimensional optical interconnection network utilizing variable grating mode liquid crystal devices (VGM LCD's) which are optical transducers capable of performing intensity-to-spatial-frequency conversion. The proposed system performs real-time, reconfigurable, but blocking and nonbroadcasting 3-dimensional optical interconnections. The operating principles of the 3-D optical interconnection network are described, and some of the fundamental limitations are addressed. The system presented in this paper can be directly used as a configuration of switching elements for the 2-D optical perfect-shuffle dynamic interconnection network, as well as for a B-ISDN photonic switching system.