The search functionality is under construction.

Keyword Search Result

[Keyword] channel density(2hit)

1-2hit
  • VLSI Architecture for the Low-Computation Cycle and Power-Efficient Recursive DFT/IDFT Design

    Lan-Da VAN  Chin-Teng LIN  Yuan-Chu YU  

     
    PAPER-Digital Signal Processing

      Vol:
    E90-A No:8
      Page(s):
    1644-1652

    In this paper, we propose one low-computation cycle and power-efficient recursive discrete Fourier transform (DFT)/inverse DFT (IDFT) architecture adopting a hybrid of input strength reduction, the Chebyshev polynomial, and register-splitting schemes. Comparing with the existing recursive DFT/IDFT architectures, the proposed recursive architecture achieves a reduction in computation-cycle by half. Appling this novel low-computation cycle architecture, we could double the throughput rate and the channel density without increasing the operating frequency for the dual tone multi-frequency (DTMF) detector in the high channel density voice over packet (VoP) application. From the chip implementation results, the proposed architecture is capable of processing over 128 channels and each channel consumes 9.77 µW under 1.2 V@20 MHz in TSMC 0.13 1P8M CMOS process. The proposed VLSI implementation shows the power-efficient advantage by the low-computation cycle architecture.

  • An Optimal Channel Pin Assignment Algorithm for Hierarchical Building-Block Layout Design

    Tetsushi KOIDE  Shin'ichi WAKABAYASHI  Noriyoshi YOSHIDA  

     
    PAPER

      Vol:
    E76-A No:10
      Page(s):
    1636-1644

    This paper presents a linear time optimal algorithm to a channel pin assignment problem for hierarchical building-block layout design. The channel pin assignment problem is to determine positions of the pins of nets on the top and the bottom sides of a channel, which are partitioned into several intervals, and the pins are permutable within their associated intervals. The channel pin assignment problem has been shown NP-hard in general. We present a linear time optimal algorithm for an important special case of the problem, in which there is at most one pin of a net within each interval in the channel. The proposed algorithm is optimal in a sense that it can minimize both the channel density and the total wire length of the channel. We also disscuss how to apply our algorithm to the pin assignment in the L-shaped and staircase channels. Experimental results indicate that substantial reduction in both channel density and estimated total wire length can be obtained by permuting pins in each interval. Combining the proposed algorithm with a conventional channel router, results of channel routing also achieve large amount of reduction of the number of tracks, total wire length, and the number of vias.