1999
DOI: 10.1109/82.749038
|View full text |Cite
|
Sign up to set email alerts
|

A CMOS K-winners-take-all circuit with O(n) complexity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
11
0

Year Published

2006
2006
2018
2018

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 37 publications
(12 citation statements)
references
References 4 publications
1
11
0
Order By: Relevance
“…Not only digital kWTA circuits but also most of analog kWTA circuits [11][12][13] have O(N) time complexity. Although it has been considered that the analog kWTA implementation is faster than its digital counterparts, the proposed kWTA architecture is much faster than its analog counterparts.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Not only digital kWTA circuits but also most of analog kWTA circuits [11][12][13] have O(N) time complexity. Although it has been considered that the analog kWTA implementation is faster than its digital counterparts, the proposed kWTA architecture is much faster than its analog counterparts.…”
Section: Methodsmentioning
confidence: 99%
“…While many analog kWTA circuits [11][12][13] have been designed, digital kWTA circuits have been relatively less researched than their analog counterparts. The analog kWTA implementation requires less hardware than the digital implementation, and can find k-winners by comparing all inputs simultaneously.…”
Section: Introductionmentioning
confidence: 99%
“…Various CMOS analog WTA (or losertakes-all, LTA) circuits with voltage inputs were proposed for various specifications such as various speed, precision, and supply voltage [21][22][23][24][25][26][27]. CMOS k-WTA circuits were introduced by Sekerkiran in 1999 [24] and Hung in 2002 [26]. In [25], Hung and Liu proposed a high-stable WTA/LTA circuit which operation is independent of process variation.…”
Section: Introductionmentioning
confidence: 99%
“…A scalable current-mode WTAs realized in BJT and CMOS circuits for large-scale applications were proposed by Smedley [19,20]. Various CMOS analog WTA (or losertakes-all, LTA) circuits with voltage inputs were proposed for various specifications such as various speed, precision, and supply voltage [21][22][23][24][25][26][27]. CMOS k-WTA circuits were introduced by Sekerkiran in 1999 [24] and Hung in 2002 [26].…”
Section: Introductionmentioning
confidence: 99%
“…Secondly, there are also several signal processing systems depending on the application. For instance, signal processing such as K-winners-take-all, are suitable for 3D vision systems [53][54][55][56][57][58] and subpixel accuracy [59][60][61][62][63][64][65]. Smoothing [66], motion detection [67][68][69], programmable amplification, multiresolution imaging [70], video compression [71], dynamic range enhancement, discrete cosine transform (DCT), intensity sorting, etc.…”
Section: Analog Signal Processingmentioning
confidence: 99%