Frame memory compression for high-resolution video coding

Access Full Text

Frame memory compression for high-resolution video coding

For access to this article, please select a purchase option:

Buy chapter PDF
£10.00
(plus tax if applicable)
Buy Knowledge Pack
10 chapters for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
VLSI Architectures for Future Video Coding — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Author(s): Yibo Fan 1 ; Chenhao Gu 1 ; Tianwen Yang 1 ; Ruixue Lei 1
View affiliations
Source: VLSI Architectures for Future Video Coding,2019
Publication date August 2019

This chapter presents a frame memory compression method used in video coding. Frame memory compression compresses the data to be stored in the frame memory in order to reduce the external bandwidth and the related power consumption, as shown in Figure 7.1. When the pixels of a motion-compensated frame have to be written into external DRAM, the frame memory compression engine compresses those pixels. During motion estimation (ME), the frame memory compression engine decompresses the compressed pixels of previous frames and passes them to the video codec. As shown in Figure 7.2, most of the frame memory compression algorithms are composed of three stages: prediction, entropy coding and memory organization [1], which are respectively introduced in Sections 7.1, 7.2 and 7.3.

Chapter Contents:

  • 7.1 Prediction
  • 7.1.1 Differential pulse-code modulation
  • 7.1.2 Intra-mode referenced in-block prediction
  • 7.1.3 Block truncation coding
  • 7.1.4 Hierarchical minimum and difference
  • 7.1.5 Hierarchical average and copy
  • 7.1.6 Modified Hadamard transform
  • 7.1.7 Discrete cosine transform
  • 7.2 Entropy coding
  • 7.2.1 Coding methods in frame compression
  • 7.2.2 Huffman coding
  • 7.2.3 Golomb coding
  • 7.2.4 SFL coding and SBT coding
  • 7.3 Memory organization
  • 7.3.1 Works on bandwidth efficiency
  • 7.3.1.1 Address table compression and reference memory access style of IP module and ME module
  • 7.3.1.2 Pixels duplication and luma–chroma correlated mapping
  • 7.3.1.3 TLB addressing and fixed addressing
  • 7.3.1.4 Dual-mode memory addressing (DMMA): direct block memory access (DBMA) and relative block memory access (RBMA)
  • 7.3.2 Works on power consumption
  • 7.3.2.1 Different-level memory mapping for VCR-LFRC (variable-compression-ratio lossless frame recompression)
  • 7.3.2.2 Main memory and auxiliary memory
  • 7.3.2.3 Partition group table-based compression storage
  • 7.3.3 Other works
  • 7.3.3.1 MB-column-based memory mapping
  • References

Inspec keywords: motion estimation; video coding; motion compensation; image coding; DRAM chips; data compression; video codecs

Other keywords: high-resolution video coding; compressed pixels; Figure 7; motion-compensated frame; memory organization; frame memory compression engine compresses; entropy coding; frame memory compression algorithms; frame memory compression method

Subjects: Computer vision and image processing techniques; Semiconductor storage; Video signal processing; Optical, image and video signal processing; Memory circuits; Image and video coding

Preview this chapter:
Zoom in
Zoomout

Frame memory compression for high-resolution video coding, Page 1 of 2

| /docserver/preview/fulltext/books/cs/pbcs053e/PBCS053E_ch7-1.gif /docserver/preview/fulltext/books/cs/pbcs053e/PBCS053E_ch7-2.gif

Related content

content/books/10.1049/pbcs053e_ch7
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading