EEMA is Extended Exponential Moving Average

	Yn = aXn + bYn-1

	if b = (1-a), that is the EMA

PSEUDO CODE

	Declaration:
		N = N					# const int, Number of elements
		X[] = {x0,x2,....xn}	# array of double, elements I/O buffer, zero-base index, i.e. n = N-1
		a = a					# const double, coefficient a
		b = b					# const double, coefficient b
		ini = Y[-1]				# const double, initial value
		r						# double, accumulator

	Process:
		r = ini
		loop i = 0 to N-1
			r = a*X[i] + b*r
			X[i] = r

	Return:
		X[] = {y0,y2,....yn}	# EEMA(X) in X


HPF Variant

	Yn = Yn-1 - (aXn + bYn-1)

PSEUDO CODE

	Declaration:
		N = N					# const int, Number of elements
		X[] = {x0,x2,....xn}	# array of double, elements I/O buffer, zero-base index, i.e. n = N-1
		a = a					# const double, coefficient a
		b = b					# const double, coefficient b
		ini = Y[-1]				# const double, initial value
		r,s						# double, accumulators

	Process:
		r = ini
		loop i = 0 to N-1
			s = X[i] - r
			r = a*X[i] + b*r
			X[i] = s

	Return:
		X[] = {y0,y2,....yn}	# HPF(X) in X
