Search arXiv⌕ Search

arXiv · 0704.3019

Arbitrary Rate Permutation Modulation for the Gaussian Channel

Abstract

In this paper non-group permutation modulated sequences for the Gaussian channel are considered. Without the restriction to group codes rather than subsets of group codes, arbitrary rates are achievable. The code construction utilizes the known optimal group constellations to ensure at least the same performance but exploit the Gray code ordering structure of multiset permutations as a selection criterion at the decoder. The decoder achieves near maximum likelihood performance at low computational cost and low additional memory requirements at the receiver.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Oliver Henkel. 2007-04-23. Arbitrary Rate Permutation Modulation for the Gaussian Channel. https://arxiv.org/abs/0704.3019

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

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 Cost-Aware Designs for Sequential Hypothesis Testing

We introduce Cost-Aware (CA) Sequential Hypothesis Testing (CASHT), in which an active decision-maker selects sensing actions with different, random costs to identify the true hypothesis under an average-error constraint $δ$, while minimizing the expected total cost (rather than the number of samples). For fixed costs, we prove that the optimal expected total cost scales as $Θ(\log(1/δ))$, and is achievable by Multihypothesis Sequential Probability Ratio Test-based procedures. We show that the CA design principle is to maximize the ratio of expected information gain to expected cost under the policy-induced action distribution. Guided by this principle, we adapt two classic policies to the CA setting and establish their asymptotic optimality. We then treat random costs under two revelation models: ex-post, where costs are disclosed only after a sample is obtained, and the cost-error tradeoff coincides with the fixed-cost case, and ex-ante, where costs accrue before acquisition, and the decision maker may cancel an action mid-operation. For the ex-ante model, we characterize when cancellation lowers the total cost and analyze several cost distributions in detail. Simulations confirm our findings that the CA variants consistently reduce total cost relative to their classic counterparts, and when action cancellation helps or hurts.

cs.IT↗

Construction of Multi-sequences With High Nonlinear Complexity via Narrow Ray Class Fields

Nonlinear complexity is a fundamental criterion in the evaluation of pseudorandom sequences. The construction of multi-sequences with high nonlinear complexity is both theoretically and practically important in cryptography. Motivated by prior constructions of multi-sequences with high nonlinear complexity in [IEEE Trans. Inf. Theory, 60(10), 2014] and [IEEE Trans. Inf. Theory, 63(12), 2017], we provide a unified framework via narrow ray class fields and the cyclic descent introduced by Guruswami and Xing in [J. Combin. Theory Ser. A 129 (2015) ]. Then we can generate new multi-sequences with high nonlinear complexity over function fields with arbitrary genera.

cs.IT↗