### 2021

Olmos, Pablo M.; Liu, Yanfang; Mitchell, David G. M.

Low-Density Parity-Check (LDPC) Codes for 5G Communications Book Chapter

In: Wiley 5G Ref, pp. 1-23, American Cancer Society, 2021, ISBN: 9781119471509.

Abstract | Links | BibTeX | Tags: 5G, Channel Coding, FPGA, hardware implementation, LDPC codes, pipeline architecture, protographs, quasi-cyclic LDPC codes

@inbook{doi,

title = {Low-Density Parity-Check (LDPC) Codes for 5G Communications},

author = {Pablo M. Olmos and Yanfang Liu and David G. M. Mitchell},

url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/9781119471509.w5GRef013},

doi = {https://doi.org/10.1002/9781119471509.w5GRef013},

isbn = {9781119471509},

year = {2021},

date = {2021-01-01},

booktitle = {Wiley 5G Ref},

pages = {1-23},

publisher = {American Cancer Society},

abstract = {Abstract In this article, we describe the fundamental advances in low-density parity-check (LDPC) codes over the last two decades with special emphasis on the class of LDPC codes selected for the 5G new radio standard. We present structured protograph and quasi-cyclic LDPC codes, which are convenient for hardware implementation. The 5G LDPC codes are then reviewed in detail. Hardware considerations regarding the implementation of the encoders and decoders of 5G LDPC codes are also discussed. We conclude the article by presenting three of the more promising extensions of LDPC codes known to date (generalized LDPC codes, nonbinary LDPC codes, and spatially coupled LDPC codes), which could potentially replace conventional LDPC codes in future communication standards.},

keywords = {5G, Channel Coding, FPGA, hardware implementation, LDPC codes, pipeline architecture, protographs, quasi-cyclic LDPC codes},

pubstate = {published},

tppubtype = {inbook}

}

### 2016

Bocharova, Irina E; i Fàbregas, Albert Guillén; Kudryashov, Boris D; Martinez, Alfonso; Campo, Adria Tauste; Vazquez-Vilar, Gonzalo

Multi-Class Source-Channel Coding Journal Article

In: IEEE Transactions on Information Theory, 62 (9), pp. 5093 – 5104, 2016.

Abstract | Links | BibTeX | Tags: Channel Coding, Complexity theory, error probability, Indexes, Journal, Maximum likelihood decoding

@article{Bocharova2016,

title = {Multi-Class Source-Channel Coding},

author = {Irina E Bocharova and Albert Guillén i Fàbregas and Boris D Kudryashov and Alfonso Martinez and Adria Tauste Campo and Gonzalo Vazquez-Vilar},

url = {http://arxiv.org/abs/1410.8714},

year = {2016},

date = {2016-09-01},

journal = {IEEE Transactions on Information Theory},

volume = {62},

number = {9},

pages = {5093 -- 5104},

abstract = {This paper studies an almost-lossless source-channel coding scheme in which source messages are assigned to different classes and encoded with a channel code that depends on the class index. The code performance is analyzed by means of random-coding error exponents and validated by simulation of a low-complexity implementation using existing source and channel codes. While each class code can be seen as a concatenation of a source code and a channel code, the overall performance improves on that of separate source-channel coding and approaches that of joint source-channel coding when the number of classes increases.},

keywords = {Channel Coding, Complexity theory, error probability, Indexes, Journal, Maximum likelihood decoding},

pubstate = {published},

tppubtype = {article}

}

Vazquez-Vilar, Gonzalo; Campo, Adria Tauste; i Fabregas, Albert Guillen; Martinez, Alfonso

Bayesian M-Ary Hypothesis Testing: The Meta-Converse and Verdú-Han Bounds Are Tight Journal Article

In: IEEE Transactions on Information Theory, 62 (5), pp. 2324–2333, 2016, ISSN: 0018-9448.

Abstract | Links | BibTeX | Tags: Bayes methods, Channel Coding, Electronic mail, error probability, Journal, Random variables, Testing

@article{Vazquez-Vilar2016,

title = {Bayesian M-Ary Hypothesis Testing: The Meta-Converse and Verdú-Han Bounds Are Tight},

author = {Gonzalo Vazquez-Vilar and Adria Tauste Campo and Albert Guillen i Fabregas and Alfonso Martinez},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7434042},

doi = {10.1109/TIT.2016.2542080},

issn = {0018-9448},

year = {2016},

date = {2016-05-01},

journal = {IEEE Transactions on Information Theory},

volume = {62},

number = {5},

pages = {2324--2333},

abstract = {Two alternative exact characterizations of the minimum error probability of Bayesian M-ary hypothesis testing are derived. The first expression corresponds to the error probability of an induced binary hypothesis test and implies the tightness of the meta-converse bound by Polyanskiy et al.; the second expression is a function of an information-spectrum measure and implies the tightness of a generalized Verdú-Han lower bound. The formulas characterize the minimum error probability of several problems in information theory and help to identify the steps where existing converse bounds are loose.},

keywords = {Bayes methods, Channel Coding, Electronic mail, error probability, Journal, Random variables, Testing},

pubstate = {published},

tppubtype = {article}

}

### 2015

Olmos, Pablo M; Urbanke, Rudiger

A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes Journal Article

In: IEEE Transactions on Information Theory, 61 (6), pp. 3164–3184, 2015, ISSN: 0018-9448.

Abstract | Links | BibTeX | Tags: asymptotic analysis, asymptotic properties, binary erasure channel, Channel Coding, Codes on graphs, Couplings, Decoding, Differential equations, error probability, finite length performance, finite length spatially coupled code, finite-length code performance, finite-length performance, Iterative decoding, iterative decoding thresholds, Journal, parity check codes, Probability, SC-LDPC codes, scaling law, Sockets, spatially coupled LDPC codes, spatially-coupled LDPC codes

@article{Olmos2015bb,

title = {A Scaling Law to Predict the Finite-Length Performance of Spatially-Coupled LDPC Codes},

author = {Pablo M Olmos and Rudiger Urbanke},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7086074},

doi = {10.1109/TIT.2015.2422816},

issn = {0018-9448},

year = {2015},

date = {2015-06-01},

journal = {IEEE Transactions on Information Theory},

volume = {61},

number = {6},

pages = {3164--3184},

abstract = {Spatially-coupled low-density parity-check (SC-LDPC) codes are known to have excellent asymptotic properties. Much less is known regarding their finite-length performance. We propose a scaling law to predict the error probability of finite-length spatially coupled code ensembles when transmission takes place over the binary erasure channel. We discuss how the parameters of the scaling law are connected to fundamental quantities appearing in the asymptotic analysis of these ensembles and we verify that the predictions of the scaling law fit well to the data derived from simulations over a wide range of parameters. The ultimate goal of this line of research is to develop analytic tools for the design of SC-LDPC codes under practical constraints.},

keywords = {asymptotic analysis, asymptotic properties, binary erasure channel, Channel Coding, Codes on graphs, Couplings, Decoding, Differential equations, error probability, finite length performance, finite length spatially coupled code, finite-length code performance, finite-length performance, Iterative decoding, iterative decoding thresholds, Journal, parity check codes, Probability, SC-LDPC codes, scaling law, Sockets, spatially coupled LDPC codes, spatially-coupled LDPC codes},

pubstate = {published},

tppubtype = {article}

}

Vazquez-Vilar, Gonzalo; Martinez, Alfonso; i Fabregas, Albert Guillen

A derivation of the Cost-Constrained Sphere-Packing Exponent Inproceedings

In: 2015 IEEE International Symposium on Information Theory (ISIT), pp. 929–933, IEEE, Hong Kong, 2015, ISBN: 978-1-4673-7704-1.

Links | BibTeX | Tags: Channel Coding, channel-coding cost-constrained sphere-packing exp, continuous channel, continuous memoryless channel, cost constraint, error probability, hypothesis testing, Lead, Memoryless systems, Optimization, per-codeword cost constraint, reliability function, spherepacking exponent, Testing

@inproceedings{Vazquez-Vilar2015,

title = {A derivation of the Cost-Constrained Sphere-Packing Exponent},

author = {Gonzalo Vazquez-Vilar and Alfonso Martinez and Albert Guillen i Fabregas},

url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=7282591},

doi = {10.1109/ISIT.2015.7282591},

isbn = {978-1-4673-7704-1},

year = {2015},

date = {2015-06-01},

booktitle = {2015 IEEE International Symposium on Information Theory (ISIT)},

pages = {929--933},

publisher = {IEEE},

address = {Hong Kong},

keywords = {Channel Coding, channel-coding cost-constrained sphere-packing exp, continuous channel, continuous memoryless channel, cost constraint, error probability, hypothesis testing, Lead, Memoryless systems, Optimization, per-codeword cost constraint, reliability function, spherepacking exponent, Testing},

pubstate = {published},

tppubtype = {inproceedings}

}

Salamanca, Luis; Murillo-Fuentes, Juan José; Olmos, Pablo M; Perez-Cruz, Fernando; Verdu, Sergio

Approaching the DT Bound Using Linear Codes in the Short Blocklength Regime Journal Article

In: IEEE Communications Letters, 19 (2), pp. 123–126, 2015, ISSN: 1089-7798.

Abstract | Links | BibTeX | Tags: binary erasure channel, Channel Coding, Complexity theory, finite blocklength regime, LDPC codes, Maximum likelihood decoding, ML decoding, parity check codes, random coding

@article{Salamanca2014bb,

title = {Approaching the DT Bound Using Linear Codes in the Short Blocklength Regime},

author = {Luis Salamanca and Juan José Murillo-Fuentes and Pablo M Olmos and Fernando Perez-Cruz and Sergio Verdu},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6957577},

doi = {10.1109/LCOMM.2014.2371032},

issn = {1089-7798},

year = {2015},

date = {2015-02-01},

journal = {IEEE Communications Letters},

volume = {19},

number = {2},

pages = {123--126},

abstract = {The dependence-testing (DT) bound is one of the strongest achievability bounds for the binary erasure channel (BEC) in the finite block length regime. In this paper, we show that maximum likelihood decoded regular low-density paritycheck (LDPC) codes with at least 5 ones per column almost achieve the DT bound. Specifically, using quasi-regular LDPC codes with block length of 256 bits, we achieve a rate that is less than 1% away from the rate predicted by the DT bound for a word error rate below 103. The results also indicate that the maximum-likelihood solution is computationally feasible for decoding block codes over the BEC with several hundred bits.},

keywords = {binary erasure channel, Channel Coding, Complexity theory, finite blocklength regime, LDPC codes, Maximum likelihood decoding, ML decoding, parity check codes, random coding},

pubstate = {published},

tppubtype = {article}

}

### 2014

Cespedes, Javier; Olmos, Pablo M; Sanchez-Fernandez, Matilde; Perez-Cruz, Fernando

Improved Performance of LDPC-Coded MIMO Systems with EP-based Soft-Decisions Inproceedings

In: 2014 IEEE International Symposium on Information Theory, pp. 1997–2001, IEEE, Honolulu, 2014, ISBN: 978-1-4799-5186-4.

Abstract | Links | BibTeX | Tags: Approximation algorithms, Approximation methods, approximation theory, Channel Coding, channel decoder, communication complexity, complexity, Complexity theory, Detectors, encoding scheme, EP soft bit probability, EP-based soft decision, error statistics, expectation propagation, expectation-maximisation algorithm, expectation-propagation algorithm, Gaussian approximation, Gaussian channels, LDPC, LDPC coded MIMO system, Low Complexity receiver, MIMO, MIMO communication, MIMO communication systems, MIMO receiver, modern communication system, multiple input multiple output, parity check codes, per-antenna soft bit probability, posterior marginalization problem, posterior probability computation, QAM constellation, Quadrature amplitude modulation, radio receivers, signaling, spectral analysis, spectral efficiency maximization, symbol detection, telecommunication signalling, Vectors

@inproceedings{Cespedes2014b,

title = {Improved Performance of LDPC-Coded MIMO Systems with EP-based Soft-Decisions},

author = {Javier Cespedes and Pablo M Olmos and Matilde Sanchez-Fernandez and Fernando Perez-Cruz},

url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6875183},

isbn = {978-1-4799-5186-4},

year = {2014},

date = {2014-01-01},

booktitle = {2014 IEEE International Symposium on Information Theory},

pages = {1997--2001},

publisher = {IEEE},

address = {Honolulu},

abstract = {Modern communications systems use efficient encoding schemes, multiple-input multiple-output (MIMO) and high-order QAM constellations for maximizing spectral efficiency. However, as the dimensions of the system grow, the design of efficient and low-complexity MIMO receivers possesses technical challenges. Symbol detection can no longer rely on conventional approaches for posterior probability computation due to complexity. Marginalization of this posterior to obtain per-antenna soft-bit probabilities to be fed to a channel decoder is computationally challenging when realistic signaling is used. In this work, we propose to use Expectation Propagation (EP) algorithm to provide an accurate low-complexity Gaussian approximation to the posterior, easily solving the posterior marginalization problem. EP soft-bit probabilities are used in an LDPC-coded MIMO system, achieving outstanding performance improvement compared to similar approaches in the literature for low-complexity LDPC MIMO decoding.},

keywords = {Approximation algorithms, Approximation methods, approximation theory, Channel Coding, channel decoder, communication complexity, complexity, Complexity theory, Detectors, encoding scheme, EP soft bit probability, EP-based soft decision, error statistics, expectation propagation, expectation-maximisation algorithm, expectation-propagation algorithm, Gaussian approximation, Gaussian channels, LDPC, LDPC coded MIMO system, Low Complexity receiver, MIMO, MIMO communication, MIMO communication systems, MIMO receiver, modern communication system, multiple input multiple output, parity check codes, per-antenna soft bit probability, posterior marginalization problem, posterior probability computation, QAM constellation, Quadrature amplitude modulation, radio receivers, signaling, spectral analysis, spectral efficiency maximization, symbol detection, telecommunication signalling, Vectors},

pubstate = {published},

tppubtype = {inproceedings}

}

Campo, Adria Tauste; Vazquez-Vilar, Gonzalo; i Fàbregas, Albert Guillén; Koch, Tobias; Martinez, Alfonso

A Derivation of the Source-Channel Error Exponent Using Nonidentical Product Distributions Journal Article

In: IEEE Transactions on Information Theory, 60 (6), pp. 3209–3217, 2014, ISSN: 0018-9448.

Abstract | Links | BibTeX | Tags: ALCIT, Channel Coding, COMONSENS, DEIPRO, error probability, joint source-channel coding, Joints, MobileNET, Probability distribution, product distributions, random coding, Reliability, reliability function, sphere-packing bound, Upper bound

@article{TausteCampo2014,

title = {A Derivation of the Source-Channel Error Exponent Using Nonidentical Product Distributions},

author = {Adria Tauste Campo and Gonzalo Vazquez-Vilar and Albert Guillén i Fàbregas and Tobias Koch and Alfonso Martinez},

url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6803047 http://www.tsc.uc3m.es/~koch/files/IEEE_TIT_60(6).pdf},

issn = {0018-9448},

year = {2014},

date = {2014-01-01},

journal = {IEEE Transactions on Information Theory},

volume = {60},

number = {6},

pages = {3209--3217},

publisher = {IEEE},

abstract = {This paper studies the random-coding exponent of joint source-channel coding for a scheme where source messages are assigned to disjoint subsets (referred to as classes), and codewords are independently generated according to a distribution that depends on the class index of the source message. For discrete memoryless systems, two optimally chosen classes and product distributions are found to be sufficient to attain the sphere-packing exponent in those cases where it is tight.},

keywords = {ALCIT, Channel Coding, COMONSENS, DEIPRO, error probability, joint source-channel coding, Joints, MobileNET, Probability distribution, product distributions, random coding, Reliability, reliability function, sphere-packing bound, Upper bound},

pubstate = {published},

tppubtype = {article}

}

Salamanca, Luis; Murillo-Fuentes, Juan José; Olmos, Pablo M; Perez-Cruz, Fernando; Verdu, Sergio

Near DT Bound Achieving Linear Codes in the Short Blocklength Regime Journal Article

In: IEEE Communications Letters, PP (99), pp. 1–1, 2014, ISSN: 1089-7798.

Abstract | Links | BibTeX | Tags: binary erasure channel, Channel Coding, Complexity theory, finite blocklength regime, LDPC codes, Maximum likelihood decoding, ML decoding, parity check codes, random coding

@article{Salamanca2014bb,

title = {Near DT Bound Achieving Linear Codes in the Short Blocklength Regime},

author = {Luis Salamanca and Juan José Murillo-Fuentes and Pablo M Olmos and Fernando Perez-Cruz and Sergio Verdu},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6957577},

issn = {1089-7798},

year = {2014},

date = {2014-01-01},

journal = {IEEE Communications Letters},

volume = {PP},

number = {99},

pages = {1--1},

abstract = {The dependence-testing (DT) bound is one of the strongest achievability bounds for the binary erasure channel (BEC) in the finite block length regime. In this paper, we show that maximum likelihood decoded regular low-density paritycheck (LDPC) codes with at least 5 ones per column almost achieve the DT bound. Specifically, using quasi-regular LDPC codes with block length of 256 bits, we achieve a rate that is less than 1% away from the rate predicted by the DT bound for a word error rate below 103. The results also indicate that the maximum-likelihood solution is computationally feasible for decoding block codes over the BEC with several hundred bits.},

keywords = {binary erasure channel, Channel Coding, Complexity theory, finite blocklength regime, LDPC codes, Maximum likelihood decoding, ML decoding, parity check codes, random coding},

pubstate = {published},

tppubtype = {article}

}

Ostman, Johan; Yang, Wei; Durisi, Giuseppe; Koch, Tobias

Diversity Versus Multiplexing at Finite Blocklength Inproceedings

In: 2014 11th International Symposium on Wireless Communications Systems (ISWCS), pp. 702–706, IEEE, Barcelona, 2014, ISBN: 978-1-4799-5863-4.

Abstract | Links | BibTeX | Tags: Antennas, Channel Coding, channel selectivity, Coherence, delay-sensitive ultra-reliable communication links, diversity reception, diversity-exploiting schemes, diversity-multiplexing tradeoff, Fading, finite blocklength analysis, maximum channel coding rate, multiple-antenna block-memoryless Rayleigh-fading, Multiplexing, nonasymptotic bounds, packet size, radio links, Rayleigh channels, Time-frequency analysis, Transmitters, Upper bound

@inproceedings{Ostman2014,

title = {Diversity Versus Multiplexing at Finite Blocklength},

author = {Johan Ostman and Wei Yang and Giuseppe Durisi and Tobias Koch},

url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6933444},

isbn = {978-1-4799-5863-4},

year = {2014},

date = {2014-01-01},

booktitle = {2014 11th International Symposium on Wireless Communications Systems (ISWCS)},

pages = {702--706},

publisher = {IEEE},

address = {Barcelona},

abstract = {A finite blocklenth analysis of the diversity-multiplexing tradeoff is presented, based on nonasymptotic bounds on the maximum channel coding rate of multiple-antenna block-memoryless Rayleigh-fading channels. The bounds in this paper allow one to numerically assess for which packet size, number of antennas, and degree of channel selectivity, diversity-exploiting schemes are close to optimal, and when instead the available spatial degrees of freedom should be used to provide spatial multiplexing. This finite blocklength view on the diversity-multiplexing tradeoff provides insights on the design of delay-sensitive ultra-reliable communication links.},

keywords = {Antennas, Channel Coding, channel selectivity, Coherence, delay-sensitive ultra-reliable communication links, diversity reception, diversity-exploiting schemes, diversity-multiplexing tradeoff, Fading, finite blocklength analysis, maximum channel coding rate, multiple-antenna block-memoryless Rayleigh-fading, Multiplexing, nonasymptotic bounds, packet size, radio links, Rayleigh channels, Time-frequency analysis, Transmitters, Upper bound},

pubstate = {published},

tppubtype = {inproceedings}

}

### 2013

Salamanca, Luis; Murillo-Fuentes, Juan Jose; Olmos, Pablo M; Perez-Cruz, Fernando

Improving the BP Estimate over the AWGN Channel Using Tree-Structured Expectation Propagation Inproceedings

In: 2013 IEEE International Symposium on Information Theory, pp. 2990–2994, IEEE, Istanbul, 2013, ISSN: 2157-8095.

Abstract | Links | BibTeX | Tags: Approximation algorithms, Approximation methods, AWGN channels, BEC, belief propagation decoding, BI-AWGN channel, binary additive white Gaussian noise channel, binary erasure channel, BP estimation, Channel Coding, Complexity theory, error rate reduction, error statistics, Expectation, finite-length codes, Iterative decoding, LDPC codes, LDPC decoding, low-density parity-check decoding, Maximum likelihood decoding, parity check codes, posterior distribution, Propagation, TEP algorithm, tree-structured expectation propagation algorithm, trees (mathematics)

@inproceedings{Salamanca2013,

title = {Improving the BP Estimate over the AWGN Channel Using Tree-Structured Expectation Propagation},

author = {Luis Salamanca and Juan Jose Murillo-Fuentes and Pablo M Olmos and Fernando Perez-Cruz},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6620774},

issn = {2157-8095},

year = {2013},

date = {2013-01-01},

booktitle = {2013 IEEE International Symposium on Information Theory},

pages = {2990--2994},

publisher = {IEEE},

address = {Istanbul},

abstract = {In this paper, we propose the tree-structured expectation propagation (TEP) algorithm for low-density parity-check (LDPC) decoding over the binary additive white Gaussian noise (BI-AWGN) channel. By approximating the posterior distribution by a tree-structure factorization, the TEP has been proven to improve belief propagation (BP) decoding over the binary erasure channel (BEC). We show for the AWGN channel how the TEP decoder is also able to capture additional information disregarded by the BP solution, which leads to a noticeable reduction of the error rate for finite-length codes. We show that for the range of codes of interest, the TEP gain is obtained with a slight increase in complexity over that of the BP algorithm. An efficient way of constructing the tree-like structure is also described.},

keywords = {Approximation algorithms, Approximation methods, AWGN channels, BEC, belief propagation decoding, BI-AWGN channel, binary additive white Gaussian noise channel, binary erasure channel, BP estimation, Channel Coding, Complexity theory, error rate reduction, error statistics, Expectation, finite-length codes, Iterative decoding, LDPC codes, LDPC decoding, low-density parity-check decoding, Maximum likelihood decoding, parity check codes, posterior distribution, Propagation, TEP algorithm, tree-structured expectation propagation algorithm, trees (mathematics)},

pubstate = {published},

tppubtype = {inproceedings}

}

Salamanca, Luis; Olmos, Pablo M; Perez-Cruz, Fernando; Murillo-Fuentes, Juan Jose

Tree-Structured Expectation Propagation for LDPC Decoding over BMS Channels Journal Article

In: IEEE Transactions on Communications, 61 (10), pp. 4086–4095, 2013, ISSN: 0090-6778.

Abstract | Links | BibTeX | Tags: Approximation algorithms, Approximation methods, BEC, belief propagation, binary erasure channel, binary memoryless symmetric channels, BMS channels, Channel Coding, Complexity theory, convolutional codes, convolutional low-density parity-check codes, Decoding, decoding block, expectation propagation, finite-length codes, LDPC decoding, message-passing algorithm, parity check codes, Probability density function, sparse linear codes, TEP algorithm, tree-structured expectation propagation, trees (mathematics), Vegetation

@article{Salamanca2013a,

title = {Tree-Structured Expectation Propagation for LDPC Decoding over BMS Channels},

author = {Luis Salamanca and Pablo M Olmos and Fernando Perez-Cruz and Juan Jose Murillo-Fuentes},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6587624},

issn = {0090-6778},

year = {2013},

date = {2013-01-01},

journal = {IEEE Transactions on Communications},

volume = {61},

number = {10},

pages = {4086--4095},

abstract = {In this paper, we put forward the tree-structured expectation propagation (TEP) algorithm for decoding block and convolutional low-density parity-check codes over any binary channel. We have already shown that TEP improves belief propagation (BP) over the binary erasure channel (BEC) by imposing marginal constraints over a set of pairs of variables that form a tree or a forest. The TEP decoder is a message-passing algorithm that sequentially builds a tree/forest of erased variables to capture additional information disregarded by the standard BP decoder, which leads to a noticeable reduction of the error rate for finite-length codes. In this paper, we show how the TEP can be extended to any channel, specifically to binary memoryless symmetric (BMS) channels. We particularly focus on how the TEP algorithm can be adapted for any channel model and, more importantly, how to choose the tree/forest to keep the gains observed for block and convolutional LDPC codes over the BEC.},

keywords = {Approximation algorithms, Approximation methods, BEC, belief propagation, binary erasure channel, binary memoryless symmetric channels, BMS channels, Channel Coding, Complexity theory, convolutional codes, convolutional low-density parity-check codes, Decoding, decoding block, expectation propagation, finite-length codes, LDPC decoding, message-passing algorithm, parity check codes, Probability density function, sparse linear codes, TEP algorithm, tree-structured expectation propagation, trees (mathematics), Vegetation},

pubstate = {published},

tppubtype = {article}

}

Bravo-Santos, Ángel M

Polar Codes for Gaussian Degraded Relay Channels Journal Article

In: IEEE Communications Letters, 17 (2), pp. 365–368, 2013, ISSN: 1089-7798.

Abstract | Links | BibTeX | Tags: channel capacity, Channel Coding, Decoding, Encoding, Gaussian channels, Gaussian degraded relay channel, Gaussian noise, Gaussian-degraded relay channels, log-likelihood expression, Markov coding, Noise, parity check codes, polar code detector, polar codes, relay-destination link, Relays, Vectors

@article{Bravo-Santos2013,

title = {Polar Codes for Gaussian Degraded Relay Channels},

author = {Ángel M Bravo-Santos},

url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=6412681},

issn = {1089-7798},

year = {2013},

date = {2013-01-01},

journal = {IEEE Communications Letters},

volume = {17},

number = {2},

pages = {365--368},

publisher = {IEEE},

abstract = {In this paper we apply polar codes for the Gaussian degraded relay channel. We study the conditions to be satisfied by the codes and provide an efficient method for constructing them. The relay-destination link is special because the noise is the sum of two components: the Gaussian noise and the signals from the source. We study this link and provide the log-likelihood expression to be used by the polar code detector. We perform simulations of the channel and the results show that polar codes of high rate and large codeword length are closer to the theoretical limit than other good codes.},

keywords = {channel capacity, Channel Coding, Decoding, Encoding, Gaussian channels, Gaussian degraded relay channel, Gaussian noise, Gaussian-degraded relay channels, log-likelihood expression, Markov coding, Noise, parity check codes, polar code detector, polar codes, relay-destination link, Relays, Vectors},

pubstate = {published},

tppubtype = {article}

}

### 2012

Campo, Adria Tauste; Vazquez-Vilar, Gonzalo; i Fabregas, Albert Guillen; Koch, Tobias; Martinez, Alfonso

Achieving Csiszár's Source-Channel Coding Exponent with Product Distributions Inproceedings

In: 2012 IEEE International Symposium on Information Theory Proceedings, pp. 1548–1552, IEEE, Cambridge, MA, 2012, ISSN: 2157-8095.

Abstract | Links | BibTeX | Tags: average probability of error, Channel Coding, code construction, codewords, Csiszár's source-channel coding, Decoding, Encoding, error probability, error statistics, Joints, Manganese, product distributions, random codes, random-coding upper bound, source coding, source messages, Upper bound

@inproceedings{Campo2012a,

title = {Achieving Csiszár's Source-Channel Coding Exponent with Product Distributions},

author = {Adria Tauste Campo and Gonzalo Vazquez-Vilar and Albert Guillen i Fabregas and Tobias Koch and Alfonso Martinez},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6283524},

issn = {2157-8095},

year = {2012},

date = {2012-01-01},

booktitle = {2012 IEEE International Symposium on Information Theory Proceedings},

pages = {1548--1552},

publisher = {IEEE},

address = {Cambridge, MA},

abstract = {We derive a random-coding upper bound on the average probability of error of joint source-channel coding that recovers Csiszár's error exponent when used with product distributions over the channel inputs. Our proof technique for the error probability analysis employs a code construction for which source messages are assigned to subsets and codewords are generated with a distribution that depends on the subset.},

keywords = {average probability of error, Channel Coding, code construction, codewords, Csiszár's source-channel coding, Decoding, Encoding, error probability, error statistics, Joints, Manganese, product distributions, random codes, random-coding upper bound, source coding, source messages, Upper bound},

pubstate = {published},

tppubtype = {inproceedings}

}

Salamanca, Luis; Murillo-Fuentes, Juan Jose; Perez-Cruz, Fernando

Bayesian Equalization for LDPC Channel Decoding Journal Article

In: IEEE Transactions on Signal Processing, 60 (5), pp. 2672–2676, 2012, ISSN: 1053-587X.

Abstract | Links | BibTeX | Tags: Approximation methods, Bayes methods, Bayesian equalization, Bayesian estimation problem, Bayesian inference, Bayesian methods, BCJR (Bahl–Cocke–Jelinek–Raviv) algorithm, BCJR algorithm, Channel Coding, channel decoding, channel equalization, channel equalization problem, Channel estimation, channel state information, CSI, Decoding, equalisers, Equalizers, expectation propagation, expectation propagation algorithm, fading channels, graphical model representation, intersymbol interference, Kullback-Leibler divergence, LDPC, LDPC coding, low-density parity-check decoder, Modulation, parity check codes, symbol posterior estimates, Training

@article{Salamanca2012b,

title = {Bayesian Equalization for LDPC Channel Decoding},

author = {Luis Salamanca and Juan Jose Murillo-Fuentes and Fernando Perez-Cruz},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6129544},

issn = {1053-587X},

year = {2012},

date = {2012-01-01},

journal = {IEEE Transactions on Signal Processing},

volume = {60},

number = {5},

pages = {2672--2676},

abstract = {We describe the channel equalization problem, and its prior estimate of the channel state information (CSI), as a joint Bayesian estimation problem to improve each symbol posterior estimates at the input of the channel decoder. Our approach takes into consideration not only the uncertainty due to the noise in the channel, but also the uncertainty in the CSI estimate. However, this solution cannot be computed in linear time, because it depends on all the transmitted symbols. Hence, we also put forward an approximation for each symbol's posterior, using the expectation propagation algorithm, which is optimal from the Kullback-Leibler divergence viewpoint and yields an equalization with a complexity identical to the BCJR algorithm. We also use a graphical model representation of the full posterior, in which the proposed approximation can be readily understood. The proposed posterior estimates are more accurate than those computed using the ML estimate for the CSI. In order to illustrate this point, we measure the error rate at the output of a low-density parity-check decoder, which needs the exact posterior for each symbol to detect the incoming word and it is sensitive to a mismatch in those posterior estimates. For example, for QPSK modulation and a channel with three taps, we can expect gains over 0.5 dB with same computational complexity as the ML receiver.},

keywords = {Approximation methods, Bayes methods, Bayesian equalization, Bayesian estimation problem, Bayesian inference, Bayesian methods, BCJR (Bahl–Cocke–Jelinek–Raviv) algorithm, BCJR algorithm, Channel Coding, channel decoding, channel equalization, channel equalization problem, Channel estimation, channel state information, CSI, Decoding, equalisers, Equalizers, expectation propagation, expectation propagation algorithm, fading channels, graphical model representation, intersymbol interference, Kullback-Leibler divergence, LDPC, LDPC coding, low-density parity-check decoder, Modulation, parity check codes, symbol posterior estimates, Training},

pubstate = {published},

tppubtype = {article}

}

### 2011

Ruiz, Francisco J R; Perez-Cruz, Fernando

Zero-Error Codes for the Noisy-Typewriter Channel Inproceedings

In: 2011 IEEE Information Theory Workshop, pp. 495–497, IEEE, Paraty, 2011, ISBN: 978-1-4577-0437-6.

Abstract | Links | BibTeX | Tags: channel capacity, Channel Coding, Equations, Linear code, Noise measurement, noisy-typewriter channel, nontrivial codes, nonzero zero-error rate, odd-letter noisy-typewriter channels, Upper bound, Vectors, zero-error capacity, zero-error codes

@inproceedings{Ruiz2011,

title = {Zero-Error Codes for the Noisy-Typewriter Channel},

author = {Francisco J R Ruiz and Fernando Perez-Cruz},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6089510},

isbn = {978-1-4577-0437-6},

year = {2011},

date = {2011-01-01},

booktitle = {2011 IEEE Information Theory Workshop},

pages = {495--497},

publisher = {IEEE},

address = {Paraty},

abstract = {In this paper, we propose nontrivial codes that achieve a non-zero zero-error rate for several odd-letter noisy-typewriter channels. Some of these codes (specifically, those which are defined for a number of letters of the channel of the form 2n + 1) achieve the best-known lower bound on the zero-error capacity. We build the codes using linear codes over rings, as we do not require the multiplicative inverse to build the codes.},

keywords = {channel capacity, Channel Coding, Equations, Linear code, Noise measurement, noisy-typewriter channel, nontrivial codes, nonzero zero-error rate, odd-letter noisy-typewriter channels, Upper bound, Vectors, zero-error capacity, zero-error codes},

pubstate = {published},

tppubtype = {inproceedings}

}

Koch, Tobias; Lapidoth, Amos

Asymmetric Quantizers are Better at Low SNR Inproceedings

In: 2011 IEEE International Symposium on Information Theory Proceedings, pp. 2592–2596, IEEE, St. Petersburg, 2011, ISSN: 2157-8095.

Abstract | Links | BibTeX | Tags: asymmetric one-bit quantizer, asymmetric signal constellations, channel capacity, Channel Coding, Constellation diagram, Decoding, discrete-time average-power-limited Gaussian chann, Gaussian channels, quantization, Signal to noise ratio, signal-to-noise ratio, SNR, spread spectrum communication, spread-spectrum communications, ultra wideband communication, ultrawideband communications, Upper bound

@inproceedings{Koch2011,

title = {Asymmetric Quantizers are Better at Low SNR},

author = {Tobias Koch and Amos Lapidoth},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6034037},

issn = {2157-8095},

year = {2011},

date = {2011-01-01},

booktitle = {2011 IEEE International Symposium on Information Theory Proceedings},

pages = {2592--2596},

publisher = {IEEE},

address = {St. Petersburg},

abstract = {We study the behavior of channel capacity when a one-bit quantizer is employed at the output of the discrete-time average-power-limited Gaussian channel. We focus on the low signal-to-noise ratio regime, where communication at very low spectral efficiencies takes place, as in Spread-Spectrum and Ultra-Wideband communications. It is well known that, in this regime, a symmetric one-bit quantizer reduces capacity by 2/$pi$, which translates to a power loss of approximately two decibels. Here we show that if an asymmetric one-bit quantizer is employed, and if asymmetric signal constellations are used, then these two decibels can be recovered in full.},

keywords = {asymmetric one-bit quantizer, asymmetric signal constellations, channel capacity, Channel Coding, Constellation diagram, Decoding, discrete-time average-power-limited Gaussian chann, Gaussian channels, quantization, Signal to noise ratio, signal-to-noise ratio, SNR, spread spectrum communication, spread-spectrum communications, ultra wideband communication, ultrawideband communications, Upper bound},

pubstate = {published},

tppubtype = {inproceedings}

}

Salamanca, Luis; Olmos, Pablo M; Murillo-Fuentes, Juan Jose; Perez-Cruz, Fernando

MAP Decoding for LDPC Codes over the Binary Erasure Channel Inproceedings

In: 2011 IEEE Information Theory Workshop, pp. 145–149, IEEE, Paraty, 2011, ISBN: 978-1-4577-0437-6.

Abstract | Links | BibTeX | Tags: binary erasure channel, Channel Coding, computational complexity, Decoding, generalized peeling decoder, generalized tree-structured expectation propagatio, graphical models, Iterative decoding, LDPC codes, MAP decoding, MAP decoding algorithm, Maximum likelihood decoding, parity check codes, TEP decoder, tree graph theory, Tree graphs, tree-structured expectation propagation, trees (mathematics)

@inproceedings{Salamanca2011a,

title = {MAP Decoding for LDPC Codes over the Binary Erasure Channel},

author = {Luis Salamanca and Pablo M Olmos and Juan Jose Murillo-Fuentes and Fernando Perez-Cruz},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6089364},

isbn = {978-1-4577-0437-6},

year = {2011},

date = {2011-01-01},

booktitle = {2011 IEEE Information Theory Workshop},

pages = {145--149},

publisher = {IEEE},

address = {Paraty},

abstract = {In this paper, we propose a decoding algorithm for LDPC codes that achieves the MAP solution over the BEC. This algorithm, denoted as generalized tree-structured expectation propagation (GTEP), extends the idea of our previous work, the TEP decoder. The GTEP modifies the graph by eliminating a check node of any degree and merging this information with the remaining graph. The GTEP decoder upon completion either provides the unique MAP solution or a tree graph in which the number of parent nodes indicates the multiplicity of the MAP solution. This algorithm can be easily described for the BEC, and it can be cast as a generalized peeling decoder. The GTEP naturally optimizes the complexity of the decoder, by looking for checks nodes of minimum degree to be eliminated first.},

keywords = {binary erasure channel, Channel Coding, computational complexity, Decoding, generalized peeling decoder, generalized tree-structured expectation propagatio, graphical models, Iterative decoding, LDPC codes, MAP decoding, MAP decoding algorithm, Maximum likelihood decoding, parity check codes, TEP decoder, tree graph theory, Tree graphs, tree-structured expectation propagation, trees (mathematics)},

pubstate = {published},

tppubtype = {inproceedings}

}

### 2010

Olmos, Pablo M; Murillo-Fuentes, Juan Jose; Perez-Cruz, Fernando

Tree-Structure Expectation Propagation for Decoding LDPC Codes over Binary Erasure Channels Inproceedings

In: 2010 IEEE International Symposium on Information Theory, pp. 799–803, IEEE, Austin, TX, 2010, ISBN: 978-1-4244-7892-7.

Abstract | Links | BibTeX | Tags: belief propagation, binary erasure channels, Bipartite graph, BP decoder, Capacity planning, Channel Coding, codeword, computational complexity, Decoding, Finishing, graph theory, H infinity control, LDPC code decoding, LDPC Tanner graph, Maxwell decoder, parity check codes, Performance analysis, tree structure expectation propagation, trees (mathematics), Upper bound

@inproceedings{Olmos2010,

title = {Tree-Structure Expectation Propagation for Decoding LDPC Codes over Binary Erasure Channels},

author = {Pablo M Olmos and Juan Jose Murillo-Fuentes and Fernando Perez-Cruz},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5513636},

isbn = {978-1-4244-7892-7},

year = {2010},

date = {2010-01-01},

booktitle = {2010 IEEE International Symposium on Information Theory},

pages = {799--803},

publisher = {IEEE},

address = {Austin, TX},

abstract = {Expectation Propagation is a generalization to Belief Propagation (BP) in two ways. First, it can be used with any exponential family distribution over the cliques in the graph. Second, it can impose additional constraints on the marginal distributions. We use this second property to impose pair-wise marginal distribution constraints in some check nodes of the LDPC Tanner graph. These additional constraints allow decoding the received codeword when the BP decoder gets stuck. In this paper, we first present the new decoding algorithm, whose complexity is identical to the BP decoder, and we then prove that it is able to decode codewords with a larger fraction of erasures, as the block size tends to infinity. The proposed algorithm can be also understood as a simplification of the Maxwell decoder, but without its computational complexity. We also illustrate that the new algorithm outperforms the BP decoder for finite block-size codes.},

keywords = {belief propagation, binary erasure channels, Bipartite graph, BP decoder, Capacity planning, Channel Coding, codeword, computational complexity, Decoding, Finishing, graph theory, H infinity control, LDPC code decoding, LDPC Tanner graph, Maxwell decoder, parity check codes, Performance analysis, tree structure expectation propagation, trees (mathematics), Upper bound},

pubstate = {published},

tppubtype = {inproceedings}

}

Salamanca, Luis; Murillo-Fuentes, Juan Jose; Perez-Cruz, Fernando

Channel Decoding with a Bayesian Equalizer Inproceedings

In: 2010 IEEE International Symposium on Information Theory, pp. 1998–2002, IEEE, Austin, TX, 2010, ISBN: 978-1-4244-7892-7.

Abstract | Links | BibTeX | Tags: a posteriori probability, Bayesian equalizer, Bayesian methods, BER, Bit error rate, Channel Coding, channel decoding, channel estate information, Communication channels, Decoding, equalisers, Equalizers, error statistics, low-density parity-check decoders, LPDC decoders, Maximum likelihood decoding, maximum likelihood detection, maximum likelihood estimation, Noise reduction, parity check codes, Probability, Uncertainty

@inproceedings{Salamanca2010a,

title = {Channel Decoding with a Bayesian Equalizer},

author = {Luis Salamanca and Juan Jose Murillo-Fuentes and Fernando Perez-Cruz},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5513348},

isbn = {978-1-4244-7892-7},

year = {2010},

date = {2010-01-01},

booktitle = {2010 IEEE International Symposium on Information Theory},

pages = {1998--2002},

publisher = {IEEE},

address = {Austin, TX},

abstract = {Low-density parity-check (LPDC) decoders assume the channel estate information (CSI) is known and they have the true a posteriori probability (APP) for each transmitted bit. But in most cases of interest, the CSI needs to be estimated with the help of a short training sequence and the LDPC decoder has to decode the received word using faulty APP estimates. In this paper, we study the uncertainty in the CSI estimate and how it affects the bit error rate (BER) output by the LDPC decoder. To improve these APP estimates, we propose a Bayesian equalizer that takes into consideration not only the uncertainty due to the noise in the channel, but also the uncertainty in the CSI estimate, reducing the BER after the LDPC decoder.},

keywords = {a posteriori probability, Bayesian equalizer, Bayesian methods, BER, Bit error rate, Channel Coding, channel decoding, channel estate information, Communication channels, Decoding, equalisers, Equalizers, error statistics, low-density parity-check decoders, LPDC decoders, Maximum likelihood decoding, maximum likelihood detection, maximum likelihood estimation, Noise reduction, parity check codes, Probability, Uncertainty},

pubstate = {published},

tppubtype = {inproceedings}

}

Olmos, Pablo M; Murillo-Fuentes, Juan Jose; Perez-Cruz, Fernando

Joint Nonlinear Channel Equalization and Soft LDPC Decoding with Gaussian Processes Journal Article

In: IEEE Transactions on Signal Processing, 58 (3), pp. 1183–1192, 2010, ISSN: 1053-587X.

Abstract | Links | BibTeX | Tags: Bayesian nonlinear classification tool, Bit error rate, Channel Coding, channel equalizers, Channel estimation, Coding, equalisers, equalization, error statistics, Gaussian processes, GPC, joint nonlinear channel equalization, low-density parity-check (LDPC), low-density parity-check channel decoder, Machine learning, nonlinear channel, nonlinear codes, parity check codes, posterior probability estimates, soft LDPC decoding, soft-decoding, support vector machine (SVM)

@article{Olmos2010a,

title = {Joint Nonlinear Channel Equalization and Soft LDPC Decoding with Gaussian Processes},

author = {Pablo M Olmos and Juan Jose Murillo-Fuentes and Fernando Perez-Cruz},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5290078},

issn = {1053-587X},

year = {2010},

date = {2010-01-01},

journal = {IEEE Transactions on Signal Processing},

volume = {58},

number = {3},

pages = {1183--1192},

abstract = {In this paper, we introduce a new approach for nonlinear equalization based on Gaussian processes for classification (GPC). We propose to measure the performance of this equalizer after a low-density parity-check channel decoder has detected the received sequence. Typically, most channel equalizers concentrate on reducing the bit error rate, instead of providing accurate posterior probability estimates. We show that the accuracy of these estimates is essential for optimal performance of the channel decoder and that the error rate output by the equalizer might be irrelevant to understand the performance of the overall communication receiver. In this sense, GPC is a Bayesian nonlinear classification tool that provides accurate posterior probability estimates with short training sequences. In the experimental section, we compare the proposed GPC-based equalizer with state-of-the-art solutions to illustrate its improved performance.},

keywords = {Bayesian nonlinear classification tool, Bit error rate, Channel Coding, channel equalizers, Channel estimation, Coding, equalisers, equalization, error statistics, Gaussian processes, GPC, joint nonlinear channel equalization, low-density parity-check (LDPC), low-density parity-check channel decoder, Machine learning, nonlinear channel, nonlinear codes, parity check codes, posterior probability estimates, soft LDPC decoding, soft-decoding, support vector machine (SVM)},

pubstate = {published},

tppubtype = {article}

}

Fresia, Maria; Perez-Cruz, Fernando; Poor, Vincent H; Verdu, Sergio

Joint Source and Channel Coding Journal Article

In: IEEE Signal Processing Magazine, 27 (6), pp. 104–113, 2010, ISSN: 1053-5888.

Abstract | Links | BibTeX | Tags: belief propagation, Channel Coding, combined source-channel coding, Decoding, Encoding, graphical model, Hidden Markov models, Iterative decoding, joint source channel coding, JSC coding, LDPC code, low density parity check code, Markov processes, parity check codes, Slepian-Wolf problem, variable length codes

@article{Fresia2010,

title = {Joint Source and Channel Coding},

author = {Maria Fresia and Fernando Perez-Cruz and Vincent H Poor and Sergio Verdu},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5563107},

issn = {1053-5888},

year = {2010},

date = {2010-01-01},

journal = {IEEE Signal Processing Magazine},

volume = {27},

number = {6},

pages = {104--113},

abstract = {The objectives of this article are two-fold: First, to present the problem of joint source and channel (JSC) coding from a graphical model perspective and second, to propose a structure that uses a new graphical model for jointly encoding and decoding a redundant source. In the first part of the article, relevant contributions to JSC coding, ranging from the Slepian-Wolf problem to joint decoding of variable length codes with state-of-the-art source codes, are reviewed and summarized. In the second part, a double low-density parity-check (LDPC) code for JSC coding is proposed. The double LDPC code can be decoded as a single bipartite graph using standard belief propagation (BP) and its limiting performance is analyzed by using extrinsic information transfer (EXIT) chart approximations.},

keywords = {belief propagation, Channel Coding, combined source-channel coding, Decoding, Encoding, graphical model, Hidden Markov models, Iterative decoding, joint source channel coding, JSC coding, LDPC code, low density parity check code, Markov processes, parity check codes, Slepian-Wolf problem, variable length codes},

pubstate = {published},

tppubtype = {article}

}

### 2009

Perez-Cruz, Fernando; Kulkarni, S R

Distributed Least Square for Consensus Building in Sensor Networks Inproceedings

In: 2009 IEEE International Symposium on Information Theory, pp. 2877–2881, IEEE, Seoul, 2009, ISBN: 978-1-4244-4312-3.

Abstract | Links | BibTeX | Tags: Change detection algorithms, Channel Coding, Distributed computing, distributed least square method, graphical models, Inference algorithms, Kernel, Least squares methods, nonparametric statistics, Parametric statistics, robustness, sensor-network learning, statistical analysis, Telecommunication network reliability, Wireless sensor network, Wireless Sensor Networks

@inproceedings{Perez-Cruz2009,

title = {Distributed Least Square for Consensus Building in Sensor Networks},

author = {Fernando Perez-Cruz and S R Kulkarni},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5205336},

isbn = {978-1-4244-4312-3},

year = {2009},

date = {2009-01-01},

booktitle = {2009 IEEE International Symposium on Information Theory},

pages = {2877--2881},

publisher = {IEEE},

address = {Seoul},

abstract = {We present a novel mechanism for consensus building in sensor networks. The proposed algorithm has three main properties that make it suitable for general sensor-network learning. First, the proposed algorithm is based on robust nonparametric statistics and thereby needs little prior knowledge about the network and the function that needs to be estimated. Second, the algorithm uses only local information about the network and it communicates only with nearby sensors. Third, the algorithm is completely asynchronous and robust. It does not need to coordinate the sensors to estimate the underlying function and it is not affected if other sensors in the network stop working. Therefore, the proposed algorithm is an ideal candidate for sensor networks deployed in remote and inaccessible areas, which might need to change their objective once they have been set up.},

keywords = {Change detection algorithms, Channel Coding, Distributed computing, distributed least square method, graphical models, Inference algorithms, Kernel, Least squares methods, nonparametric statistics, Parametric statistics, robustness, sensor-network learning, statistical analysis, Telecommunication network reliability, Wireless sensor network, Wireless Sensor Networks},

pubstate = {published},

tppubtype = {inproceedings}

}

Fresia, Maria; Perez-Cruz, Fernando; Poor, Vincent H

Optimized Concatenated LDPC Codes for Joint Source-Channel Coding Inproceedings

In: 2009 IEEE International Symposium on Information Theory, pp. 2131–2135, IEEE, Seoul, 2009, ISBN: 978-1-4244-4312-3.

Abstract | Links | BibTeX | Tags: approximation theory, asymptotic behavior analysis, Channel Coding, combined source-channel coding, Concatenated codes, Decoding, Entropy, EXIT chart, extrinsic information transfer, H infinity control, Information analysis, joint belief propagation decoder, joint source-channel coding, low-density-parity-check code, optimized concatenated independent LDPC codes, parity check codes, Redundancy, source coding, transmitter, Transmitters

@inproceedings{Fresia2009,

title = {Optimized Concatenated LDPC Codes for Joint Source-Channel Coding},

author = {Maria Fresia and Fernando Perez-Cruz and Vincent H Poor},

url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5205766},

isbn = {978-1-4244-4312-3},

year = {2009},

date = {2009-01-01},

booktitle = {2009 IEEE International Symposium on Information Theory},

pages = {2131--2135},

publisher = {IEEE},

address = {Seoul},

abstract = {In this paper a scheme for joint source-channel coding based on low-density-parity-check (LDPC) codes is investigated. Two concatenated independent LDPC codes are used in the transmitter: one for source coding and the other for channel coding, with a joint belief propagation decoder. The asymptotic behavior is analyzed using EXtrinsic Information Transfer (EXIT) charts and this approximation is corroborated with illustrative experiments. The optimization of the degree distributions for our sparse code to maximize the information transmission rate is also considered.},

keywords = {approximation theory, asymptotic behavior analysis, Channel Coding, combined source-channel coding, Concatenated codes, Decoding, Entropy, EXIT chart, extrinsic information transfer, H infinity control, Information analysis, joint belief propagation decoder, joint source-channel coding, low-density-parity-check code, optimized concatenated independent LDPC codes, parity check codes, Redundancy, source coding, transmitter, Transmitters},

pubstate = {published},

tppubtype = {inproceedings}

}