Search results for "Decoding"
showing 10 items of 70 documents
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…
On the size of transducers for bidirectional decoding of prefix codes
2012
In a previous paper [L. Giambruno and S. Mantaci, Theoret. Comput. Sci. 411 (2010) 1785–1792] a bideterministic transducer is defined for the bidirectional deciphering of words by the method introduced by Girod [ IEEE Commun. Lett. 3 (1999) 245–247]. Such a method is defined using prefix codes. Moreover a coding method, inspired by the Girod’s one, is introduced, and a transducer that allows both right-to-left and left-to-right decoding by this method is defined. It is proved also that this transducer is minimal. Here we consider the number of states of such a transducer, related to some features of the considered prefix code X . We find some bounds of such a number of states in relation wi…
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…
Packet loss recovery in an indoor Free Space Optics link using rateless codes
2014
Free Space Optics (FSO) systems present some important advantages if compared to Radio Frequency links, but they can be affected by several impairments that degrade the link quality and availability. In particular, due to temporary interruptions of the line-of-sight condition between the transmitter and the receiver, packet loss can occur during data transmission. In this work, we present an indoor Free Space Optics link, in which we have systematically generated interruptions of the beam. We demonstrate how the application of the most recent rateless codes, i.e., RaptorQ codes, can strongly improve the link quality by reducing packet loss. In particular, results show that the Packet Error …
Nash codes for noisy channels
2012
This paper studies the stability of communication protocols that deal with transmission errors. We consider a coordination game between an informed sender and an uninformed decision maker, the receiver, who communicate over a noisy channel. The sender's strategy, called a code, maps states of nature to signals. The receiver's best response is to decode the received channel output as the state with highest expected receiver payoff. Given this decoding, an equilibrium or "Nash code" results if the sender encodes every state as prescribed. We show two theorems that give sufficient conditions for Nash codes. First, a receiver-optimal code defines a Nash code. A second, more surprising observati…
Rate-Splitting Random Access Mechanism for Massive Machine Type Communications in 5G Cellular Internet-of-Things
2021
The cellular Internet-of-Things has resulted in the deployment of millions of machine-type communication (MTC) devices. These massive number of devices must communicate with a single gNodeB (gNB) via the random access channel (RACH) mechanism. However, existing RACH mechanisms are inefficient when dealing with such large number of devices. To address this issue, we propose the rate-splitting random access (RSRA) mechanism, which uses rate splitting and decoding in rate-splitting multiple access (RSMA) to improve RACH success rates. The proposed mechanism divides the message into common and private messages and enhances the decoding performance. We demonstrate, using extensive simulations, t…
The DMT of Real and Quaternionic Lattice Codes and DMT Classification of Division Algebra Codes
2021
In this paper we consider the diversity-multiplexing gain tradeoff (DMT) of so-called minimum delay asymmetric space-time codes. Such codes are less than full dimensional lattices in their natural ambient space. Apart from the multiple input single output (MISO) channel there exist very few methods to analyze the DMT of such codes. Further, apart from the MISO case, no DMT optimal asymmetric codes are known. We first discuss previous criteria used to analyze the DMT of space-time codes and comment on why these methods fail when applied to asymmetric codes. We then consider two special classes of asymmetric codes where the code-words are restricted to either real or quaternion matrices. We p…