Transforms predicted and input frames separately, then subtracts only essential differences to cut video encoding memory, computation, and power.
Adaptive variable-length codewords, block segmentation, and motion handling cut video bitrate while preserving image quality for real-time transmission.
Selective in-loop filtering on same-polarity field lines cuts interlaced blocking artifacts while preserving field structure and coding efficiency.
Adaptive switching between frequency- and time-domain concealment cuts modulation noise during long audio frame errors.
Zero-value detection in row and column subsets lets a 2D transform skip redundant operations, cutting power use and processing cycles.
A line buffer and frequency synthesizer de-spread spread-spectrum video clocks while limiting jitter and preserving receiver synchronization.
Multiple candidate reference frames let duplex Wyner-Ziv video frames decode forward or backward, improving error resilience and splicing flexibility.
Field-polarity-aware motion vector prediction improves interlaced video compression by selecting same or opposite predictors from neighboring blocks.
Segment-based parameter selection uses residual amplitude and prediction effectiveness to cut code length in time-series predictive coding.
Variable weighting of forward and backward reference blocks improves motion prediction accuracy and coding efficiency, especially in fading scenes.
Temporal-distance weighting improves B-picture block prediction by refining forward and backward interpolation for better coding efficiency.
A dual-buffer VLC bitstream generator fits variable-length coded data into fixed-width output while handling overflow without stalling.
Precomputed UI windows and thresholded counters help a Manchester-II decoder separate sync patterns from data despite clock jitter and variance.
Adaptive encoding and motion estimation keep video compression within available memory bandwidth to sustain real-time encoding.
Iterative convex projection restores lossy coded signals so they can be re-encoded losslessly while preserving embedded information.
Precomputed context-based lookup tables estimate arithmetic-coded bit length in real time while preserving high precision and limiting storage.
Selective inter-pixel filtering improves low-bit-rate picture quality while reducing decoding load and power use in mobile video coding.
Multi-resolution search enables wide coarse matching and local block refinement, improving small-block motion vectors with lower compute and memory use.
Buffered intermediate data from pre-decoded frames improves video transcoding quality while reducing computation, memory use, and bit rate control load.
Switching between uniform and non-uniform QAM constellations by LDPC coding rate improves AWGN channel gain and cable system capacity.
Four-field motion vectors and polarity-aware predictors improve interlaced P-frame coding by reducing skewed prediction and distortion.
Adaptive weighting of reference pictures improves fading-sequence prediction accuracy while avoiding unnecessary decoding overhead.
Counter-based UI window calculation decodes DisplayPort AUX Manchester-II signals without CDR, improving sync detection under clock variance.
Separate forward and backward motion-vector buffers improve interlaced B-field prediction accuracy, compression efficiency, and low-CPU decoding.
Restoring high-frequency detail from lower coding layers improves interlayer prediction accuracy and reduces enhancement-layer data.
Multiple interpolation filters are switched with motion vectors to improve fractional-pixel prediction accuracy and video encoding efficiency.
Predicting CABAC coding amount before binarization lets each macroblock switch early to I_PCM or coded output, speeding image processing.
Pixel colors are encoded by tracking when the same color last appeared, cutting graphical update data for real-time image replication.
A conversion layer turns QR codes, text, and bar codes into standard-compliant data so existing processors can store and use them.
Adaptive CABAC context models enable macroblock-level field/frame encoding for interlaced video, improving compression efficiency.
Adaptive envelope parameters track changing quantization-index statistics, improving lossless arithmetic coding efficiency with packet-level decoding support.
By separating sign and magnitude coding, this audio vector coding approach avoids irregular factorial calculations and reduces storage data.
Scanning coefficients from high to low frequency and switching tables only upward preserves biased probabilities for better coding efficiency.
Two-layer run-level coding cuts video bitrate with smaller zoned and embedded Huffman tables, reducing memory and decode workload.
Hybrid predictor polarity and neighbor motion vectors improve interlaced field compensation, cutting bit rate while preserving video quality.
Jointly coding reference field selection and differential motion vectors cuts interlaced video bit rate overhead while improving prediction accuracy.
Uses byte-offset correlation and start code timestamps to seek variable-bitrate audio-video streams without index tables.
Representative motion vector selection improves direct prediction in interlaced B-pictures while lowering decoding complexity.
Joint variable-length coding of macroblock type, motion vectors, and block patterns cuts signaling overhead in interlaced video.
Adaptive signaling lets interlaced forward-predicted fields use one or two reference fields, improving motion compensation and lowering bit rate overhead.
Compressed bitplane signaling marks forward or not-forward modes in interlaced B-fields, cutting coding overhead while preserving prediction accuracy.
Selecting same- or opposite-polarity motion vector predictors improves interlaced video compression by lowering bitrate and preserving quality.
Multiple decoding tables with completion flags adjust reference bit length to balance table memory and decoding speed.
Using 4MV only in forward and backward interlaced B-picture modes improves motion compensation while limiting coding overhead and decode complexity.
Band-specific dictionaries and masked sparse basis selection cut matching-pursuit complexity while improving PSNR and bit cost.