Related papers: The Golden Ratio Encoder
One of the most important consideration techniques when one want to solve the protecting of digital signal is the golden matrix. The golden matrices can be used for creation of a new kind of cryptography called the golden cryptography. Many…
This article introduces the {\Omega} counter, a frequency counter -- or a frequency-to-digital converter, in a different jargon -- based on the Linear Regression (LR) algorithm on time stamps. We discuss the noise of the electronics. We…
Let $X=\sum_{k=1}^\infty X_k \beta^{-k}$ be the base-$\beta$ expansion of a continuous random variable $X$ on the unit interval where $\beta$ is the positive solution to $\beta^n = 1 + \beta + \cdots + \beta^{n-1}$ for an integer $n\ge 2$…
In this paper will be presented new approach to entropy coding: family of generalizations of standard numeral systems which are optimal for encoding sequence of equiprobable symbols, into asymmetric numeral systems - optimal for freely…
In this paper we present a block coded modulation scheme for a 2 x 2 MIMO system over slow fading channels, where the inner code is the Golden Code. The scheme is based on a set partitioning of the Golden Code using two-sided ideals whose…
Many machine learning applications deal with high dimensional data. To make computations feasible and learning more efficient, it is often desirable to reduce the dimensionality of the input variables by finding linear combinations of the…
The polarization process of conventional polar codes in binary erasure channel (BEC) is recast to the Domany-Kinzel cellular automaton model of directed percolation in a tilted square lattice. Consequently, the former's scaling exponent,…
As quantum computers continue to become more capable, the possibilities of their applications increase. For example, quantum techniques are being integrated with classical neural networks to perform machine learning. In order to be used in…
Quantum computing may speed up numerical problems involving large matrices that are demanding for classical computers, and active research on this possibility is ongoing. In this work, we propose quantum algorithms for the exact simulation…
We consider the computation of the entanglement-assisted quantum rate-distortion function, which plays a central role in quantum information theory. We propose an efficient alternating minimization algorithm based on the Lagrangian…
Optimization theory has been widely studied in academia and finds a large variety of applications in industry. The different optimization models in their discrete and/or continuous settings have catered to a rich source of research…
We propose the first near-optimal quantum algorithm for estimating in Euclidean norm the mean of a vector-valued random variable with finite mean and covariance. Our result aims at extending the theory of multivariate sub-Gaussian…
Quantum advantage requires overcoming noise-induced degradation of quantum systems. Conventional methods for reducing noise such as error mitigation face scalability issues in deep circuits. Specifically, noise hampers the extraction of…
Ultrafast physical random bit generation at hundreds of Gb/s rates, with verified randomness, is a crucial ingredient in secure communication and have recently emerged using optics based physical systems. Here we examine the inverse problem…
The problem of quantizing a circularly-symmetric complex Gaussian random variable is considered. For this purpose, we design two non-uniform quantizers, a high-rate-, and a Lloyd-Max-, quantizer that are both based on the (golden angle)…
Quantum-phase-estimation algorithms are critical subroutines in many applications for quantum computers and in quantum-metrology protocols. These algorithms estimate the unknown strength of a unitary evolution. By using coherence or…
Hybrid analog-digital precoding is a key millimeter wave access technology, where an antenna array with reduced number of radio frequency (RF) chains is used with an RF precoding matrix to increase antenna gain at a reasonable cost.…
The impossibility of perfectly discriminating non orthogonal quantum states imposes far-reaching consequences both on quantum and classical communication schemes. We propose and numerically analyze an optimized quantum receiver for the…
Quantum computers are analog devices; thus they are highly susceptible to accumulative errors arising from classical control electronics. Fast operation--as necessitated by decoherence--makes gating errors very likely. In most current…
Quantum integer factorization is a potential quantum computing solution that may revolutionize cryptography. Nevertheless, a scalable and efficient quantum algorithm for noisy intermediate-scale quantum computers looks far-fetched. We…