Search results for "Decoding"
showing 10 items of 70 documents
Struggling with L2 alphabet: The role of proficiency in orthographic learning
2023
The present study examined the process of L2 orthographic learning in bilinguals with distant L1–L2 orthographies. Chinese–English bilinguals with various English proficiency levels were trained with novel L2 words during a reading task. In contrast to higher proficient learners, those with lower L2 proficiency exhibited increased effects of length, frequency, and lexicality across exposures and at-chance recognition of trained words. Importantly, an additional post-training task assessing the lexical integration of trained words evidenced the engagement in different L1–L2 reading strategies across different levels of L2 proficiency, hence suggesting the L1 holistic processing at the base …
Superresolved imaging of remote moving targets.
2006
We present a superresolving approach that allows one to exceed the diffraction limit and recover highly resolved contours of moving targets from a sequence of low-resolution images. The presented approach is suitable for remote sensing applications. The resolution decoding algorithm that is used to recover the high-resolution features of the target can be run partially via optical means and that way can be used to reduce the required computational complexity.
Diagonal space time hadamard codes with erasure decoding algorithm
2005
A major challenge in the area of space time (ST) codes is to find codes suitable for efficient decoding, thus overcoming the problem of many existing ST code designs which require maximum-likelihood (ML) decoding. A solution could be to apply single-input single-output (SISO) channel codes and theory over temporal channel fading to the multi-input single-output (MISO) code construction and classical suboptimum decoding methods. For these purposes, an ST code construction which allows the use of efficient decoding algorithms is described. We propose a concatenated code, where the inner code is the diagonal ST Hadamard (D-STH) code with Paley constructions and the outer code is an algebraic b…
Transducers for the bidirectional decoding of prefix codes
2010
AbstractWe construct a transducer for the bidirectional decoding of words encoded by the method introduced by Girod (1999) in [5] and we prove that it is bideterministic and that it can be used both for the left-to-right and the right-to-left decoding.We also give a similar construction for a transducer that decodes in both directions words encoded by a generalization of Girod’s encoding method. We prove that it has the same properties as those of the previous transducer. In addition we show that it has a single initial/final state and that it is minimal.
A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay
2012
Girod’s encoding method has been introduced in order to efficiently decode from both directions messages encoded by using finite prefix codes. In the present paper, we generalize this method to finite codes with a finite deciphering delay. In particular, we show that our decoding algorithm can be realized by a deterministic finite transducer. We also investigate some properties of the underlying unlabeled graph.
Reducing Overhearing Energy in Wake-Up Radio-Enabled WPANs: Scheme and Performance
2018
Wake-up Radio (WuR)-enabled wireless personal area networks (WPANs) are more popular over conventional WPANs thanks to WuR's on-demand transmission feature and overwhelming energy consumption superiority. In a WuRenabled WPAN, overhearing occurs when a wake-up receiver decodes and validates the address of a wake-up call which is not intended to it. However, such overhearing consumes a portion of the required reception energy for unintended nodes. To diminish overhearing thus conserve total reception energy in a network, we propose a bit-by-bit address decoding (BBAD) scheme and compare it with another addressing scheme for WuR that uses a micro-controller unit to decode and match the whole …
Secrecy analysis and learning-based optimization of cooperative NOMA SWIPT systems
2019
Non-orthogonal multiple access (NOMA) is considered to be one of the best candidates for future networks due to its ability to serve multiple users using the same resource block. Although early studies have focused on transmission reliability and energy efficiency, recent works are considering cooperation among the nodes. The cooperative NOMA techniques allow the user with a better channel (near user) to act as a relay between the source and the user experiencing poor channel (far user). This paper considers the link security aspect of energy harvesting cooperative NOMA users. In particular, the near user applies the decode-and-forward (DF) protocol for relaying the message of the source no…
A nonstationary model for the analysis of transient speech signals
1987
In this correspondence, a model is presented for the analysis of transient speech signals, which is based on a sum of the impulsive responses corresponding to a number of poles with time-dependent parameters. The aim of this analysis is to obtain discriminative features of the different transient elements of speech.
Implementation of JPEG2000 arithmetic decoder using dynamic reconfiguration of FPGA
2005
This paper describes implementation of a part of JPEG2000 algorithm (MQ-Decoder and arithmetic decoder) on a FPGA board using dynamic reconfiguration. Comparison between static and dynamic reconfiguration is presented and new analysis criteria (time performance, logic cost, spatio-temporal efficiency) are defined. MQ-decoder and arithmetic decoder can be classified in the most attractive case for dynamic reconfiguration implementation: applications without parallelism by functions. This implementation is done on an architecture designed to study dynamic reconfiguration of FPGAs: the ARDOISE architecture. The implementation obtained, based on four partial configurations of arithmetic decoder…
Cost-driven framework for progressive compression of textured meshes
2019
International audience; Recent advances in digitization of geometry and radiometry generate in routine massive amounts of surface meshes with texture or color attributes. This large amount of data can be compressed using a progressive approach which provides at decoding low complexity levels of details (LoDs) that are continuously refined until retrieving the original model. The goal of such a progressive mesh compression algorithm is to improve the overall quality of the transmission for the user, by optimizing the rate-distortion trade-off. In this paper, we introduce a novel meaningful measure for the cost of a progressive transmission of a textured mesh by observing that the rate-distor…