-
Notifications
You must be signed in to change notification settings - Fork 6
/
cores.html
10804 lines (10804 loc) · 843 KB
/
cores.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
---
layout: default
---
<div class="ip_cores">
<form action="#">
<fieldset>
<input type="text" name="search" value="" id="id_search" placeholder=" 859 free VHDL/Verilog IP cores at your fingertips..." autofocus />
</fieldset>
</form>
<table id="table_example">
<thead>
<tr>
<th width="30%">Project Name</th>
<th width="5%">Repository</th>
<th width="8%">Last Update</th>
<th width="8%">Language</th>
<th width="5%">Dev. Status</th>
<th width="5%">License</th>
</tr>
</thead>
<tbody>
<tr>
<td>
<b>ARITHMETIC CORE</b>
</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core ant: NoLicense: LGPLDescriptionAudio Codec(ADPCM 1-Bit)The code is ready for Altera Cyclone-II DE1 Starter board and it is tested, you can modify codes and use them in any project.Core Description:Sampling Frequency: 44100HzChannels: StereoBit-rate: 1 Bit Per Sample(So it is: 44.1 * 2 = 88.2kbps)Compression Ratio: 16:1VHDL code consists:1-bit ADPCM Decoder(x2), I2S Driver(x1), I2C Driver(x1), Flash Memory Driver(x1), Keyboard Driver(x1), LED Bar(x1), Volume and Config Engine(x1).Codec(Encoder/Decoder) is available in Win32 application that you can use it to encode PCM RAW wave files, then burn</div>
<a href='cores/arithmetic_core/1_bit_adpcm_codec/index.html'>1 bit adpcm codec</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_1_bit_adpcm_codec'>code</a>
</td>
<td>May 22, 2011</td>
<td>VHDL</td>
<td>Stable</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core lphaAdditional info:FPGA provenWishBone Compliant: NoLicense: LGPLDescriptionRTL Verilog code to perform Two Dimensional Fast Hartley Transform (2D-FHT) for 8x8 points.Presented algorithm is FHT with decimation in frequency domain.Main FeaturesHigh Clock SpeedLow Latency(97 clock cycles)Low Slice CountSingle Clock Cycle per sample operationFully synchronous core with positive edge triggeringFlexible core control with regard to input data widthDiscrete Hartley Transform is used in a wide variety of signal processing applications such as filtering, convolution, correlation, compression and so on</div>
<a href='cores/arithmetic_core/2d_fht/index.html'>2d fht</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_2d_fht'>code</a>
</td>
<td>Jul 25, 2011</td>
<td>Verilog</td>
<td>Alpha</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core Design done,Specification doneWishBone Compliant: NoLicense: GPLDescriptionA 32-bit parallel and highly pipelined Cyclic Redundancy Code (CRC) generator is presented. The design can handle 5 different channels at an input rate of 2Gbps each (the total output throughput is 5x4Gbps.)The generated CRCs are compatible with the 32-bit Ethernet standards. The circuit has been implemented with standard cells in a 0.35Micron standard CMOS process using the properties of Galois Fields and has been conceived as a "free" IP.Features- 5 independent channels @ 4Gbps each- Works (simulations) with a standar</div>
<a href='cores/arithmetic_core/5x4gbps_crc_generator_designed_with_standard_cells/index.html'>5x4gbps crc generator designed with standard cells</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_5x4gbps_crc_generator_designed_with_standard_cells'>code</a>
</td>
<td>Aug 8, 2013</td>
<td>VHDL</td>
<td>Stable</td>
<td>GPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core ment status:PlanningAdditional info:WishBone Compliant: NoLicense: LGPL</div>
<a href='cores/arithmetic_core/8-bit_piepelined_processor/index.html'>8-bit piepelined processor</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_8-bit_piepelined_processor'>code</a>
</td>
<td>Mar 30, 2015</td>
<td>C/C++</td>
<td>Planning</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core n done,FPGA provenWishBone Compliant: NoLicense: GPLDescriptionThis is 8-bit microprocessor with 5 instructions. It is based on 8080 architecture. This architecture called SAP for Simple-As-Possible computer. It very useful design which introduces most of the basic and fundamental ideas behind computer operation.This design could be used for instruction classes for undergraduate classes or specific VHDL classes. This processor is based on the 8080 architecture, therefore, it could be upgraded step by step to integrate further facilities. It is very exciting challenge for the students to do so.</div>
<a href='cores/arithmetic_core/8-bit_up/index.html'>8-bit up</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_8-bit_up'>code</a>
</td>
<td>Apr 11, 2012</td>
<td>VHDL</td>
<td>Stable</td>
<td>GPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core done,FPGA proven,Specification doneWishBone Compliant: NoLicense: LGPLDescriptionThis is crypto core with AMBA support APB based on datasheet fomAES_SPECIf you liked our work is want to help contribute to the future progress of others who have seen help us by donating.GITHUB : git clone https://github.com/red0bear/AES128GLADIC is a group of people working with integrated circuits in Latin America that have done some work with integrated circuits or participated in training in the part of the digital flow. We hope that our IPs are also vital in any way the proposal for those who want to use i</div>
<a href='cores/arithmetic_core/aes128/index.html'>aes128</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_aes128'>code</a>
</td>
<td>Mar 9, 2015</td>
<td>Verilog</td>
<td>Stable</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core n doneWishBone Compliant: NoLicense: LGPLDescriptionA fast (single-cycle) base-2 antilog function.Need an electronic design solution? Visithttp://www.cantares.on.ca/Doesn't run quite as fast as my Log code: 166MHz, vs. 250MHz for the log. Registering the input would bring that up. Takes about the same resources as the log.To do a single-cycle square-root, first take the log. Then, divide that result by 2 (shift), and take the antilog. Tada...If you use this, please write and tell me about it!</div>
<a href='cores/arithmetic_core/anti-logarithm_square-root_base-2_single-cycle/index.html'>anti-logarithm square-root base-2 single-cycle</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_anti-logarithm_square-root_base-2_single-cycle'>code</a>
</td>
<td>Jan 28, 2011</td>
<td>Verilog</td>
<td>Stable</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core mpliant: NoLicense:DescriptionThese cores provide a simple means of converting between binary and BCD in hardware. Written in Verilog, with parameters for the input and output widths, these simple cores illustrate the use of functions in Verilog for performing operations that are not easy to do any other way in a fully parameterized (scalable) block of logic.There are two conversions: binary_to_bcd and bcd_to_binary. These operate serially, requiring one clock per binary bit used in the conversion.The method used for the conversion from base 2 to base 10 is what I call a "binary coded decim</div>
<a href='cores/arithmetic_core/binary_to_bcd_conversions_with_led_display_driver/index.html'>binary to bcd conversions with led display driver</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_binary_to_bcd_conversions_with_led_display_driver'>code</a>
</td>
<td>Dec 23, 2009</td>
<td>Unknow</td>
<td>Stable</td>
<td>Unknown</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core info:WishBone Compliant: NoLicense: LGPLDescriptionThis project implements a parameterized Reed Solomon decoder for use in OFDM wireless systems.FeaturesDecodes full length (n = 255, t = 16) and shortened Reed Solomon encoded data blocks.Status- Complete version submitted</div>
<a href='cores/arithmetic_core/bluespec_systemverilog_reed_solomon_decoder/index.html'>bluespec systemverilog reed solomon decoder</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_bluespec_systemverilog_reed_solomon_decoder'>code</a>
</td>
<td>Dec 20, 2009</td>
<td>Bluespe</td>
<td>Planning</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core Compliant: NoLicense: LGPL</div>
<a href='cores/arithmetic_core/btc-fpga-miner-open_source_fpga_bitcoin_miner/index.html'>btc-fpga-miner-open source fpga bitcoin miner</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_btc-fpga-miner-open_source_fpga_bitcoin_miner'>code</a>
</td>
<td>May 15, 2014</td>
<td>VHDL</td>
<td>Alpha</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core hBone Compliant: NoLicense: LGPLDescriptionThis IP implements the CAVLC parsing process in ITU-T H.264 (05/2003)Features- Compatible with ITU-T H.264 (05/2003), but it do not calculate nC and store TotalCoeff,you need to add a nC_decoder outside this core.- New structure for run_before decoder, the core doesn't save Runs in flip-flops anddoesn't need the run_combine process, this feature reduces both cycle and resource.- this core has a simple interface- 9 cycles per cavlc block on average(including P frames)- Fully synchronous design, Fully synthesisableStatusDocumentationSynthesis resultsPus</div>
<a href='cores/arithmetic_core/cavlc_decoder/index.html'>cavlc decoder</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_cavlc_decoder'>code</a>
</td>
<td>Nov 20, 2012</td>
<td>Verilog</td>
<td>Beta</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core e,FPGA proven,Specification doneWishBone Compliant: NoLicense: BSDIntroductionA cellular automata (CA) is a discrete model that consists of a grid (1D, 2D, 3D ) with objects called cells. Each cell can be in one of a given set of states (on and off, different colours etc). Each cell has a set of cells in close proximity (neighbours). Given the current internal state of a cell, the states of the neighbour cells and a given set of update rules the next state of a cell can be determined.The ca_prng IP-core implements a 1D binary cellular automata with wrap around at the edges (i.e. a ring). The d</div>
<a href='cores/arithmetic_core/cellular_automata_prng/index.html'>cellular automata prng</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_cellular_automata_prng'>code</a>
</td>
<td>Dec 20, 2009</td>
<td>Verilog</td>
<td>Stable</td>
<td>BSD</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core ant: NoLicense:DescriptionCores are generated fromConfluence; a modern logic design language. Confluence is a simple, yet highly expressive language that compiles into Verilog, VHDL, and C. Seewww.confluent.orgfor more info.Cordics (COordinate Rotation DIgital Computers) perform arbitrary phase rotations of complex vectors and are often used to calculate trigonometric functions and vector magnitudes.FeaturesEach file is stand-alone and represents a specific configuration.The 4 parameters are:- Rotation or Vector Mode- Vector Precision- Angle Precision- Number of Cordic StagesAll designs </div>
<a href='cores/arithmetic_core/cf_cordic/index.html'>cf cordic</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_cf_cordic'>code</a>
</td>
<td>Dec 20, 2009</td>
<td>Unknow</td>
<td>Stable</td>
<td>Unknown</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core : NoLicense:DescriptionCores are generated fromConfluence; a modern logic design language. Confluence is a simple, yet highly expressive language that compiles into Verilog, VHDL, and C. SeeConfluentfor more info.The Fast Fourier Transform converts time or spacial information into the frequency domain and is one of the most popular DSP algorithms.FeaturesThe FFT architecture is pipelined on a rank basis; each rank hasits own butterfly and ranks are isolated from each other usingmemory interleavers. This FFT can perform calculations oncontinuous streaming data (one data set right after a</div>
<a href='cores/arithmetic_core/cf_fft/index.html'>cf fft</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_cf_fft'>code</a>
</td>
<td>May 18, 2012</td>
<td>Unknow</td>
<td>Stable</td>
<td>Unknown</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core ant: NoLicense:DescriptionCores are generated fromConfluence; a modern logic design language. Confluence is a simple, yet highly expressive language that compiles into Verilog, VHDL, and C. SeeConfluentfor more info.FeaturesThe floating point representation follows the IEEE-754 bit format:{SignBit, Exponent, Mantissa}Each file is stand-alone and represents a specific configuration.The 3 configuration parameters are:- Combinatorial or Pipelined ('c' or 'p')- Exponent Precision- Mantissa PrecisionNote the total width = 1 + Exponent Precision + Mantissa Precision.For pipeline configurations, pi</div>
<a href='cores/arithmetic_core/cf_floating_point_multiplier/index.html'>cf floating point multiplier</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_cf_floating_point_multiplier'>code</a>
</td>
<td>Dec 20, 2009</td>
<td>Unknow</td>
<td>Stable</td>
<td>Unknown</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core pecification doneWishBone Compliant: NoLicense: LGPLDefinitionA Complex arithmetic library for arithmetic operations is needed in many signal processing applications. This project will present a complex operations library for SystemC based designs. Some of the operations like multiplication, division and square root are based on Cordic algorithms in order to reduce the resources needed for implementation. Eventhough the library is based on the complex library of the Agility Compiler Software but nearly all of the operations were modified and improved. The operations included within this projec</div>
<a href='cores/arithmetic_core/complex_arithmetic_operations/index.html'>complex arithmetic operations</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_complex_arithmetic_operations'>code</a>
</td>
<td>Dec 20, 2009</td>
<td>SystemC</td>
<td>Alpha</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core atus:PlanningAdditional info:WishBone Compliant: NoLicense: LGPLDescriptionGaussian Pseudo-random Number Generator is a fix-point entity implemented with VHDL, used for generating complex Gaussian pseudo-random numbers. The generator can be further divided into two stages. The first stage is a uniform pseudo-random number generator called Mersenne Twister, and the second is a conversion stage. Mersenne Twister provides uniform pseudo-random number sequence with an astronomical period of 2^19937-1 up to 32-bit accuracy, using only 624 words working area [1]. A conversion model was built upon Me</div>
<a href='cores/arithmetic_core/complex_gaussian_pseudo-random_number_generator/index.html'>complex gaussian pseudo-random number generator</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_complex_gaussian_pseudo-random_number_generator'>code</a>
</td>
<td>Dec 21, 2011</td>
<td>VHDL</td>
<td>Planning</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core mpliant: NoLicense: LGPLDescriptionPlease write a description of the project here. It is used as a MetaTag (search engines looks at this).</div>
<a href='cores/arithmetic_core/complex_operations_ise_for_nios_ii/index.html'>complex operations ise for nios ii</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_complex_operations_ise_for_nios_ii'>code</a>
</td>
<td>Sep 14, 2010</td>
<td>VHDL</td>
<td>Alpha</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core gn done,FPGA provenWishBone Compliant: NoLicense:DescriptionA 100% behavioral implementation of a cordic core. The core is highly configurable through `defines. A testbench is included. See the included manual for details. Source and user manual availablehereStatus- Tested in hardware</div>
<a href='cores/arithmetic_core/configurable_cordic_core_in_verilog/index.html'>configurable cordic core in verilog</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_configurable_cordic_core_in_verilog'>code</a>
</td>
<td>Aug 12, 2011</td>
<td>Verilog</td>
<td>Unknow</td>
<td>Unknown</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core fo:WishBone Compliant: NoLicense: LGPLdownload</div>
<a href='cores/arithmetic_core/configurable_crc_core/index.html'>configurable crc core</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_configurable_crc_core'>code</a>
</td>
<td>Sep 9, 2010</td>
<td>Verilog</td>
<td>Alpha</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core ign done,FPGA provenWishBone Compliant: NoLicense: LGPLDescriptionThis is a behavioral module for parallel scrambler/descrambler.There are RTL scrambler modules available, the purpose of this project is to built a code that is easier to understand and more flexible for reconfiguration. The code is synthesize-able, and should not cost more than RTL modules.</div>
<a href='cores/arithmetic_core/configurable_parallel_scrambler/index.html'>configurable parallel scrambler</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_configurable_parallel_scrambler'>code</a>
</td>
<td>Jul 31, 2014</td>
<td>VHDL</td>
<td>Alpha</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core GA provenWishBone Compliant: NoLicense: GPLDescriptionThe CORDIC algorithm is an iterative algorithm to evaluate many mathematical functions, such as trigonometrically functions, hyperbolic functions and planar rotations.Core DescriptionAs the name suggests the CORDIC algorithm was developed for rotating coordinates, a piece of hardware for doing real-time navigational computations in the 1950's. The CORDIC uses a sequence like successive approximation to reach its results. The nice part is it does this by adding/subtracting and shifting only.Suppose we want to rotate a point(X,Y) by an an</div>
<a href='cores/arithmetic_core/cordic_core/index.html'>cordic core</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_cordic_core'>code</a>
</td>
<td>Jan 8, 2013</td>
<td>VHDL</td>
<td>Stable</td>
<td>GPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core pliant: NoLicense: LGPLDescriptionPlease write a description of the project here. It is used as a MetaTag (search engines looks at this).</div>
<a href='cores/arithmetic_core/crcahb/index.html'>crcahb</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_crcahb'>code</a>
</td>
<td>Mar 6, 2015</td>
<td>Verilog</td>
<td>Alpha</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core pliant: NoLicense: LGPLDescriptionThis core is a low latency divider that works by caching reciprocal values, then using a multiply to perform the divide rather than the usual divide operation. On first encountering a divide operation the reciprocal of the divisor is calculated, this takes the same amount of time as a normal divide. The next time the same divide is encountered the pre-calculated reciprocal is used. Reciprocals are stored in a small cache similar to a processor data cache.a/b is the same as a * 1/bIn many cases the divisor 'b' remains the same within a loop. 1/b can be calculat</div>
<a href='cores/arithmetic_core/cr_div-cached_reciprocal_divider/index.html'>cr_div-cached reciprocal divider</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_cr_div-cached_reciprocal_divider'>code</a>
</td>
<td>Feb 12, 2013</td>
<td>Verilog</td>
<td>Alpha</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core icense:DescriptionRecent advances in communications and networking technologies have made it possible that many applications use digital videos such as teleconferencing and multimedia communications. These applications require a very large bit-rate if being handled without compression. Most video compression standards such as HDTV, H.261, JPEG and MPEG use Discrete Cosine Transform (DCT) as a standard transform-coding scheme.Discrete Cosine Transform is decomposing the signal into weighted sums of cosine harmonics; unlike DCT, Discrete Fourier Transform decomposes the signal into weighted sums</div>
<a href='cores/arithmetic_core/dct-discrete_cosine_transformer/index.html'>dct-discrete cosine transformer</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_dct-discrete_cosine_transformer'>code</a>
</td>
<td>Jul 26, 2013</td>
<td>Unknow</td>
<td>Beta</td>
<td>Unknown</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core proven,Specification doneWishBone Compliant: NoLicense:DescriptionNEW: 12 bit input MDCT version created by Emrah Yuce has been added to project downloads.Parallel synthesizable implementation of 2D DCT in VHDL. Currently works on 8 bit input data using 12 bit DCT coefficients (12-bit DCT output). Multiplier-less design, parallel distributed arithmetic with butterfly computation used instead. Implementation done as row-column decomposition, two 1D DCT units and transpose matrix between them (double buffered as ping-pong buffer for performance). Latency (time between first 8 bit input data is </div>
<a href='cores/arithmetic_core/discrete_cosine_transform_core/index.html'>discrete cosine transform core</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_discrete_cosine_transform_core'>code</a>
</td>
<td>Mar 7, 2009</td>
<td>VHDL</td>
<td>Stable</td>
<td>Unknown</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core oneWishBone Compliant: NoLicense:Features- The unit is designed to be synchronous to one global clock. All registers are updated on the rising edge of the clock.- All registers can be reset with one global reset.- The multiply operation is broken up to take advantage of the 25 x 18 multiply blocks in the Virtex5 DSP48E slices. The 25 x 18 multiply twos complement block will perform a 24 x 17 unsigned multiply, so it takes 9 DSP48E slices to perform the 53 x 53 bit multiply required to multiply two double-precision floating point numbers.- fpu_double.v is the top-level module. The input sign</div>
<a href='cores/arithmetic_core/double_fpu_verilog/index.html'>double_fpu_verilog</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_double_fpu_verilog'>code</a>
</td>
<td>Dec 20, 2009</td>
<td>Verilog</td>
<td>Alpha</td>
<td>Unknown</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core nfo:WishBone Compliant: NoLicense: LGPLDescriptionIntroduction:From my thesis: Low-Density Parity Check (LDPC) coding is a form of error coding introduced by Gallager that can achieve performance close to the Shannon limit, exceeding the performance of Turbo codes. The coding scheme was introduced in the early 1960€™s, but has gained favor recently due to excellent performance and lack of patent rights. Several recent standards include optional or mandatory LDPC coding methods; among these is the second generation Digital Video Broadcasting standard for satellite applications (DVB</div>
<a href='cores/arithmetic_core/dvb-s2_ldpc_decoder/index.html'>dvb-s2 ldpc decoder</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_dvb-s2_ldpc_decoder'>code</a>
</td>
<td>Dec 3, 2010</td>
<td>Verilog</td>
<td>Planning</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core WishBone Compliant: NoLicense: GPLComments# ECPU 0.1.alpha# ==============## Background# ========# Resurrected university project originally written in VHDL.# Converted to Verilog by hand and fixed bugs.## Modifications made in verilog post-conversion:# - New barrel shifter# - Reviewed opcode list# - Enhanced testbench to allow for random stimulus (verilog only tb)# - Tested using Icarus## Currently checking for synthesis:# - Passes synthesis checks using "veriwell ... +synopsys"## Features# ========# * 15 working opcodes/functions :# cADD_AB# cINC_A# cINC_B# cSUB_AB# cCMP_</div>
<a href='cores/arithmetic_core/ecpu_alu/index.html'>ecpu_alu</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_ecpu_alu'>code</a>
</td>
<td>Dec 20, 2009</td>
<td>Verilog</td>
<td>Beta</td>
<td>GPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core GA proven,Specification doneWishBone Compliant: NoLicense: LGPLDescriptionThe Elliptic Curve Group core is for computing the addition of two elements in the elliptic curve group, and the addition of $c$ identical elements in the elliptic curve group.The elliptic curve is super-singular $E:y^2=x^3-x+1$ in affine coordinates defined over a Galois field $GF(3^m)$, $m=97$, whose irreducible polynomial is $x^97+x^12+2$.The elliptic curve group is the set of solutions $(x,y)$ over $GF(3^m)$ to the equation of $E$, together with an additional point at infinity, denoted $O$. An element in the elliptic</div>
<a href='cores/arithmetic_core/elliptic_curve_group/index.html'>elliptic curve group</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_elliptic_curve_group'>code</a>
</td>
<td>Apr 18, 2012</td>
<td>Verilog</td>
<td>Stable</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core bleAdditional info:Design done,FPGA proven,Specification doneWishBone Compliant: NoLicense: LGPLDescriptionThis project was started in order to create fixed point (Q format) arithmetic modules in verilog.What was created was a parameterized (specify size (N) and number of fractional bits (Q)) implementation to make configuring for different projects simple.This implementation uses the following data structure:| sign (0+/1-) | whole number | fractional bits || ____1 bit___ | _N-Q-1 bits_ | _____Q bits____ |The following modules were created:-Twos Complement-Addition (Combinational)-Multiplicati</div>
<a href='cores/arithmetic_core/fixed_point_arithmetic_modules/index.html'>fixed point arithmetic modules</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_fixed_point_arithmetic_modules'>code</a>
</td>
<td>Oct 31, 2013</td>
<td>Verilog</td>
<td>Stable</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core dditional info:Design done,FPGA proven,Specification doneWishBone Compliant: NoLicense: LGPLSynopsisVerilog Fixed point math libraryOriginal work by Sam Skalicky, originally foundhereExtended, updated, and heavily commented by Tom BurkeThis library includes the basic math functions for the Verilog Language,for implementation on FPGAs.All units have been simulated and synthesized for Xilinx Spartan 3E devicesusing the Xilinx ISE WebPack tools v14.7These math routines use a signed magnitude Q,N format, where N is the totalnumber of bits used, and Q is the number of fractional bits used. For ins</div>
<a href='cores/arithmetic_core/fixed_point_math_library_for_verilog/index.html'>fixed point math library for verilog</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_fixed_point_math_library_for_verilog'>code</a>
</td>
<td>Oct 30, 2014</td>
<td>Verilog</td>
<td>Mature</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core one Compliant: NoLicense: LGPLDescriptionVHDL project for a Square Root Unit (SRU) for 32-bit fixed point data. The unit implements the Goldschmidt recursion algorithm. It is pipelined with Initiation Interval of 1 clock cycle, and it perform the computation of a single square root with a latency of 3 clock cycles.The design has been tested on 45nm ASIC library.</div>
<a href='cores/arithmetic_core/fixed_point_square_root_recursive_algorithm/index.html'>fixed point square root recursive algorithm</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_fixed_point_square_root_recursive_algorithm'>code</a>
</td>
<td>Mar 16, 2015</td>
<td>VHDL</td>
<td>Alpha</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core rovenWishBone Compliant: NoLicense: GPLDescriptionQuadratic_func is a fully pipelined quadratic polynomial that computes the relation y = ax^2 + bx + c. On each rising-edge of the clock (when en is high), the coefficients and input x term are sampled at the function inputs. The result has a latency of 3 clock cycles. All inputs to the function are 8-bit signed fractions, with the generic parameter 'fw' specifying the number of fraction bits. The output result is a 24-bit signed fraction. If integer arithmetic is preferred, then the parameter fw should be set to 0. For larger bit-widths, t</div>
<a href='cores/arithmetic_core/fixed-point_quadratic_polynomial/index.html'>fixed-point quadratic polynomial</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_fixed-point_quadratic_polynomial'>code</a>
</td>
<td>Jul 26, 2011</td>
<td>VHDL</td>
<td>Stable</td>
<td>GPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core PGA provenWishBone Compliant: NoLicense:DescriptionThis Floating Point units were developed as part of the HAVOC project. The Design schematics and related files can be browsed at the FPU repository, or downloaded as a separate file from the FP units home page.The FP Adder is a single-precision, IEEE-754 compilant, signed adder/substractor. It includes both single-cycle and 6-stage pipelined designs. The design is fully synthesizable and has been tested in a Xilinx Virtex-II XC2V3000 FPGA, occupying 385 CLBs and with a theoretical maximum operating frecuency of 6MHz for the single-cycle desig</div>
<a href='cores/arithmetic_core/floating_point_adder_and_multiplier/index.html'>floating point adder and multiplier</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_floating_point_adder_and_multiplier'>code</a>
</td>
<td>Feb 23, 2012</td>
<td>VHDL</td>
<td>Stable</td>
<td>Unknown</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core iant: NoLicense: LGPLDescriptionVHDL implementation of a fast space- and resource-efficient logarithm approximation unit for FPGAs.The unit is an implementation of the ICSILog algorithm.</div>
<a href='cores/arithmetic_core/floating-point_logarithm_unit/index.html'>floating-point logarithm unit</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_floating-point_logarithm_unit'>code</a>
</td>
<td>Dec 21, 2010</td>
<td>VHDL</td>
<td>Stable</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core ne Compliant: NoLicense: LGPLDescriptionThis implementation project proposes a practical implementation of a Median Filter architecture focused in low-cost FPGA devices. The architecture is based on the research presented in the following paper:http://islab.soe.uoguelph.ca/sareibi/TEACHING_dr/ENG6530_RCS_html_dr/outline_W2014/docs/PAPER_REVIEW_dr/2013_dr/GRAD_dr/FPGAbasedMedianFilter.pdfSorry, but we do not have time to develop a proper architecture document. However the paper presents a brief and at the same time complete description for this implementation design.</div>
<a href='cores/arithmetic_core/fpga-based_median_filter/index.html'>fpga-based median filter</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_fpga-based_median_filter'>code</a>
</td>
<td>Mar 21, 2014</td>
<td>Verilog</td>
<td>Stable</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core hBone Compliant: NoLicense:DescriptionThis is a 32-bit floating point unit (FPU), which I developed in a project within the Vienna University of Technology. It can do arithmetic operations on floating point numbers. The FPU complies fully with the IEEE 754 Standard. The FPU was tested and simulated in hardware and software.Features- FPU supports the following arithmetic operations:- Add- Subtract- Multiply- Divide- Square Root- For each operation the following rounding modes are supported:- Round to nearest even- Round to zero- Round up- Round down- Pipelined to achieve high operating frequenc</div>
<a href='cores/arithmetic_core/fpu/index.html'>fpu</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_fpu'>code</a>
</td>
<td>Sep 9, 2014</td>
<td>VHDL</td>
<td>Stable</td>
<td>Unknown</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core WishBone Compliant: NoLicense:DescriptionIEEE-754 compliant double-precision floating point unit. 4 operations (addition, subtraction, multiplication, division) are supported, as are the 4 rounding modes (nearest, 0, +inf, -inf). This unit also supports denormalized numbers, which is rare because most floating point units treat denormalized numbers as zero. The unit can run at clock frequencies up to 185 MHz for a Virtex5 target device.Features- The unit is designed to be synchronous to one global clock. All registers are updated on the rising edge of the clock.- All registers can be reset wi</div>
<a href='cores/arithmetic_core/fpu_double_vhdl/index.html'>fpu double vhdl</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_fpu_double_vhdl'>code</a>
</td>
<td>Oct 11, 2014</td>
<td>VHDL</td>
<td>Alpha</td>
<td>Unknown</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core Compliant: NoLicense: LGPLDescriptionFT816 floating point accelerator consists of two ninety-six bit floating point accumulators between which floating point or fixed point operations occur. Basic operations include ADD, SUB, MUL, DIV, FIX2FLT, FLT2FIX, SWAP, NEG and ABS. The floating point accumulators operate as a memory mapped device placed by default between $FEA200 and $FEA2FF. The floating point accelerator communicates through a byte wide data port and twenty-four bit address port. It was intended for use primarily with smaller byte oriented cpu€™s like the 65xx, 68xx series</div>
<a href='cores/arithmetic_core/ft816float-floating_point_accelerator/index.html'>ft816float-floating point accelerator</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_ft816float-floating_point_accelerator'>code</a>
</td>
<td>Dec 9, 2014</td>
<td>Verilog</td>
<td>Alpha</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core GA proven,Specification doneWishBone Compliant: NoLicense: LGPLDescriptionThe Gaussian Noise Generator core generates white Gaussian noise of standard normal distribution, which can be used to measure BER to extremely low BER levels (~10-15). The core uses a 64-bit combined Tausworthe generator and an approximation of the inverse normal cumulative distribution function, which obtains a PDF that is Gaussian to up to 9.1ƒ.The core was designed using synthesizable Verilog code and can be delivered as a soft-IP targeted for any FPGA device and ASIC technology. C/MATLAB models and correspondin</div>
<a href='cores/arithmetic_core/gaussian_noise_generator/index.html'>gaussian noise generator</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_gaussian_noise_generator'>code</a>
</td>
<td>Feb 1, 2015</td>
<td>Verilog</td>
<td>Stable</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core ,FPGA provenWishBone Compliant: NoLicense: LGPLDescriptionThis project implements the Galois Linear-feedback Shift Register (LFSR) in VHDL, and can be used for applications such as PRBS generation & synchronisation, CRC computations, scrambling & descrambling, cryptography, etc. This design is very generic / parameterisable, in the sense that it is intelligent enough to be able to "create" (or generate) the LFSR structure based on user input (a VHDL generic). In thelfsrentity (galois-lfsr.vhdl), there is a generic namedtaps, which allows you to input a vector of tap locations for the L</div>
<a href='cores/arithmetic_core/generic_galois_lfsr/index.html'>generic galois lfsr</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_generic_galois_lfsr'>code</a>
</td>
<td>Mar 4, 2014</td>
<td>VHDL</td>
<td>Beta</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core one,FPGA provenWishBone Compliant: NoLicense: LGPLDescriptionThis project is developed at Reconfigurable Computer Laboratory - FRM - UTN,and allows simulate and synthesize the Gregory-Newton extrapolation algorithm,using integer numbers.</div>
<a href='cores/arithmetic_core/gnextrapolator/index.html'>gnextrapolator</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_gnextrapolator'>code</a>
</td>
<td>Aug 14, 2012</td>
<td>VHDL</td>
<td>Beta</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core t: NoLicense:DescriptionThis is a collection of synthesizeable hardware dividers. Different types of dividers are available. All dividers are fully pipelined and provide a 2N by N division every clock cycle. All designs are fully parameteriseable and synthesizeable.The dividers take two inputs Z(2N-bit divident) and D(N-bit divisor), and return Q(N-bit quotient), S(N-bit remainder), div0(division by zero), and ovf(overflow).A sample implementation of a 32/16 bit divider with a remainder output runs at about 82MHz in a Spartan2e100 -6 device and occupies 1132 LUTs (about 47%) and 1736 registers</div>
<a href='cores/arithmetic_core/hardware_division_units/index.html'>hardware division units</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_hardware_division_units'>code</a>
</td>
<td>Sep 28, 2011</td>
<td>Unknow</td>
<td>Stable</td>
<td>Unknown</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core Compliant: NoLicense: LGPLReferences1. Yamamoto H., Mori S. Performance of a binary quantized all digital phase-locked loop with a new class of sequential filter//IEEE Trans. 1978. V. Com-26, 1. P. 35-45.2. Cessna J.R., Levy D.M. Phase noise and transient times for a binary quantized digital phase-locked loop in which Gaussian noise//IEEE Trans. 1972. V. Com-20, 2. P. 94-104.3. Yukawa J., Mori S. A binary quantized digital phase-locked loop//IECE. 1973. Vol. 56-A, 12. P. 79-85.</div>
<a href='cores/arithmetic_core/hardware_implementation_of_binary_fully_digital_ph/index.html'>hardware implementation of binary fully digital ph</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_hardware_implementation_of_binary_fully_digital_ph'>code</a>
</td>
<td>Feb 18, 2013</td>
<td>Verilog</td>
<td>Stable</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core ompliant: NoLicense: LGPL</div>
<a href='cores/arithmetic_core/hardware_load_balancer_for_multi-stage_software_ro/index.html'>hardware load balancer for multi-stage software ro</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_hardware_load_balancer_for_multi-stage_software_ro'>code</a>
</td>
<td>Sep 27, 2011</td>
<td>VHDL</td>
<td>Beta</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core iant: NoLicense:DescriptionHierarchical Carry Save Algorithm (HCSA) is a modification of well known adder algorithm. Comes as VHDL IP core, shows good timing and small area requirements.The Generic HCSA ALU VHDL IP Core presents an example of HCSA methodology.HCSA adder and ALU with HCSA implemented as VHDL soft IP cores. Algorithm implemetation bases on recursion method.Basic Idea: Every Bit of the Result is calculated twice simultaneously : 1. As if there IS NO carry from LSB ( less significant bit )S(i) = A(i) + B(i) + 0;2. As if these IS a carry from LSBS(i) = A(i) + B(i) </div>
<a href='cores/arithmetic_core/hcsa_adder_and_generic_alu_based_on_hcsa/index.html'>hcsa adder and generic alu based on hcsa</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_hcsa_adder_and_generic_alu_based_on_hcsa'>code</a>
</td>
<td>Dec 20, 2009</td>
<td>Unknow</td>
<td>Stable</td>
<td>Unknown</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core mpliant: NoLicense: BSDDescriptionThis project implements a sorter able to sort a continuous stream of data, consisting of records labeled with "sort keys".Sorter sorts one record every two clock cycles.Sorter is based on the heap sort algorithm. Efficient implementation is assured thanks to the use of internal dual portRAM in FPGA.The required size of heap is equal to the expected maximum distance between unsorted records in the data stream.Detailed descriptionThe sorter implemented in this project is designed for sorting of stream of constant length records.The main supposed application area</div>
<a href='cores/arithmetic_core/heap_sorter_for_fpga/index.html'>heap sorter for fpga</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_heap_sorter_for_fpga'>code</a>
</td>
<td>Oct 15, 2012</td>
<td>VHDL</td>
<td>Beta</td>
<td>BSD</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core mpliant: NoLicense:DescriptionBefore You readThis is a brief overview of the article about the series of multiplication algorithms. For comparison and estimation of proposed algorithms please refer to the full article...OverviewOperation of multiplication is very important in microelectronics. Each modern microprocessor has this operation within its instruction set, and advanced microprocessors have special multiplication units, that perform multiplication during 1 synchronization period(cycle). Especially valuable multiplication is in DSP processors, where it is practically main operation. P</div>
<a href='cores/arithmetic_core/hierarchical_integer_multiplier_unit/index.html'>hierarchical integer multiplier unit</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_hierarchical_integer_multiplier_unit'>code</a>
</td>
<td>Dec 20, 2009</td>
<td>Unknow</td>
<td>Stable</td>
<td>Unknown</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core e Compliant: NoLicense: OthersDescriptionHuffman code is used in the most streaming applications. I have written a Huffman decoder for jpeg pictures. For audio or other data streams the code have to adapt.The state machine is controlled by the jpeg baseline markers.Jpeg header is parsing for quantization and Huffman tables. It is re-programmable in each picture header. The implementation of dynamic Huffman table is very practical. If no information in the header is found the tables from the last picture are used again.In the stream the stuffing bits are removed and recognized the codeword a</div>
<a href='cores/arithmetic_core/huffman_decoder/index.html'>huffman decoder</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_huffman_decoder'>code</a>
</td>
<td>Nov 14, 2011</td>
<td>VHDL</td>
<td>Alpha</td>
<td>Others</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core shBone Compliant: NoLicense: LGPLDescriptionPlease write a description of the project here. It is used as a MetaTag (search engines looks at this).</div>
<a href='cores/arithmetic_core/lcd162b_behavior_model/index.html'>lcd162b behavior model</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_lcd162b_behavior_model'>code</a>
</td>
<td>Sep 18, 2013</td>
<td>VHDL</td>
<td>Planning</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core neWishBone Compliant: NoLicense: LGPLDescriptionThe lfsr core is a random number generator based on linear feedback shift register(LFSR).The sequence generated has the maximum length possible.The period of sequence generated by a n-bit LFSR is equal to 2^n-1.The tap values used are supposed to create maximum length sequence.The size of LFSR is a generic parameter.The core is designed in a way such that the seed of the process can be set from outside.An output enable pin make the output bit to zero's when driven low.A testbench code is provided along with core.You can use that to verify the res</div>
<a href='cores/arithmetic_core/lfsr-random_number_generator/index.html'>lfsr-random number generator</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_lfsr-random_number_generator'>code</a>
</td>
<td>Dec 23, 2012</td>
<td>VHDL</td>
<td>Alpha</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core neWishBone Compliant: NoLicense: LGPLDescriptionA fast (single-cycle) base-2 log function, based on the description athttp://www.cantares.on.ca/extras.htmlNeed an electronic design solution? Visithttp://www.cantares.on.ca/First uploaded version is in Verilog, with pipelining to maximize the clock frequency. An example implementation: It takes less than 2% of the smallest CycloneIII, and runs at 250MHz on the IOs. Probably even higher if internal-only. It even fits in a mid-sized CPLD!Second version strips outs the pipelining registers. Simpler if you don't need the throughput. This one clocks </div>
<a href='cores/arithmetic_core/logarithm_function_base-2_single-cycle/index.html'>logarithm function base-2 single-cycle</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_logarithm_function_base-2_single-cycle'>code</a>
</td>
<td>Jan 28, 2011</td>
<td>Verilog</td>
<td>Stable</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core :Design done,FPGA provenWishBone Compliant: YesLicense: GPLDescriptionThis IP core allows lossless data compression based on the Lempel-Ziv-Ross-Williams-1 algorithm. Its focus is on high throughput (of uncompressed data) at the expense of an somewhat lower compression ratio. One byte of uncompressed data can be processed at every second clockcycle. A software decoder (decompressor) written in java is included.The core is fully pipelined to allow high clock speeds. 66MHz can easily be achieved on a Spartan6FPGA. This results in a maximum compression throughput of almost 32MBytes/sec.It uses a </div>
<a href='cores/arithmetic_core/lzrw1_compressor_core/index.html'>lzrw1 compressor core</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_lzrw1_compressor_core'>code</a>
</td>
<td>Dec 19, 2013</td>
<td>VHDL</td>
<td>Stable</td>
<td>GPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core tional info:Design doneWishBone Compliant: NoLicense: LGPLDescriptionthe aim of this design to build combinatorial digital circuit to find in fast parallel the maximum or the minimum of set of given set data where number of entries = N, can be configured at compile time and also the width = M of each entry.the design idea based on binary tree structure, where there are Log_2(N) levels in the tree, the best values of N whereLog_2(N) = integer numbers like N = ( 4, 8, 16, 32, 64,...) where Log_2(N) = {2, 3, 4, 5, ...}. but to support general values of N like 29 the design will be Log_2(29)+1 wh</div>
<a href='cores/arithmetic_core/maximum-minimum_binary_tree_finder/index.html'>maximum/minimum binary tree finder</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_maximum-minimum_binary_tree_finder'>code</a>
</td>
<td>Oct 5, 2010</td>
<td>VHDL</td>
<td>Beta</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core ompliant: NoLicense: LGPLDescriptionThe MESI InterSection Controller (ISC) is a coherence system controller. It supports theMESI coherence protocolfor a cache data consistency. It synchronizes the memory requests of the system masters. It enables to keep the consistency of the data in the memory and in the local caches.This project provides the following elements:A synthesizable controller core with a complete environment of verification, synthesis, and documentation.Instructions for integrating MESI_ISC to a system.A definition and requirements of the system masters.For a detailed descripti</div>
<a href='cores/arithmetic_core/mesi_coherency_intersection_controller/index.html'>mesi coherency intersection controller</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_mesi_coherency_intersection_controller'>code</a>
</td>
<td>Mar 17, 2013</td>
<td>Verilog</td>
<td>Alpha</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core Bone Compliant: NoLicense:DescriptionDescription of project..</div>
<a href='cores/arithmetic_core/microprocessor_za208/index.html'>microprocessor za208</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_microprocessor_za208'>code</a>
</td>
<td>Jun 23, 2011</td>
<td>VHDL</td>
<td>Planning</td>
<td>Unknown</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core Compliant: NoLicense: LGPLDescriptionA quick & simple mod 3 calculator(only just combinational logic). the input 8-bit data is divided by 3. and the output is only 0, 1, or 2.I use XilinxISE10.1 Synthesis the file, the speed can reach 113MHz.If anyone want make it more faster, you can insert some registers and make it pipeline.</div>
<a href='cores/arithmetic_core/mod3_calc/index.html'>mod3_calc</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_mod3_calc'>code</a>
</td>
<td>Oct 11, 2010</td>
<td>Verilog</td>
<td>Alpha</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core nt: NoLicense: LGPLDescriptionPlease write a description of the project here. It is used as a MetaTag (search engines looks at this).</div>
<a href='cores/arithmetic_core/modbus_implementation_in_vhdl/index.html'>modbus implementation in vhdl</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_modbus_implementation_in_vhdl'>code</a>
</td>
<td>Feb 24, 2011</td>
<td>VHDL</td>
<td>Beta</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core Design done,FPGA provenWishBone Compliant: NoLicense: LGPLDescription// number sorting device, sequential, 2*N clocks for N// linear buffer implementation// sequential, stable, can be partly readed, decreasing order// reset is not implemented// see sort_stack_algorithm.png to catch the idea// number sorting, tree-like implementation, sequential,// energy efficient (theoreticaly)// see sort_tree_algorithm.png to catch the ideaArticle(Russian):http://habrahabr.ru/post/222287/</div>
<a href='cores/arithmetic_core/numbert_sort_device_on/index.html'>numbert sort device on</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_numbert_sort_device_on'>code</a>
</td>
<td>May 10, 2014</td>
<td>Verilog</td>
<td>Beta</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core liant: NoLicense: GPLDescriptionFree and open source double precision Floating Point Unit (FPU).TheopenFPU64currently features:- double precision- Addition/Subtraction- Multiplication- rounding (to nearest even)- subnormals/denormals- validated against IEEE754- Compatible with Avalon Bus- Wishbone interface will be provided soonNew algorithms can be added easily, just modify the code markedwith ADD_ALGORITHMS_HEREEverything marked with FUTURE is not yet implemented,but already added for easier transition.Tested on CycloneII and Cyclone III FPGAs.If any questions arise, don't hesitate to contac</div>
<a href='cores/arithmetic_core/openfpu64/index.html'>openfpu64</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_openfpu64'>code</a>
</td>
<td>May 7, 2010</td>
<td>VHDL</td>
<td>Beta</td>
<td>GPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core l info:Design done,FPGA proven,Specification doneWishBone Compliant: YesLicense: LGPLDescriptionThe ORSoC Graphics Accelerator can:Draw Lines.Draw Filled or Textured Rectangles.Draw Filled, Interpolated or Textured Triangles.Draw Filled Quadratic Bzier Curves.Write Text with Bitmap Fonts or Vector Fonts.Draw Alphablended shapes.Draw Colorkeyed images.Draw 3D meshes with support for depth buffer.Transform points (scaling & rotation of triangles and vector fonts).The ORSoC GFX have support for the following formats:Support for .TTF fonts.Support for .OBJ files for 3D meshes.Support for .bmp,</div>
<a href='cores/arithmetic_core/orsoc_graphics_accelerator/index.html'>orsoc graphics accelerator</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_orsoc_graphics_accelerator'>code</a>
</td>
<td>May 5, 2013</td>
<td>Verilog</td>
<td>Beta</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core Compliant: NoLicense: BSDDescriptionThis project implements a simple parametrized FFT engine.The user may define length of FFT (fftlen equal to a power of 2), and may also define the format of numbers used.To change the format of numbers, the user must change definition of the icpx_number (internal complex number) type defined in the icpx_pkg.vhd file.It is also necessary to adjust the conversion functions defined in this file.The user must also modify the butterfly.vhd file, so that the entity "butterfly" performs calculations on the user defined type.There are two implementations available.I</div>
<a href='cores/arithmetic_core/parametrized_fft_engine/index.html'>parametrized fft engine</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_parametrized_fft_engine'>code</a>
</td>
<td>Mar 24, 2015</td>
<td>VHDL</td>
<td>Beta</td>
<td>BSD</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core e Compliant: NoLicense: LGPLDescriptionPlease write a description of the project here. It is used as a MetaTag (search engines looks at this).</div>
<a href='cores/arithmetic_core/pid_controler/index.html'>pid controler</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_pid_controler'>code</a>
</td>
<td>Sep 20, 2010</td>
<td>VHDL</td>
<td>Stable</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core shBone Compliant: NoLicense: GPLDescriptionVHDL Implementation of a basic Pipeline MIPS processor. It has a translator of MIPS assembler code and implement the division algorithm restoring.</div>
<a href='cores/arithmetic_core/pipeline_mips_in_vhdl/index.html'>pipeline mips in vhdl</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_pipeline_mips_in_vhdl'>code</a>
</td>
<td>May 29, 2010</td>
<td>VHDL</td>
<td>Stable</td>
<td>GPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core e Compliant: NoLicense: LGPLDescriptionC code for generating a stand-alone population counter with user-defined size (number of input bits) and latency (number of clock cycles) in VHDL.</div>
<a href='cores/arithmetic_core/population_counter_generator/index.html'>population counter generator</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_population_counter_generator'>code</a>
</td>
<td>Jul 12, 2011</td>
<td>C/C++</td>
<td>Stable</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core pliant: NoLicense:DescriptionBefore You readThis is a brief overview of the article about the series of multiplication algorithms. For comparison and estimation of proposed algorithms please refer to the full article...OverviewOperation of multiplication is very important in microelectronics. Each modern microprocessor has this operation within its instruction set, and advanced microprocessors have special multiplication units, that perform multiplication during 1 synchronization period(cycle). Especially valuable multiplication is in DSP processors, where it is practically main operation. Pe</div>
<a href='cores/arithmetic_core/pyramid_integer_multiplier_unit/index.html'>pyramid integer multiplier unit</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_pyramid_integer_multiplier_unit'>code</a>
</td>
<td>Jul 17, 2003</td>
<td>Unknow</td>
<td>Stable</td>
<td>Unknown</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core NoLicense:DescriptionThis is synthesizeable radix 4 complex fft processor. Input data width and points are configurable. Output data width = Input data width + 2. Some necessary limited and shift have been done at every butterfly.A sample implementation of a 1024 point 12 bit FFT runs at about 97MHz in a Spartan2e100 -6 device and occupies 1,271 LUTs (about 52%) and 1,144 registers (about 47%) of the device.Features- Data width configurable- Point configurable- Input data during data output- Simulation result has compare with Matlab resultStatus- Design is available in VHDL from OpenCores CVS </div>
<a href='cores/arithmetic_core/radix_4_complex_fft/index.html'>radix 4 complex fft</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_radix_4_complex_fft'>code</a>
</td>
<td>Sep 30, 2010</td>
<td>Unknow</td>
<td>Stable</td>
<td>Unknown</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core liant: NoLicense: LGPLDescriptionRay Tracing : A rendering technique that challenges anyone who is interested in Computer Science, Computer Graphics and Digital Systems in General.The Main Goal of this project is to create an engine to Render 3D models. This engine is made over HW/SW. What Im planning to do is to make a RTL generic enough to plug it along with a processor, by means of a bus or any connector the developer wishes.So the RTL's published on this page will describe the HW part of the engine. I don't know, YET, if I'm allowed to upload SW source code. If I am, for sure I will, but </div>
<a href='cores/arithmetic_core/ray_tracing_arithmetic_engine/index.html'>ray tracing arithmetic engine</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_ray_tracing_arithmetic_engine'>code</a>
</td>
<td>Jul 25, 2011</td>
<td>VHDL</td>
<td>Mature</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core iant: NoLicense: LGPLDescriptionPlease write a description of the project here. It is used as a MetaTag (search engines looks at this).</div>
<a href='cores/arithmetic_core/reconfigurable_hardware_platform/index.html'>reconfigurable hardware platform</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_reconfigurable_hardware_platform'>code</a>
</td>
<td>Mar 29, 2012</td>
<td>Other</td>
<td>Planning</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core one,FPGA provenWishBone Compliant: NoLicense: LGPLDescriptionThis project implements a parameterized Reed Solomon decoder for use in OFDM wireless systems.Source code provided in C++ (trunk/cpp-source) and Bluespec(trunk/bluespec-source).</div>
<a href='cores/arithmetic_core/reed-solomon_decoder/index.html'>reed-solomon decoder</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_reed-solomon_decoder'>code</a>
</td>
<td>Jun 16, 2010</td>
<td>C/C++</td>
<td>Stable</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core nfo:Design done,FPGA provenWishBone Compliant: NoLicense: LGPLDescriptionA divider that calculates the quotient and remainder of a division operation in multiple clock cycles. The dividend, divisor, quotient and remainder are all 32-bit signed integers. By taking the advantage of a shifter that can shift more than one bit (up to 9 bits) during each cycle of computation, it takes less cycles to finish than a radix-2 nonrestoring divider.</div>
<a href='cores/arithmetic_core/signed_integer_divider/index.html'>signed integer divider</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_signed_integer_divider'>code</a>
</td>
<td>Mar 8, 2013</td>
<td>Verilog</td>
<td>Alpha</td>
<td>LGPL</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core ification doneWishBone Compliant: NoLicense: BSDDescriptionSine and cosine table that can be synthesized. Pure VHDL, no other tools orsilicon vendor macros. Pipeline delay can be selected from combinatorialto 10 stages at compile time via a generic.Phase input and sin/cos output widths are automatically determined by theconnected bus. 16 bit phase/18 bit amplitude runs at 230 MHz in Spartan6-3without any optimization efforts. (Just setting 250 MHz as the goal)Also features a programmable pipeline register entity for most basic VHDL types.Pipeline delay can be set from 0 to MAXINT clocksAlso a </div>
<a href='cores/arithmetic_core/sineandcosinetable/index.html'>sineandcosinetable</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_sineandcosinetable'>code</a>
</td>
<td>Feb 26, 2011</td>
<td>VHDL</td>
<td>Beta</td>
<td>BSD</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core Design done,Specification doneWishBone Compliant: NoLicense:Before You ReadThis is a brief overview of the article aboutsingle-clockunsigned integer division algorithm. For comparison and estimation of proposed algorithms please refer to the full article...OverviewNow two division algorithms are wide spread in computing: restoring and non-restoring algorithms. They consider that both algorithms may be used in sequential calculation scheme, when one digit of the result is achieved during one clock. However there are no principle objections against getting all digits of the quotient and the rema</div>
<a href='cores/arithmetic_core/single_clock_unsigned_division_algorithm/index.html'>single clock unsigned division algorithm</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_single_clock_unsigned_division_algorithm'>code</a>
</td>
<td>Sep 28, 2011</td>
<td>VHDL</td>
<td>Stable</td>
<td>Unknown</td>
</tr>
<tr>
<th>
<div hidden>arithmetic core hBone Compliant: NoLicense: LGPLDescriptionThe DLX processor is an academic processor described in in John L. Hennessy and David A. Patterson's Computer Architecture: A Quantitative Approach. Our project aims to offer a decent structural VHDL description of the processor. Moreover, advanced computer architecture features, power management, debug unit, memory management unit and OCP will be added to the project. The final goal of the project is to provide a multi-processor system-on-chip which can support VLSI research or simple embedded application.</div>
<a href='cores/arithmetic_core/superscalar_version_of_dlx/index.html'>superscalar version of dlx</a>
</th>
<td>
<a href='https://github.com/fabriziotappero/ip-cores/tree/arithmetic_core_superscalar_version_of_dlx'>code</a>
</td>
<td>Oct 31, 2012</td>
<td>VHDL</td>
<td>Planning</td>
<td>LGPL</td>