5 Hits in 6.0 sec

Boolean Matrix Factorization and Noisy Completion via Message Passing [article]

Siamak Ravanbakhsh, Barnabas Poczos, Russell Greiner
2016 arXiv   pre-print
Our empirical study demonstrates that message passing is able to recover low-rank Boolean matrices, in the boundaries of theoretically possible recovery and compares favorably with state-of-the-art in  ...  We treat these problems as maximum a posteriori inference problems in a graphical model and present a message passing approach that scales linearly with the number of observations and factors.  ...  This model can represent Low Density Parity Check (LDPC) coding using the XOR product, with N = 1. In LDPC, the objective is to transmit the data vector Y ∈ {0, 1} K though a noisy channel.  ... 
arXiv:1509.08535v3 fatcat:2srjrmtg4jejndgonjypqemoxa

Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs

Shaoshi Yang, Lajos Hanzo
2015 IEEE Communications Surveys and Tutorials  
Firstly, we highlight the fundamentals of MIMO detection, including the nature of co-channel interference, the generality of the MIMO detection problem, the received signal models of both linear memoryless  ...  The type-I LS-MIMO corresponds to the case where the number of active users is much smaller than the number of BS antennas, which is currently the mainstream definition of LS-MIMO.  ...  Hamid Jafarkhani (University of California, Irvine), Prof. Arogyaswami Paulraj (Stanford University) and anonymous reviewers for their insightful comments and suggestions.  ... 
doi:10.1109/comst.2015.2475242 fatcat:ppgqyvdlu5bsvk34n4e3dfog2u

Welcome Messages

2019 2019 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS)  
The database along with its source code will be made open source for the research and academic purpose.  ...  With the spread of mobile devices, image and video transmission is in great demand.  ...  G polar T inner H T ldpc = 0 (1) In order to decode the received sequence using BP decoding of LDPC code, the condition of (1) must be satisfied. Consider the polar code of R = 1/2.  ... 
doi:10.1109/ispacs48206.2019.8986291 fatcat:gu4zaxsqkncp5n2ebj5fybk7ce

Group Testing: An Information Theory Perspective

Matthew Aldridge, Oliver Johnson, Jonathan Scarlett
2019 Foundations and Trends in Communications and Information Theory  
We cover several related developments: efficient algorithms with practical storage and computation requirements, achievability bounds for optimal decoding methods, and algorithmindependent converse bounds  ...  X 0,τ , X 1,τ sub-matrices of X corresponding to (S 0 , S 1 ) with |S 0 | = τ (Equation (4.14)) X 0,τ , X 1,τ sub-vectors of X K corresponding to (S 0 , S 1 ) with |S 0 | = τ I τ conditional mutual information  ...  The apparent success of belief propagation may not be a surprise, since it has enjoyed considerable success for the decoding of LDPC codes over noisy channels, a problem that shares characteristics with  ... 
doi:10.1561/0100000099 fatcat:t3paagtzy5clnjo3t3ikdhwfpq

Engineering, Technology & Applied Science Research (ETASR), Vol. 11, No. 2, pp. 6845-7068 [article]

2021 Zenodo  
Engineering, Technology & Applied Science Research (ETASR) is an international bimonthly wide scope, peer-reviewed open access journal for the publication of original articles concerned with diverse aspects  ...  of science application, technology, and engineering.  ...  ACKNOWLEDGMENT The authors would like to thank the Deanship of the Scientific Research of the University of Ha'il, Saudi Arabia for funding and supporting this research project (♯ RG-191245).  ... 
doi:10.5281/zenodo.4720665 fatcat:mk2prflstjaa3bhkjenwy22s6u