Filters








4,051 Hits in 4.2 sec

On a multiple-access in a vector disjunctive channel

Alexey Frolov, Victor Zyablov, Vladimir Sidorenko, Robert Fischer
2013 2013 IEEE International Symposium on Information Theory  
For the resulting multiple-access system a lower bound on the relative sum rate is derived.  ...  We address the problem of increasing the sum rate in a multiple-access system from [1] for small number of users.  ...  CONCLUSION In the present paper, a novel signal-code construction for a multiple-access system using a disjunctive vector channel is proposed.  ... 
doi:10.1109/isit.2013.6620218 dblp:conf/isit/FrolovZSF13 fatcat:ppwdhwh5hnevtazigff62ovs7i

Random multiple access in q-ary disjunctive channel

Eugeny Pustovalov, Andrey Turlikov
2012 2012 XIII International Symposium on Problems of Redundancy in Information and Control Systems  
Random Multiple Access (RMA) in q-ary disjunctive channel is considered. Novel RMA algorithm is suggested. The algorithm belongs to the class of splitting algorithms.  ...  It reduces number of retransmissions in q-ary disjunctive channel due to exploiting properties of the channel.  ...  INTRODUCTION Random Multiple Access (RMA) is preferred channel access method for the low intensity traffic where multiple packets rarely queue up at one transmitter.  ... 
doi:10.1109/red.2012.6338410 fatcat:tg3cr3yhgzcvxf4etvacxqihrm

A class of codes for a T active users out of N multiple-access communication system

P. Mathys
1990 IEEE Transactions on Information Theory  
The concept is, however, also useful in communications over the multiple-access OR channel. Many generalizations and results concerning the multiple-access OR channel have been obtained [2]-[4].  ...  The multiaccess T-BAC, as shown in Fig. 1 , is a multiple binary input single summed output channel [8].  ... 
doi:10.1109/18.59923 fatcat:7dkzgcdg6fbsnonsswo5mosenm

Superimposed codes for the multiaccess binary adder channel

P.Z. Fan, M. Darnell, B. Honary
1995 IEEE Transactions on Information Theory  
The concept is, however, also useful in communications over the multiple-access OR channel. Many generalizations and results concerning the multiple-access OR channel have been obtained [2]-[4].  ...  The multiaccess T-BAC, as shown in Fig. 1 , is a multiple binary input single summed output channel [8].  ... 
doi:10.1109/18.391266 fatcat:wyzoehaqpvaoxc6pqt7fd3vszu

A Reliable Broadcast Protocol in Vehicular Ad Hoc Networks

Xiumei Fan, Chao Wang, Jiguo Yu, Kai Xing, Yingwen Chen, Jiawei Liang
2015 International Journal of Distributed Sensor Networks  
In this paper, we propose a MAC protocol based on s-disjunct code to achieve reliable and real-time broadcasts via assigning a channel to each vehicle as the vehicle enters the network.  ...  However, current contention-based media access control (MAC) protocols cannot guarantee high performance in high density VANETs.  ...  then present a channel assignment algorithm based on -disjunct code.  ... 
doi:10.1155/2015/286241 fatcat:w6kaexncpzahhbcurwucw2cvtu

Constant Weight Codes with Gabor Dictionaries and Bayesian Decoding for Massive Random Access [article]

Patrick Agostini, Zoran Utkovski, Alexis Decurninge, Maxime Guillaud, Slawomir Stanczak
2022 arXiv   pre-print
This paper considers a general framework for massive random access based on sparse superposition coding.  ...  We provide guidelines for the code design and propose the use of constant-weight codes in combination with a dictionary design based on Gabor frames.  ...  This channel can be viewed as a concatenation of an inner channel x → A (S) x + w, and an outer multiple access channel, (c i 1 , . . . , c i Ka ) → x, where (∀k ∈ [K a ]) i k ∈ I a .  ... 
arXiv:2207.13049v1 fatcat:t6m5ytvwcfbydd26hvmqziy3uu

On the Capacity of the Multiuser Vector Adder Channel [article]

Alexey Frolov, Pavel Rybin, Victor Zyablov
2014 arXiv   pre-print
We investigate the capacity of the Q-frequency S-user vector adder channel (channel with intensity information) introduced by Chang and Wolf.  ...  At the same time the relative capacity for the uncoordinated case is upper bounded by a constant.  ...  An example of a multiple-access system with uncoordinated transmission for a disjunctive channel (OR channel) is given in [8] and for a vector disjunctive channel in [10] , [11] .  ... 
arXiv:1401.2118v1 fatcat:vipg73mmfbekrfiuynex36qrku

Semi-quantitative group testing

Amin Emad, Olgica Milenkovic
2012 2012 IEEE International Symposium on Information Theory Proceedings  
Although binary testing is required for some applications -such as coin weighing -in other 1 One may view the SQGT scheme as a generalization of thresholded group testing to multiple thresholds and zero  ...  We also define a new class of disjunct codes suitable for SQGT, termed SQ-disjunct codes.  ...  applications, such as conflict resolution in multiple access channel (MAC) and genotyping, non-binary tests may be used to further reduce the number of tests.  ... 
doi:10.1109/isit.2012.6283599 dblp:conf/isit/EmadM12 fatcat:dmhwbkgmxnfe7mflbflm2a5x34

Semi-Quantitative Group Testing [article]

Amin Emad, Olgica Milenkovic
2012 arXiv   pre-print
We also define a new class of disjunct codes suitable for SQGT, termed SQ-disjunct codes.  ...  We consider a novel group testing procedure, termed semi-quantitative group testing, motivated by a class of problems arising in genome sequence processing.  ...  CAPACITY OF SQGT It is well-known that group testing may be viewed as a special instance of a multiple access channel (MAC) (e.g. see [9] ).  ... 
arXiv:1202.2887v2 fatcat:3jzleiwk3zhthaayn5hud6dpaa

Semiquantitative Group Testing

Amin Emad, Olgica Milenkovic
2014 IEEE Transactions on Information Theory  
Semi-quantitative group testing (SQGT) is a (possibly) non-binary pooling scheme that may be viewed as a concatenation of an adder channel and an integer-valued quantizer.  ...  While for most of these constructions we assume that the number of defectives is much smaller than total number of test subjects, we also consider the case in which there is no restriction on the number  ...  applications, such as conflict resolution in multiple access channel (MAC) and genotyping, non-binary tests may be used to further reduce the number of tests.  ... 
doi:10.1109/tit.2014.2327630 fatcat:rsdzm4zhzbgs5evkqjipbmqhve

Accelerating In-Memory Database Selections Using Latency Masking Hardware Threads

Prerna Budhkar, Ildar Absalyamov, Vasileios Zois, Skyler Windh, Walid A. Najjar, Vassilis J. Tsotras
2019 ACM Transactions on Architecture and Code Optimization (TACO)  
This behavior is expected, because all memory accesses (reads or writes) on the MTP are interleaved on a single memory channel. More channel activity leads to a higher bandwidth utilization.  ...  Instead of a cache line access, these types of DIMMS allows us to gather/scatter values of strided access from multiple memory banks using a single memory request.  ... 
doi:10.1145/3310229 fatcat:g4zabsnadfbt5kdmfn5c7tqb2e

Robust resource management for predictable services in wireless healthcare

Cunqing Hua, Rong Zheng
2009 Proceedings of the 1st ACM international workshop on Medical-grade wireless networks - WiMD '09  
A good wireless solution has the potential to reduce deployment cost, facilitate ubiquitous information access, and improve patient care by eliminating wires, which are a source of infection and physical  ...  In particular, predictable services can be achieved using joint power control, channel assignment and radio interface selection in multi-radio multichannel(MR-MC) wireless networks in presence of unpredictable  ...  The disjunctive set in (5) is a proper set because the intersection of the feasible region of all disjunctions is empty.  ... 
doi:10.1145/1540373.1540377 fatcat:6uvgt3bcyja7haht4cw2j2c3o4

Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing

Elena Egorova, Marcel Fernandez, Grigory Kabatiansky, Moon Ho Lee
2018 Designs, Codes and Cryptography  
Our approach is based on the theory of the signature codes for multiple access channels, mainly, for a weighted noisy adder channel.  ...  We propose a new approach to construct noise-resistant multimedia fingerprinting codes.  ...  the segment In fact, the considered problem is equivalent to one of constructing signature codes for an A-channel-a special class of multiple access channels.  ... 
doi:10.1007/s10623-018-0580-4 fatcat:36o4ehxebvcthpdsmbmaobcgxy

Bounds on Entanglement-Assisted Source-Channel Coding via the Lovász \(\vartheta \) Number and Its Variants

Toby Cubitt, Laura Mancinska, David E. Roberson, Simone Severini, Dan Stahlke, Andreas Winter
2014 IEEE Transactions on Information Theory  
We study zero-error entanglement assisted source-channel coding (communication in the presence of side information).  ...  Beigi introduced a quantity β as an upper bound on α^* and posed the question of whether β(G) = ϑ(G) . We answer this in the affirmative and show that a related quantity is equal to ϑ(G) .  ...  APPENDIX A MULTIPLICATIVITY In Lovász' original paper [4] on the ϑ function, he proved that ϑ(G H) = ϑ(G)ϑ(H), i.e. ϑ is multiplicative with respect to the strong product.  ... 
doi:10.1109/tit.2014.2349502 fatcat:nxd7nehamfe7tlos6zse6g3vpu

Noisy Private Information Retrieval: On Separability of Channel Coding and Information Retrieval [article]

Karim Banawan, Sennur Ulukus
2018 arXiv   pre-print
In MAC-PIR, the database responses reach the user through a multiple access channel (MAC) that mixes the responses together in a stochastic way.  ...  Next, we consider the private information retrieval problem from multiple access channels (MAC-PIR).  ...  is performed via a cooperative multiple access channel, as . . i i i W i W M . . .  ... 
arXiv:1807.05997v1 fatcat:nhfarf7gvjgcnbcwi5du7pnepm
« Previous Showing results 1 — 15 out of 4,051 results