PROJECT TITLE :
LLM Integer Cosine Transform and its Fast Algorithm
Existing video coding standards use solely 4$,times,$4 and eight$,times,$eight transforms for energy compaction. Recent research has found that the utilization of larger transforms, such as sixteen$,times,$sixteen, along with the existing transforms will improve coding performance particularly in high-definition (HD) videos which are turning into additional and a lot of common. This raises the interest of seeking high-performance higher-order transforms with low computation demand. During this paper, a method to derive orthogonal integer cosine transforms is proposed. The order-$2N$ remodel is outlined using the order-$N$ remodel. A family of these integer transforms, Loeffler, Ligtenberg, and Moschytz (LLM) integer cosine remodel, is derived using this methodology. Its quick algorithm structure is the same as LLM fast discrete cosine transform (DCT) algorithm but requires integer operations only. This new family of transforms isn't solely very shut to the DCT however conjointly has excellent coding performance.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here