This article introduces a lossless encoding scheme for interleaved input from a fixed number of binary sources, each
one characterized by a known probability value. The algorithm achieves compression performance close to the
entropy, providing very fast encoding and decoding speed. The algorithm can efficiently benefit from independent
parallel decoding units, and it is demonstrated to have significant advantages in hardware implementations over
previous technologies.
KEYWORDS: Data processing, Video processing, Video, Computer programming, Video surveillance, Data storage, Image processing, Field programmable gate arrays, Video compression, Logic
Wyner-Ziv based video codecs reverse the
processing complexity between encoders and decoders
such that the complexity of the encoder can be
significantly reduced at the expense of highly complex
decoders requiring hardware accelerators to achieve
real time performance. In this paper we describe a
flexible hardware architecture for processing the
Belief Propagation algorithm in a real time Wyner-Ziv
video decoder for several hundred, very large, Low
Density Parity Check (LDPC) codes. The proposed
architecture features a hierarchical memory structure
to provide a caching capability to overcome the high
memory bandwidths needed to supply data to the
processors. By taking advantage of the deterministic
nature of LDPC codes to increase cache utilization, we
are able to substantially reduce the size of expensive,
high speed memory needed to support the processing
of large codes compared to designs implementing a
single layer memory structure.
In this paper we consider Wyner-Ziv video compression using rateless LDPC codes. It is shown that the advantages of using rateless LDPC codes in Wyner-Ziv video compression, in comparison to using traditional fixed-rate LDPC codes, are at least threefold: 1) it significantly reduces the storage complexity; 2) it allows seamless integration with mode selection; and 3) it greatly improves the overall system's performance. Experimental results on the standard CIF-sized sequence mobile_and_calendar show that by combining rateless LDPC coding with simple skip mode selection, one can build a Wyner-Ziv video compression system that is, at rate 0.2 bits per pixel, about 2.25dB away from the standard JM software implementation of the H.264 main profile, more than 8.5dB better than H.264 Intra where all frames are H.264 coded intrapredicted frames, and about 2.3dB better than the same Wyner-Ziv system using fixed-rate LDPC coding. In terms of encoding complexity, the Wyner-Ziv video compression system is two orders of magnitude less complex than the JM implementation of the H.264 main profile.
Conference Committee Involvement (2)
Visual Communications and Image Processing 2009
20 January 2009 | San Jose, California, United States
Visual Communications and Image Processing 2008
29 January 2008 | San Jose, California, United States
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.