Improved Algorithm for ODCT Computation of a Running Data Sequence

<table class="table-group" id="tab1"><tr><td><table class="table"><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr class="thead"><td align="left">Type</td><td align="center">Multiplications (<svg height="15.4" id="M199" style="vertical-align:-3.39069pt" version="1.1" viewbox="0 0 26.3375 15.4" width="26.3375" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><path d="M619 482q0 -69 -40.5 -119t-96 -72.5t-118.5 -26.5h-44l-70 20l-31 -151q-14 -67 0.5 -83t89.5 -22l-5 -28h-287l8 28q65 7 81.5 22t29.5 83l79 398q12 56 0.5 70.5t-78.5 20.5l7 28h255q108 0 164 -43t56 -125zM524 478q0 141 -146 141q-25 0 -47 -8q-16 -6 -20.5 -13.5
t-10.5 -39.5l-43 -241q37 -13 83 -13q67 0 125.5 45t58.5 129z" id="x1D443"></path></g>
<g transform="matrix(.012,-0,0,-.012,10.875,15.187)"><path d="M390 111l17 -21q-34 -45 -80 -73.5t-89 -28.5q-91 0 -146 62t-55 147q0 118 101 195q74 57 149 57h1q59 0 90 -27q16 -14 16 -30q0 -15 -12 -29t-21 -14q-8 0 -19 11q-44 41 -101 41q-52 0 -87.5 -42.5t-35.5 -117.5q0 -49 15 -87t39 -58t49 -30t48 -10q33 0 60.5 12
t60.5 43z" id="x63"></path></g><g transform="matrix(.012,-0,0,-.012,15.908,15.187)"><path d="M797 0h-214v26q46 5 58 17.5t12 63.5v167q0 116 -88 116q-48 0 -112 -52q3 -18 3 -42v-195q0 -46 11 -58t53 -17v-26h-214v26q48 5 59.5 17t11.5 60v172q0 115 -88 115q-47 0 -109 -52v-235q0 -47 10 -59.5t48 -17.5v-26h-211v26q50 5 62.5 17t12.5 60v207q0 48 -9 59.5
t-52 18.5v23q79 14 139 41v-81q3 2 29 20.5t44 29.5q45 28 81 28t66 -22t46 -61q25 20 83 57q39 26 76 26q59 0 93 -40t34 -113v-193q0 -49 10.5 -60.5t54.5 -16.5v-26z" id="x6D"></path></g>
</svg>)</td><td align="center">Additions (<svg height="15.4" id="M200" style="vertical-align:-3.39069pt" version="1.1" viewbox="0 0 21.85 15.4" width="21.85" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.112)"><path d="M619 482q0 -69 -40.5 -119t-96 -72.5t-118.5 -26.5h-44l-70 20l-31 -151q-14 -67 0.5 -83t89.5 -22l-5 -28h-287l8 28q65 7 81.5 22t29.5 83l79 398q12 56 0.5 70.5t-78.5 20.5l7 28h255q108 0 164 -43t56 -125zM524 478q0 141 -146 141q-25 0 -47 -8q-16 -6 -20.5 -13.5
t-10.5 -39.5l-43 -241q37 -13 83 -13q67 0 125.5 45t58.5 129z" id="x1D443"></path></g>
<g transform="matrix(.012,-0,0,-.012,10.875,15.187)"><path d="M390 111l17 -21q-34 -45 -80 -73.5t-89 -28.5q-91 0 -146 62t-55 147q0 118 101 195q74 57 149 57h1q59 0 90 -27q16 -14 16 -30q0 -15 -12 -29t-21 -14q-8 0 -19 11q-44 41 -101 41q-52 0 -87.5 -42.5t-35.5 -117.5q0 -49 15 -87t39 -58t49 -30t48 -10q33 0 60.5 12
t60.5 43z" id="x63"></path></g><g transform="matrix(.012,-0,0,-.012,15.932,15.187)"><path d="M433 39l-85 -51q-27 0 -47 20q-16 16 -24 44q-5 -3 -24 -16.5t-27 -18.5t-23 -13.5t-25 -12t-19 -3.5q-52 0 -86 36.5t-34 85.5q0 71 81 99q128 43 155 65v17q0 54 -23 83.5t-62 29.5q-28 0 -45 -19t-29 -66q-7 -23 -29 -23q-15 0 -29 13t-14 30t31 40q25 19 68.5 40.5
t81.5 29.5q49 0 82 -27q45 -39 45 -123v-185q0 -60 35 -60q18 0 36 11zM275 84v156q-12 -6 -49 -23t-41 -19q-31 -14 -46 -31t-15 -43q0 -35 22.5 -55.5t48.5 -20.5q19 0 42 10.5t38 25.5z" id="x61"></path></g>
</svg>)</td></tr><tr><td class="thead-hr" colspan="3"><hr/></td></tr><tr><td align="left">From definition</td><td align="center">       368</td><td align="center">     448</td></tr><tr><td align="left">From simultaneous update algorithm</td><td align="center">       305</td><td align="center">     320</td></tr><tr><td align="left">From independent update algorithm</td><td align="center">       201</td><td align="center">     320</td></tr><tr class="table-tr"><td colspan="3"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

Journal of Electrical and Computer Engineering

tab1

Table 1

Table 1: Improved Algorithm for ODCT Computation of a Running Data Sequence 