{"id":55135,"date":"2018-03-09T22:42:51","date_gmt":"2018-03-09T22:42:51","guid":{"rendered":"https:\/\/www.deberes.net\/tesis\/sin-categoria\/iterative-joint-source-channel-coding-techniques-for-single-and-multiterminal-sources-in-communication-networks\/"},"modified":"2018-03-09T22:42:51","modified_gmt":"2018-03-09T22:42:51","slug":"iterative-joint-source-channel-coding-techniques-for-single-and-multiterminal-sources-in-communication-networks","status":"publish","type":"post","link":"https:\/\/www.deberes.net\/tesis\/tecnologia-de-las-telecomunicaciones\/iterative-joint-source-channel-coding-techniques-for-single-and-multiterminal-sources-in-communication-networks\/","title":{"rendered":"Iterative joint source-channel coding techniques for single and multiterminal sources in communication networks"},"content":{"rendered":"<h2>Tesis doctoral de <strong> Javier Del Ser Lorente <\/strong><\/h2>\n<p>En cualquier sistema de comunicaci\u00f3n la compresi\u00f3n de la informaci\u00f3n generada por las fuentes de datos a su m\u00ednima expresi\u00f3n resulta de gran inter\u00e9s a la hora de reducir la potencia de transmisi\u00f3n necesaria para comunicaciones fiables. A menudo la redundancia de dichas fuentes se halla en la dependencia probabil\u00edstica entre s\u00edmbolos de fuente consecutivos. Estas fuentes son com\u00fanmente denominadas fuentes \u00fanicas o multiterminales con memoria siendo dicha memoria, en el caso multiterminal, la correlaci\u00f3n temporal entre vectores de s\u00edmbolos fuente consecutivamente generados. Es bien sabido que, cuando la fuente tiene memoria, la cantidad media de informaci\u00f3n por s\u00edmbolo de fuente viene dada por la tasa de entrop\u00eda, menor que la entrop\u00eda por s\u00edmbolo de fuente. En este contexto, en un sistema de comunicaci\u00f3n es posible reducir la potencia necesaria para alcanzar una determinada probabilidad de error si la memoria de la fuente se explota en el proceso de detecci\u00f3n, i.E. Se explota la tasa de entrop\u00eda en lugar de la entrop\u00eda por s\u00edmbolo de fuente. Esta tesis se centra en el dise\u00f1o de esquemas iterativos de codificaci\u00f3n y decodificaci\u00f3n para la transmisi\u00f3n de fuentes con memoria a trav\u00e9s de canales ruidosos puto a punto y mimo. A tal prop\u00f3sito, la tesis se divide en dos partes correlacionadas: -la primera parte se concentra en la transmisi\u00f3n punto a punto de fuentes \u00fanicas con memoria. El procedimiento tradicional para abordar este problema se basa en el teorema de separaci\u00f3n, implementado la codificaci\u00f3n de fuente y la de canal separadamente. Cuando la complejidad es infinita, no hay p\u00e9rdida de rendimiento en comparaci\u00f3n con t\u00e9cnicas conjuntas de codificaci\u00f3n. Sin embargo, cuando la complejidad es limitada esta separaci\u00f3n deja de ser \u00f3ptima. Los esquemas cl\u00e1sicos de codificaci\u00f3n conjunta para fuentes con memoria consisten en incorporar el modelo estad\u00edstico de la fuente al proceso de decodificaci\u00f3n, dependiendo la complejidad del decodidificador de las caracter\u00edsticas de la fuente. Esta primera parte muestra gue el preprocesamiento de la fuente mediante la transformada bwt supone un m\u00e9todo universal y alternativo para explotar la memoria de la fuente tanto en codificaci\u00f3n de fuente como de canal. Concretamente para este \u00faltimo caso, se presenta un sistema novedoso de modulaci\u00f3n controlada por fuente en el que la energ\u00eda asignada a los s\u00edmbolos de la constelaci\u00f3n est\u00e1 controlada por los estad\u00edsticos de primer orden a la salida de la bwt. &#8211; La segunda parte se centra en la transmisi\u00f3n de fuentes mul ti terminal es con memoria a trav\u00e9s de redes mul ti usuari o. En primer lugar se aborda el canal de difusi\u00f3n gaussiano, donde cada componente del vector generado por la fuente se env\u00eda a su correspondiente receptor mediante una \u00fanica se\u00f1al transmitida. Varias estrategias de codificaci\u00f3n son analizadas, y se propone un esquema pr\u00e1ctico de superposici\u00f3n para fuentes mul ti terminal es con memoria. Esta parte de la tesis tambi\u00e9n considera la transmisi\u00f3n de fuentes multiterminal es a trav\u00e9s de canales de m\u00faltiple acceso, con especial \u00e9nfasis en el dise\u00f1o de receptores iterativos mediante grafos de factores. Asumiendo selectividad frecuencial en el canal, se proponen esquemas de codificaci\u00f3n conjunta fuente-canal que llevan a cabo ecualizaci\u00f3n, decodificaci\u00f3n y explotaci\u00f3n de la memoria de manera iterativa. Los resultados de simulaci\u00f3n muestran que el desempe\u00f1o de los sistemas propuestos se acercan a los l\u00edmites derivados asumiendo separaci\u00f3n. En resumen, el objetivo de esta tesis es dise\u00f1ar esquemas de comunicaci\u00f3n adecuados para fuentes con memoria que logran reducir la potencia de transmisi\u00f3n necesaria para un cierto nivel de rendimiento y complejidad.  in a communication system it results undoubtedly of great interest to compress the information generated by the data sources to its most elementary representation, so that the amount of power necessary for rel iable communication can be reduced. It is often the case that the redundancy shown by a variety of data sources can be modelled by taking into account the probabilistic dependance among consecutively source symbols rather than the probabilistic distribution of a single symbol. These sources are commonly referred to as single or multiterminal sources with memory being the memory, in this latter case, the existing temporal correlation among the consecutive symbol vectors generated by the multiterminal source. When the source has memory, the average amount of information per source symbol is given by the entropy rate, which is lower than its entropy per single letter. In this context, given a coded or uncoded communication system, one can decrease the power requi red to achieve a certain probability of error by taking into account this memory in the detection process, i.E. By exploiting the entropy rate rather than the entropy per single letter of the source. This thesis investigates the design of iterative encoding and decoding schemes for the transmission of single and multiterminal sources with memory through noisy point to point and m\u00faltiple input m\u00faltiple output channels. To that end, the dissertation is divided in two different (but closely related) parts: &#8211; the first part concentrates on the point to point transmission of single sources with memory. The classical way to tackle this problem is based on the separation theorem, by first implementing source compression and then channel coding. Assuming infinite complexity, no loss in performance is incurred when compared to joint source-channel coding techniques. However, when the complexity is an issue this separation is no longer optimal. To alleviate this lost in performance, classical joint source channel coding schemes exploit the memory of the source by attaching its statistical structure to the decoding process, thus, the complexity of the decoder depends strongly on the source characteristics in order to relax the complexity of the decoder, we show that preprocessing the source before the encoder by a data sorting algorithm is a universal method to exploit the correlation without relying on the source parameters. We invest\u00edgate the application of the burrows wheeler transform to both source and channel coding. For this latter case, we present a novel source controlled binary modulation scheme that adapts the allocated energy according to the distribution of the binary symbols at the bwt output &#8211; the second part focuses on the transmission of multiterminal sources with memory through multiuser communication networks. We first deal with the gaussian broadcast channel, where each component of the multiterminal source output vector is sent to the corresponding receiver by using a single transmit signal. To that purpose, severa! Encoding strategies are studied, and a practical superposition scheme for correlated multiterminal sources is proposed. The exploitation of the memory in correlated multiterminal sources when being sent through m\u00faltiple access channels is also covered, with emphasis on designing iterative receivers by means of factor qraphs. We consider frequency selective channels and propose joint source-channel coding schemes that iteratively perform equalization, decoding and memory exploitation. Two different equalizers and a correlation estimation method are also proposed. Simulation results show that the performance of the derived schemes is close to the separation-based limits. Summarizing these contributions, the goal of this dissertation is to design communication schemes that take into account the memory of single or multiterminal sources to reduce the transmit power requi red for a certain level of performance and compl<\/p>\n<p>&nbsp;<\/p>\n<h3>Datos acad\u00e9micos de la tesis doctoral \u00ab<strong>Iterative joint source-channel coding techniques for single and multiterminal sources in communication networks<\/strong>\u00ab<\/h3>\n<ul>\n<li><strong>T\u00edtulo de la tesis:<\/strong>\u00a0 Iterative joint source-channel coding techniques for single and multiterminal sources in communication networks <\/li>\n<li><strong>Autor:<\/strong>\u00a0 Javier Del Ser Lorente <\/li>\n<li><strong>Universidad:<\/strong>\u00a0 Navarra<\/li>\n<li><strong>Fecha de lectura de la tesis:<\/strong>\u00a0 23\/10\/2006<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n<h3>Direcci\u00f3n y tribunal<\/h3>\n<ul>\n<li><strong>Director de la tesis<\/strong>\n<ul>\n<li>Pedro Crespo Bofill<\/li>\n<\/ul>\n<\/li>\n<li><strong>Tribunal<\/strong>\n<ul>\n<li>Presidente del tribunal: Juan  ignacio Sancho seuma <\/li>\n<li>jon Altuna iraola (vocal)<\/li>\n<li>Luis Castedo rivas (vocal)<\/li>\n<li>joaquin Miguez arenas (vocal)<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Tesis doctoral de Javier Del Ser Lorente En cualquier sistema de comunicaci\u00f3n la compresi\u00f3n de la informaci\u00f3n generada por las [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"var(--ast-global-color-4)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"footnotes":""},"categories":[12487,17749,19520,2489],"tags":[121791,65593,85218,53579,121792,82075],"class_list":["post-55135","post","type-post","status-publish","format-standard","hentry","category-aplicacion-de-la-probabilidad","category-navarra","category-procesos-de-markov","category-tecnologia-de-las-telecomunicaciones","tag-javier-del-ser-lorente","tag-joaquin-miguez-arenas","tag-jon-altuna-iraola","tag-juan-ignacio-sancho-seuma","tag-luis-castedo-rivas","tag-pedro-crespo-bofill"],"_links":{"self":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/55135","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/comments?post=55135"}],"version-history":[{"count":0,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/55135\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/media?parent=55135"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/categories?post=55135"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/tags?post=55135"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}