Search results for " code"

showing 10 items of 636 documents

Fading mitigation coding techniques for space to ground free space optical communications (Euro Med Telco 2014)

2014

In this manuscript, a Geostationary satellite-toground Free Space Optics (FSO) downlink channel model has been implemented, which is able to predict temporal irradiance fluctuations caused by scintillation at a wide range of turbulence conditions and for different values of the zenith angle. In order to mitigate fading events that occur in FSO communications, we have also tested the performance of three different families of Rateless Codes (Luby Transform, Raptor and RaptorQ) into our model and found that RaptorQ is the best candidate to mitigate errors in FSO links.

Space-to- Ground FSO linkSettore ING-INF/03 - Telecomunicazionifading mitigationrateless codeSettore ING-INF/02 - Campi ElettromagneticiOptical Wireless Communicationtime-serieSettore ING-INF/01 - Elettronica
researchProduct

A performance study of LTE MIMO-OFDM systems using the extended one-ring MIMO channel model

2012

In this paper, we consider a long-term evolution (LTE) system for the downlink by using multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) techniques. The downlink channel is modeled by the socalled extended MIMO one-ring model. This model extends the well-known narrowband one-ring model with respect to frequency selectivity. The symbol error rate (SER) performance of the LTE MIMO-OFDM system is investigated for the downlink by employing different kinds of spatial encoders, where it is assumed that the channel state information (CSI) is perfectly known. For comparison, the space-time block coding (STBC) scheme, the vertical Bell Laboratories layered spac…

Space–time block code3G MIMOOrthogonal frequency-division multiplexingComputer scienceChannel state informationReal-time computingMIMOTelecommunications linkData_CODINGANDINFORMATIONTHEORYMIMO-OFDMTopologyMulti-user MIMOComputer Science::Information TheoryThe 2012 International Conference on Advanced Technologies for Communications
researchProduct

Filter multiplexing by use of spatial Code Division Multiple Access approach.

2003

The increasing popularity of optical communication has also brought a demand for a broader bandwidth. The trend, naturally, was to implement methods from traditional electronic communication. One of the most effective traditional methods is Code Division Multiple Access. In this research, we suggest the use of this approach for spatial coding applied to images. The approach is to multiplex several filters into one plane while keeping their mutual orthogonality. It is shown that if the filters are limited by their bandwidth, the output of all the filters can be sampled in the original image resolution and fully recovered through an all-optical setup. The theoretical analysis of such a setup …

Spatial filterbusiness.industryComputer scienceCode division multiple accessMaterials Science (miscellaneous)Bandwidth (signal processing)Optical communicationSpatial codeMultiplexingIndustrial and Manufacturing EngineeringOpticsElectronic engineeringBusiness and International ManagementbusinessOptical filterImage resolutionApplied optics
researchProduct

Super Resolution Methods Implementing Diffractive Masks Having a Certain Degree of Periodicity

2011

This section presents an approach that provides super resolved imaging at the center of the field of view and yet allows to see the remaining of the original field of view with original resolution. This operation resembles optical zooming while the zoomed and the nonzoomed images are obtained simultaneously. This is obtained by taking a single snap-shot and using a single imaging lens. The technique utilizes a special static/still coding element and a postprocessing algorithmic, without any mechanical movements.

Spatial light modulatorbusiness.industryComputer scienceComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISIONField of viewSuperresolutionGray levelGray codeImaging lensComputer visionArtificial intelligenceZoombusinessCoding (social sciences)
researchProduct

Dans quelle mesure les préférences individuelles contraignent-elles le développement du marché de l'assurance dépendance ?

2015

Dans un contexte de vieillissement de la population, différents scenarii sont envisagés pour réformer l’organisation et le financement de la prise en charge des personnes âgées dépendantes. La place de la prévoyance individuelle dans le financement de la dépendance est à ce titre largement débattue. À l’heure actuelle, malgré des restes à charge potentiellement conséquents, peu d’individus disposent d’une couverture assurantielle. Cet article vise à enrichir la littérature existante en évaluant dans quelle mesure les préférences observées dans la population limitent cette couverture. Nous mobilisons pour cela l’enquête Patrimoine et préférences vis-à-vis du temps et du risque (Pater) de 201…

Statistics and ProbabilityEconomics and Econometricsdemande d’assurance[SHS.STAT]Humanities and Social Sciences/Methods and statistics050208 financeSociology and Political Science05 social sciencespréférence pour le présentPréférences individuelles[SHS.ECO]Humanities and Social Sciences/Economics and Financeperte d’autonomieassurance dépendanceassurance0502 economics and business[SHS.STAT] Humanities and Social Sciences/Methods and statistics[ SHS.ECO ] Humanities and Social Sciences/Economies and financesaversion du risque.dépendance050207 economics[SHS.ECO] Humanities and Social Sciences/Economics and Finance[ SHS.STAT ] Humanities and Social Sciences/Methods and statisticsdépendance ; perte d’autonomie ; assurance dépendance ; demande d’assurance ; préférence pour le présent ; aversion du risque ; Codes JEL C25- D91- G22- I12- I18- J14ComputingMilieux_MISCELLANEOUSprise en charge
researchProduct

On the dimerization of the primitive tRNAs: implications in the origin of genetic code.

2002

RNAs that catalyse their own aminoacylation have been recently selected in vitro. These findings support the notion that the primitive aminoacyl-tRNA synthetases may have been RNAs. In this paper, we propose a structural model for the first aminoacyl-tRNA synthetase consisting of an RNA complex formed between two primitive tRNA molecules through two intermolecular loop-strand interactions, and with implications in the origin of the genetic code.

Statistics and ProbabilityGeneticsGeneral Immunology and MicrobiologyModels GeneticApplied MathematicsRNAAminoacylationGeneral MedicineBiologyGenetic codeenvironment and public healthGeneral Biochemistry Genetics and Molecular Biologyenzymes and coenzymes (carbohydrates)RNA TransferGenetic CodeModeling and SimulationTransfer RNAbacteriaAnimalsGeneral Agricultural and Biological SciencesDimerizationJournal of theoretical biology
researchProduct

Topological Minimally Entangled States via Geometric Measure

2014

Here we show how the Minimally Entangled States (MES) of a 2d system with topological order can be identified using the geometric measure of entanglement. We show this by minimizing this measure for the doubled semion, doubled Fibonacci and toric code models on a torus with non-trivial topological partitions. Our calculations are done either quasi-exactly for small system sizes, or using the tensor network approach in [R. Orus, T.-C. Wei, O. Buerschaper, A. Garcia-Saez, arXiv:1406.0585] for large sizes. As a byproduct of our methods, we see that the minimisation of the geometric entanglement can also determine the number of Abelian quasiparticle excitations in a given model. The results in …

Statistics and ProbabilityPhysicsQuantum PhysicsFibonacci numberToric codeStrongly Correlated Electrons (cond-mat.str-el)High Energy Physics - Lattice (hep-lat)FOS: Physical sciencesStatistical and Nonlinear PhysicsTorusQuantum entanglementTopologyMultipartite entanglementCondensed Matter - Strongly Correlated ElectronsHigh Energy Physics - LatticeTopological orderStatistics Probability and UncertaintyAbelian groupQuantum Physics (quant-ph)Quantum
researchProduct

kmcEx: memory-frugal and retrieval-efficient encoding of counted k-mers.

2018

Abstract Motivation K-mers along with their frequency have served as an elementary building block for error correction, repeat detection, multiple sequence alignment, genome assembly, etc., attracting intensive studies in k-mer counting. However, the output of k-mer counters itself is large; very often, it is too large to fit into main memory, leading to highly narrowed usability. Results We introduce a novel idea of encoding k-mers as well as their frequency, achieving good memory saving and retrieval efficiency. Specifically, we propose a Bloom filter-like data structure to encode counted k-mers by coupled-bit arrays—one for k-mer representation and the other for frequency encoding. Exper…

Statistics and ProbabilitySource codeComputer sciencemedia_common.quotation_subject0206 medical engineeringHash function02 engineering and technologyBiochemistry03 medical and health sciencesEncoding (memory)Molecular BiologyTime complexity030304 developmental biologyBlock (data storage)media_common0303 health sciencesSequence Analysis DNAData structureComputer Science ApplicationsComputational MathematicsComputational Theory and MathematicsError detection and correctionAlgorithmSequence Alignment020602 bioinformaticsAlgorithmsSoftwareBioinformatics (Oxford, England)
researchProduct

ArtiFuse—computational validation of fusion gene detection tools without relying on simulated reads

2019

Abstract Motivation Gene fusions are an important class of transcriptional variants that can influence cancer development and can be predicted from RNA sequencing (RNA-seq) data by multiple existing tools. However, the real-world performance of these tools is unclear due to the lack of known positive and negative events, especially with regard to fusion genes in individual samples. Often simulated reads are used, but these cannot account for all technical biases in RNA-seq data generated from real samples. Results Here, we present ArtiFuse, a novel approach that simulates fusion genes by sequence modification to the genomic reference, and therefore, can be applied to any RNA-seq dataset wit…

Statistics and ProbabilitySource codeSequence analysisComputer sciencemedia_common.quotation_subjectValue (computer science)Genomicscomputer.software_genreBiochemistryFusion gene03 medical and health sciences0302 clinical medicineSoftwareMolecular BiologyGene030304 developmental biologymedia_common0303 health sciencesSequence Analysis RNAbusiness.industryHigh-Throughput Nucleotide SequencingRNAGenomicsComputer Science ApplicationsComputational MathematicsComputational Theory and Mathematics030220 oncology & carcinogenesisBenchmark (computing)RNAData miningGene FusionbusinesscomputerSoftwareBioinformatics
researchProduct

Random walk approximation of BSDEs with H{\"o}lder continuous terminal condition

2018

In this paper, we consider the random walk approximation of the solution of a Markovian BSDE whose terminal condition is a locally Hölder continuous function of the Brownian motion. We state the rate of the L2-convergence of the approximated solution to the true one. The proof relies in part on growth and smoothness properties of the solution u of the associated PDE. Here we improve existing results by showing some properties of the second derivative of u in space. peerReviewed

Statistics and Probabilitynumerical schemeHölder conditionSpace (mathematics)01 natural sciences010104 statistics & probabilityMathematics::Probability0101 mathematicsBrownian motionrandom walk approximationSecond derivativeMathematicsstokastiset prosessitSmoothness (probability theory)numeeriset menetelmät010102 general mathematicsMathematical analysisSpeed of convergenceBackward stochastic differential equationsFunction (mathematics)State (functional analysis)Random walk[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]random walk approxi-mationbackward stochastic differential equationsspeed of convergencespeed of convergence MSC codes : 65C30 60H35 60G50 65G99Mathematics - Probability
researchProduct