Scalable binary sorting architecture based on rank ordering with linear area-time complexity

A new modular architecture is presented for the realization of high-speed binary sorting engines, based on efficient rank ordering. Capacitive Threshold Logic (CTL) gates are utilized for the implementation of the multi-input programmable majority (voting) functions required in the architecture. The...

Full description

Saved in:
Bibliographic Details
Main Authors: Hatirnaz, I., Leblebici, Y.
Format: Conference Proceeding
Language:English
Subjects:
Clocks
Computer architecture
Computer science
Engines
Filters
Hardware
Logic gates
Sorting
Vectors
Voting
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 373
container_issue
container_start_page 369
container_title
container_volume
creator Hatirnaz, I.
Leblebici, Y.
description A new modular architecture is presented for the realization of high-speed binary sorting engines, based on efficient rank ordering. Capacitive Threshold Logic (CTL) gates are utilized for the implementation of the multi-input programmable majority (voting) functions required in the architecture. The overall complexity of the proposed bit-serial architecture increases linearly with the number of input vectors to be sorted (window size=m) and with the bit-length of the input vectors (word size=n), and the sorter architecture can be easily expanded to accommodate large vector sets. It is demonstrated that the proposed sorting engine is capable of producing a fully sorted output vector set in (m+n-1) clock cycles, i.e., in linear time.
doi_str_mv 10.1109/ASIC.2000.880766
format conference_proceeding
fullrecord <record><control><sourceid>proquest_6IE</sourceid><recordid>TN_cdi_ieee_primary_880766</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>880766</ieee_id><sourcerecordid>27706101</sourcerecordid><originalsourceid>FETCH-LOGICAL-i245t-5a46f3445dcc55f8c735ba0ae1f9a99fd21a5d681896baa6b183b46c493067c93</originalsourceid><addsrcrecordid>eNot0L1PwzAQBXBLgEQp3RGTJ7aUc2I79lhVfEmVGAobUnRxLtSQJsV2Bf3vCSrTDe-nJ71j7ErAXAiwt4v103KeA8DcGCi1PmEXUBootLJGnrKJAF1kYI05Z7MYP0YIUikBasLe1g47rDvite8xHHgcQvL9O8fgNj6RS_swZhip4UPPA_affAgNhT_z7dOGd74nDKMnzJLfEnfDdtfRj0-HS3bWYhdp9n-n7PX-7mX5mK2eH56Wi1Xmc6lSplDqtpBSNc4p1RpXFqpGQBKtRWvbJheoGm2EsbpG1LUwRS21k7YAXTpbTNnNsXcXhq89xVRtfXTUddjTsI9VXpagBYgRXh-hJ6JqF_x2nFwdn1b8AnJfYVU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype><pqid>27706101</pqid></control><display><type>conference_proceeding</type><title>Scalable binary sorting architecture based on rank ordering with linear area-time complexity</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Hatirnaz, I. ; Leblebici, Y.</creator><creatorcontrib>Hatirnaz, I. ; Leblebici, Y.</creatorcontrib><description>A new modular architecture is presented for the realization of high-speed binary sorting engines, based on efficient rank ordering. Capacitive Threshold Logic (CTL) gates are utilized for the implementation of the multi-input programmable majority (voting) functions required in the architecture. The overall complexity of the proposed bit-serial architecture increases linearly with the number of input vectors to be sorted (window size=m) and with the bit-length of the input vectors (word size=n), and the sorter architecture can be easily expanded to accommodate large vector sets. It is demonstrated that the proposed sorting engine is capable of producing a fully sorted output vector set in (m+n-1) clock cycles, i.e., in linear time.</description><identifier>ISSN: 1063-0988</identifier><identifier>ISBN: 0780365984</identifier><identifier>ISBN: 9780780365988</identifier><identifier>DOI: 10.1109/ASIC.2000.880766</identifier><language>eng</language><publisher>IEEE</publisher><subject>Clocks ; Computer architecture ; Computer science ; Engines ; Filters ; Hardware ; Logic gates ; Sorting ; Vectors ; Voting</subject><ispartof>Proceedings - IEEE International ASIC Conference and Exhibit, 2000, p.369-373</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/880766$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,314,776,780,785,786,2052,4036,4037,27898,27899,54892</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/880766$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Hatirnaz, I.</creatorcontrib><creatorcontrib>Leblebici, Y.</creatorcontrib><title>Scalable binary sorting architecture based on rank ordering with linear area-time complexity</title><title>Proceedings - IEEE International ASIC Conference and Exhibit</title><addtitle>ASIC</addtitle><description>A new modular architecture is presented for the realization of high-speed binary sorting engines, based on efficient rank ordering. Capacitive Threshold Logic (CTL) gates are utilized for the implementation of the multi-input programmable majority (voting) functions required in the architecture. The overall complexity of the proposed bit-serial architecture increases linearly with the number of input vectors to be sorted (window size=m) and with the bit-length of the input vectors (word size=n), and the sorter architecture can be easily expanded to accommodate large vector sets. It is demonstrated that the proposed sorting engine is capable of producing a fully sorted output vector set in (m+n-1) clock cycles, i.e., in linear time.</description><subject>Clocks</subject><subject>Computer architecture</subject><subject>Computer science</subject><subject>Engines</subject><subject>Filters</subject><subject>Hardware</subject><subject>Logic gates</subject><subject>Sorting</subject><subject>Vectors</subject><subject>Voting</subject><issn>1063-0988</issn><isbn>0780365984</isbn><isbn>9780780365988</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2000</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNot0L1PwzAQBXBLgEQp3RGTJ7aUc2I79lhVfEmVGAobUnRxLtSQJsV2Bf3vCSrTDe-nJ71j7ErAXAiwt4v103KeA8DcGCi1PmEXUBootLJGnrKJAF1kYI05Z7MYP0YIUikBasLe1g47rDvite8xHHgcQvL9O8fgNj6RS_swZhip4UPPA_affAgNhT_z7dOGd74nDKMnzJLfEnfDdtfRj0-HS3bWYhdp9n-n7PX-7mX5mK2eH56Wi1Xmc6lSplDqtpBSNc4p1RpXFqpGQBKtRWvbJheoGm2EsbpG1LUwRS21k7YAXTpbTNnNsXcXhq89xVRtfXTUddjTsI9VXpagBYgRXh-hJ6JqF_x2nFwdn1b8AnJfYVU</recordid><startdate>2000</startdate><enddate>2000</enddate><creator>Hatirnaz, I.</creator><creator>Leblebici, Y.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>2000</creationdate><title>Scalable binary sorting architecture based on rank ordering with linear area-time complexity</title><author>Hatirnaz, I. ; Leblebici, Y.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i245t-5a46f3445dcc55f8c735ba0ae1f9a99fd21a5d681896baa6b183b46c493067c93</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Clocks</topic><topic>Computer architecture</topic><topic>Computer science</topic><topic>Engines</topic><topic>Filters</topic><topic>Hardware</topic><topic>Logic gates</topic><topic>Sorting</topic><topic>Vectors</topic><topic>Voting</topic><toplevel>online_resources</toplevel><creatorcontrib>Hatirnaz, I.</creatorcontrib><creatorcontrib>Leblebici, Y.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library Online</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hatirnaz, I.</au><au>Leblebici, Y.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Scalable binary sorting architecture based on rank ordering with linear area-time complexity</atitle><btitle>Proceedings - IEEE International ASIC Conference and Exhibit</btitle><stitle>ASIC</stitle><date>2000</date><risdate>2000</risdate><spage>369</spage><epage>373</epage><pages>369-373</pages><issn>1063-0988</issn><isbn>0780365984</isbn><isbn>9780780365988</isbn><abstract>A new modular architecture is presented for the realization of high-speed binary sorting engines, based on efficient rank ordering. Capacitive Threshold Logic (CTL) gates are utilized for the implementation of the multi-input programmable majority (voting) functions required in the architecture. The overall complexity of the proposed bit-serial architecture increases linearly with the number of input vectors to be sorted (window size=m) and with the bit-length of the input vectors (word size=n), and the sorter architecture can be easily expanded to accommodate large vector sets. It is demonstrated that the proposed sorting engine is capable of producing a fully sorted output vector set in (m+n-1) clock cycles, i.e., in linear time.</abstract><pub>IEEE</pub><doi>10.1109/ASIC.2000.880766</doi><tpages>5</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1063-0988
ispartof Proceedings - IEEE International ASIC Conference and Exhibit, 2000, p.369-373
issn 1063-0988
language eng
recordid cdi_ieee_primary_880766
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Clocks
Computer architecture
Computer science
Engines
Filters
Hardware
Logic gates
Sorting
Vectors
Voting
title Scalable binary sorting architecture based on rank ordering with linear area-time complexity
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-03-04T23%3A47%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Scalable%20binary%20sorting%20architecture%20based%20on%20rank%20ordering%20with%20linear%20area-time%20complexity&rft.btitle=Proceedings%20-%20IEEE%20International%20ASIC%20Conference%20and%20Exhibit&rft.au=Hatirnaz,%20I.&rft.date=2000&rft.spage=369&rft.epage=373&rft.pages=369-373&rft.issn=1063-0988&rft.isbn=0780365984&rft.isbn_list=9780780365988&rft_id=info:doi/10.1109/ASIC.2000.880766&rft_dat=%3Cproquest_6IE%3E27706101%3C/proquest_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i245t-5a46f3445dcc55f8c735ba0ae1f9a99fd21a5d681896baa6b183b46c493067c93%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=27706101&rft_id=info:pmid/&rft_ieee_id=880766&rfr_iscdi=true