OpenCores
URL https://opencores.org/ocsvn/minimips_superscalar/minimips_superscalar/trunk

Subversion Repositories minimips_superscalar

[/] [minimips_superscalar] - Rev 21

Rev

Go to most recent revision | Details | Compare with Previous | Blame

Filtering Options

Clear current filter

Rev Log message Author Age Path
21 Correcting codes that work in behavioral simulation but cause problems with implementation. There must be more to be corrected yet. In analysis ... mcafruni 1538d 19h /minimips_superscalar
20 I've uncommented wait statement so that the benchmark to be loaded into the simulation. mcafruni 1573d 07h /minimips_superscalar
19 mcafruni 1906d 23h /minimips_superscalar
18 clock_gate.vhd: removed.
minimips.vhd: Clock2 input is wrongly connected to the clock signal (Do not ask me how that happened. I'm sorry.). The right thing is to be connected to the clock2 signal. Adjusted.
mcafruni 1906d 23h /minimips_superscalar
17 Removing unnecessary clock-gate architecture. mcafruni 1907d 00h /minimips_superscalar
16 FIR filter with 36 coefficients. (binary to run) mcafruni 1940d 09h /minimips_superscalar
15 FIR filter with 36 coefficients. mcafruni 1940d 09h /minimips_superscalar
14 Buble Sort algorithm. Four totally disorderly numbers are sorted in ascending order. Worst performance algorithm. mcafruni 1944d 03h /minimips_superscalar
13 Buble Sort algorithm. Four totally disorderly numbers are sorted in ascending order. Worst performance algorithm. mcafruni 1944d 03h /minimips_superscalar
12 Static Fast Fourier Transform COOLEY TUKEY algorithm to 8 samples. The signal must have zeros betwen non null samples to prevent multiplication by real and complex numbers, since the core don't have floating point. mcafruni 1944d 03h /minimips_superscalar
11 Static Fast Fourier Transform COOLEY TUKEY algorithm to 8 samples. The signal must have zeros betwen non null samples to prevent multiplication by real and complex numbers, since the core don't have floating point. mcafruni 1944d 03h /minimips_superscalar
10 Matrix/Vector multiplication by constant. (binary) mcafruni 1954d 02h /minimips_superscalar
9 Matrix/Vector multiplication by constant. mcafruni 1954d 02h /minimips_superscalar
8 mcafruni 1985d 00h /minimips_superscalar
7 Uploading missing file 'pps_pf.vhd'. mcafruni 1985d 00h /minimips_superscalar
6 This is the assembly gasm modified that include a multiplication instruction which operands are 16-bit wide. mcafruni 1997d 13h /minimips_superscalar
5 6x6 Matrix multiplication (ingenuous algorithm)
msx.bin: uses 16-bit operands multiplication instruction (mult2 rd, rs, rt).
m6x.bin: uses 32-bit operands original multiplication instruction (mult rs, rt) and the move instruction (mflo rd) after.
mcafruni 1997d 21h /minimips_superscalar
4 It needs to be tested on more useful and real benchmarks to reveal possible instruction sequences not supported by the architecture. Suggestions are welcome. mcafruni 1997d 21h /minimips_superscalar
3 mcafruni 1997d 22h /minimips_superscalar
2 mcafruni 1997d 22h /minimips_superscalar

1 2 Next >

Show All

powered by: WebSVN 2.1.0

© copyright 1999-2024 OpenCores.org, equivalent to Oliscience, all rights reserved. OpenCores®, registered trademark.