Search Results - "Niesen, U."
-
1
The Degrees of Freedom of Compute-and-Forward
Published in IEEE transactions on information theory (01-08-2012)“…We analyze the asymptotic behavior of compute-and-forward relay networks in the regime of high signal-to-noise ratios. We consider a section of such a network…”
Get full text
Journal Article -
2
Caching in Wireless Networks
Published in IEEE transactions on information theory (01-10-2012)“…We consider the problem of delivering content cached in a wireless network of n nodes randomly located on a square of area n. The network performance is…”
Get full text
Journal Article -
3
Adaptive Alternating Minimization Algorithms
Published in IEEE transactions on information theory (01-03-2009)“…The classical alternating minimization (or projection) algorithm has been successful in the context of solving optimization problems over two variables. The…”
Get full text
Journal Article -
4
The Approximate Capacity of the Gaussian n-Relay Diamond Network
Published in IEEE transactions on information theory (01-02-2013)“…We consider the Gaussian "diamond" or parallel relay network, in which a source node transmits a message to a destination node with the help of N relays. Even…”
Get full text
Journal Article -
5
On Capacity Scaling in Arbitrary Wireless Networks
Published in IEEE transactions on information theory (01-09-2009)“…In recent work, Ozgur, Leveque, and Tse (2007) obtained a complete scaling characterization of throughput scaling for random extended wireless networks (i.e.,…”
Get full text
Journal Article -
6
Computation Alignment: Capacity Approximation Without Noise Accumulation
Published in IEEE transactions on information theory (01-06-2013)“…Consider several source nodes communicating across a wireless network to a destination node with the help of several layers of relay nodes. Recent work by…”
Get full text
Journal Article -
7
Tracking Stopping Times Through Noisy Observations
Published in IEEE transactions on information theory (01-01-2009)“…A novel quickest detection setting is proposed, generalizing the well-known Bayesian change-point detection model. Suppose {(Xi , Yi )} i ges 1 is a sequence…”
Get full text
Journal Article -
8
On Capacity of Line Networks
Published in IEEE transactions on information theory (01-11-2007)“…We consider communication through a cascade of discrete memoryless channels (DMCs). The source and destination node of this cascade are allowed to use coding…”
Get full text
Journal Article -
9
Fundamental Limits of Caching
Published in IEEE transactions on information theory (01-05-2014)“…Caching is a technique to reduce peak traffic rates by prefetching popular content into memories at the end users. Conventionally, these memories are used to…”
Get full text
Journal Article -
10
Interference Alignment in Dense Wireless Networks
Published in IEEE transactions on information theory (01-05-2011)“…We consider arbitrary dense wireless networks, in which n nodes are placed in an arbitrary (deterministic) manner on a square region of unit area and…”
Get full text
Journal Article -
11
Interference Alignment: From Degrees of Freedom to Constant-Gap Capacity Approximations
Published in IEEE transactions on information theory (01-08-2013)“…Interference alignment is a key technique for communication scenarios with multiple interfering links. In several such scenarios, interference alignment was…”
Get full text
Journal Article -
12
Glare sensitivity and visual acuity after excimer laser photorefractive keratectomy for myopia
Published in British journal of ophthalmology (01-02-1997)“…BACKGROUND Following excimer laser photorefractive keratectomy (PRK), an increase in glare sensitivity and a reduction in contrast sensitivity can occur owing…”
Get full text
Journal Article -
13
The Balanced Unicast and Multicast Capacity Regions of Large Wireless Networks
Published in IEEE transactions on information theory (01-05-2010)“…We consider the question of determining the scaling of the n 2 -dimensional balanced unicast and the n 2 n -dimensional balanced multicast capacity regions of…”
Get full text
Journal Article -
14
Computation over Mismatched Channels
Published in IEEE journal on selected areas in communications (01-04-2013)“…We consider the problem of distributed computation of a target function over a two-user deterministic multiple-access channel. If the target and channel…”
Get full text
Journal Article -
15
Energy-Efficient Communication Over the Unsynchronized Gaussian Diamond Network
Published in IEEE transactions on information theory (01-12-2014)“…Communication networks are often designed and analyzed assuming tight synchronization among nodes. However, in applications that require communication in the…”
Get full text
Journal Article -
16
Energy-Efficient Communication in the Presence of Synchronization Errors
Published in IEEE transactions on information theory (01-11-2015)“…Communication systems are traditionally designed to have tight transmitter-receiver synchronization. This requirement has negligible overhead in the…”
Get full text
Journal Article -
17
Disability glare after excimer laser photorefractive keratectomy for myopia
Published in Journal of refractive surgery (1995) (01-02-1996)“…A change of corneal topography and haze after excimer laser photorefractive keratectomy (PRK) can reduce contrast sensitivity and cause glare. Both glare and…”
Get more information
Journal Article -
18
Clinical and immunological characteristics of oculomucocutaneous disorders
Published in Developments in ophthalmology (1999)Get more information
Journal Article -
19
Grouping-and-shifting designs for structured LDPC codes with large girth
Published in International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings (2004)“…We introduce a method to design structured LDPC codes with large girth and flexible code rates. The method is simple to explain: we divide the nodes in the…”
Get full text
Conference Proceeding -
20
A class of structured LDPC codes with large girth
Published in 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577) (2004)“…A class of structured LDPC codes-turbo-structured LDPC (TS-LDPC) codes-composed of two subtrees connected by an interleaver is introduced in this paper…”
Get full text
Conference Proceeding