Thèses sur le sujet « Neuronal coding and decoding »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Consultez les 50 meilleures thèses pour votre recherche sur le sujet « Neuronal coding and decoding ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.
Tripathy, Shreejoy J. « Understanding the Form and Function of Neuronal Physiological Diversity ». Research Showcase @ CMU, 2013. http://repository.cmu.edu/dissertations/318.
Texte intégralRomero, Arandia Iñigo. « Reading out neural populations : shared variability, global fluctuations and information processing ». Doctoral thesis, Universitat Pompeu Fabra, 2017. http://hdl.handle.net/10803/404684.
Texte intégralEntender el origen y la función de la actividad de poblaciones neuronales, y cómo esta actividad se relaciona con los estímulos sensoriales, las decisiones o las acciones motoras es un gran desafio en neurociencia. En este trabajo hemos analizado la actividad de decenas de neuronas registradas en la corteza visual primaria de monos mientras rejillas sinusoidales en diferentes orientaciones eran presentadas. Hemos encontrado que las fluctuaciones globales de la red medidas mediante la actividad de la población modulan la selectividad de las neuronas de manera multiplicativa y aditiva. Además, la actividad de la población también afecta a la información presente en grupos pequeños de neuronas, dependiendo de la modulación que ha provocado en la selectividad de estas neuronas. La información en la población completa, sin embargo, no varía con estas fluctuaciones. En la segunda parte hemos desarrollado un método para medir 'correlaciones diferenciales' con datos limitados. Al aplicarlo a los datos experimentales hemos obtenido la primera estimación preliminar del tamaño de estas correlaciones que limitan la información. Nuestros resultados contribuyen al avance del entendimiento sobre la codi ficación de la información en poblaciones neuronales, y al mismo tiempo generan más preguntas sobre cómo éstas procesan y transmiten información.
Understanding the sources and the role of the spiking activity of neural populations, and how this activity is related to sensory stimuli, decisions or motor actions is a crucial challenge in neuroscience. In this work, we analyzed the spiking activity of tens of neurons recorded in the primary visual cortex of macaque monkeys while drifting sinusoidal gratings were presented in di erent orientations. We found that global uctuations of the network measured by the population activity a ect the tuning of individual neurons both multiplicatively and additively. Population activity also has an impact in the information of small ensembles, which depends on the kind of modulation that the tuning of those neurons undergoes. Interestingly, the total information of the network is not altered by these uctuations. In the second part, we developed a method to measure 'di erential correlations' from limited amount of data, and obtained the rst, although preliminary, estimate in experimental data. Our results have important implications for information coding, and they open new questions about the way information is processed and transmitted by the spiking activity of neural populations.
Iwaza, Lana, et Lana Iwaza. « Joint Source-Network Coding & ; Decoding ». Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00855787.
Texte intégralIwaza, Lana. « Joint Source-Network Coding & ; Decoding ». Thesis, Paris 11, 2013. http://www.theses.fr/2013PA112048/document.
Texte intégralWhile network data transmission was traditionally accomplished via routing, network coding (NC) broke this rule by allowing network nodes to perform linear combinations of the upcoming data packets. Network operations are performed in a specific Galois field of fixed size q. Decoding only involves a Gaussian elimination with the received network-coded packets. However, in practical wireless environments, NC might be susceptible to transmission errors caused by noise, fading, or interference. This drawback is quite problematic for real-time applications, such as multimediacontent delivery, where timing constraints may lead to the reception of an insufficient number of packets and consequently to difficulties in decoding the transmitted sources. At best, some packets can be recovered, while in the worst case, the receiver is unable to recover any of the transmitted packets.In this thesis, we propose joint source-network coding and decoding schemes in the purpose of providing an approximate reconstruction of the source in situations where perfect decoding is not possible. The main motivation comes from the fact that source redundancy can be exploited at the decoder in order to estimate the transmitted packets, even when some of them are missing. The redundancy can be either natural, i.e, already existing, or artificial, i.e, externally introduced.Regarding artificial redundancy, we choose multiple description coding (MDC) as a way of introducing structured correlation among uncorrelated packets. By combining MDC and NC, we aim to ensure a reconstruction quality that improves gradually with the number of received network-coded packets. We consider two different approaches for generating descriptions. The first technique consists in generating multiple descriptions via a real-valued frame expansion applied at the source before quantization. Data recovery is then achieved via the solution of a mixed integerlinear problem. The second technique uses a correlating transform in some Galois field in order to generate descriptions, and decoding involves a simple Gaussian elimination. Such schemes are particularly interesting for multimedia contents delivery, such as video streaming, where quality increases with the number of received descriptions.Another application of such schemes would be multicasting or broadcasting data towards mobile terminals experiencing different channel conditions. The channel is modeled as a binary symmetric channel (BSC) and we study the effect on the decoding quality for both proposed schemes. Performance comparison with a traditional NC scheme is also provided.Concerning natural redundancy, a typical scenario would be a wireless sensor network, where geographically distributed sources capture spatially correlated measures. We propose a scheme that aims at exploiting this spatial redundancy, and provide an estimation of the transmitted measurement samples via the solution of an integer quadratic problem. The obtained reconstruction quality is compared with the one provided by a classical NC scheme
Mendl, Christian. « Neuronal coding in the retina ». Diss., lmu, 2012. http://nbn-resolving.de/urn:nbn:de:bvb:19-139015.
Texte intégralRossoni, Enrico. « Synchronization and decoding in spiking neuronal networks ». Thesis, University of Sussex, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.443995.
Texte intégral姍, 路., et Shan Lu. « Coding and decoding for multiuser communication systems ». Thesis, https://doors.doshisha.ac.jp/opac/opac_link/bibid/BB12863897/?lang=0, 2014. https://doors.doshisha.ac.jp/opac/opac_link/bibid/BB12863897/?lang=0.
Texte intégralCoding and decoding for multiuser communication systems are investigated. For MAAC, we propose a coding scheme of (k + 1)-ary error-correcting signature codes. We give binary and non-binary signature codes. They are the best error-correcting signature codes for MAAC, in the sense that they have highest sum rates known. For TWRC, we propose a low-complexity two-user turbo decoding scheme when turbo codes are applied in two users. The approximate decoding algorithm preserves low decoding complexity over the Gaussian TWRC, without much performance degradation.
博士(工学)
Doctor of Philosophy in Engineering
同志社大学
Doshisha University
Meyer, Linda. « Coding and Decoding of Reed-Muller Codes ». Thesis, Karlstads universitet, Institutionen för matematik och datavetenskap (from 2013), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-84009.
Texte intégralI den här uppsatsen kommer flera varianter av linjära felrättande koder att presenteras. Läsaren får ta del av en allmän beskrivning av binära koder och en mer detaljerad framställning av linjära koder så som Hamming, repetitionskod, Reed-Muller kod m.m. Tillsammans med en fördjupning i ämnet, avseende metoder för kodning och avkodning, kommer vi att ge exempel för att bidra till förståelsen. Den digitala eran, som vi lever i, innefattar att datatransmission är en del av vår vardag. Vår frekventa användning av mobila enheter visar på hur viktigt det är att data överförs korrekt via kommunikationskanalerna. Av den anledningen är vetenskapen om felrättande koder högaktuell i dagens samhälle. Det huvudsakliga syftet med uppsatsen är att studera linjära block-koder som tillhör klassen binära koder. I det här fallet kommer vi att fokusera lite extra på Reed-Muller koder av första ordningen.
Rice, Mark. « Decoding of cyclic block codes ». Thesis, University of Manchester, 1989. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.330207.
Texte intégralBáez, Mendoza Raymundo. « Neuronal coding of reward during social interactions ». Thesis, University of Cambridge, 2014. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.648675.
Texte intégralAbdulwahid, Khalid. « Optimal decoding for line codes ». Thesis, University of Essex, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.253980.
Texte intégralHuluta, Emanuil. « Discrete wavelet transform architecture for image coding and decoding ». Thesis, University of Ottawa (Canada), 2003. http://hdl.handle.net/10393/26491.
Texte intégralAl-Rubaie, Alaa Abdulameer Saeed. « Iterative decoding and detection for physical layer network coding ». Thesis, University of Newcastle upon Tyne, 2015. http://hdl.handle.net/10443/4062.
Texte intégralLi, Xiaodong. « Bandwidth-efficient coded modulation and iterative decoding / ». Thesis, Connect to this title online ; UW restricted, 1998. http://hdl.handle.net/1773/6017.
Texte intégralFagervik, Kjetil. « Iterative decoding of concatenated codes ». Thesis, University of Surrey, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.268307.
Texte intégralPatel, Ami (Ami M. ). « Effects of neuronal correlations on population decoding and encoding models ». Thesis, Massachusetts Institute of Technology, 2013. http://hdl.handle.net/1721.1/112429.
Texte intégralCataloged from PDF version of thesis. Thesis pagination reflects the way it was delivered to the Institute Archives and Special Collections, MIT.
Includes bibliographical references (pages 71-73).
In this thesis, we analyze the effect of the correlations in neural activity on the information that is encoded in and can be decoded from a population of neurons. Various noise models describing these correlations are considered - in particular, we use models that take into account the pairwise correlations and other, simpler models that assume shared global additive and/or multiplicative noise factors. The performance of these models on firing rate prediction (encoding) and population decoding are studied. Our analyses show a significant beneficial effect of pairwise correlations on encoding models, with much of this benefit being explained by the global noise models. However, the effects of correlations on decoding vary among our datasets, providing an empirical justification to the theoretical results suggesting correlations can be either helpful or harmful to decoding.
by Ami Patel.
M. Eng.
Shin, Sooyoung Kim. « Trellis decoding of Reed Solomon codes ». Thesis, University of Surrey, 1994. http://epubs.surrey.ac.uk/843410/.
Texte intégralHo, Hai Pang. « Low complexity decoding of cyclic codes ». Thesis, University of Surrey, 1998. http://epubs.surrey.ac.uk/844222/.
Texte intégralSouvignier, Thomas Victor. « Turbo decoding for partial response channels / ». Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 1999. http://wwwlib.umi.com/cr/ucsd/fullcit?p9938584.
Texte intégralLopes, Renato da Rocha. « Iterative estimation, equalization and decoding ». Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/15026.
Texte intégralFu, Shengli. « Space-time coding and decoding for MIMO wireless communication systems ». Access to citation, abstract and download form provided by ProQuest Information and Learning Company ; downloadable PDF file 0.57Mb, 156 p, 2005. http://wwwlib.umi.com/dissertations/fullcit?3182631.
Texte intégralPHUTATHUM, AWASSADA. « Implementing Distributed Storage Systemsby Network Coding and ConsideringComplexity of Decoding ». Thesis, KTH, Kommunikationsteori, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-103607.
Texte intégralPark, Jong Il. « Trellis based soft output decoding algorithms for concatenated coding systems ». Diss., Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/13898.
Texte intégralMcPheters, Laura L. « Concatenated coding and iterative decoding for magnetic and optical recording ». Diss., Georgia Institute of Technology, 2001. http://hdl.handle.net/1853/16018.
Texte intégralLiu, Jingjing. « Novel LDPC coding and decoding strategies : design, analysis, and algorithms ». Thesis, University of York, 2012. http://etheses.whiterose.ac.uk/3880/.
Texte intégralSivasankaran, Ravi. « Sequential iterative decoding of concatenated recursive systematic convolutional codes ». Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/13372.
Texte intégralKim, Hasung. « Turbo-Like Coding for Spread-Spectrum Communications ». Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/4815.
Texte intégralJiang, Jing. « Advanced channel coding techniques using bit-level soft information ». [College Station, Tex. : Texas A&M University, 2007. http://hdl.handle.net/1969.1/ETD-TAMU-1923.
Texte intégralHicks, Matthew Graham. « Applications of acousto-optic demodulation and decoding techniques ». Thesis, University of Plymouth, 1997. http://hdl.handle.net/10026.1/2563.
Texte intégralDaniel, J. S. « Synthesis and decoding of array error control codes ». Thesis, University of Manchester, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.374587.
Texte intégralMirza, Javed. « Enhanced Reed Solomon decoding using soft decision information ». Thesis, University of Surrey, 1993. http://epubs.surrey.ac.uk/844171/.
Texte intégralHorley, Niall. « Advanced practical coding and modulation techniques for time varying channels ». Thesis, Lancaster University, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.387440.
Texte intégralValenti, Matthew C. « Iterative Detection and Decoding for Wireless Communications ». Diss., Virginia Tech, 1999. http://hdl.handle.net/10919/28290.
Texte intégralPh. D.
Alzubi, Jafar A. « Forward error correction coding and iterative decoding using algebraic geometric theory ». Thesis, Swansea University, 2012. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.582101.
Texte intégralTan, Jun. « Iterative decoding and multicarrier modulation for wireless communications ». Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/13274.
Texte intégralBozantzis, Vasilios. « Integrated vector encoding-decoding designs for non-stationary sources and noisy channels ». Thesis, University of Sussex, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.366056.
Texte intégralYaxley, S. « Neurophysiological analysis of gustatory coding in the primate ». Thesis, University of Oxford, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.355810.
Texte intégralGittis, Aryn Hilary. « Decoding the ionic basis of neuronal diversity in the medial vestibular nucleus ». Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2008. http://wwwlib.umi.com/cr/ucsd/fullcit?p3303674.
Texte intégralTitle from first page of PDF file (viewed June 18, 2008). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references.
Chauvin, Todd Henry. « Interleavers and iterative decoders for turbo codes / ». Thesis, Connect to this title online ; UW restricted, 2000. http://hdl.handle.net/1773/5947.
Texte intégralFayyaz, Ubaid Ullah. « Polar code design and decoding for magnetic recording ». Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/52994.
Texte intégralBenachour, Phillip. « Trellis decoding techniques for the multiple access binary adder channel ». Thesis, Lancaster University, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.314240.
Texte intégralAkeredolu, P. S. « Some new procedures for generating and decoding error correcting codes ». Thesis, De Montfort University, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.382273.
Texte intégralVon, Solms Suné. « Design of effective decoding techniques in network coding networks / Suné von Solms ». Thesis, North-West University, 2013. http://hdl.handle.net/10394/9544.
Texte intégralThesis (PhD (Computer Engineering))--North-West University, Potchefstroom Campus, 2013
Zhao, Yuanyi. « Iterative decoding combined with physical-layer network coding on impulsive noise channels ». Thesis, University of Newcastle upon Tyne, 2016. http://hdl.handle.net/10443/3537.
Texte intégralMarhenke, Jörg. « On algorithms for coding and decoding algebraic-geometric codes and their implementation ». [S.l. : s.n.], 2008. http://nbn-resolving.de/urn:nbn:de:bsz:289-vts-65822.
Texte intégralBlad, Anton. « Early-Decision Decoding of LDPC Codes ». Licentiate thesis, Linköping : Department of Electrical Engineering, Linköping University, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-17185.
Texte intégralHuang, Yuheng. « Bit-interleaved coded modulation with iterative decoding for wireless communications / ». Thesis, Connect to this title online ; UW restricted, 2004. http://hdl.handle.net/1773/5903.
Texte intégralAbedi, Ali. « Invariance Properties and Performance Evaluation of Bit Decoding Algorithms ». Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/768.
Texte intégralEscalera, Guerrero Sergio. « Coding and Decoding Design of ECOCs for Multi-class Pattern and Object Recognition ». Doctoral thesis, Universitat Autònoma de Barcelona, 2008. http://hdl.handle.net/10803/5789.
Texte intégralMany real problems require multi-class decisions. In the Pattern Recognition field, many techniques have been proposed to deal with the binary problem. However, the extension of many 2-class classifiers to the multi-class case is a hard task. In this sense, Error-Correcting Output Codes (ECOC) demonstrated to be a powerful tool to combine any number of binary classifiers to model multi-class problems. But there are still many open issues about the capabilities of the ECOC framework. In this thesis, the two main stages of an ECOC design are analyzed: the coding and the decoding steps. We present different problem-dependent designs. These designs take advantage of the knowledge of the problem domain to minimize the number of classifiers, obtaining a high classification performance. On the other hand, we analyze the ECOC codification in order to define new decoding rules that take full benefit from the information provided at the coding step. Moreover, as a successful classification requires a rich feature set, new feature detection/extraction techniques are presented and evaluated on the new ECOC designs. The evaluation of the new methodology is performed on different real and synthetic data sets: UCI Machine Learning Repository, handwriting symbols, traffic signs from a Mobile Mapping System, Intravascular Ultrasound images, Caltech Repository data set or Chaga's disease data set. The results of this thesis show that significant performance improvements are obtained on both traditional coding and decoding ECOC designs when the new coding and decoding rules are taken into account.
Mann, Sarah Edge. « The Original View of Reed-Solomon Coding and the Welch-Berlekamp Decoding Algorithm ». Diss., The University of Arizona, 2013. http://hdl.handle.net/10150/301533.
Texte intégral