This paper presents analysis of video compression based on block SVD Algorithm. Compression is done to reduce the volume of data to be transmitted, to reduce the bandwidth required for transmission and to reduce the storage requirements. Video is a sequence of still images representing scenes in motion. Current video compression standards like MPEG, H.26x series are highly computationally expensive and hence they are not suitable for real time applications. Current applications like video calling, video conferencing require low complexity video compression algorithms. In addition, the paper investigates the effect of rank in block SVD decomposition to measure the quality in terms of compression ratio and PSNR and also reduce the complexity. The advantage of using the block SVD is the property of energy compaction and its ability to adapt to the local statistical variations of an image.