Filters








449 Hits in 6.7 sec

Computation of Total Capacity for Discrete Memoryless Multiple-Access Channels

M. Rezaeian, A. Grant
<span title="">2004</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/niovmjummbcwdg4qshgzykkpfu" style="color: black;">IEEE Transactions on Information Theory</a> </i> &nbsp;
The Arimoto-Blahut algorithm is generalized for computation of the total capacity of discrete memoryless multiple-access channels (MACs).  ...  These results are based on the specialization of the Kuhn-Tucker condition for the total capacity of the MAC, and an extension of a known symmetry property for single-user channels.  ...  Section V defines a class of "symmetric" M -user discrete memoryless MACs for which the uniform distribution is the solution of (1).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tit.2004.836661">doi:10.1109/tit.2004.836661</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7tvhoi2sibbvhoznp4hgwechea">fatcat:7tvhoi2sibbvhoznp4hgwechea</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070831123527/http://www.itr.unisa.edu.au/~alex/papers/RezaeianGrant04.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/63/47/6347a2e0fa52d045ae2333037876fb93cbc5a940.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tit.2004.836661"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Page 2180 of Mathematical Reviews Vol. 50, Issue 6 [page]

<span title="">1975</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
Guiasu (Bucharest) Meister, Bernd; Oettli, Werner (Oettli, Karl Werner] 16074 Two classes of algorithms for concave optimization, and the calculation of the capacity of discrete memoryless channels.  ...  For calculation of the capacity of arbitrary discrete memoryless channels there are two iterative methods, one of which was pro- posed by the authors in 1967 based on concave programming and the other  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1975-06_50_6/page/2180" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1975-06_50_6/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Channel quantizers that maximize random coding exponents for binary-input memoryless channels

Hideki Yagi, Brian M. Kurkoski
<span title="">2012</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jtcdcetsmvdmjcshq24lhzakwu" style="color: black;">2012 IEEE International Conference on Communications (ICC)</a> </i> &nbsp;
The problem of finding the optimum output quantizer for a given discrete memoryless channel is investigated, where the quantizer output has fewer values than the channel output.  ...  The quantizer design algorithm is based on a dynamic programming approach, and is an extension of a mutual-information maximization method.  ...  The maximization of the random coding exponent may be interpreted as the minimization of the probability of decoding error for a given discrete memoryless channel (DMC), which may be a finely quantized  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icc.2012.6363931">doi:10.1109/icc.2012.6363931</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/icc/YagiK12.html">dblp:conf/icc/YagiK12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zusvtvnobrhbnfktm4dztdlv5a">fatcat:zusvtvnobrhbnfktm4dztdlv5a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809001100/http://www.jaist.ac.jp/~kurkoski/papers/conf/Yagi-icc12.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7f/09/7f091d5a065e8c9523619f16a1634db0274a28ba.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/icc.2012.6363931"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

On Capacity Computation for the Two-User Binary Multiple-Access Channel [article]

J. Bühler, G. Wunder
<span title="2009-04-30">2009</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This paper deals with the problem of computing the boundary of the capacity region for the memoryless two-user binary-input binary-output multiple-access channel ((2,2;2)-MAC), or equivalently, the computation  ...  For a restricted class of (2,2;2)-MACs and weight vectors, it is shown that, depending on an ordering property of the channel matrix, the optimal solution is located on the boundary, or the objective function  ...  For the discrete memoryless MAC, no algorithms for the computation of the capacity region boundary are known.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0904.3894v3">arXiv:0904.3894v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vkafm2ts3jhvzi63ysl2yogj7i">fatcat:vkafm2ts3jhvzi63ysl2yogj7i</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-0904.3894/0904.3894.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0904.3894v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Error Exponents for Variable-Length Block Codes With Feedback and Cost Constraints

B. Nakiboglu, R.G. Gallager
<span title="">2008</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/niovmjummbcwdg4qshgzykkpfu" style="color: black;">IEEE Transactions on Information Theory</a> </i> &nbsp;
The results are generalized to a class of discrete-time memoryless channels with arbitrary alphabets, including additive Gaussian noise channels with amplitude and power constraints.  ...  Variable-length block-coding schemes are investigated for discrete memoryless channels with ideal feedback under cost constraints.  ...  ACKNOWLEDGMENT The authors are grateful to the reviewers of [8] and to Peter Berlin for pointing out the later paper by Burnashev [2] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tit.2007.915913">doi:10.1109/tit.2007.915913</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rprnk75ucva2rjvswrflgjkt34">fatcat:rprnk75ucva2rjvswrflgjkt34</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20130226064716/http://www.mit.edu:80/~nakib/jp/04455753.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/74/28/7428fdab5b77f34800cb0c7aaf1f566a3a32a0a7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tit.2007.915913"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Extension of the Blahut-Arimoto algorithm for maximizing directed information

Haim H. Permuter, Iddo Naiss
<span title="">2010</span> <i title="IEEE"> 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) </i> &nbsp;
The algorithm can be used for estimating the capacity of channels with delayed feedback, where the feedback is a deterministic function of the output.  ...  We give a detailed description of the algorithm, showing its complexity and the memory needed, and present several numerical examples.  ...  ACKNOWLEDGMENT The authors would like to thank the Associate Editor and anonymous referees for their comments, which significantly helped to improve the content and the organization of the paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/allerton.2010.5707083">doi:10.1109/allerton.2010.5707083</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/htwkyfqvbng7til5w4x5oahxyu">fatcat:htwkyfqvbng7til5w4x5oahxyu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20131014172902/http://www.ee.bgu.ac.il/~haimp/Blahut_Arimoto_dircted_information_IT.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/84/7b/847b3e033d3b37f4d609e8d0686bed059db6727f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/allerton.2010.5707083"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Extension of the Blahut–Arimoto Algorithm for Maximizing Directed Information

Iddo Naiss, Haim H. Permuter
<span title="">2013</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/niovmjummbcwdg4qshgzykkpfu" style="color: black;">IEEE Transactions on Information Theory</a> </i> &nbsp;
The algorithm can be used for estimating the capacity of channels with delayed feedback, where the feedback is a deterministic function of the output.  ...  We give a detailed description of the algorithm, showing its complexity and the memory needed, and present several numerical examples.  ...  ACKNOWLEDGMENT The authors would like to thank the Associate Editor and anonymous referees for their comments, which significantly helped to improve the content and the organization of the paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tit.2012.2214202">doi:10.1109/tit.2012.2214202</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bnjvugjcebaule2pbwyeupkjxq">fatcat:bnjvugjcebaule2pbwyeupkjxq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20131014172902/http://www.ee.bgu.ac.il/~haimp/Blahut_Arimoto_dircted_information_IT.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/84/7b/847b3e033d3b37f4d609e8d0686bed059db6727f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tit.2012.2214202"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

FDMA capacity of Gaussian multiple-access channels with ISI

Wei Yu, J.M. Cioffi
<span title="">2002</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dha3bnxvkvhslj74k332qi2ewa" style="color: black;">IEEE Transactions on Communications</a> </i> &nbsp;
The FDMA-capacity algorithm is used to devise the optimal frequency-division duplex plan for very-high-speed digital subscriber lines.  ...  The algorithm is based on the observation that the optimal frequency partition has a two-band structure when the two channels are identical or when the signal-to-noise ratio is high.  ...  ACKNOWLEDGMENT The authors wish to thank L. M. C. Hoo for many helpful discussion.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/26.975766">doi:10.1109/26.975766</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/wdab5pfokjakvbcjx4njdlul64">fatcat:wdab5pfokjakvbcjx4njdlul64</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705163325/https://web.stanford.edu/group/cioffi/dsm/spectrumpap/weitranc02.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b1/31/b131542587ddfd167c97d87eab251f9a9d052636.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/26.975766"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

The Feedback Capacity of the (1,∞)-RLL Input-Constrained Erasure Channel [article]

Oron Sabag, Haim H. Permuter, Navin Kashyap
<span title="2015-03-11">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
DP is thus shown to be a tool not only for solving optimization problems such as capacity calculation, but also for constructing optimal coding schemes.  ...  Furthermore, we obtained an optimal encoding procedure from the solution of the DP, leading to a capacity-achieving, zero-error coding scheme for our setting.  ...  ACKNOWLEDGMENT The authors would like to thank Yonglong Li and Guangyue Han for providing us the data for the lower bound in plotted in Fig. 3 .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1503.03359v1">arXiv:1503.03359v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ozlag5idbjeytpatruoil3jy7u">fatcat:ozlag5idbjeytpatruoil3jy7u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191015145746/https://arxiv.org/pdf/1503.03359v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/96/d6/96d632b69bcbe93abb9e9850a7b6a6f5c5d9e400.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1503.03359v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Oblivious Fronthaul-Constrained Relay for a Gaussian Channel [article]

Adi Homri, Michael Peleg, Shlomo Shamai
<span title="2018-01-05">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We also investigate the case of an entropy limited relay. We present lower and upper bounds on the optimal performance (in terms of mutual information), and derive an analytical approximation.  ...  The channel between the transmitter and the relay-station is assumed to be a frequency selective additive Gaussian noise channel.  ...  The performance of such quantizers that are optimal relative to an entropy constraint was studied for a wide class of memoryless sources (e.g. [10] , [11] and [12] ).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1510.08202v3">arXiv:1510.08202v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pj44ubmb2zeelgem5rkonkx7yi">fatcat:pj44ubmb2zeelgem5rkonkx7yi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200826080248/https://arxiv.org/pdf/1510.08202v3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a5/5a/a55a3f1bbc6cd47195b59af36483e74637585e98.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1510.08202v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Oblivious Fronthaul-Constrained Relay for a Gaussian Channel

Adi Homri, Michael Peleg, Shamai (Shitz), Shlomo
<span title="2018-11-01">2018</span> <i title="Zenodo"> Zenodo </i> &nbsp;
The performance of such quantizers that are optimal relative to an entropy constraint was studied for a wide class of memoryless sources (e.g. [14] - [16] ).  ...  Also, let the elements of X, Y be i.i.d. and the channel X − Y be memoryless.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.2586628">doi:10.5281/zenodo.2586628</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/guyldkykbvgqzhx6d3xzkbm5ze">fatcat:guyldkykbvgqzhx6d3xzkbm5ze</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201227002659/https://zenodo.org/record/2586629/files/COM-66-11-2018-hps.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/36/02/3602b5ec6d9956b67d2b61d9bd5bca1d33fdcf37.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.5281/zenodo.2586628"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> zenodo.org </button> </a>

A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels

Pascal O. Vontobel, Aleksandar Kavcic, Dieter M. Arnold, Hans-Andrea Loeliger
<span title="">2008</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/niovmjummbcwdg4qshgzykkpfu" style="color: black;">IEEE Transactions on Information Theory</a> </i> &nbsp;
The classical Blahut-Arimoto algorithm (BAA) is a well-known algorithm that optimizes a discrete memoryless source (DMS) at the input of a discrete memoryless channel (DMC) in order to maximize the mutual  ...  It includes as special cases not only the classical BAA but also an algorithm that solves the problem of finding the capacity-achieving input distribution for finite-state channels with no noise.  ...  ACKNOWLEDGMENT The authors gratefully acknowledge the reviewers' constructive comments. They are also grateful to Henry Pfister for pointing out to them the papers by Mevel  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tit.2008.920243">doi:10.1109/tit.2008.920243</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/s5voyzvk2nd53m63exq3bs36oe">fatcat:s5voyzvk2nd53m63exq3bs36oe</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809105327/http://www.isiweb.ee.ethz.ch/papers/docu/pvto-darn-aloe-2008-1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/35/ad/35adbf0965454e7229141c2f79af778436e5eff5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tit.2008.920243"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Decoding Polar Codes via Weighted-Window Soft Cancellation for Slowly-Varying Channel [article]

Yong Fang
<span title="2019-11-21">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Polar codes are a class of structured channel codes proposed by Arıkan based on the principle of channel polarization, and can achieve the symmetric capacity of any Binary-input Discrete Memoryless Channel  ...  To decode polar codes for slowly-varying channel with unknown state, on the basis of SCAN, we propose the Weighted-Window SCAN (W^2SCAN).  ...  channel, there is no efficient algorithm for the capacity of virtual channel. • Decoding algorithms.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1911.08763v2">arXiv:1911.08763v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yuiubjlfszethlhpmst4gvy2z4">fatcat:yuiubjlfszethlhpmst4gvy2z4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200909084206/https://arxiv.org/pdf/1911.08763v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f9/32/f9325d9011e15f8f02e12d1ab7c96dbaa8034de1.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1911.08763v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Orthogonal Codes for Robust Low-Cost Communication [article]

Wenyi Zhang, Urbashi Mitra
<span title="2008-09-17">2008</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Orthogonal coding schemes, known to asymptotically achieve the capacity per unit cost (CPUC) for single-user ergodic memoryless channels with a zero-cost input symbol, are investigated for single-user  ...  Second, when the uncertainty set of channel transition statistics satisfies a convexity property, optimization is performed over the class of ARPUC through utilizing results of minimax robustness.  ...  ACKNOWLEDGMENT The authors wish to thank the anonymous reviewers for their detailed comments on this work, and an anonymous reviewer of an earlier version of this work for suggesting (47) in Proposition  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0702108v3">arXiv:cs/0702108v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gymlxzyntvai7g6wxac5mrrb44">fatcat:gymlxzyntvai7g6wxac5mrrb44</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-cs0702108/cs0702108.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1f/f7/1ff7af399227b1ab8ca9b8fd459026a4d9d05a44.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/cs/0702108v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

On the limits of communication with low-precision analog-to-digital conversion at the receiver

Jaspreet Singh, Onkar Dabeer, Upamanyu Madhow
<span title="">2009</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/dha3bnxvkvhslj74k332qi2ewa" style="color: black;">IEEE Transactions on Communications</a> </i> &nbsp;
For multi-bit quantization, a dual formulation of the channel capacity problem is used to obtain tight upper bounds on the capacity.  ...  The cutting-plane algorithm is employed to compute the capacity numerically, and the results obtained are used to make the following encouraging observations : (a) up to a moderately high SNR of 20 dB,  ...  ACKNOWLEDGMENTS The authors thank an anonymous reviewer for suggesting the analysis of the additive quantization noise model in Section IV-D. The first author also thanks Prof.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tcomm.2009.12.080559">doi:10.1109/tcomm.2009.12.080559</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4lzlt7xjovesvdbqy6uimrbuqq">fatcat:4lzlt7xjovesvdbqy6uimrbuqq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100706231403/http://sputnik.ece.ucsb.edu/wcsl/Publications/jassi_jouradc.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/19/fd/19fd5ca0b6fee4847277e156a31212175a8d3ee7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tcomm.2009.12.080559"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 449 results