Results 141 to 150 of about 342,890 (187)
Performance Bounds of Ranging Precision in SPAD-Based dToF LiDAR. [PDF]
Wu H +6 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
An achievable rate region for superposed timing channels
2016 IEEE International Symposium on Information Theory (ISIT), 2016A multiple-access channel where point processes are randomly transformed by timing channels and then superposed is considered. An achievable rate region for the K-user channel is established. A single-user achievable rate in the presence of “many” interfering users is proposed. Results are applied to exponential server timing channels.
Guido C. Ferrante +2 more
openaire +1 more source
Multicast Achievable Rate Region of Deterministic Broadcast Channel
2011 IEEE International Conference on Communications (ICC), 2011In this paper we address the problem of multicasting individual and common information from a single transmitter (source) to multiple receivers (destinations). We consider the general case where a separate message could be intended for any subset of destinations. We call this problem multicasting in broadcast channel.
Mohammad A. Khojastepour +1 more
openaire +1 more source
Achievable Rate Region for Gaussian MIMO MAC With Partial CSI
IEEE Transactions on Information Theory, 2013In this paper, we provide an information-theoretic analysis of a Gaussian multiple-input multiple-output multiple access channel (MIMO MAC) with imperfect channel knowledge at the receiver. In particular, we derive inner and outer bounds for the MIMO MAC rate region when the inputs are Gaussian.
AUBRY, AUGUSTO +3 more
openaire +2 more sources
Simpler achievable rate regions for multiaccess with finite blocklength
2012 IEEE International Symposium on Information Theory Proceedings, 2012Although practical communication networks employ coding schemes with blocklengths as low as several hundred symbols, classical information theoretic setups consider block-lengths approaching infinity. Building upon information spectrum concepts and recent work on channel dispersion, we develop a non-asymptotic inner bound on as well as a low-complexity,
Ebrahim Molavian Jazi +1 more
openaire +1 more source
Achievable rate regions for interference channel with two relays
2010 International Symposium On Information Theory & Its Applications, 2010In this paper, we introduce discrete memoryless Interference Channel (IFC) with two relays as two interfering transmitter-receiver pairs that are aided by two relays. We propose two different coding strategies for this channel. In the first strategy, we assume that each relay tries to mainly help one of the transmitter-receiver pairs through signal ...
Bahareh Akhbari +2 more
openaire +1 more source
A new achievable rate region for the interference channel
IEEE Transactions on Information Theory, 1981zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Han, Te Sun, Kobayashi, Kingo
openaire +2 more sources
Achievable rate regions for broadcast channels with cognitive relays
2009 IEEE Information Theory Workshop, 2009We investigate the fundamental limits of broadcast channels with cognitive relays. Specifically, we develop a new coding strategy and the associated achievable rate regions for the broadcast channel with two receivers and two additional cognitive relays. The new achievable rate regions exhibit potentially higher rates than existing schemes.
Jinhua Jiang +3 more
openaire +1 more source

