Sequences of events in noise-driven excitable systems with slow variables often show serial correlations among their intervals of events. Here, we employ a master equation for generalized non-renewal processes to calc...
详细信息
Sequences of events in noise-driven excitable systems with slow variables often show serial correlations among their intervals of events. Here, we employ a master equation for generalized non-renewal processes to calculate the interval and count statistics of superimposed processes governed by a slow adaptation variable. For an ensemble of neurons with spike-frequency adaptation, this results in the regularization of the population activity and an enhanced postsynaptic signal decoding. We confirm our theoretical results in a population of cortical neurons recorded in vivo.
Content identification based on digital fingerprinting attracts a lot of attention in different emerging applications. In this paper, we consider digital identification based on the sign-magnitude decomposition of fin...
详细信息
ISBN:
(纸本)9781457704376
Content identification based on digital fingerprinting attracts a lot of attention in different emerging applications. In this paper, we consider digital identification based on the sign-magnitude decomposition of fingerprint codewords and analyze the achievable rates for each component. We introduce a channel splitting approach and reveal certain interesting phenomena related to channel polarization. It is demonstrated that under certain conditions almost all rate in the sign channel is concentrated in reliable components, this can be of interest for complexity and security in various content identification applications. The envisioned extensions cover applications where the input and output alphabets of the channel are different at the encoding and decoding stages. Additionally, the reduction of the input data dimensionality at the encoding/enrollment stage can increase the cryptographic protection in terms of privacy leakage and simplify the decoding algorithms in biometric applications.
Interest in Adaptive Coded Aperture Imaging (ACAI) continues to grow as the optical and systems engineering community becomes increasingly aware of ACAI's potential benefits in the design and performance of both i...
详细信息
ISBN:
(纸本)9780819487759
Interest in Adaptive Coded Aperture Imaging (ACAI) continues to grow as the optical and systems engineering community becomes increasingly aware of ACAI's potential benefits in the design and performance of both imaging and non-imaging systems, such as good angular resolution (IFOV), wide distortion-free field of view (FOV), excellent image quality, and light weight construct. In this presentation we first review the accomplishments made over the past five years, then expand on previously published work to show how replacement of conventional imaging optics with coded apertures can lead to a reduction in system size and weight. We also present a trade space analysis of key design parameters of coded apertures and review potential applications as replacement for traditional imaging optics. Results will be presented, based on last year's work of our investigation into the trade space of IFOV, resolution, effective focal length, and wavelength of incident radiation for coded aperture architectures. Finally we discuss the potential application of coded apertures for replacing objective lenses of night vision goggles (NVGs).
In this paper, we study cyclic stabiliser codes over F-p of length dividing p(t) + 1 for some positive integer t. We call these t-Frobenius codes or just Frobenius codes for short. We give methods to construct them an...
详细信息
ISBN:
(纸本)9781457705953
In this paper, we study cyclic stabiliser codes over F-p of length dividing p(t) + 1 for some positive integer t. We call these t-Frobenius codes or just Frobenius codes for short. We give methods to construct them and show that they have efficient decoding algorithms. An important subclass of stabiliser codes are the linear stabiliser codes. For linear Frobenius codes we have stronger results: We completely characterise all linear Frobenius codes. As a consequence, we show that for every integer n that divides p(t) + 1 for an odd t, there are no linear cyclic codes of length n. On the other hand for even t, we give an explicit method to construct all of them. This gives us many explicit examples of Frobenius code which include the well studied Laflamme code. We show that the classical notion of BCH distance can be generalised to all the Frobenius codes that we construct, including the non-linear ones, and show that the algorithm of Berlekamp can be generalised to correct quantum errors within the BCH limit. This gives, for the first time, a family of codes that are neither CSS nor linear for which efficient decoding algorithm exits.
Brain-Machine Interface (BMI) decoding algorithms are often trained offline, but this paradigm ignores both the non-stationarity of neural signals and the feedback that exists in online, closed-loop control. To addres...
详细信息
ISBN:
(纸本)9781424441419
Brain-Machine Interface (BMI) decoding algorithms are often trained offline, but this paradigm ignores both the non-stationarity of neural signals and the feedback that exists in online, closed-loop control. To address these problems, we have developed an Adaptive Kalman Filter (AKF), a Kalman filter variant that adaptively updates its model parameters during training. For a Kalman filter decoder, batch retraining methods require completely re-estimating the parameter matrices from sufficient data to perform regression accurately, even if only small changes are necessary. Conversely, the AKF is designed to update the decoder parameters continuously and more intelligently. We simulated a population of 41 neurons learning to control a 2D computer cursor. The AKF yielded significantly faster skill acquisition and better robustness to perturbation and neuron loss than a standard Kalman filter with periodic batch retraining.
The All Unidirectional Error Detection （AUED） codes are among the ways of guarding against erroneous correction,and a t-Error Correction （EC）/A11 Unidirectional Error Detection （AUED） code can be constructed by ...
详细信息
The All Unidirectional Error Detection （AUED） codes are among the ways of guarding against erroneous correction,and a t-Error Correction （EC）/A11 Unidirectional Error Detection （AUED） code can be constructed by appending a single check symbol （P） to a linear t-EC code to achieve the AUED *** a t-EC/AUED code is used to encode information in a transmission side such information need to be decoded at the receiving *** and techniques proposed in literature for constructing t-EC/AUED codes are either come with no decoding algorithm or if a decoding a algorithm is proposed,it lacks the mathematical *** paper adopts a decoding algorithm from the literature and derives a mathematical proof for *** software is also developed and results for the encoding and decoding processes of four different encoding methods are *** on the mathematical proof and the simulation results obtained,this paper claims that the adopted algorithm is a universal decoding algorithm.
Randomly connected networks of neurons exhibit a transition from fixed-point to chaotic activity as the variance of their synaptic connection strengths is increased. In this study, we analytically evaluate how well a ...
详细信息
Randomly connected networks of neurons exhibit a transition from fixed-point to chaotic activity as the variance of their synaptic connection strengths is increased. In this study, we analytically evaluate how well a small external input can be reconstructed from a sparse linear readout of network activity. At the transition point, known as the edge of chaos, networks display a number of desirable features, including large gains and integration times. Away from this edge, in the nonchaotic regime that has been the focus of most models and studies, gains and integration times fall off dramatically, which implies that parameters must be fine tuned with considerable precision if high performance is required. Here we show that, near the edge, decoding performance is characterized by a critical exponent that takes a different value on the two sides. As a result, when the network units have an odd saturating nonlinear response function, the falloff in gains and integration times is much slower on the chaotic side of the transition. This means that, under appropriate conditions, good performance can be achieved with less fine tuning beyond the edge, within the chaotic regime.
In the paper, a modified Log-MAP algorithm based on a novel approximation of the max* operator derived from the Jensen inequality is proposed. In this approach, the max* operation is performed on n >= 2 arguments, ...
详细信息
ISBN:
(纸本)9781424480166
In the paper, a modified Log-MAP algorithm based on a novel approximation of the max* operator derived from the Jensen inequality is proposed. In this approach, the max* operation is performed on n >= 2 arguments, thus the recursive calculations are avoided and significant reduction in the number of operations performed per decoding step, as compared with the conventional Log-MAP, is achieved. Simulation results of BER performance for both turbo codes and turbo trellis-coded modulation (TTCM) employing the new algorithm are given, showing the near-optimal performance of the proposed algorithm.
Hidden Markov models are traditionally decoded by the Viterbi algorithm which finds the highest probability state path in the model. In recent years, several limitations of the Viterbi decoding have been demonstrated,...
详细信息
ISBN:
(纸本)9783642135088
Hidden Markov models are traditionally decoded by the Viterbi algorithm which finds the highest probability state path in the model. In recent years, several limitations of the Viterbi decoding have been demonstrated, and new algorithms have been developed to address them (Kall et al., 2005;Brejova et al., 2007;Gross et al., 2007;Brown and Truszkowski, 2010). In this paper, we propose a new efficient highest expected reward decoding algorithm (HERD) that allows for uncertainty in boundaries of individual sequence features. We demonstrate usefulness of our approach on jumping HMMs for recombination detection in viral genomes.
The design and implementation of adaptive coded apertures (diffraction) has advanced significantly since the first SPIE conference on Adaptive Coded Aperture Imaging and Non-Imaging Sensors held in 2007. Core algorith...
详细信息
ISBN:
(纸本)9780819483140
The design and implementation of adaptive coded apertures (diffraction) has advanced significantly since the first SPIE conference on Adaptive Coded Aperture Imaging and Non-Imaging Sensors held in 2007. Core algorithmic concepts relating to coding and decoding techniques remain steeply based in its non-diffractive design origins. We discuss adaptive coded aperture imaging's current capabilities in light of recent advances as well as methods of improvement for future systems design. The advantages of implementing reconfigurable mask patterns compared to fixed ones will also be discussed, as well as potential improvement in angular resolution by means of reconfigurable masks.
暂无评论