Loading...
Searching...
No Matches
Collaboration diagram for SplitKernels:
Classes | |
| class | SplitScalar< TT, H, INP_W, OUT_W, OVERLAP > |
| Scalar implementation for 32-bit stream, requires 2*OVERLAP <= OUT_W, (INP_W-OUT_W) % FIRST_STRIDE == 0 if OVERLAP > 0, requires OUT_W*LCNT - OVERLAP*(LCNT-1) <= INP_W, if OVERLAP <= 0, SplitScalar<f,3,10,64,22>::filter3 takes 9505 cycles SplitScalar<f,10,64,31,-1>filter2 takes 9547 cycles. More... | |
| class | SplitInt8< TT, H, INP_W, OUT_W, OVERLAP > |
| Scalar implementation for int8 stream, requires 2*OVERLAP <= OUT_W, (INP_W-OUT_W) % FIRST_STRIDE == 0 if OVERLAP > 0, requires OUT_W*LCNT - OVERLAP*(LCNT-1) <= INP_W, if OVERLAP <= 0, SplitInt8<a,10,160,64,16>::filter3 takes 1649 cycles SplitInt8<a,10,160,64,-32>filter2 takes 1237 cycles. More... | |
| class | SplitTwo32bitStreams< TT, H, INP_W, OUT_W, OVERLAP > |
| Scalar implementation for chunking 32-bit stream input into two separate streams, requires 2*OVERLAP <= OUT_W, (INP_W-OUT_W) % FIRST_STRIDE == 0 if OVERLAP > 0, requires OUT_W*LCNT - OVERLAP*(LCNT-1) <= INP_W, if OVERLAP <= 0, SplitTwo32bitStreams<f,10,64,22,1>::filter2 total = 676 SplitTwo32bitStreams<f,10,64,31,-1>::filter2 total = 812. More... | |
| class | SplitFilterFloatStream< TT, H, INP_W, OUT_W, OVERLAP > |
| Scalar implementation for slicing out portion of 32-bit stream input, requires 2*OVERLAP <= OUT_W, (INP_W-OUT_W) % FIRST_STRIDE == 0 if OVERLAP > 0, requires OUT_W*LCNT - OVERLAP*(LCNT-1) <= INP_W, if OVERLAP <= 0, SplitFilterFloatStream<f,10,64,22,1>::filter1 total = 981. More... | |
| class | SplitFilterFloatStreamTwice< TT, H, INP_W, OUT_W, OVERLAP > |
| Scalar implementation for slicing out portion of 32-bit stream input, requires 2*OVERLAP <= OUT_W, (INP_W-OUT_W) % FIRST_STRIDE == 0 if OVERLAP > 0, requires OUT_W*LCNT - OVERLAP*(LCNT-1) <= INP_W, if OVERLAP <= 0, SplitFilterFloatStreamTwice<f,10,64,22,1>::filter1 total = 893. More... | |
| class | SplitFilterFloatPktStream< TT, H, INP_W, OUT_W, OVERLAP > |
| Scalar implementation for slicing out portions of 32-bit stream input into pktstream, requires 2*OVERLAP <= OUT_W, (INP_W-OUT_W) % FIRST_STRIDE == 0 if OVERLAP > 0, requires OUT_W*LCNT - OVERLAP*(LCNT-1) <= INP_W, if OVERLAP <= 0,. More... | |
| class | SplitFilterInt8Stream< TT, H, INP_W, OUT_W, OVERLAP > |
| Scalar implementation for slicing out portion of int8 stream input, requires 2*OVERLAP <= OUT_W, (INP_W-OUT_W) % FIRST_STRIDE == 0 if OVERLAP > 0, requires OUT_W*LCNT - OVERLAP*(LCNT-1) <= INP_W, if OVERLAP <= 0,. More... | |
| class | SplitFilterInt8StreamTwice< TT, H, INP_W, OUT_W, OVERLAP > |
| Scalar implementation for slicing out portion of int8 stream input, requires 2*OVERLAP <= OUT_W, (INP_W-OUT_W) % FIRST_STRIDE == 0 if OVERLAP > 0, requires OUT_W*LCNT - OVERLAP*(LCNT-1) <= INP_W, if OVERLAP <= 0,. More... | |
| class | SplitFilterInt8PktStream< TT, H, INP_W, OUT_W, OVERLAP > |
| Scalar implementation for slicing out portions of 32-bit stream input into pktstream, requires 2*OVERLAP <= OUT_W, (INP_W-OUT_W) % FIRST_STRIDE == 0 if OVERLAP > 0, requires OUT_W*LCNT - OVERLAP*(LCNT-1) <= INP_W, if OVERLAP <= 0,. More... | |
