Adaptive Rice parameter updates shorten HEVC transform coefficient codewords, reducing encoding complexity while improving compression efficiency.
Compressive measurements let one encoded video stream reconstruct at different resolutions and channel capacities without layered streams.
Dedicated search and subpixel engines offload SAD-based motion estimation to improve video compression speed with lower design complexity.
Adaptive cache mapping reorganizes motion estimation search windows by frame width and reference count to cut memory bandwidth in video coding.
Switches between frequency-domain repetition or interpolation and time-domain concealment to limit modulation noise and preserve audio quality.
Adaptive context selection uses prior symbol values and non-zero coefficient counts to improve prediction error coding and cut video data rate.
Storing one shared content component plus separate per-copy data reduces media storage while preserving distinct licensed copies.
A shared symbol sequence lets two data values trade accuracy during compression, improving reconstruction quality without complex decompression.
Adaptive probability tables and scanning orders improve entropy coding of transform coefficients across varied video content with manageable complexity.
Adaptive threshold decoding and scan-specific context templates improve transform coefficient coding throughput and compression in video bitstreams.
Subband MCTF and wavelet decomposition enable flexible spatial and temporal video scalability without the coding loss of conventional layered schemes.
Two-dimensional last-coefficient coordinates cut CABAC serial coding load, improving transform coefficient compression and decode speed.
Adaptive coding, modulation, and physical-layer retransmission improve DVB-C2 quality of service under burst noise and changing channels.
Two independent receive chains let CPE sense out-of-band channels while receiving WRAN signals and transmitting without quiet periods.
Bit reordering groups symbols with independent contexts so entropy coding can run in parallel, boosting video decoding throughput.
Adaptive weighting of reference pictures improves motion-compensated prediction in fading video sequences, cutting encoding bits and boosting compression.
Multiplexing normal and turbo streams with variable coding rates improves ATSC VSB reception in poor channels while limiting power use.
Unidirectional motion search results narrow bi-prediction block sizes and search centers, cutting coding load while preserving compression ratio.
Spatial and temporal motion vector prediction improves B-picture encoding around scene changes and intra-coded blocks while reducing bitrate.
By encoding low and high subbands separately and compressing gain differences, this case cuts bit rate while preserving tone quality.
Basic codebook vectors combined with adjustment vectors cut vector quantization storage and calculation load while preserving encoding quality.
Maps Gaussian integer signals to distance-ordered lattice values so Golomb codes encode them efficiently without frequency tables.
Neighbor blocks coded in direct or skip mode supply calculated motion vectors, improving prediction accuracy and video coding efficiency.
Compact erasure-table storage preserves deinterleaving error flags for DVB FEC while cutting block deinterleaver memory and hardware cost.
When direct or skip neighbors lack explicit vectors, derived vectors from other blocks improve motion prediction accuracy and coding efficiency.
Dual-stage multiple-description coding spreads voice quality loss across descriptions to improve decoding under high packet loss.
Neighbor-based non-zero coefficient prediction selects the best VLC table for each block, improving picture coding efficiency and decoding accuracy.
Neighbor pixel prediction selects the best edge mode in 2×2 blocks to compress and restore image edges with better efficiency and picture quality.
Re-adding memory management commands only to the immediately previous picture avoids ambiguous picture identification and decoding faults.
When audio frame errors persist, switching from frequency-domain concealment to time-domain recovery helps avoid modulation noise and protect sound quality.
A robust sub-channel with supplementary reference signals improves ATSC reception under weak signals, Doppler fading, and dynamic multipath.
A flying-adder DCXO replaces VCXO chips by tuning the local clock from MPEG2 program clock references with precise, stable control.
Intentional frame-number gaps are marked so decoder buffers supply filler frames, avoiding false error correction and sync loss.
Re-adding memory management commands only to the immediately previous picture prevents decoding errors and inconsistent memory status.
Dual-port memory and context address look-ahead remove CABAC weight-update bottlenecks, doubling throughput with minimal added logic.
Multiplexed normal and turbo streams with variable coding rates improve ATSC broadcast reception in poor channels while lowering receiver power use.
Neighbor-based prediction of non-zero coefficients selects better VLC tables, improving picture coding efficiency and decoding accuracy.
TPS carriers provide backup channel references in DVB-OFDM receivers, improving data-carrier interpolation when pilots are degraded by fading and noise.
Correlation data between pixel and audio clocks helps HDMI receivers stabilize playback timing, reducing jitter and improving sound quality.
Conditional pull-down, repeat-picture, and field-order syntax improves interlaced and progressive video decoding while saving bitrate.
Parallel re-normalization and ternary-to-binary conversion cut clock cycles in CABAC, enabling real-time video coding without sacrificing image quality.
Surplus-bit predictive coding keeps fixed data size per pixel block, reducing quantization damage while preserving random pixel access.
Separate forward and backward motion-vector buffers improve interlaced B-frame prediction, boosting rate-distortion efficiency with lower coding overhead.
Boundary sample correction uses current and previous frame shift amounts to preserve continuity and improve interframe coding efficiency.
Independent reference picture markers let decoders start from selected frames, improving random access and recovery from frame loss.
Separate directional and omni receive chains enable out-of-band sensing and neighboring signal decoding without interrupting WRAN transmission.
By coding the last non-zero coefficient position first, video blocks can be compressed with lower bitrate and less coding complexity.
A two-stage band search pinpoints high-error frequency regions with low computation, improving scalable speech coding quality and efficiency.
A two-stage subband search pinpoints high-error frequency bands with less computation, improving scalable speech coding quality and efficiency.
Parallel syntax calculation and temporary data storage speed H.264 CAVLC coding by removing sequential waits between dependent elements.
Temperature, voltage, and calibration updates let a direct period synthesizer stabilize crystal-less oscillator frequency without quartz.
N-ary image conversion reduces reference-data transfer and motion-search computation while adaptive intra/inter prediction keeps coding efficiency high.
By indexing only selected symbols, this compression approach cuts dictionary size and comparisons while preserving effective match-range encoding.
Combined LLR reordering, de-reordering, and demapping remove LDPC decoder buffers to cut memory use, die size, and power.
Dynamic switching between equal and unequal FEC protects critical video packets during bursty network errors without adding bandwidth overhead.
By limiting references to intra or post-intra pictures, this case prevents error propagation and preserves accurate moving picture decoding.
Hardwired transform matrices and transposed writeback cut H.264 forward and inverse transform cycles while preserving software flexibility.
Hardwired transform matrices and SIMD processing cut H.264 Hadamard transform cycles while avoiding matrix loading and transposition overhead.
Overlap regions in alternating SPU buffers keep VLC codewords intact across buffer boundaries, preventing overflow and decoding errors.
Temporal-distance weighting refines motion vectors and block interpolation to improve B-picture prediction accuracy and coding efficiency.
A bypass-based Absolute-3 mode cuts CABAC context estimation and model updates in HEVC lossless coding to improve high bit-rate throughput.
Variable weighting of two motion-compensated blocks improves B-picture prediction accuracy and coding efficiency, especially in fading scenes.
Independent luma and chroma range reduction improves low-bitrate video compression while limiting blocking and ringing artifacts.
Selective intensity compensation across interlaced reference fields improves motion prediction accuracy while limiting bit rate overhead.
Jointly coding both field types and their order cuts signaling bits for interlaced video while preserving decoder compatibility.
Selective inter-pixel filter switching improves predictive picture coding quality while limiting processing load and energy use in mobile video devices.
Selective inter-pixel filter switching improves decoded picture quality while limiting processing load and hardware use in mobile video coding.
Direct interval renormalization removes CABAC iteration bottlenecks, speeding video encoding while preserving correct probability updates.
By separating sign and absolute vector codes, this decoding approach avoids irregular factorial calculations and cuts audio coding complexity.
Skipped macroblocks and joint field-frame mode coding cut interlaced video bit rate while preserving motion prediction accuracy and quality.
Selective motion vector block patterns cut macroblock signaling overhead while preserving flexible motion compensation in interlaced video.
A single joint codebook supports selectable quantization levels, cutting encoder-decoder memory use in multi-rate speech and audio coding.