Using Lava to design and verify recursive and periodic sorters

@article{Claessen2003UsingLT,
  title={Using Lava to design and verify recursive and periodic sorters},
  author={Koen Claessen and Mary Sheeran and Satnam Singh},
  journal={International Journal on Software Tools for Technology Transfer},
  year={2003},
  volume={4},
  pages={349-358}
}
The Lava system is an experimental framework for designing, verifying, and implementing circuits using powerful concepts borrowed from the world of lazy functional programming. We show how the Lava system is used to design and analyse fast sorting circuits for implementation on Field Programmable Gate Arrays (FPGAs). Two types of sorting networks are described, analyzed, and implemented. We present recursive sorting networks and periodic sorting networks based on Batcher’s bitonic merger and on… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

VIS: A System for Verification and Synthesis

View 6 Excerpts
Highly Influenced

A tutorial on Lava: a hardware description and verification system

K. Claessen, M. Sheeran
Available at: http://www. cs.chalmers.se/~koen/Lava, • 2000
View 6 Excerpts
Highly Influenced

A sequential sorting network analagous to the Batcher merge

E. R. Canfield, S. G. Williamson
Linear Multilinear Algebra • 1991
View 6 Excerpts
Highly Influenced

Collecting butterflies

G. Jones, M. Sheeran
Oxford University Programming Research Group Technical Monograph PRG-91, • 1991
View 7 Excerpts
Highly Influenced

Sorting Networks and Their Applications

AFIPS Spring Joint Computing Conference • 1968
View 6 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…