src/openpower/decoder/isa/fastdctlee.py

   1 #
   2 # Fast discrete cosine transform algorithms (Python)
   3 #
   4 # Copyright (c) 2020 Project Nayuki. (MIT License)
   5 # https://www.nayuki.io/page/fast-discrete-cosine-transform-algorithms
   6 #
   7 # Permission is hereby granted, free of charge, to any person obtaining a copy of
   8 # this software and associated documentation files (the "Software"), to deal in
   9 # the Software without restriction, including without limitation the rights to
  10 # use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
  11 # the Software, and to permit persons to whom the Software is furnished to do so,
  12 # subject to the following conditions:
  13 # - The above copyright notice and this permission notice shall be included in
  14 #   all copies or substantial portions of the Software.
  15 # - The Software is provided "as is", without warranty of any kind, express or
  16 #   implied, including but not limited to the warranties of merchantability,
  17 #   fitness for a particular purpose and noninfringement. In no event shall the
  18 #   authors or copyright holders be liable for any claim, damages or other
  19 #   liability, whether in an action of contract, tort or otherwise, arising from,
  20 #   out of or in connection with the Software or the use or other dealings in the
  21 #   Software.
  22 #
  23
  24 import math
  25 from copy import deepcopy
  26
  27 # bits of the integer 'val'.
  28 def reverse_bits(val, width):
  29     result = 0
  30     for _ in range(width):
  31         result = (result << 1) | (val & 1)
  32         val >>= 1
  33     return result
  34
  35
  36 # DCT type II, unscaled. Algorithm by Byeong Gi Lee, 1984.
  37 # See: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.118.3056&rep=rep1&type=pdf#page=34
  38 def transform(vector, indent=0):
  39     idt = "   " * indent
  40     n = len(vector)
  41     if n == 1:
  42         return list(vector)
  43     elif n == 0 or n % 2 != 0:
  44         raise ValueError()
  45     else:
  46         half = n // 2
  47         alpha = [(vector[i] + vector[-(i + 1)]) for i in range(half)]
  48         beta  = [(vector[i] - vector[-(i + 1)]) /
  49                  (math.cos((i + 0.5) * math.pi / n) * 2.0)
  50                     for i in range(half)]
  51         alpha = transform(alpha)
  52         beta  = transform(beta )
  53         result = []
  54         for i in range(half - 1):
  55             result.append(alpha[i])
  56             result.append(beta[i] + beta[i + 1])
  57         result.append(alpha[-1])
  58         result.append(beta [-1])
  59         return result
  60
  61
  62 def transform(vector, indent=0):
  63     idt = "   " * indent
  64     n = len(vector)
  65     if n == 1:
  66         return list(vector)
  67     elif n == 0 or n % 2 != 0:
  68         raise ValueError()
  69     else:
  70         half = n // 2
  71         alpha = [0] * half
  72         beta = [0] * half
  73         print (idt, "xf", vector)
  74         print (idt, "coeff", n, "->", end=" ")
  75         for i in range(half):
  76             t1, t2 = vector[i], vector[n-i-1]
  77             k = (math.cos((i + 0.5) * math.pi / n) * 2.0)
  78             print (i, n-i-1, "i/n", (i+0.5)/n, ":", k, end= " ")
  79             alpha[i] = t1 + t2
  80             beta[i] = (t1 - t2) * (1/k)
  81         print ()
  82         print (idt, "n", n, "alpha", end=" ")
  83         for i in range(0, n, 2):
  84             print (i, i//2, alpha[i//2], end=" ")
  85         print()
  86         print (idt, "n", n, "beta", end=" ")
  87         for i in range(0, n, 2):
  88             print (i, beta[i//2], end=" ")
  89         print()
  90         alpha = transform(alpha, indent+1)
  91         beta  = transform(beta , indent+1)
  92         result = [0] * n
  93         for i in range(half):
  94             result[i*2] = alpha[i]
  95             result[i*2+1] = beta[i]
  96         print(idt, "merge", result)
  97         for i in range(half - 1):
  98             result[i*2+1] += result[i*2+3]
  99         print(idt, "result", result)
 100         return result
 101
 102
 103 def transform_itersum(vector, indent=0):
 104     idt = "   " * indent
 105     n = len(vector)
 106     if n == 1:
 107         return list(vector)
 108     elif n == 0 or n % 2 != 0:
 109         raise ValueError()
 110     else:
 111         half = n // 2
 112         alpha = [0] * half
 113         beta = [0] * half
 114         for i in range(half):
 115             t1, t2 = vector[i], vector[i+half]
 116             alpha[i] = t1
 117             beta[i] = t2
 118         alpha = transform_itersum(alpha, indent+1)
 119         beta  = transform_itersum(beta , indent+1)
 120         result = [0] * n
 121         for i in range(half):
 122             result[i*2] = alpha[i]
 123             result[i*2+1] = beta[i]
 124         print(idt, "iter-merge", result)
 125         for i in range(half - 1):
 126             result[i*2+1] += result[i*2+3]
 127         print(idt, "iter-result", result)
 128         return result
 129
 130
 131
 132 def transform2(vec):
 133
 134     vec = deepcopy(vec)
 135     # Initialization
 136     n = len(vec)
 137     print ()
 138     print ("transform2", n)
 139     levels = n.bit_length() - 1
 140
 141     # reference (read/write) the in-place data in *reverse-bit-order*
 142     ri = list(range(n))
 143     ri = [ri[reverse_bits(i, levels)] for i in range(n)]
 144
 145     # and pretend we LDed the data in bit-reversed order as well
 146     vec = [vec[reverse_bits(i, levels)] for i in range(n)]
 147
 148     size = n
 149     while size >= 2:
 150         halfsize = size // 2
 151         tablestep = n // size
 152         ir = list(range(0, n, size))
 153         print ("  xform", size, ir)
 154         for i in ir:
 155             k = 0
 156             j = list(range(i, i + halfsize))
 157             jr = list(range(i+halfsize, i + size))
 158             jr.reverse()
 159             print ("  xform jr", j, jr)
 160             for ci, (jl, jh) in enumerate(zip(j, jr)):
 161                 t1, t2 = vec[ri[jl]], vec[ri[jh]]
 162                 coeff = (math.cos((ci + 0.5) * math.pi / size) * 2.0)
 163                 # normally DCT would use jl+halfsize not jh, here.
 164                 # to be able to work in-place, the idea is to perform a
 165                 # swap afterwards.  however actually we swap the *indices*
 166                 vec[ri[jl]] = t1 + t2
 167                 vec[ri[jh]] = (t1 - t2) * (1/coeff)
 168                 print ("coeff", size, i, k, "jl", jl, "jh", jh,
 169                        "i/n", (k+0.5)/size, coeff, vec[ri[jl]], vec[ri[jh]])
 170                 k += tablestep
 171             # instead of using jl+halfsize, perform a swap here.
 172             # use half of j/jr because actually jl+halfsize = reverse(j)
 173             # actually: swap the *indices*... not the actual data.
 174             # incredibly... bizarrely... this works *without* having
 175             # to do anything else.
 176             hz2 = halfsize // 2 # can be zero which stops reversing 1-item lists
 177             for ci, (jl, jh) in enumerate(zip(j[:hz2], jr[:hz2])):
 178                 tmp = ri[jl+halfsize]
 179                 ri[jl+halfsize] = ri[jh]
 180                 ri[jh] = tmp
 181                 print ("     swap", size, i, ri[jl+halfsize], ri[jh])
 182         size //= 2
 183
 184     print("post-swapped", ri)
 185     print("transform2 pre-itersum", vec)
 186
 187     n = len(vec)
 188     size = n // 2
 189     while size >= 2:
 190         halfsize = size // 2
 191         ir = list(range(0, halfsize))
 192         print ("itersum", halfsize, size, ir)
 193         for i in ir:
 194             jr = list(range(i+halfsize, i+n-halfsize, size))
 195             print ("itersum    jr", i+halfsize, i+size, jr)
 196             for jh in jr:
 197                 vec[jh] += vec[jh+size]
 198                 print ("    itersum", size, i, jh, jh+size)
 199         size //= 2
 200
 201     print("transform2 result", vec)
 202
 203     return vec
 204
 205
 206 # DCT type III, unscaled. Algorithm by Byeong Gi Lee, 1984.
 207 # See: https://www.nayuki.io/res/fast-discrete-cosine-transform-algorithms/lee-new-algo-discrete-cosine-transform.pdf
 208 def inverse_transform(vector, root=True, indent=0):
 209     idt = "   " * indent
 210     if root:
 211         vector = list(vector)
 212         vector[0] /= 2
 213     n = len(vector)
 214     if n == 1:
 215         return vector, [0]
 216     elif n == 0 or n % 2 != 0:
 217         raise ValueError()
 218     else:
 219         half = n // 2
 220         alpha = [vector[0]]
 221         beta  = [vector[1]]
 222         for i in range(2, n, 2):
 223             alpha.append(vector[i])
 224             beta.append(vector[i - 1] + vector[i + 1])
 225         print (idt, "n", n, "alpha 0", end=" ")
 226         for i in range(2, n, 2):
 227             print (i, end=" ")
 228         print ("beta 1", end=" ")
 229         for i in range(2, n, 2):
 230             print ("%d+%d" % (i-1, i+1), end=" ")
 231         print()
 232         inverse_transform(alpha, False, indent+1)
 233         inverse_transform(beta , False, indent+1)
 234         for i in range(half):
 235             x = alpha[i]
 236             y = beta[i] / (math.cos((i + 0.5) * math.pi / n) * 2)
 237             vector[i] = x + y
 238             vector[-(i + 1)] = x - y
 239             print (idt, " v[%d] = alpha[%d]+beta[%d]" % (i, i, i))
 240             print (idt, " v[%d] = alpha[%d]-beta[%d]" % (n-i-1, i, i))
 241         return vector
 242
 243
 244 def inverse_transform2(vector, root=True):
 245     n = len(vector)
 246     if root:
 247         vector = list(vector)
 248     if n == 1:
 249         return vector
 250     elif n == 0 or n % 2 != 0:
 251         raise ValueError()
 252     else:
 253         half = n // 2
 254         alpha = [0]
 255         beta  = [1]
 256         for i in range(2, n, 2):
 257             alpha.append(i)
 258             beta.append(("add", i - 1, i + 1))
 259         inverse_transform2(alpha, False)
 260         inverse_transform2(beta , False)
 261         for i in range(half):
 262             x = alpha[i]
 263             y = ("cos", beta[i], i)
 264             vector[i] = ("add", x, y)
 265             vector[-(i + 1)] = ("sub", x, y)
 266         return vector
 267
 268
 269 def failllll_transform2(block):
 270     N = len(block)
 271     cos = [0.0] * (N>>1)
 272
 273     front = deepcopy(block)
 274     back = deepcopy(block)
 275
 276     step = 1
 277     j = N *2
 278     half_N = N
 279     prev_half_N = N
 280
 281     while j > 1: #// Cycle of iterations Input Butterfly
 282         half_N = half_N >> 1
 283         current_PI_half_By_N = (math.pi / 2) / prev_half_N
 284         current_PI_By_N = 0.0
 285         step_Phase = current_PI_half_By_N * 2.0
 286         print ("n", N, "cos", end=" ")
 287         for i in range(half_N):
 288             #Precompute Cosine's coefficients
 289             a = current_PI_By_N + current_PI_half_By_N
 290             print (i, a / (math.pi), math.cos(a) * 2, end=" ")
 291             cos[i] = 0.5 / math.cos(a)
 292             current_PI_By_N += step_Phase
 293         print()
 294         k = 0
 295         for x in range(step):
 296             for i in range(half_N):
 297                 shift = k + prev_half_N - i - 1
 298                 back[k + i]          = front[k + i] + front[shift]
 299                 back[k + half_N + i] = (front[k + i] - front[shift]) * cos[i]
 300                 print ("xf coeff", N, j, i, x, "k/kh", k+i, k+half_N+i)
 301             k += prev_half_N
 302         temp = front
 303         front = back
 304         back = temp
 305         j = j >> 1
 306         step = step << 1
 307         prev_half_N = half_N
 308
 309     half_N = 2
 310     prev_half_N = 2
 311     j = 2
 312
 313     print("xform intermediate", front)
 314
 315     while j < N: # Cycle of Out ButterFly
 316         k = 0
 317         print ("out", j, N, step, half_N)
 318         for x in range(step):
 319             for i in range(half_N - 1):
 320                 back[k + (i << 1)] = front[k + i]
 321                 back[k + (i << 1) + 1] = (front[k + half_N + i] +
 322                                           front[k + half_N + i + 1])
 323                 print ("  out", j, x, i, "k", k,
 324                                 "k+i<<1", k+(i<<1), "hh1", k+half_N+i)
 325             back[k + ((half_N - 1) << 1)] = front[k + half_N - 1]
 326             back[k + (half_N << 1) - 1] = front[k + (half_N << 1) - 1]
 327             k += prev_half_N
 328
 329         temp = front
 330         front = back
 331         back = temp
 332         j = j << 1
 333         step = step >> 1
 334         half_N = prev_half_N
 335         prev_half_N = prev_half_N << 1
 336
 337     for i in range(N):
 338         block[i] = front[i] #// Unload DCT coefficients
 339     dN = 2.0
 340     #block[0] = block[0] / dN #// Compute DC.
 341
 342     print("transform2 result", block)
 343     return block
 344
 345
 346 def itersum_explore(vector, indent=0):
 347     idt = "   " * indent
 348     n = len(vector)
 349     if n == 1:
 350         return list(vector)
 351     elif n == 0 or n % 2 != 0:
 352         raise ValueError()
 353     else:
 354         half = n // 2
 355         alpha = [0] * half
 356         beta = [0] * half
 357         for i in range(half):
 358             t1, t2 = vector[i], vector[i+half]
 359             alpha[i] = t1
 360             beta[i] = t2
 361         alpha = itersum_explore(alpha, indent+1)
 362         beta  = itersum_explore(beta , indent+1)
 363         result = [0] * n
 364         for i in range(half):
 365             result[i*2] = alpha[i]
 366             result[i*2+1] = beta[i]
 367         print(idt, "iter-merge", result)
 368         for i in range(half - 1):
 369             result[i*2+1] = ("add", result[i*2+1], result[i*2+3])
 370         print(idt, "iter-result", result)
 371         return result
 372
 373
 374 def itersum_explore2(vec, indent=0):
 375     n = len(vec)
 376     size = n // 2
 377     while size >= 2:
 378         halfsize = size // 2
 379         ir = list(range(0, halfsize))
 380         #ir.reverse()
 381         print ("itersum", halfsize, size, ir)
 382         for i in ir:
 383             jr = list(range(i+halfsize, i+n-halfsize, size))
 384             print ("itersum    jr", i+halfsize, i+size, jr)
 385             for jh in jr:
 386                 vec[jh] = ("add", vec[jh], vec[jh+size])
 387                 print ("    itersum", size, i, jh, jh+size)
 388         size //= 2
 389
 390     #if reverse:
 391     #    vec = [vec[reverse_bits(i, levels)] for i in range(n)]
 392
 393     return vec
 394
 395 if __name__ == '__main__':
 396     n = 16
 397     vec = list(range(n))
 398     levels = n.bit_length() - 1
 399     vec = [vec[reverse_bits(i, levels)] for i in range(n)]
 400     ops = itersum_explore(vec)
 401     #ops = [ops[reverse_bits(i, levels)] for i in range(n)]
 402     for i, x in enumerate(ops):
 403         print (i, x)
 404
 405     n = 16
 406     vec = list(range(n))
 407     levels = n.bit_length() - 1
 408     #vec = [vec[reverse_bits(i, levels)] for i in range(n)]
 409     ops = itersum_explore2(vec)
 410     for i, x in enumerate(ops):
 411         print (i, x)