Princeton Software

Displaying 1-40 of 93 results

  • White Papers // Apr 2014

    Nonparametric Detection of Anomalous Data via Kernel Mean Embedding

    An anomaly detection problem is investigated, in which there are totally n sequences with s anomalous sequences to be detected. Each normal sequence contains m independent and identically distributed (i.i.d.) samples drawn from a distribution p, whereas each anomalous sequence contains m i.i.d. samples drawn from a distribution q that...

    Provided By Princeton Software

  • White Papers // Mar 2014

    Integrating Energy Storage Into the Smart Grid: A Prospect Theoretic Approach

    In this paper, the interactions and energy exchange decisions of a number of geographically distributed storage units are studied under decision-making involving end-users. In particular, a non-cooperative game is formulated between customer-owned storage units where each storage unit's owner can decide on whether to charge or discharge energy with a...

    Provided By Princeton Software

  • White Papers // Feb 2014

    Parallel Streaming Computation on Error-Prone Processors

    Hardware fault rates are increasing due to decreasing transistor sizes in newer technology nodes. To ensure reliability, circuits need more redundancy and higher voltage margins, incurring high area/performance/energy overheads. Since some applications, such as multimedia processing and streaming applications, can tolerate some types of errors, approximate computing research has begun...

    Provided By Princeton Software

  • White Papers // Jan 2014

    A Technology-Aware and Energy-Oriented Topology Exploration for On-Chip Networks

    On-chip interconnection networks have been proposed and used in the past few years to replace buses and dedicated wires as the standard on-chip interconnection fabric. As packet-switching interconnection networks replace buses and dedicated wires to become the standard on-chip interconnection fabric, reducing their power consumption has been identified to be...

    Provided By Princeton Software

  • White Papers // Jan 2014

    GARNET: A Detailed On-Chip Network Model inside a Full-System Simulator

    Until very recently, microprocessor designs were computation-centric. On-chip communication was frequently ignored. This was because of fast, single-cycle on-chip communication. The interconnect power was also insignificant compared to the transistor power. With uniprocessor designs providing diminishing returns and the advent of Chip Multi-Processors (CMPs) in mainstream systems, the on-chip network...

    Provided By Princeton Software

  • White Papers // Jan 2014

    Implementing Application-Specific Cache-Coherence Protocols in Configurable Hardware

    Streamlining communication is key to achieving good performance in shared-memory parallel programs. While full hardware support for cache coherence generally offers the best performance, not all parallel machines provide it. Instead, software layers using Shared Virtual Memory (SVM) can be built to enforce coherence at a higher level. In prior...

    Provided By Princeton Software

  • White Papers // Jan 2014

    Global Multi-Threaded Instruction Scheduling

    Recently, the microprocessor industry has moved toward Chip Multi-Processor (CMP) designs as a means of utilizing the increasing transistor counts in the face of physical and micro-architectural limitations. Despite this move, CMPs do not directly improve the performance of single threaded codes, a characteristic of most applications. In order to...

    Provided By Princeton Software

  • White Papers // Sep 2013

    Interference Masking for Secure Wireless Broadcast Communications

    Physical layer security has been recognized as a promising technique to realize secure wireless communications. In this paper, a novel interference masking approach is proposed for secure broadcast scenarios. Specifically when there is an external jamming node, pre-coding matrices at the source and jammer are carefully designed to ensure that...

    Provided By Princeton Software

  • White Papers // Aug 2013

    Power Analysis of Embedded Operating Systems

    The increasing complexity and software content of embedded systems has led to the frequent use of system software that helps applications access underlying hardware resources easily and efficiently. In this paper, the authors analyze the power consumption of Real-Time Operating Systems (RTOSs), which form an important component of the system...

    Provided By Princeton Software

  • White Papers // Jul 2013

    Starchart: Hardware and Software Optimization Using Recursive Partitioning Regression Trees

    Graphics Processing Units (GPUs) are in increasingly wide use, but significant hurdles lie in selecting the appropriate algorithms, runtime parameter settings, and hardware configurations to achieve power and performance goals with them. Exploring hardware and software choices requires time consuming simulations or extensive real-system measurements. While some auto-tuning support has...

    Provided By Princeton Software

  • White Papers // Jun 2013

    Fast Condensation of the Program Dependence Graph

    Aggressive compiler optimizations are formulated around the Program Dependence Graph (PDG). Many techniques, including loop fission and parallelization are concerned primarily with dependence cycles in the PDG. The Directed Acyclic Graph of Strongly Connected Components (DAGSCC) represents these cycles directly. The naive method to construct the DAGSCC first computes the...

    Provided By Princeton Software

  • White Papers // May 2013

    SoftCell: Taking Control of Cellular Core Networks

    Existing cellular networks suffer from inflexible and expensive equipment, and complex control-plane protocols. To address these challenges, the authors present SoftCell, a scalable architecture for supporting fine-grained policies for mobile devices in cellular core networks. The SoftCell controller realizes high-level service polices by directing traffic over paths that traverse a...

    Provided By Princeton Software

  • White Papers // May 2013

    Privacy Preserving Recommendation System Based on Groups

    Recommendation systems have received considerable attention in the recent decades. Yet with the development of information technology and social media, the risk in revealing private data to service providers has been a growing concern to more and more users. Trade-offs between quality and privacy in recommendation systems naturally arise. In...

    Provided By Princeton Software

  • White Papers // May 2013

    Channels with Cost Constraints: Strong Converse and Dispersion

    This paper shows the strong converse and the dispersion of memory-less channels with cost constraints. The analysis is based on a new non-asymptotic converse bound expressed in terms of the distribution of a random variable termed the b-tilted information density, which plays a role similar to that of the information...

    Provided By Princeton Software

  • White Papers // May 2013

    Increasing Smart Meter Privacy Through Energy Harvesting and Storage Devices

    Smart meters are key elements for the operation of smart grids. By providing near real-time information on the energy consumption of individual users, smart meters increase the efficiency in generation, distribution and storage of energy in a smart grid. The ability of the utility provider to track users' energy consumption...

    Provided By Princeton Software

  • White Papers // May 2013

    Stratos: A Network-Aware Orchestration Layer for Middleboxes in the Cloud

    The authors see an increasing demand for in-the-cloud middlebox processing as applications and enterprises want their cloud deployments to leverage the same benefits that such services offer in traditional deployments. Unfortunately, today's cloud middlebox deployments lack the same abstractions for flexible deployment and elastic scaling that have been instrumental to...

    Provided By Princeton Software

  • White Papers // May 2013

    BitDeposit: Deterring Attacks and Abuses of Cloud Computing Services Through Economic Measures

    Dependability in cloud computing applications can be negatively affected by various attacks or service abuses. To come ahead of this threat, the authors propose an economic measure to deter attacks and various service abuses in cloud computing applications. Their proposed defense is based on requiring a service user to pay...

    Provided By Princeton Software

  • White Papers // Apr 2013

    Optimal Lossless Compression: Source Varentropy and Dispersion

    This paper deals with the fundamental limits of strictly-lossless variable-length compression of known sources without prefix constraints. The source dispersion characterizes the time-horizon over which it is necessary to code in order to approach the entropy rate within a pre-specified tolerance. The authors show that for a large class of...

    Provided By Princeton Software

  • White Papers // Apr 2013

    Making Every Bit Count in Wide-Area Analytics

    Many data sets, such as system logs, are generated from widely distributed locations. Current distributed systems often discard this data because they lack the ability to backhaul it efficiently, or to do anything meaningful with it at the distributed sites. This leads to lost functionality, efficiency, and business opportunities. The...

    Provided By Princeton Software

  • White Papers // Mar 2013

    Characterizing Hypervisor Vulnerabilities in Cloud Computing Servers

    The rise of the Cloud Computing paradigm has led to security concerns, taking into account that resources are shared and mediated by a Hypervisor which may be targeted by rogue guest VMs and remote attackers. In order to better de ne the threats to which a cloud server's Hypervisor is...

    Provided By Princeton Software

  • White Papers // Mar 2013

    Do Commodity SMT Processors Need More OS Research?

    The availability of Simultaneous Multi-Threading (SMT) in commodity processors such as the Pentium 4 (P4) has raised interest among OS researchers. While earlier simulation studies of SMT suggested exciting performance potential, observed improvement on the P4 has been much more restrained, raising the hope that OS research can help bridge...

    Provided By Princeton Software

  • White Papers // Feb 2013

    Composing Software-Defined Networks

    Managing a network requires support for multiple concurrent tasks, from routing and traffic monitoring, to access control and server load balancing. Software-Defined Networking (SDN) allows applications to realize these tasks directly, by installing packet-processing rules on switches. However, today's SDN platforms provide limited support for creating modular applications. This paper...

    Provided By Princeton Software

  • White Papers // Feb 2013

    Language-Based Security for Software-Defined Networks

    In many settings, including campuses, enterprises, militaries, and datacenters, networks must be shared between entities that send and receive traffic over common hardware. The authors analyze the fundamental problem of how to program shared networks in a secure and reliable manner. Their solution is based on a new programming model...

    Provided By Princeton Software

  • White Papers // Feb 2013

    Information Theoretic Privacy for Smart Meters

    Smart Meters (SMs) measure and report energy consumption of individual users to the utility provider at short intervals on the order of minutes. While SM data is used to increase the efficiency in electricity distribution, it also conveys sensitive private data on the energy consumption behaviour of individual customers. In...

    Provided By Princeton Software

  • White Papers // Jan 2013

    Polar Codes for Broadcast Channels

    Polar codes are introduced for discrete memoryless broadcast channels. For m-user deterministic broadcast channels, polarization is applied to map uniformly random message bits from m independent messages to one codeword while satisfying broadcast constraints. The polarization-based codes achieve rates on the boundary of the private-message capacity region. For two-user noisy...

    Provided By Princeton Software

  • White Papers // Jan 2013

    AMUSE: Empowering Users for Cost-Aware Offloading With Throughput-Delay Tradeoffs

    Mobile users face a tradeoff between cost, throughput, and delay in making their offloading decisions. To navigate this tradeoff, the authors propose AMUSE (Adaptive bandwidth Management through USer-Empowerment), a practical, cost-aware WiFi offloading system that takes into account a user's throughput-delay tradeoffs and cellular budget constraint. Based on predicted future...

    Provided By Princeton Software

  • White Papers // Jan 2013

    Intra-Data-Center Traffic Engineering With Ensemble Routing

    Today's data centers are shared among multiple tenants running a wide range of applications. These applications require a network with a scalable and robust layer-2 network management solution that enables load-balancing and QoS provisioning. Ensemble routing was proposed to achieve management scalability and robustness by using Virtual Local Area Networks...

    Provided By Princeton Software

  • White Papers // Jan 2013

    Reducing GPU Offload Latency via Fine-Grained CPU-GPU Synchronization

    GPUs are seeing increasingly widespread use for general purpose computation due to their excellent performance for highly-parallel, throughput-oriented applications. For many workloads, however, the performance benefits of offloading are hindered by the large and unpredictable overheads of launching GPU kernels and of transferring data between CPU and GPU. This paper...

    Provided By Princeton Software

  • White Papers // Jan 2013

    On Practical Design for Joint Distributed Source and Network Coding

    The authors consider the problem of communicating correlated information from two source nodes over a network to multiple destination nodes. This problem involves a joint consideration of distributed source coding (compression) and network coding (information relaying). Although the optimal admissible rate region was previously characterized, it was not yet clear...

    Provided By Princeton Software

  • White Papers // Dec 2012

    Empirical Distribution of Good Channel Codes with Non-Vanishing Error Probability

    This paper studies several properties of channel codes that approach the fundamental limits of a given memoryless channel with a non-vanishing probability of error. The output distribution induced by an ?"-capacity-achieving code is shown to be close in a strong sense to the capacity achieving output distribution (for DMC and...

    Provided By Princeton Software

  • White Papers // Dec 2012

    Fairness and Isolation in Multi-Tenant Storage as Optimization Decomposition

    Shared storage services enjoy wide adoption in commercial clouds. But most systems today provide weak performance isolation and fairness between tenants, if at all. Most approaches to multi-tenant resource allocation are based either on per-VM allocations or hard rate limits that assume uniform workloads to achieve high utilization. Instead, Pisces,...

    Provided By Princeton Software

  • White Papers // Dec 2012

    Learning Efficient Satisfaction Equilibria Via Trial and Error

    In this paper, the problem of Quality-of-Service (QoS) provisioning is formulated as a game in satisfaction form. The corresponding solution is shown to be either Satisfaction Equilibrium (SE), an Efficient Satisfaction Equilibrium (ESE) or a non-equilibrium solution in which the largest population of players are satisfied (N-person satisfaction point, N-PSP)....

    Provided By Princeton Software

  • White Papers // Dec 2012

    Security Verification of Hardware-Enabled Attestation Protocols

    Hardware-software security architectures can significantly improve the security provided to computer users. However, the authors are lacking a security verification methodology that can provide design-time verification of the security properties provided by such architectures. While verification of an entire hardware-software security architecture is very difficult today, this paper proposes a...

    Provided By Princeton Software

  • White Papers // Nov 2012

    Asynchronous Communication: Exact Synchronization, Universality and Dispersion

    This paper considers a strengthened formulation that requires the decoder to estimate both the message and the location of the codeword exactly. Such a scheme allows for transmitting data bits in the synchronization phase of the communication, thereby improving bandwidth and energy efficiencies. It is shown that the capacity region...

    Provided By Princeton Software

  • White Papers // Nov 2012

    An Efficient Energy Curtailment Scheme for Outage Management in Smart Grid

    In this paper an efficient energy curtailment scheme is studied, which enables the power users of a smart grid network to decide on the reduction in energy supplied to them in the event of a power outage in the system. Considering the advantages of a two-way communications infrastructure for any...

    Provided By Princeton Software

  • White Papers // Oct 2012

    On the Decentralized Management of Scrambling Codes in Small Cell Networks

    In this paper, the problem of primary scrambling code (PSC) allocation in Wideband Code-Division Multiple Access (WCDMA) self-configuring small cell networks is studied using tools from game theory. In this game, it is shown that when the number of available scrambling codes is larger than or equal to the number...

    Provided By Princeton Software

  • White Papers // Oct 2012

    The Nash Equilibrium Region of the Linear Deterministic Interference Channel With Feedback

    The two-user Linear Deterministic Interference Channel (LD-IC) with feedback is studied under the assumption that each transmitter aims to selfishly maximize its individual achievable rate by tuning its own transmit configuration. More specifically, each transmitter autonomously tunes parameters such as the number of information bits per block, block length, codebook...

    Provided By Princeton Software

  • White Papers // Oct 2012

    Non-Asymptotic Achievability Bounds in Multiuser Information Theory

    Invoking random coding, but not typical sequences, the authors give non-asymptotic achievability results for the major setups in multiuser information theory. No limitations, such as memory-lessness or discreteness, on sources/channels are imposed. All the bounds given are powerful enough to yield the constructive side of the (asymptotic) capacity regions in...

    Provided By Princeton Software

  • White Papers // Oct 2012

    Achieving Pareto Optimal Equilibria in Energy Efficient Clustered Ad Hoc Networks

    In this paper, a decentralized iterative algorithm able to achieve a Pareto optimal working point in a clustered ad hoc network is analyzed. Here, radio devices are assumed to operate above a minimal Signal to Interference plus Noise Ratio (SINR) threshold while minimizing the global power consumption. A distributed algorithm,...

    Provided By Princeton Software

  • White Papers // Sep 2012

    Performance Isolation and Fairness for Multi-Tenant Cloud Storage

    Shared storage services enjoy wide adoption in commercial clouds. But most systems today provide weak performance isolation and fairness between tenants, if at all. Misbehaving or high-demand tenants can overload the shared service and disrupt other well-behaved tenants, leading to unpredictable performance and violating SLAs. This paper presents Pisces, a...

    Provided By Princeton Software

  • White Papers // Sep 2012

    Performance Isolation and Fairness for Multi-Tenant Cloud Storage

    Shared storage services enjoy wide adoption in commercial clouds. But most systems today provide weak performance isolation and fairness between tenants, if at all. Misbehaving or high-demand tenants can overload the shared service and disrupt other well-behaved tenants, leading to unpredictable performance and violating SLAs. This paper presents Pisces, a...

    Provided By Princeton Software

  • White Papers // May 2012

    A Scalable Server for 3D Metaverses

    Metaverses are three-dimensional virtual worlds where anyone can add and script new objects. Metaverses today, such as Second Life, are dull, lifeless, and stagnant because users can see and interact with only a tiny region around them, rather than a large and immersive world. Current metaverses impose this distance restriction...

    Provided By Princeton Software

  • White Papers // Jul 2012

    Physical Layer Security in Wireless Networks With Passive and Active Eavesdroppers

    Security is becoming an increasingly important issue in wireless communications, to which physical layer approaches can contribute by providing addition resources for securing confidential messages. In this paper, the resilience of multi-user networks to passive and active eavesdropping is investigated. In particular, average secrecy capacities are evaluated in scenarios involving...

    Provided By Princeton Software

  • White Papers // Oct 2012

    On the Decentralized Management of Scrambling Codes in Small Cell Networks

    In this paper, the problem of primary scrambling code (PSC) allocation in Wideband Code-Division Multiple Access (WCDMA) self-configuring small cell networks is studied using tools from game theory. In this game, it is shown that when the number of available scrambling codes is larger than or equal to the number...

    Provided By Princeton Software

  • White Papers // Dec 2012

    Learning Efficient Satisfaction Equilibria Via Trial and Error

    In this paper, the problem of Quality-of-Service (QoS) provisioning is formulated as a game in satisfaction form. The corresponding solution is shown to be either Satisfaction Equilibrium (SE), an Efficient Satisfaction Equilibrium (ESE) or a non-equilibrium solution in which the largest population of players are satisfied (N-person satisfaction point, N-PSP)....

    Provided By Princeton Software

  • White Papers // Oct 2012

    The Nash Equilibrium Region of the Linear Deterministic Interference Channel With Feedback

    The two-user Linear Deterministic Interference Channel (LD-IC) with feedback is studied under the assumption that each transmitter aims to selfishly maximize its individual achievable rate by tuning its own transmit configuration. More specifically, each transmitter autonomously tunes parameters such as the number of information bits per block, block length, codebook...

    Provided By Princeton Software

  • White Papers // Apr 2012

    Achievability of Efficient Satisfaction Equilibria in Self-Configuring Networks

    In this paper, a behavioral rule that allows radio devices to achieve an Efficient Satisfaction Equilibrium (ESE) in fully Decentralized Self-Configuring Networks (DSCNs) is presented. The relevance of ESE in the context of DSCNs is that at such state, radio devices adopt a transmission/receive configuration such that they are able...

    Provided By Princeton Software

  • White Papers // Aug 2012

    Managing the Adoption of Asymmetric Bidirectional Firewalls: Seeding and Mandating

    The security of the Internet can be significantly improved if Internet Service Providers adopt firewalls to monitor traffic entering and leaving access networks. But this process suffers due to 'Free-riding', and hence, regulatory requirements and 'Seeding' strategies are required to influence the adoption process. In this paper, the authors analytically...

    Provided By Princeton Software

  • White Papers // Nov 2012

    An Efficient Energy Curtailment Scheme for Outage Management in Smart Grid

    In this paper an efficient energy curtailment scheme is studied, which enables the power users of a smart grid network to decide on the reduction in energy supplied to them in the event of a power outage in the system. Considering the advantages of a two-way communications infrastructure for any...

    Provided By Princeton Software

  • White Papers // Feb 2013

    Information Theoretic Privacy for Smart Meters

    Smart Meters (SMs) measure and report energy consumption of individual users to the utility provider at short intervals on the order of minutes. While SM data is used to increase the efficiency in electricity distribution, it also conveys sensitive private data on the energy consumption behaviour of individual customers. In...

    Provided By Princeton Software

  • White Papers // Jan 2013

    Intra-Data-Center Traffic Engineering With Ensemble Routing

    Today's data centers are shared among multiple tenants running a wide range of applications. These applications require a network with a scalable and robust layer-2 network management solution that enables load-balancing and QoS provisioning. Ensemble routing was proposed to achieve management scalability and robustness by using Virtual Local Area Networks...

    Provided By Princeton Software

  • White Papers // Jan 2013

    AMUSE: Empowering Users for Cost-Aware Offloading With Throughput-Delay Tradeoffs

    Mobile users face a tradeoff between cost, throughput, and delay in making their offloading decisions. To navigate this tradeoff, the authors propose AMUSE (Adaptive bandwidth Management through USer-Empowerment), a practical, cost-aware WiFi offloading system that takes into account a user's throughput-delay tradeoffs and cellular budget constraint. Based on predicted future...

    Provided By Princeton Software

  • White Papers // Jul 2012

    PETRELS: Parallel Estimation and Tracking of Subspace by Recursive Least Squares From Partial Observations

    Many real world data sets exhibit an embedding of low-dimensional structure in a high-dimensional manifold. Examples include images, videos and internet traffic data. It is of great significance to reduce the storage requirements and computational complexity when the data dimension is high. Therefore, the authors consider the problem of reconstructing...

    Provided By Princeton Software

  • White Papers // May 2013

    SoftCell: Taking Control of Cellular Core Networks

    Existing cellular networks suffer from inflexible and expensive equipment, and complex control-plane protocols. To address these challenges, the authors present SoftCell, a scalable architecture for supporting fine-grained policies for mobile devices in cellular core networks. The SoftCell controller realizes high-level service polices by directing traffic over paths that traverse a...

    Provided By Princeton Software

  • White Papers // May 2013

    Stratos: A Network-Aware Orchestration Layer for Middleboxes in the Cloud

    The authors see an increasing demand for in-the-cloud middlebox processing as applications and enterprises want their cloud deployments to leverage the same benefits that such services offer in traditional deployments. Unfortunately, today's cloud middlebox deployments lack the same abstractions for flexible deployment and elastic scaling that have been instrumental to...

    Provided By Princeton Software

  • White Papers // May 2013

    Privacy Preserving Recommendation System Based on Groups

    Recommendation systems have received considerable attention in the recent decades. Yet with the development of information technology and social media, the risk in revealing private data to service providers has been a growing concern to more and more users. Trade-offs between quality and privacy in recommendation systems naturally arise. In...

    Provided By Princeton Software

  • White Papers // Feb 2013

    Composing Software-Defined Networks

    Managing a network requires support for multiple concurrent tasks, from routing and traffic monitoring, to access control and server load balancing. Software-Defined Networking (SDN) allows applications to realize these tasks directly, by installing packet-processing rules on switches. However, today's SDN platforms provide limited support for creating modular applications. This paper...

    Provided By Princeton Software

  • White Papers // Jun 2011

    Asynchronous Code-Division Random Access Using Convex Optimization

    Many applications in cellular systems and sensor networks involve a random subset of a large number of users asynchronously reporting activity to a base station. This paper examines the problem of MUltiuser Detection (MUD) in random access channels for such applications. Traditional orthogonal signaling ignores the random nature of user...

    Provided By Princeton Software

  • White Papers // Jul 2010

    Why Gabor Frames? Two Fundamental Measures of Coherence and Their Role in Model Selection

    The problem of model selection arises in a number of contexts, such as subset selection in linear regression, estimation of structures in graphical models, and signal denoising. This paper studies non-asymptotic model selection for the general case of arbitrary (random or deterministic) design matrices and arbitrary nonzero entries of the...

    Provided By Princeton Software

  • White Papers // Oct 2011

    Choir Codes: Coding for Full Duplex Interference Management

    Communication networks conventionally operate with half-duplex methods and interference avoiding schemes to manage multiple transceivers. Here, the authors consider a method in which nodes transmit and receive in concert to achieve full duplex communication without transmitter coordination. They build on a recent framework for full-duplex communication in ad-hoc wireless networks...

    Provided By Princeton Software

  • White Papers // May 2011

    Deterministic Pilot Sequences for Sparse Channel Estimation in OFDM Systems

    This paper examines the problem of multipath channel estimation in single-antenna Orthogonal Frequency Division Multiplexing (OFDM) systems. In particular, the authors study the problem of pilot assisted channel estimation in wideband OFDM systems, where the time-domain (discrete) channel is approximately sparse. Existing works on this topic established that techniques from...

    Provided By Princeton Software

  • White Papers // Oct 2011

    Faster than Nyquist, Slower than Tropp

    The sampling rate of analog-to-digital converters is severely limited by underlying technological constraints. Recently, Tropp et al. proposed a new architecture, called a Random Demodulator (RD) that attempts to circumvent this limitation by sampling sparse, band-limited signals at a rate much lower than the Nyquist rate. An integral part of...

    Provided By Princeton Software

  • White Papers // Sep 2010

    Multiuser Detection in Asynchronous On-Off Random Access Channels Using Lasso

    This paper considers on - off random access channels where users transmit either a one or a zero to a base station. Such channels represent an abstraction of control channels used for scheduling requests in third-generation cellular systems and uplinks in wireless sensor networks deployed for target detection. This paper...

    Provided By Princeton Software

  • White Papers // Apr 2010

    Model Selection: Two Fundamental Measures of Coherence and Their Algorithmic Significance

    The problem of model selection arises in a number of contexts, such as compressed sensing, subset selection in linear regression, estimation of structures in graphical models, and signal denoising. This paper generalizes the notion of incoherence in the existing literature on model selection and introduces two fundamental measures of coherence...

    Provided By Princeton Software

  • White Papers // Oct 2010

    Revisiting Model Selection and Recovery of Sparse Signals Using One-Step Thresholding

    This paper studies non-asymptotic model selection and recovery of sparse signals in high-dimensional, linear inference problems. In contrast to the existing literature, the focus here is on the general case of arbitrary design matrices and arbitrary nonzero entries of the signal. In this regard, it utilizes two easily computable measures...

    Provided By Princeton Software

  • White Papers // Jan 2013

    Polar Codes for Broadcast Channels

    Polar codes are introduced for discrete memoryless broadcast channels. For m-user deterministic broadcast channels, polarization is applied to map uniformly random message bits from m independent messages to one codeword while satisfying broadcast constraints. The polarization-based codes achieve rates on the boundary of the private-message capacity region. For two-user noisy...

    Provided By Princeton Software

  • White Papers // May 2010

    WideArea Route Control for Distributed Services

    Many distributed services would benefit from control over the flow of traffic to and from their users, to offer better performance and higher reliability at a reasonable cost. Unfortunately, although today's cloud-computing platforms offer elastic computing and bandwidth resources, they do not give services control over wide-area routing. The authors...

    Provided By Princeton Software

  • White Papers // Oct 2012

    Achieving Pareto Optimal Equilibria in Energy Efficient Clustered Ad Hoc Networks

    In this paper, a decentralized iterative algorithm able to achieve a Pareto optimal working point in a clustered ad hoc network is analyzed. Here, radio devices are assumed to operate above a minimal Signal to Interference plus Noise Ratio (SINR) threshold while minimizing the global power consumption. A distributed algorithm,...

    Provided By Princeton Software

  • White Papers // May 2012

    Feedback and Delayed CSI Can Be as Good as Perfect CSI

    The Degrees of Freedom (DoF) region of the two-user MIMO Interference Channel (IC) is completely characterized in the presence of noiseless channel output feedback from each receiver to its respective transmitter and with the assumption of delayed Channel State Information (CSI) at the transmitters. It is shown that having output...

    Provided By Princeton Software

  • White Papers // May 2012

    Channel Estimation Impact Over MIMO-MAC Achievable Rates

    The authors present inner and outer bounds of the rate region for the multiple-input-multiple-output mutiple access channel with imperfect channel estimates. They then employ them to compare different channel estimation techniques. They show that the benefit of using traditional compressed sensing recovery techniques, specifically orthogonal matching pursuit, for multipath wireless...

    Provided By Princeton Software

  • White Papers // Dec 2010

    Protection Over Asymmetric Channels, S-MATE: Secure Multipath Adaptive Traffic Engineering

    There have been several approaches to the problem of provisioning traffic engineering between core network nodes in Internet Service Provider (ISP) networks. Such approaches aim to minimize network delay, increase capacity, and enhance security services between two core (relay) network nodes, an ingress node and an egress node. MATE (Multipath...

    Provided By Princeton Software

  • White Papers // Oct 2010

    S-MATE: Secure Coding-Based Multipath Adaptive Traffic Engineering

    There have been several approaches to provisioning traffic between core network nodes in Internet Service Provider (ISP) networks. Such approaches aim to minimize network delay, increase network capacity, and enhance network security services. MATE (Multipath Adaptive Traffic Engineering) protocol has been proposed for multipath adaptive traffic engineering between an ingress...

    Provided By Princeton Software

  • White Papers // Oct 2012

    Non-Asymptotic Achievability Bounds in Multiuser Information Theory

    Invoking random coding, but not typical sequences, the authors give non-asymptotic achievability results for the major setups in multiuser information theory. No limitations, such as memory-lessness or discreteness, on sources/channels are imposed. All the bounds given are powerful enough to yield the constructive side of the (asymptotic) capacity regions in...

    Provided By Princeton Software

  • White Papers // Nov 2010

    Arimoto Channel Coding Converse and Renyi Divergence

    Arimoto proved a non-asymptotic upper bound on the probability of successful decoding achievable by any code on a given discrete memory-less channel. In this paper the authors present a simple derivation of the Arimoto converse based on the data-processing inequality for Renyi divergence. The method has two benefits. First, it...

    Provided By Princeton Software

  • White Papers // May 2013

    Channels with Cost Constraints: Strong Converse and Dispersion

    This paper shows the strong converse and the dispersion of memory-less channels with cost constraints. The analysis is based on a new non-asymptotic converse bound expressed in terms of the distribution of a random variable termed the b-tilted information density, which plays a role similar to that of the information...

    Provided By Princeton Software

  • White Papers // May 2012

    A New Converse in Rate-Distortion Theory

    The fundamental problem in non-asymptotic rate-distortion theory is to estimate the minimum achievable source coding rate at any given block-length k compatible with allowable distortion d. This paper shows new finite-block-length converse bounds applicable to lossy source coding as well as joint source-channel coding, which are tight enough not only...

    Provided By Princeton Software

  • White Papers // Nov 2010

    Channel Dispersion and Moderate Deviations Limits for Memoryless Channels

    Recently, Altug and Wagner posed a question regarding the optimal behavior of the probability of error when channel coding rate converges to the capacity sufficiently slowly. They gave a sufficient condition for the Discrete Memory-less Channel (DMC) to satisfy a Moderate Deviation Property (MDP) with the constant equal to the...

    Provided By Princeton Software

  • White Papers // Jul 2012

    To Code or Not to Code: Revisited

    The authors revisit the dilemma of whether one should or should not code when operating under delay constraints. In those curious cases when the source and the channel are probabilistically matched so that symbol-by-symbol coding is optimal in terms of the average distortion achieved, they show that it also achieves...

    Provided By Princeton Software

  • White Papers // Dec 2012

    Empirical Distribution of Good Channel Codes with Non-Vanishing Error Probability

    This paper studies several properties of channel codes that approach the fundamental limits of a given memoryless channel with a non-vanishing probability of error. The output distribution induced by an ?"-capacity-achieving code is shown to be close in a strong sense to the capacity achieving output distribution (for DMC and...

    Provided By Princeton Software

  • White Papers // Nov 2012

    Asynchronous Communication: Exact Synchronization, Universality and Dispersion

    This paper considers a strengthened formulation that requires the decoder to estimate both the message and the location of the codeword exactly. Such a scheme allows for transmitting data bits in the synchronization phase of the communication, thereby improving bandwidth and energy efficiencies. It is shown that the capacity region...

    Provided By Princeton Software