This paper examines the computational and memory complexity of a spatial domain (SD) and in-band (IB) wavelet video codec based on Motion Compensated Temporal Filtering (MCTF). It is indicated how complexity scalability can be achieved in such videocodecs, and some of the trade-offs between complexity and coding performance are analyzed.