2017
DOI: 10.1109/tcomm.2017.2695197
|View full text |Cite
|
Sign up to set email alerts
|

Analog Transmission of Correlated Sources Over Fading SIMO Multiple Access Channels

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
28
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
7

Relationship

5
2

Authors

Journals

citations
Cited by 9 publications
(28 citation statements)
references
References 26 publications
0
28
0
Order By: Relevance
“…The proposed decoder relies on the use of a sphere decoder to lower the overall complexity while computing the numerical integrals involved in the MMSE decoding. Although the approach resembles that in [12], the transformations over the original mapping function and the mathematical derivation of the searching lattice are different. • A practical optimization of the DQLC mapping parameters which enables its utilization on scenarios with a moderate number of transmit users.…”
Section: A Contributionsmentioning
confidence: 99%
See 1 more Smart Citation
“…The proposed decoder relies on the use of a sphere decoder to lower the overall complexity while computing the numerical integrals involved in the MMSE decoding. Although the approach resembles that in [12], the transformations over the original mapping function and the mathematical derivation of the searching lattice are different. • A practical optimization of the DQLC mapping parameters which enables its utilization on scenarios with a moderate number of transmit users.…”
Section: A Contributionsmentioning
confidence: 99%
“…Sphere decoding is a general strategy to search for the closest vectors in a lattice and it was originally proposed to detect digital signals in MIMO transmissions [11]. This strategy has already been applied to lower the computational cost of the MMSE estimation when transmitting analog symbols using modulo mappings [12]. In this paper, we mathematically derive the lattice corresponding to DQLC-based mappings and apply the sphere decoder to the obtained lattice.…”
Section: Introductionmentioning
confidence: 99%
“…Equation (33) determines the maximum number of bits which can be transmitted at each channel use with an arbitrarily low probability of error, whereas (31) determines the minimum number of bits required to achieve the distortion given by the parameter θ. Since we are transmitting two source symbols in two channel uses, ( 31) and ( 33) can be equated directly, searching for the parameter θ which satisfies such equality.…”
Section: A Performance Bound For Cfmentioning
confidence: 99%
“…We boldly and explicitly contrast our contributions to the state-of-the-art in Table II and detail them below: 1 We reduce the complexity of SISO CS decoding by using a tree search to find the most likely combination of the source signal and associated sensor values before using the SD to find the set of likely alternative hypotheses, in order to glean high quality extrinsic information, which can be iteratively exchanged with the concatenated channel decoder. Unlike the traditional SD routinely used for JSCC or for MIMO detection based on the distance between adjacent points [27]- [29], the proposed scheme performs tree search-based SD relying on the input Logarithmic-Likelihood Ratios (LLRs). Furthermore, our scheme exploits the additional constraints imposed by the sparsity upper bound K and the presence/absence of connectivity between the source signals and sensors, which make the application of SD a challenge.…”
Section: Introductionmentioning
confidence: 99%