Suppose I have L bits. First, I want to multiply the L bits with L orthogonal codes of length N, and then I want to add all the vectors.
So, first, I have to do a scalar multiplication with a vector and then an addition. Please refer to the figure for more clarity.
What will be the Computational Complexity (in terms of order O) of the above operations also shown in the figure? Thanks in advance.
