[go: up one dir, main page]

Goyal et al., 1999 - Google Patents

Quantized frame expansions as source-channel codes for erasure channels

Goyal et al., 1999

View PDF
Document ID
13007134566613638135
Author
Goyal V
Kovacevic J
Vetterli M
Publication year
Publication venue
Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096)

External Links

Snippet

Quantized frame expansions are proposed as a method for generalized multiple description coding, where each quantized coefficient is a description. Whereas previous investigations have revealed the robustness of frame expansions to additive noise and quantization, this …
Continue reading at www.academia.edu (PDF) (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information or similar information or a subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/65—Purpose and implementation aspects
    • H03M13/6508—Flexibility, adaptability, parametrability and configurability of the implementation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/63—Joint error correction and other techniques
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/39—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes
    • H03M13/41—Sequence estimation, i.e. using statistical methods for the reconstruction of the original codes using the Viterbi algorithm or Viterbi processors
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms

Similar Documents

Publication Publication Date Title
Goyal et al. Quantized frame expansions as source-channel codes for erasure channels
Goyal et al. Quantized frame expansions with erasures
Goyal et al. Multiple description transform coding: Robustness to erasures using tight frame expansions
Baron et al. Distributed compressive sensing
Benedetto et al. Sigma-delta (/spl Sigma//spl Delta/) quantization and finite frames
Goyal et al. Generalized multiple description coding with correlating transforms
Rath et al. Frame-theoretic analysis of DFT codes with erasures
CN102132494B (en) Method and apparatus of communication
US7536299B2 (en) Correlating and decorrelating transforms for multiple description coding systems
Gabay et al. Joint source-channel coding using real BCH codes for robust image transmission
Chou et al. Noise-shaping quantization methods for frame-based and compressive sampling systems
Skoglund Soft decoding for vector quantization over noisy channels with memory
Ooi et al. Fast iterative coding techniques for feedback channels
Rath et al. Performance analysis and recursive syndrome decoding of DFT codes for bursty erasure recovery
Barros et al. Scalable decoding on factor trees: A practical solution for wireless sensor networks
Guionnet et al. Soft decoding of multiple descriptions
Vaezi et al. Systematic DFT frames: Principle, eigenvalues structure, and applications
Heinen et al. Transactions papers source-optimized channel coding for digital transmission channels
Dembo et al. Universal denoising for the finite-input general-output channel
US20030014716A1 (en) Universal lossless data compression
Rath et al. Characterization of a class of error correcting frames for robust signal transmission over wireless communication channels
Ferreira et al. Stable DFT codes and frames
Matsuyama et al. Spectral Distortion Measures for Speech Compression.
Xie et al. Linear analog codes: The good and the bad
Shirazinia et al. Channel-optimized vector quantizer design for compressed sensing measurements