Home / Intermediate


Sorting – Pipelined Even-Odd

One of my thoughts was to use an even-odd approach. This is typically done when using GPUs in a sequential fashion. I decided to do this pipelined. This approach turned out to be extremely inefficient in retrospect. In a future post, I’ll do a state machine based approach which will …

Read More »

Sorting – Completely parallel approach

The first approach I attempted was a completely parallel approach as shown in the diagram below: The advantage to this approach, if it meets timing, is that it will produce a result every clock cycle, it’s compact, easy to understand, and uses a reasonable amount of logic. compare.sv 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197module compare …

Read More »

Sorting – Design definition

I had Been trying to come up with a good problem to illustrate design trade offs when I came across this: Design a module that can sort four numbers. I’ve only done a few sorts in BASIC ages ago and more recently in OpenCL. Off the top of my head, …

Read More »