Analysis on Tailed Distributed Arithmetic Codes for Uniform Binary Sources

Fang, Yong; Stankovic, Vladimir; Cheng, Samuel; Yang, En-hui

doi:10.1109/tcomm.2016.2599535

Cited by 8 publications

(24 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We notice that DAC is a nonlinear code, so its theoretical analysis is more involved than that of linear codes, such as turbo codes, LDPC codes, and polar codes. Though some theoretical analyses have been seen for IEAC in our prior work [21], [22], [23], [24], [25], hardly any theoretical analysis is found for BPAC up to now. Actually, the analysis of BPAC is much more difficult than that of IEAC, so this paper will still focus on IEAC as our prior work.…”

Section: B Theoretical Analyses Of Dacmentioning

confidence: 99%

See 1 more Smart Citation

Codebook Cardinality Spectrum of Distributed Arithmetic Coding for Independent and Identically-Distributed Binary Sources

Fang

Stankovic

2020

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

It was demonstrated that, as a nonlinear implementation of Slepian-Wolf Coding (SWC), Distributed Arithmetic Coding (DAC) outperforms traditional Low-Density Parity-Check (LPDC) codes for short code length and biased sources. This fact triggers research efforts into theoretical analysis of DAC. In our previous work, we proposed two analytical tools, Codebook Cardinality Spectrum (CCS) and Hamming Distance Spectrum (HDS), to analyze DAC for Stationary Memoryless Binary Sources (SMBS) with uniform distribution. This paper extends our work on CCS from uniform SMBS to biased SMBS. We begin with the final CCS and then deduce each level of CCS backwards by recursion. The main finding of this paper is that the final CCS of biased SMBS is not uniformly distributed over [0, 1). This paper derives the final CCS of biased SMBS and proposes a numerical algorithm for calculating CCS effectively in practice. All theoretical analyses are well verified by experimental results.

show abstract

Section: B Theoretical Analyses Of Dacmentioning

confidence: 99%

“…The deduction of HDS in [24] is very complex, so it is simplified in [25]. Besides HDS, [25] defines the Codebook Cardinality Spectrum (CCS), which is an ensemble of Probability Density Functions (PDF).…”

Section: B Theoretical Analyses Of Dacmentioning

confidence: 99%

Codebook Cardinality Spectrum of Distributed Arithmetic Coding for Independent and Identically-Distributed Binary Sources

Fang

Stankovic

2020

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

show abstract

“…Conditional CCS The pdf of U 0 given X j = b ∈ B is called the conditional CCS given X j = b, and denoted by f 0,j (u|b) [27].…”

Section: Review On Codebook Cardinality Spectrummentioning

confidence: 99%

“…The above phenomena inspire some improvements of DAC codes, e.g., permutating codewords in each codebook [24], mapping the last few symbols of each sequence onto nonoverlapped intervals [15], [16], [27], etc. After these improvements, DAC codes may outperform LDPC codes and turbo codes, especially for short sequences [15], [16], [24], [27].…”

Section: Properties Of Decoding Errorsmentioning

confidence: 99%

See 1 more Smart Citation

Hamming Distance Spectrum of DAC Codes for Equiprobable Binary Sources

Fang

Stankovic

Cheng

et al. 2016

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

This version is available at https://strathprints.strath.ac.uk/55413/ Strathprints is designed to allow users to access the research output of the University of Strathclyde. Unless otherwise explicitly stated on the manuscript, Copyright © and Moral Rights for the papers on this site are retained by the individual authors and/or other copyright owners. Please check the manuscript for details of any other licences that may have been applied. You may not engage in further distribution of the material for any profitmaking activities or any commercial gain. You may freely distribute both the url (https://strathprints.strath.ac.uk/) and the content of this paper for research or private study, educational, or not-for-profit purposes without prior permission or charge.Any correspondence concerning this service should be sent to the Strathprints administrator: strathprints@strath.ac.ukThe Strathprints institutional repository (https://strathprints.strath.ac.uk) is a digital archive of University of Strathclyde research outputs. It has been developed to disseminate open access research outputs, expose data about those outputs, and enable the management and persistent access to Strathclyde's intellectual output. Abstract-Distributed Arithmetic Coding (DAC) is an effective technique for implementing Slepian-Wolf coding (SWC). It has been shown that a DAC code partitions source space into unequalsize codebooks, so that the overall performance of DAC codes depends on the cardinality and structure of these codebooks. The problem of DAC codebook cardinality has been solved by the so-called Codebook Cardinality Spectrum (CCS). This paper extends the previous work on CCS by studying the problem of DAC codebook structure. We define Hamming Distance Spectrum (HDS) to describe DAC codebook structure and propose a mathematical method to calculate the HDS of DAC codes. The theoretical analyses are verified by experimental results.

show abstract

5G‐oriented non‐orthogonal multiple access technology

Zhang

Yang

2020

Int J Communication

View full text Add to dashboard Cite

Summary With the changes of the times and the rapid development of the mobile Internet and the Internet of Things, network communications are facing increasingly severe challenges. Due to the user exclusivity of the orthogonal resources of the existing orthogonal multiple access technology, it is difficult for the number of accessible users and the spectral efficiency to meet the application requirements of network communications. 5G technology will meet the diverse business needs of people in various scenarios such as life, work, leisure, and transportation. This paper analyzes the 5G‐oriented non‐orthogonal multiple access (NOMA) technology and designs and implements a NOMA technology simulation platform laboratory based on 5G technology. The entire simulation experiment adopts a modular design concept so that it can be modified and extended in the future network communication. In this paper, the user pairing scheme and power allocation algorithm of NOMA technology are studied in depth. For the user pairing scheme, this paper adopts two schemes: traversal search pairing scheme and grouping pairing scheme. For the same algorithm for power allocation, this paper studies two suboptimal power allocation algorithms including fixed power allocation and partial transmission power allocation. Simulation experiments show that the average cell throughput and cell edge user throughput of NOMA are slightly lower than when the traversal search pairing scheme is adopted: the average cell throughput has decreased by approximately 4%, and the cell edge user throughput has decreased by approximately 1.6%. The packet pairing scheme is a compromise between complexity and throughput performance. For different power allocation factor values, the overall throughput performance of some transmission power allocation algorithms is better than the flower pollination algorithm (FPA).

show abstract

Analysis on Tailed Distributed Arithmetic Codes for Uniform Binary Sources

Cited by 8 publications

References 20 publications

Codebook Cardinality Spectrum of Distributed Arithmetic Coding for Independent and Identically-Distributed Binary Sources

Codebook Cardinality Spectrum of Distributed Arithmetic Coding for Independent and Identically-Distributed Binary Sources

Hamming Distance Spectrum of DAC Codes for Equiprobable Binary Sources

5G‐oriented non‐orthogonal multiple access technology

Contact Info

Product

Resources

About