English
Related papers

Related papers: New Bounds for Binary and Ternary Overloaded CDMA

200 papers

We consider the hashing mechanism for constructing binary embeddings, that involves pseudo-random projections followed by nonlinear (sign function) mappings. The pseudo-random projection is described by a matrix, where not all entries are…

Machine Learning · Computer Science 2016-07-04 Anna Choromanska , Krzysztof Choromanski , Mariusz Bojarski , Tony Jebara , Sanjiv Kumar , Yann LeCun

Collisions with hidden terminals is a major cause of performance degradation in 802.11 and likewise wireless networks. Carrier sense multiple access with collision avoidance (CSMA/CA) is utilized to avoid collisions at the cost of spatial…

Networking and Internet Architecture · Computer Science 2014-01-30 Zhiyi Zhou , Dongning Guo , Michael L. Honig

This paper considers linear transceiver design for downlink multiuser multiple-input multiple-output (MIMO) systems. We examine different transceiver design problems. We focus on two groups of design problems. The first group is the…

Optimization and Control · Mathematics 2013-11-26 Tadilo Endeshaw Bogale , Luc Vandendorpe

General matrix multiplication (GEMM) is a fundamental operation in deep learning (DL). With DL moving increasingly toward low precision, recent works have proposed novel unary GEMM designs as an alternative to conventional binary GEMM…

Hardware Architecture · Computer Science 2026-02-03 Prabhu Vellaisamy , Harideep Nair , Di Wu , Shawn Blanton , John Paul Shen

In this paper we present a simple method to exploit the diversity of interference in heterogenous wireless communication systems with large number of machine-type-devices (MTD). We consider a system with a machine-type-aggregator (MTA) as…

Information Theory · Computer Science 2017-08-11 Samad Ali , Nandana Rajatheva

This paper presents non-binary polar codes for the two-user multiple-access channel (MAC). The bit error rate (BER) performances of the non-binary polar codes with different kernel factors have been investigated in detail to select a proper…

Information Theory · Computer Science 2021-11-09 Guan-Chen Liu , Qi-Yue Yu

This paper is motivated by the problem of error control in network coding when errors are introduced in a random fashion (rather than chosen by an adversary). An additive-multiplicative matrix channel is considered as a model for random…

Information Theory · Computer Science 2019-05-07 Danilo Silva , Frank R. Kschischang , Ralf Kötter

A new variant of bit interleaved coded modulation (BICM) is proposed. In the new scheme, called Parallel BICM, L identical binary codes are used in parallel using a mapper, a newly proposed finite-length interleaver and a binary dither…

Information Theory · Computer Science 2010-08-18 Amir Ingber , Meir Feder

In this paper we wish to introduce a method to reconstruct large size Welch Bound Equality (WBE) codes from small size WBE codes. The advantage of these codes is that the implementation of ML decoder for the large size codes is reduced to…

Information Theory · Computer Science 2009-03-07 Mohammad Javad Faraji , Pedram Pad , Farokh Marvasti

Consider the identification (ID) via channels problem, where a receiver wants to decide whether the transmitted identifier is its identifier, rather than decoding the identifier. This model allows to transmit identifiers whose size scales…

Information Theory · Computer Science 2021-06-28 Onur Günlü , Joerg Kliewer , Rafael F. Schaefer , Vladimir Sidorenko

To increase the information capacity of DNA storage, composite DNA letters were introduced. We propose a novel channel model for composite DNA in which composite sequences are decomposed into ordered standard non-composite sequences. The…

Information Theory · Computer Science 2025-10-31 Besart Dollma , Ohad Elishco , Eitan Yaakobi

In this paper we are concerned with the asymptotic analysis of nonbinary spatially-coupled low-density parity-check (SC-LDPC) ensembles defined over GL$\left(2^{m}\right)$ (the general linear group of degree $m$ over GF$\left(2\right)$).…

Information Theory · Computer Science 2020-06-23 Zhonghao Zhang , Mengnan Xu , Chongbin Xu , Dan Zeng , Zhichao Sheng

Balancing efficiency of bandwidth use and complexity of detection involves choosing a suitable load for a multi-access channel. In the case of synchronous CDMA, with random codes, it is possible to demonstrate the existence of a threshold…

Information Theory · Computer Science 2009-05-22 Jack Raymond

We present a novel approach for low-complexity equalizer design well-suited for cellular massive MIMO systems. Our design allows to exploit the channel structure in terms of covariance matrices to improve the performance in the face of…

Information Theory · Computer Science 2018-08-01 David Neumann , Thomas Wiese , Michael Joham , Wolfgang Utschick

This paper provides a survey of the state-of-the-art information theoretic analysis for overlay multi-user (more than two pairs) cognitive networks and reports new capacity results. In an overlay scenario, cognitive / secondary users share…

Information Theory · Computer Science 2015-10-26 Diana Maamari , Daniela Tuninetti , Natasha Devroye

This paper addresses the problem of learning binary hash codes for large scale image search by proposing a novel hashing method based on deep neural network. The advantage of our deep model over previous deep model used in hashing is that…

Computer Vision and Pattern Recognition · Computer Science 2015-08-31 Thanh-Toan Do , Anh-Zung Doan , Ngai-Man Cheung

Recently, a novel lookup table based decoding method for binary low-density parity-check codes has attracted considerable attention. In this approach, mutual-information maximizing lookup tables replace the conventional operations of the…

Information Theory · Computer Science 2019-10-24 Maximilian Stark , Jan Lewandowsky , Souradip Saha , Gerhard Bauch

The binary neural network, largely saving the storage and computation, serves as a promising technique for deploying deep models on resource-limited devices. However, the binarization inevitably causes severe information loss, and even…

Neural and Evolutionary Computing · Computer Science 2020-04-08 Haotong Qin , Ruihao Gong , Xianglong Liu , Xiao Bai , Jingkuan Song , Nicu Sebe

We analyze nonbinary spatially-coupled low-density parity-check (SC-LDPC) codes built on the general linear group for transmission over the binary erasure channel. We prove threshold saturation of the belief propagation decoding to the…

Information Theory · Computer Science 2014-07-23 Alexandre Graell i Amat , Iryna Andriyanova , Amina Piemontese

In many practical communication systems, one binary encoder/decoder pair is used to communicate over a set of parallel channels. Examples of this setup include multi-carrier transmission, rate-compatible puncturing of turbo-like codes, and…

Information Theory · Computer Science 2024-01-25 Christian Häger , Alexandre Graell i Amat , Alex Alvarado , Fredrik Brännström , Erik Agrell
‹ Prev 1 8 9 10 Next ›