2021
DOI: 10.3390/e23080983
|View full text |Cite
|
Sign up to set email alerts
|

Source Symbol Purging-Based Distributed Conditional Arithmetic Coding

Abstract: A distributed arithmetic coding algorithm based on source symbol purging and using the context model is proposed to solve the asymmetric Slepian–Wolf problem. The proposed scheme is to make better use of both the correlation between adjacent symbols in the source sequence and the correlation between the corresponding symbols of the source and the side information sequences to improve the coding performance of the source. Since the encoder purges a part of symbols from the source sequence, a shorter codeword le… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 23 publications
0
3
0
Order By: Relevance
“…For lossless decoding, the required minimum code rate (RMCR) of a DSC scheme can be used to present the coding efficiency of that DSC scheme [9]. Table 2 shows the RMCR of DCASACP, SPDCAC, and DAC coding different sources when ( | ) = 0.1.…”
Section: Simulation Experimentsmentioning
confidence: 99%
See 2 more Smart Citations
“…For lossless decoding, the required minimum code rate (RMCR) of a DSC scheme can be used to present the coding efficiency of that DSC scheme [9]. Table 2 shows the RMCR of DCASACP, SPDCAC, and DAC coding different sources when ( | ) = 0.1.…”
Section: Simulation Experimentsmentioning
confidence: 99%
“…The initial probability distribution of all methods is set to 0.5. The purging rate of SPDCAC is set to the maximum value (1/2), and the maximum coding interval expand factor of DAC is set according to [9]. We can find it from the table.…”
Section: Simulation Experimentsmentioning
confidence: 99%
See 1 more Smart Citation