sou123

For Principles of Compiler Design, I recommend the dragon book, i.e. the book by Aho et al and for Digital Signal Processing, there is a book by B. P. Lathi (sorry, I can't recall the title of the book right now) and there is also a book by Oppenheim.

Hi everyone, I have seen that while designing arithmetic circuits such as adder etc, people say that this adder is of complexity O(n) or O(n^2) or something like that. My question is, given a circuit, how can I find its complexity? Is there any book chapter or paper that addresses this issue from the basics. Thanking in advance.