Changes between Version 2 and Version 3 of ParabixTransform


Ignore:
Timestamp:
Apr 20, 2014, 2:03:52 PM (3 years ago)
Author:
cameron
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • ParabixTransform

    v2 v3  
    1313=== Ideal Implementation Using SIMD Packing ===
    1414
    15 Given a processor architecture that supports binary SIMD operations on 2^k-bit
     15Given a processor architecture that supports binary SIMD operations on 2^k^-bit
    1616registers, an ideal implementation of the Parabix Transposition can be based
    1717on the availability of a family of horizontal packing operations.  The operations
     
    2424in the concatenation of {{{e1}}} and {{{e2}}}, returning the packed set of
    25252^k^ bits as a single 2^k^-bit value.   
    26 The following example illustrates this operation working with 16-bit registers.
     26The following example illustrates this operation working with 16-bit (k=4) registers.
    2727||{{{e1}}}||{{{AaBbCcDd}}}||{{{EeFfGgHh}}}||
    2828||{{{e2}}}||{{{JjKkLlMm}}}||{{{NnPpQqRr}}}||