5,757 research outputs found

    Capacity of Complexity-Constrained Noise-Free CDMA

    Full text link
    An interference-limited noise-free CDMA downlink channel operating under a complexity constraint on the receiver is introduced. According to this paradigm, detected bits, obtained by performing hard decisions directly on the channel's matched filter output, must be the same as the transmitted binary inputs. This channel setting, allowing the use of the simplest receiver scheme, seems to be worthless, making reliable communication at any rate impossible. We prove, by adopting statistical mechanics notion, that in the large-system limit such a complexity-constrained CDMA channel gives rise to a non-trivial Shannon-theoretic capacity, rigorously analyzed and corroborated using finite-size channel simulations.Comment: To appear in IEEE Communications Letter

    Secure exchange of information by synchronization of neural networks

    Full text link
    A connection between the theory of neural networks and cryptography is presented. A new phenomenon, namely synchronization of neural networks is leading to a new method of exchange of secret messages. Numerical simulations show that two artificial networks being trained by Hebbian learning rule on their mutual outputs develop an antiparallel state of their synaptic weights. The synchronized weights are used to construct an ephemeral key exchange protocol for a secure transmission of secret data. It is shown that an opponent who knows the protocol and all details of any transmission of the data has no chance to decrypt the secret message, since tracking the weights is a hard problem compared to synchronization. The complexity of the generation of the secure channel is linear with the size of the network.Comment: 11 pages, 5 figure

    Statistical mechanical aspects of joint source-channel coding

    Full text link
    An MN-Gallager Code over Galois fields, qq, based on the Dynamical Block Posterior probabilities (DBP) for messages with a given set of autocorrelations is presented with the following main results: (a) for a binary symmetric channel the threshold, fcf_c, is extrapolated for infinite messages using the scaling relation for the median convergence time, tmed1/(fcf)t_{med} \propto 1/(f_c-f); (b) a degradation in the threshold is observed as the correlations are enhanced; (c) for a given set of autocorrelations the performance is enhanced as qq is increased; (d) the efficiency of the DBP joint source-channel coding is slightly better than the standard gzip compression method; (e) for a given entropy, the performance of the DBP algorithm is a function of the decay of the correlation function over large distances.Comment: 6 page

    Generation of unpredictable time series by a Neural Network

    Full text link
    A perceptron that learns the opposite of its own output is used to generate a time series. We analyse properties of the weight vector and the generated sequence, like the cycle length and the probability distribution of generated sequences. A remarkable suppression of the autocorrelation function is explained, and connections to the Bernasconi model are discussed. If a continuous transfer function is used, the system displays chaotic and intermittent behaviour, with the product of the learning rate and amplification as a control parameter.Comment: 11 pages, 14 figures; slightly expanded and clarified, mistakes corrected; accepted for publication in PR

    A bright, pulsed two-mode squeezer

    Full text link
    We report the realization of a bright ultrafast two-mode squeezer based on type II parametric downconversion (PDC) in periodically poled KTiOPO4\mathrm{KTiOPO_4} (PP-KTP) waveguides. It produces a pulsed two-mode squeezed vacuum state: a photon-number entangled pair of truly single-mode pulses or, in terms of continuous variables quantum optics, a pulsed, single mode Einstein-Podolsky-Rosen (EPR) state in the telecom regime. We prove the single mode character of our source by measuring its g(2)g^{(2)} correlation function and demonstrate a mean photon number of up to 2.5 per pulse, equivalent to 11dB of two-mode squeezing.Comment: 4 pages, 3 figure

    Is a multiple excitation of a single atom equivalent to a single excitation of an ensemble of atoms?

    Full text link
    Recent technological advances have enabled to isolate, control and measure the properties of a single atom, leading to the possibility to perform statistics on the behavior of single quantum systems. These experiments have enabled to check a question which was out of reach previously: Is the statistics of a repeatedly excitation of an atom N times equivalent to a single excitation of an ensemble of N atoms? We present a new method to analyze quantum measurements which leads to the postulation that the answer is most probably no. We discuss the merits of the analysis and its conclusion.Comment: 3 pages, 3 figure

    Coherent generation of EPR-entangled light pulses mediated by a single trapped atom

    Get PDF
    We show that a single, trapped, laser-driven atom in a high-finesse optical cavity allows for the quantum-coherent generation of entangled light pulses on demand. Schemes for generating simultaneous and temporally separated pulse pairs are proposed. The mechanical effect of the laser excitation on the quantum motion of the cold trapped atom mediates the entangling interaction between two cavity modes and between the two subsequent pulses, respectively. The entanglement is of EPR-type, and its degree can be controlled through external parameters. At the end of the generation process the atom is decorrelated from the light field. Possible experimental implementations of the proposals are discussed.Comment: 11 pages, 4 figure

    Cryptography based on neural networks - analytical results

    Full text link
    Mutual learning process between two parity feed-forward networks with discrete and continuous weights is studied analytically, and we find that the number of steps required to achieve full synchronization between the two networks in the case of discrete weights is finite. The synchronization process is shown to be non-self-averaging and the analytical solution is based on random auxiliary variables. The learning time of an attacker that is trying to imitate one of the networks is examined analytically and is found to be much longer than the synchronization time. Analytical results are found to be in agreement with simulations
    corecore