Skip to main content

Circuit Realization of the Sorting Problem

  • Chapter
Discrete Analysis and Operations Research

Part of the book series: Mathematics and Its Applications ((MAIA,volume 355))

Abstract

An approach to solving the sorting problem is proposed based on minimizing a parameter related to real time calculation. In [2], the author used this approach to solve the problem of finding the largest number of a given array. A logical circuit over basis {&,V,} is constructed which arranges m given numbers in descending order. The circuit depth does not exceed log2 n + 6,12log2 m asymptotically, where n is the length of binary representation of each of the given numbers.

This research was partially supported by the Russian Foundation for Fundamental Research (Grant 93–01–16009).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. R. E. Blahut (1985) Fast Algorithms for Digital Signal Processing, Addison-Wesley Publishing Co., Reading, Mass.

    MATH  Google Scholar 

  2. È. Sh. Kospanov (1992) Schema realization of the search for an extremum in a number file (in Russian), Metody Diskret Analiz. 52, 59–65.

    MathSciNet  MATH  Google Scholar 

  3. S. V. Yablonskiĭ (1974) Introduction to the theory of functions of k-valued logic, in: Discrete Mathematics and Mathematical Questions of Cybernetics (in Russian), Nauka, Moscow, pp. 9–66.

    Google Scholar 

  4. O. B. Lupanov (1963) On the synthesis of certain classes of control systems (in Russian), in: Problemy Kibernet. Vol. 10, Nauka, Moscow, pp. 63–97.

    Google Scholar 

  5. V. M. Khrapchenko (1967) On a asymptotical estimate of addition time of parallel summator (in Russian), in: Problemy Kibernet Vol. 19, Nauka, Moscow, pp. 221–227.

    Google Scholar 

  6. V. M. Khrapchenko (1978) Some estimates for multiplication time (in Russian), in: Problemy Kibernet Vol. 33, Nauka, Moscow, pp. 221–227.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Kluwer Academic Publishers

About this chapter

Cite this chapter

Kospanov, È.S. (1996). Circuit Realization of the Sorting Problem. In: Korshunov, A.D. (eds) Discrete Analysis and Operations Research. Mathematics and Its Applications, vol 355. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-1606-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-1606-7_8

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-010-7217-5

  • Online ISBN: 978-94-009-1606-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics