2014
DOI: 10.1109/tsp.2014.2300039
|View full text |Cite
|
Sign up to set email alerts
|

Distributed Source-Channel Coding Based on Real-Field BCH Codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
6
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 17 publications
(6 citation statements)
references
References 46 publications
0
6
0
Order By: Relevance
“…(b) Bernoulli-Gaussian. quantized BU source using RSSC (12), BCHSC (13), AC, Huffman encoder, and run length encoding, plus the Shannon's lower bound (45), as a function of the average sparsity ratio p, for b = 8 bits/sample. It is noted that the rates indicated by both RSSC and AC are coincident, while the BCHSC can achieve a higher compression gain (up to 15% compared to RSSC).…”
Section: A Performance Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…(b) Bernoulli-Gaussian. quantized BU source using RSSC (12), BCHSC (13), AC, Huffman encoder, and run length encoding, plus the Shannon's lower bound (45), as a function of the average sparsity ratio p, for b = 8 bits/sample. It is noted that the rates indicated by both RSSC and AC are coincident, while the BCHSC can achieve a higher compression gain (up to 15% compared to RSSC).…”
Section: A Performance Analysismentioning
confidence: 99%
“…For example, a compression scheme for continuous sources considering that the decoder has side information, i.e., a noisy version of the source, is proposed in [38]. Several works have discussed designing codes for similar problems, e.g., multi-terminal source coding [39]- [42], successive refinement source compression [43], and joint source channel coding [44], [45].…”
Section: Introductionmentioning
confidence: 99%
“…As http://asp.eurasipjournals.com/content/2013/1/166 we also demonstrate in the result section, the performance of a feedback-free non-rate-adaptive code is limited by the block length and for short-and medium-length codes clearly inferior compared with the performance of its rateadaptive counterpart. In the context of non-rate-adaptive codes, quasi-arithmetic codes for DSC have been investigated in [12], and in the field of real-number codes, BCH-DFT codes [13] have been proposed.…”
Section: H(x|y ) Is Lowmentioning
confidence: 99%
“…Posterior to the RS decoding removing the noise, the residual effect of ISI can be removed by a Galois field equalizer in the second stage. The judicious selection of the code parameters can effectively remove the problem of high PAPR and BER [15]. BCH codes have the ability to recover the synchronization problem because of its self synchronizing capability.…”
Section: Introductionmentioning
confidence: 99%