RevLib is an online resource for benchmarks within the domain of reversible and quantum circuit design
Universität Bremen References Cite RevLib Acknowledgements About RevLib
Bubblesort circuit (bubblesort)

A circuit sorting an array of 4 unsigned integers using the bubblesort algorithm with a fixed (maximal) number of iterations.

Download: bubblesort_240.src

Circuit Realizations:

Lib. lines gates costs File Pic. Ref. Notes
MCT+MCF 318 2903 29327 Download realization No picture available WSSD:2013 Initial approach (Sect. IV); if-stm. w/o additional lines; 16 bit
MCT+MCF 622 5795 58739 Download realization No picture available WSSD:2013 Initial approach (Sect. IV); if-stm. w/o additional lines; 32 bit
MCT+MCF 812 3885 21149 Download realization No picture available WSSD:2013 Initial approach (Sect. IV); if-stm. w/ additional lines; 16 bit
MCT+MCF 1596 7737 42281 Download realization No picture available WSSD:2013 Initial approach (Sect. IV); if-stm. w/ additional lines; 32 bit
MCT+MCF 217 3342 34374 Download realization No picture available WSSD:2013 Line-aware scheme (Sect. V); 16 bit
MCT+MCF 425 6606 68766 Download realization No picture available WSSD:2013 Line-aware scheme (Sect. V); 32 bit
MCT+MCF 319 3047 11615 Download realization No picture available WSSD:2013 Cost-aware scheme (Sect. VI) if-stm. w/o additional lines; 16 bit
MCT+MCF 623 5939 21827 Download realization No picture available WSSD:2013 Cost-aware scheme (Sect. VI) if-stm. w/o additional lines; 32 bit
MCT+MCF 813 4029 12653 Download realization No picture available WSSD:2013 Cost-aware scheme (Sect. VI) if-stm. w/ additional lines; 16 bit
MCT+MCF 1597 7881 24569 Download realization No picture available WSSD:2013 Cost-aware scheme (Sect. VI) if-stm. w/ additional lines; 32 bit
MCT+MCF 218 3534 13830 Download realization No picture available WSSD:2013 Cost- & Line-aware scheme; 16 bit
MCT+MCF 426 6798 25950 Download realization No picture available WSSD:2013 Cost- & Line-aware scheme; 32 bit
 
legend

 back