Search results for "Decoding methods"
showing 10 items of 54 documents
Support vector machines in engineering: an overview
2014
This paper provides an overview of the support vector machine SVM methodology and its applicability to real-world engineering problems. Specifically, the aim of this study is to review the current state of the SVM technique, and to show some of its latest successful results in real-world problems present in different engineering fields. The paper starts by reviewing the main basic concepts of SVMs and kernel methods. Kernel theory, SVMs, support vector regression SVR, and SVM in signal processing and hybridization of SVMs with meta-heuristics are fully described in the first part of this paper. The adoption of SVMs in engineering is nowadays a fact. As we illustrate in this paper, SVMs can …
Performance of Hybrid-ARQ with Incremental Redundancy over Double Rayleigh Fading Channels
2011
In this paper, we study the performance of hybrid automatic repeat request (HARQ) with incremental redundancy (IR) over double Rayleigh channels. Such channels can be used to model the fading amplitude for vehicle-to-vehicle (V2V) communications. We study the performance of HARQ from an information theoretic perspective. Analytical expressions are derived for the $\epsilon$-outage capacity, the average number of transmissions, and the average transmission rate for HARQ with IR, assuming a maximum number of rounds for the HARQ protocol. In our study, the communication rate per HARQ round is adjusted to the average signal-to-noise ratio (SNR) such that a target outage probability is not excee…
Part of Speech Tagging Using Hidden Markov Models
2020
Abstract In this paper, we present a wide range of models based on less adaptive and adaptive approaches for a PoS tagging system. These parameters for the adaptive approach are based on the n-gram of the Hidden Markov Model, evaluated for bigram and trigram, and based on three different types of decoding method, in this case forward, backward, and bidirectional. We used the Brown Corpus for the training and the testing phase. The bidirectional trigram model almost reaches state of the art accuracy but is disadvantaged by the decoding speed time while the backward trigram reaches almost the same results with a way better decoding speed time. By these results, we can conclude that the decodi…
Quantitative evaluation of muscle synergy models: a single-trial task decoding approach.
2012
Delis, Ioannis | Berret, Bastien | Pozzo, Thierry | Panzeri, Stefano; International audience; ''Muscle synergies, i.e., invariant coordinated activations of groups of muscles, have been proposed as building blocks that the central nervous system (CNS) uses to construct the patterns of muscle activity utilized for executing movements . Several efficient dimensionality reduction algorithms that extract putative synergies from electromyographic (EMG) signals have been developed. Typically, the quality of synergy decompositions is assessed by computing the Variance Accounted For (VAF). Yet, little is known about the extent to which the combination of those synergies en codes task discriminating…
Super-orthogonal space-time trellis codes with differential phase modulation for noncoherent mobile communication systems
2010
In this paper, we show how to design super-orthogonal space-time trellis codes (SOSTTCs) using the differential binary phase-shift keying (PSK) modulation for noncoherent communication systems, for which the knowledge of the channel state information (CSI) at the receiver is not necessary. Moreover, a new decoding algorithm with reduced decoding complexity is proposed. In all simulations, a geometric two-ring channel model is employed to evaluate the performance of the SOSTTCs. The simulation results show that the proposed decoding algorithm has the same decoding performance compared with the traditional decoding strategy, while the new algorithm reduces significantly the overall computing …
Detection of TV commercials
2004
This paper presents a system that labels TV shots either as commercial or program shots. The system uses two observations: logo presence and shot duration. These observations are modeled using HMMs, and a Viterbi decoder is finally used for shot labeling. The system has been tested on several hours of real video, achieving more than 99% correct labeling.
Unitary Space–Time Constellation Design Based on the Chernoff Bound of the Pairwise Error Probability
2008
Unitary space-time constellation design is considered for noncoherent multiple-antenna communications, where neither the transmitter nor the receiver knows the fading coefficients of the channel. By employing the Clarke's subdifferential theorem of the sum of the kappa largest singular values of a unitary matrix, we present a numerical optimization procedure for finding unitary space-time signal constellations of any dimension. The Chernoff bound of the pairwise error probability is used directly as a design criterion. The constellations are found by performing gradient descent search on a family ldquosurrogaterdquo functions that converge to the maximum pairwise error probability. The comp…
Super-resolved Imaging based upon spatial depolarization of light
2010
In this paper we present a new approach allowing the surpassing of the diffraction based limitation for the achievable resolution provided by imaging systems. It is based on an encoding-decoding process of various spatial pixels or regions in the field of view of the imaged object by orthogonal and differently time varying polarization states. The reconstruction of the original spatial information is obtained by applying a decoding process in a way similar to the encoding one. Although all the spatial information is summed and mixed together by the system, the decoding provides super resolved imaging since in every spatial position the undesired spatial information having time varying polar…
Super-resolved or field of view enlarged imaging based upon spatial depolarization of light
2010
Abstract In this paper we present a new approach allowing the surpassing of the diffraction based limitation for the achievable resolution provided by imaging systems. It is based on an encoding–decoding process of various spatial pixels or regions in the field of view of the imaged object by orthogonal and differently time varying polarization states. The reconstruction of the original spatial information is obtained by applying a decoding process in a way similar to the encoding one. Although all the spatial information is summed and mixed together by the system, the decoding provides super-resolved imaging since in every spatial position the undesired spatial information having time vary…
A Generalization of Girod’s Bidirectional Decoding Method to Codes with a Finite Deciphering Delay
2012
In this paper we generalize an encoding method due to Girod (cf. [6]) using prefix codes, that allows a bidirectional decoding of the encoded messages. In particular we generalize it to any finite alphabet A, to any operation defined on A, to any code with finite deciphering delay and to any key x ∈ A+ , on a length depending on the deciphering delay. We moreover define, as in [4], a deterministic transducer for such generalized method. We prove that, fixed a code X ∈ A* with finite deciphering delay and a key x ∈ A *, the transducers associated to different operations are isomorphic as unlabelled graphs. We also prove that, for a fixed code X with finite deciphering delay, transducers asso…