Searcharxiv⌕ Search

arXiv · 2611.18942

Surrogate Symbols in Wireless Communications

Abstract

Co-channel interference (CCI), caused by the inevitable aggressive channel reuse in dense deployments, remains a critical bottleneck for current and future wireless communication systems. In this paper, we address this bottleneck in an N-co-channel wireless communications network of single-antenna transmitters and receivers. The limiting case of this problem leads to a novel "thought experiment": If each receiver's own desired channel link is simultaneously completely blocked, can a Maximum Likelihood Detection at each receiver still recover its transmitted symbol? In the traditional way of thinking, the answer is no: The receiver obtains nothing but co-channel interference (CCI) plus thermal noise, and a receiver-side phase rotation cannot help, since there is no desired signal to align. Given only the channel matrix H -- and no knowledge of the transmitted symbols -- can the transmitters' phases be chosen so that the received signal becomes "almost" the desired symbol at every receiver? We show that the answer is yes. We first develop the underlying framework for the general case (nonzero own-channel link case), turning classical co-channel systems into a novel discrete phase-optimization problem, "Game of Phases: Surrogate Symbol Optimization", and present two algorithms, "Minimum Phased-Interference Power algorithm (MiPIP)" and "Maximum Phased-Interference Support (MaPRIS)". We then show that the MaPRIS resolves the thought experiment: it converts hostile CCI into an "almost" desired symbol even when the own desired channel link is zero, yielding the counter-intuitive result that higher CCI variance yields higher SINR. Extensive simulation results confirm the findings. The gain promised by the proposed algorithms comes on top of any other CCI reduction techniques as our framework here is based on a bottom-line baseband model.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zekeriya Uykan. 2026-11-13. Surrogate Symbols in Wireless Communications. https://searcharxiv.com/abs/2611.18942

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Frames over finite fields with respect to the Galois inner product and their connections to self-orthogonal and LCD codes

In this paper, we generalize the theory of frames to vector spaces over finite fields equipped with the $\ell$-Galois inner product. We introduce $\ell$-Galois analogues of fundamental concepts in frame theory and investigate extensions of existing results to the $\ell$-Galois setting. In particular, we establish necessary and sufficient conditions for a given matrix to be the $\ell$-Galois Gram matrix of a frame and show that such frames are unique up to isometry. We also extend Gerzon's bound to $\ell$-Galois equiangular systems and show that equality in this bound yields an $\ell$-Galois equiangular tight frame. Furthermore, we investigate the connections between $\ell$-Galois frames and $\ell$-Galois self-orthogonal and LCD codes over finite fields. We establish necessary and sufficient conditions for constructing $\ell$-Galois equiangular tight frames from self-dual codes, generalizing existing results by Shi et al. on the relationship between frames and self-dual codes over finite fields. Beyond self-dual codes, we provide sufficient conditions for constructing $\ell$-Galois equiangular tight frames from linear codes using their automorphism groups, together with explicit examples.

cs.IT↗

Efficient and rate-optimal list-decoding in the presence of minimal feedback

Given a channel with length-$n$ inputs and outputs over the alphabet $\{0,1,\ldots,q-1\}$, and of which a fraction $\varrho \in (0,1-1/q)$ of symbols can be arbitrarily corrupted by an adversary, a fundamental problem is that of communicating at rates close to the information-theoretically optimal values, while ensuring the receiver can infer that the transmitter's message is from a ``small" set. While the existence of such codes is known, and constructions with computationally tractable encoding/decoding procedures are known for large $q$, we provide the first schemes that attain this performance for any $q \geq 2$, as long as low-rate feedback (asymptotically negligible relative to the number of transmissions) from the receiver to the transmitter is available. For any sufficiently small $\varepsilon > 0$ and $\varrho \in (1-{1}/{q}-Θ(\sqrt{\varepsilon}))$ our minimal feedback scheme has the following parameters: Rate $1-H_q(\varrho) - \varepsilon$ (i.e., $\varepsilon$-close to information-theoretically optimal -- here $H_q(\varrho)$ is the $q$-ary entropy function), list-size $\exp\left(\mathcal{O}\left(\varepsilon^{-3/2}\log^2(1/\varepsilon)\right)\right)$, computational complexity of encoding/decoding $n^{\mathcal{O}(\varepsilon^{-1}\log(1/\varepsilon))}$, storage complexity $\mathcal{O}(n^{η+1}\log n)$ for a code design parameter $η>1$ that trades off storage complexity with the probability of error. The error probability is $\mathcal{O}(n^{-η})$, and the (vanishing) feedback rate is $\mathcal{O}({1}/{\sqrt{\log(n)}})$. Our full-feedback scheme has zero probability of error and minimal storage complexity, while the other parameters are the same as the vanishing rate feedback scheme.

cs.IT↗

On concatenation of matrices for reversible linear codes over a finite commutative ring and applications to DNA codes

In this paper, we develop a generalized framework for constructing reversible linear, reversible self dual and reversible DNA codes using a matrix-theoretic approach based on involutory matrices. The proposed concatenation scheme gives a large class of generator matrices and yields codes with good parameters. The construction is carried out at the level of linear codes and then extended to DNA codes. Using a matrix product approach, we provide a unified method for analysis and proof. Further, we resolve an open problem raised by Oztas et.al. and also we correct and improve some results of them.

cs.IT↗