About this Journal Submit a Manuscript Table of Contents
Journal of Engineering
Volume 2013 (2013), Article ID 759761, 8 pages
http://dx.doi.org/10.1155/2013/759761
Research Article

A VLSI Implementation of Rank-Order Searching Circuit Employing a Time-Domain Technique

1Faculty of Electronics and Telecommunications, University of Science, VNU-HCM, Ho Chi Minh City, Vietnam
2Department of Electrical Engineering and Information Systems, The University of Tokyo, Tokyo 113-8656, Japan

Received 28 August 2012; Revised 3 December 2012; Accepted 11 December 2012

Academic Editor: Jan Van der Spiegel

Copyright © 2013 Trong-Tu Bui and Tadashi Shibata. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

We present a compact and low-power rank-order searching (ROS) circuit that can be used for building associative memories and rank-order filters (ROFs) by employing time-domain computation and floating-gate MOS techniques. The architecture inherits the accuracy and programmability of digital implementations as well as the compactness and low-power consumption of analog ones. We aim to implement identification function as the first priority objective. Filtering function would be implemented once the location identification function has been carried out. The prototype circuit was designed and fabricated in a 0.18 μm CMOS technology. It consumes only 132.3 μW for an eight-input demonstration case.

1. Introduction

Searching operation is an important function in recognition systems. In conventional recognition systems, only the nearest matched template data among a vast number of template data can be retrieved. However, in some applications, such as in -neighbor selectors or internet routers, finding an th nearest matched data is necessary. Although such kind of operation can be carried out by employing a sorting processor, sorting operation is computationally expensive and time consuming, making it unsuitable for building low-power systems.

In image and speech processing, data compression, communication, neural network, and so forth, nonlinear filters can find a lot of applications such as attenuating impulsive noise while preserving sudden changes in the signal. Among many types of nonlinear filters, MIN, MAX, and MEDIAN are most popular ones. These filters can be implemented by using rank-order filters (ROFs) with appropriate rank-order setting values. Several ROFs have been implemented in fully digital [1, 2], mixed-signal [3] as well as analog approaches [46]. When considering the problem of saving required circuit area so as to use the structure as a basic block for building parallel processing array, analog implementations of ROFs are preferred. Although they can achieve low-power consumption and small chip real estate, the main drawback of analog implementations is that they suffer from the problems of accuracy, such as mismatches between transconductance amplifiers [4].

In this paper, we have developed a compact and low-power rank-order searching (ROS) circuit by employing a time-domain computation technique. Here, a time interval or delay time is used for representing value. The circuitry in this study is the core that can be used for building associative memories and ROFs. Since employing time-domain technique, the architecture not only achieves small chip real estate and low power consumption of analog implementations, but also improves the accuracy of such approaches. In the design we aim to identify the location of the candidate as the first priority objective. Getting out its content or filtering function would be implemented easily once the location was found.

In the rest of the paper, system organization and major circuitries utilized in the prototype chip design are described in Sections 2 and 3. Section 4 shows the experimental results from the test chips fabricated in a 0.18 μm CMOS technology. And the conclusion of the paper is given in Section 5.

2. System Organization

A ROF employing pulse width modulation (PWM) signals was proposed in [7] in a fully digital architecture. That architecture works well for filtering function, but it suffers from the problem of narrow-pulse signals (or glitches) probably occurring at the output of XOR gates in the address encoder circuit, leading error in the location identification function. The problem becomes more obviously in the case of a large number of inputs. In order to overcome this problem as well as to achieve a compact architecture dealing with the problem of a large number of inputs in many applications, an analog rank-order searching engine employing time-domain computation techniques is proposed in Figure 1. It is the basic core for building ROFs and associative memories. Identification function is the first objective that we aim at with this architecture. Basically, it consists of analog-to-delay-time converters (ATCs), a rank-order setting circuitry, a comparator based on floating-gate MOS technology, a binary encoder, and a binary counter. The ATCs convert analog values, , to delay-time signals; then the rank-order searching circuit uses them as input data. The final output is a binary code representing the location of the th smallest value in analog voltage domain or the th risen-up signal in time domain. In addition, in order to establish a smooth interfacing to the following digital processing, a binary counter can be added to the system. The value of the th smallest input in a digital format is given at the output of this counter. Filtering/searching operation is carried out within a period called the operation slot which is determined by the SLOT signal. The value of SLOT is mainly selected depending on the desired resolution of computation. For example, SLOT is set to 256 () clock cycles for 8-bit resolution. In the study, from now on, a rank of is represented by a binary number RANK equivalent to (). For example, a rank of four is represented by the rank value of .

759761.fig.001
Figure 1: Block diagram of the rank-order searching circuit.

3. Circuit Implementations

3.1. Analog-to-Delay-Time Converter (ATC)

Input voltages, , are converted to delay-time signals, , by ATCs as shown in Figure 1. Input analog voltages are applied to the negative nodes of voltage comparators while a common ramp voltage signal is applied to the positive nodes. The comparator compares the input analog voltage with this ramp voltage. The output of the comparator remains “0” level until the ramp exceeds the input voltage. At that moment, the comparator output is inverted to “1” level. In this manner, an analog voltage is converted to a delay-time signal. A smaller delay-time is corresponding to a smaller analog voltage.

3.2. Floating-Gate-MOS-Based Comparator and Rank-Order Setting Circuit

In order to reduce the circuit area compared with [7], the carry save adder (CSA) and the subtractor in [7] are replaced by a simple floating-gate-MOS-based comparator and a rank-order setting circuit. Simplified schematic of the floating-gate-MOS-based comparator utilized is shown in Figure 2. The voltages at the floating gates are determined as linear weighted summations of multiple input signals and calculated by [8]: where ,    is either “” or “.”

fig2
Figure 2: Floating-gate-MOS-based comparator.

are the input voltages getting one of two levels: or ; are capacitive coupling coefficients between the floating gate and each of the input gates; is the capacitive coupling coefficient between the floating gate and the substrate. and are necessary to guarantee that is smaller than at each given rank and to fit the range of and inside the input range of the comparator. Smallest MIM capacitances of 16 fF of the fabrication process were chosen to save chip area.

For a given rank-order value, rank-order setting circuit will connect some of its capacitors (i.e., ) to and connect others to ground so that it can set a corresponding proportional to the rank value. The voltage rises proportionally to the number of “1” inputs. When exceeds , the comparator output COUT becomes “high,” as shown in Figure 2, after a small delay due to the response of the comparator.

Figure 3 demonstrates the case of a 5-input system with the required rank order of four. As can be seen in this example, the filtered input, that is, the candidate, is and a binary code of will be generated by the address encoder.

759761.fig.003
Figure 3: Demonstration of the rank-order searching operation.
3.3. Address Encoding

Figure 4 illustrates the schematic diagram of the address encoding circuit. It identifies the location of the filtered input and represents this location as a binary code. It consists of simple XOR gates, narrow-pulse filters, domino buffers, and a binary encoder. Location identification function is carried out by taking XOR function between COUT and delay-time signals then searching a “0” that is remained at the output of domino buffers. Unfortunately, due to the response time of the comparator, a narrow-pulse signal (i.e., glitch) will occur at the output of the corresponding XOR gate of the candidate signal. Theoretically, such a glitch disappears if the response time is zero. This pulse is narrower than others occurring at other XORs’ outputs. Narrow-pulse filters are placed at the outputs of XOR gates to remove such a pulse. The domino buffers following filters detect from “0” to “1” transitions. As a result, only one output of these buffers remains “0” level, and others become “1,” at the end of the operation slot. A following binary priority encoder senses the “0” input and generates an address corresponding to that one. As can be seen in the example of Figure 3, the fourth smallest data () is nearly identical to the signal COUT, and the glitch occurring at is removed by the narrow-pulse filter.

759761.fig.004
Figure 4: Address encoding circuit.
3.4. Narrow-Pulse Filter (Glitch Filter)

A well-known delay cell [9] has been employed as a narrow-pulse filter in this design. Figure 5 shows the basic schematic of the filter. At the beginning of operation, the output of the filter is reset to “0” by and . The output changes its state when the voltage of the parasitic capacitor becomes smaller than the threshold voltage of the inverter. Therefore, if the discharge time , namely, the time required to discharge the parasitic capacitance from to , is larger than the pulse width of , the pulse is filtered. The advantage of this filter over conventional RC filters is that the filtered pulse width is programmable by changing a bias voltage . By this manner, the filter is programmed to filter only the narrowest pulse , which is related to the candidate signal , while other pulses are just delayed by filtering.

759761.fig.005
Figure 5: Narrow-pulse filter.

4. Experimental Results

4.1. Chip Fabrication

The proof-of-concept chip was designed and fabricated using a 0.18 μm standard CMOS technology. The chip includes eight inputs for demonstration. Time-domain signals are directly applied as input data. It means that ATCs shown in Figure 1 were not implemented in the test chip. For simplicity, the binary counter to count the number of clocks representing the digital value of the ranked input was not implemented either.

A photomicrograph of the test chip is shown in Figure 6 and specifications are summarized in Table 1. The core size is 0.006 mm2. The power dissipation is 132.3 μW and the accuracy is 9.5 ns, respectively. Assuming that the system has 8-bit resolution, it takes 256 clock cycles in each operation slot. As a result, the filtering latency is 2.432 μs.

tab1
Table 1: Specifications of the proof-of-concept chip.
759761.fig.006
Figure 6: Photomicrograph of the roof-of-concept chip.
4.2. Measurement Results and Discussion

In order to verify the operation of the prototype chip, an arbitrary pattern of 8 time-domain signals, as shown in Figure 7, was applied as input data. In this example, a rank value of 1002 corresponding to searching for the 5th smallest signal is applied to the rank-order setting circuit. Figure 8 shows the measurement results of the searching operation. The searched input (filtered input) is the input . A winner address code of was generated by the encoder. These waveforms are captured at the maximum time accuracy (i.e., time resolution) of 9.5 ns.

759761.fig.007
Figure 7: Pattern for measurement.
759761.fig.008
Figure 8: Measured waveforms. Waveforms of operation slot signal (SLOT), signal , LSB of the winner address, and output of the comparator (COUT).

Figure 9 shows the response of the comparator. The comparator has a response time of 3.8 ns at the bias voltage of 0.9 V. Reducing will increase the response time with the expense of more power dissipation. It can be seen that the time accuracy of the system is the minimum time between two successive delay-time signals in order that the system can distinguish them correctly. In this design, the time accuracy is at least twice as large as the response time of the comparator because of XOR function and filtering operation. If two successive signals violate the time accuracy, they both generate narrow pulses at the outputs of XORs, and these two pulses will be filtered. Consequently, the binary encoder may give a wrong decision. For the test chip, the time accuracy is achieved as small as 9.5 ns. As a matter of fact, the response time can be reduced by employing fast comparators but usually with the tradeoff of more power consumption. High-speed synchronous comparators such as in [10] can be implemented in the system since time-domain signals can be synchronized with the system clock. The time accuracy is not an important issue because it can be satisfied by changing the slope of the ramp voltage signal in the ATC. It mainly affects the latency time required for a given resolution.

759761.fig.009
Figure 9: Response of the comparator.

The performance of the test chip is summarized in Table 2 along with some ROF implementations from the literature. As can be seen from the table, the analog design in [5] gives the best performance in terms of compactness. It is also quite fast but the precision is not good. Digital implementation in [2] is very fast, but it occupies large area. The architecture in this study achieves small core size and low-power consumption. Although this architecture still suffers from some sources of errors such as the offset of the comparators, process variations,…, most of these error can be eliminated by increasing the time resolution of the system to a certain value, via changing the slope of the ramp voltage in the ATCs, so that the system can distinguishe successive time signals correctly. As can be seen, the tradeoff is a larger latency. The problem of glitches in [7], which probably occur at the outputs of XOR gates, is solved by using programmable narrow-pulse filters.

tab2
Table 2: Performance comparison.

The rank-order setting circuit can be removed in certain applications where the rank is fixed, making the architecture simpler, and thus saving chip area. In addition, chip real estate becomes smaller if such a high- MIM capacitance technology is available. The area required for capacitors in the floating-gate-MOS-based comparator, therefore, would be reduced significantly. In terms of computation accuracy, the proposed approach can preserve the precision of digital approaches which is difficult to achieve with pure analog implementations.

The narrow-pulse filter employing delay elements described in Section 3.4 can be replaced by a better version shown in Figure 10. The power-hungry current source caused by in Figure 5 is removed, thus reducing the total DC power consumption. As a result, an estimated power consumption as small as 77 μW is achieved.

759761.fig.0010
Figure 10: New proposed narrow-pulse filter.

Once the location of the desired input is identified, the ROF function can be implemented by either an additional counter, as shown in Figure 1, to receive the filtered value in a binary code or an additional multiplexer to select the filtered analog signal.

5. Conclusions

A low-power analog implementation of rank-order searching circuit for building ROFs and associative memories has been developed by using a time-domain computation scheme. The architecture can preserve the accuracy of digital implementations but achieves advantages of analog implementations in terms of low-power dissipation and small chip real estate. The architecture is also a promising solution when a large number of input data are required. This is because it does not require many additional circuits. The circuit operation has been verified by experimental results obtained from the fabricated proof-of-concept chip.

Acknowledgments

The authors would like to thank Mr. Liem T. Nguyen for his original ideas of the rank-order filter using time-domain digital computation technique presented in [7]. The VLSI chip has been fabricated in the fabrication program of VLSI Design and Education Center, The University of Tokyo in collaboration with Rohm Corporation and Toppan Printing Corporation.

References

  1. V. A. Pedroni, “Compact hamming-comparator-based rank order filter for digital VLSI and FPGA implementations,” in Proceedings of the 2004 International Symposium on Circuits and Systems (ISCAS '04), pp. II585–II588, Vancouver, Canada, May 2004. View at Scopus
  2. L. R. Dung and M. C. Lin, “A maskable memory architecture for rank-order filtering,” IEEE Transactions on Consumer Electronics, vol. 50, no. 2, pp. 558–564, 2004. View at Publisher · View at Google Scholar · View at Scopus
  3. H. Yamasaki and T. Shibata, “A high-speed median filter VLSI using floating-gate-MOS-based low-power majority voting circuits,” in Proceedings of the 31st European Solid-State Circuits Conference (ESSCIRC '05), pp. 125–128, Grenoble, France, September 2005. View at Publisher · View at Google Scholar · View at Scopus
  4. J. Ramírez-Angulo, C. Lackey, and A. Díaz-Sanchez, “Compact continuous-time analog rank-order filter implementation in CMOS technology,” in Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS '02), pp. V/65–V/68, Scottsdale, Ariz, USA, May 2002. View at Scopus
  5. J. Poikonen and A. Paasio, “A ranked order filter implementation for parallel analog processing,” IEEE Transactions on Circuits and Systems I, vol. 51, no. 5, pp. 974–987, 2004. View at Publisher · View at Google Scholar · View at Scopus
  6. R. G. Carvajal, J. Ramírez-Angulo, G. O. Ducoudray, and A. J. López-Martín, “High-speed high-precision CMOS analog rank order filter with O(n) complexity,” IEEE Journal of Solid-State Circuits, vol. 40, no. 6, pp. 1238–1248, 2005. View at Publisher · View at Google Scholar · View at Scopus
  7. L. T. Nguyen, K. Ito, and T. Shibata, “Compact and power-efficient implementation of rank-order filters using time-domain digital computation technique,” Japanese Journal of Applied Physics, vol. 47, no. 4, pp. 2807–2811, 2008. View at Publisher · View at Google Scholar · View at Scopus
  8. T. Shibata and T. Ohmi, “A functional MOS transistor featuring gate-level weighted sum and threshold operations,” IEEE Transactions on Electron Devices, vol. 39, no. 3, pp. 1444–1455, 1992. View at Publisher · View at Google Scholar
  9. D. K. Jeong, G. Borriello, D. A. Hodges, and R. H. Katz, “Design of PLL-based clock generation circuits,” IEEE Journal of Solid-State Circuits, vol. 22, no. 2, pp. 255–261, 1987. View at Scopus
  10. S. Park, Y. Palaskas, and M. P. Flynn, “A 4-GS/s 4-bit flash ADC in 0.18 μn CMOS,” IEEE Journal of Solid-State Circuits, vol. 42, no. 9, pp. 1865–1872, 2007. View at Publisher · View at Google Scholar · View at Scopus