Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A Depth-First Based Distributed Arithmetic Code Decoding Method

A depth-first, decoding method technology, applied in the field of distributed arithmetic code decoding based on depth-first, can solve problems such as waste of resources

Inactive Publication Date: 2021-02-02
CHANGAN UNIV
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

At the same time, in order to prevent overflow, the decoder needs to allocate space for the end nodes of all paths, and the memory can only be released after decoding, resulting in a waste of resources

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Depth-First Based Distributed Arithmetic Code Decoding Method
  • A Depth-First Based Distributed Arithmetic Code Decoding Method
  • A Depth-First Based Distributed Arithmetic Code Decoding Method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0037] The technical solution of the present invention will be described in further detail below in conjunction with the accompanying drawings and specific embodiments.

[0038] Principle of distributed arithmetic code decoding based on depth first

[0039] Depth-first decoding decomposes distributed arithmetic code decoding into a pass-through process, starting from some non-leaf nodes (only initially from the root node) and usually ending at a leaf node. While passing through each fork node, the decoder always chooses the most probable, i.e., child node with the greater overall metric, while storing another node in the list. We call the path ending at the end of the stored child node paused. In this way, the action of selecting storage is repeated until a leaf node is reached or some termination conditions are met. This whole process is called a transfer. Then, the decoder chooses the best, i.e., the paused path with the largest total metric from the list of paused paths t...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a distributed arithmetic code decoding method based on depth-first, and the method comprises the following contents: a data structure and a global variable; depth-first decoding summary; single-path searching; decoder behaviors at a fork node; compression end node pause path list; online memory releasing; optimal pause path selection; and ending conditions. According to the invention, compared with the conventional breadth-first decoding, the depth-first decoding is better in short code execution.

Description

technical field [0001] The invention relates to a depth-first decoding method, in particular to a depth-first-based distributed arithmetic code decoding method. Background technique [0002] Distributed source coding is based on Slepian-Wolf theory and Wyner-Ziv theory, and is one of the hot research directions in the field of coding. Distributed Arithmetic Coding (DAC) is a coding scheme based on the basic theory of distributed source coding, which is generated by introducing arithmetic code as the core of codec. Extreme performance, and widely recognized and applied. Due to the existence of overlapping areas in distributed arithmetic codes, an incomplete binary decoding tree will be formed as the decoding proceeds. The traditional distributed arithmetic code decoding scheme is implemented based on breadth-first search, and the Hamming distance between the minimum full path and the side information is unknown before reaching the leaf node, so it is necessary to visit a la...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H04L1/00H03M7/40
CPCH03M7/4006H04L1/0054
Inventor 方勇崔华王璇关琦
Owner CHANGAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com