232 research outputs found
Linear Finite-Field Deterministic Networks With Many Sources and One Destination
We find the capacity region of linear finite-field deterministic networks
with many sources and one destination. Nodes in the network are subject to
interference and broadcast constraints, specified by the linear finite-field
deterministic model. Each node can inject its own information as well as relay
other nodes' information. We show that the capacity region coincides with the
cut-set region. Also, for a specific case of correlated sources we provide
necessary and sufficient conditions for the sources transmissibility. Given the
"deterministic model" approximation for the corresponding Gaussian network
model, our results may be relevant to wireless sensor networks where the
sensing nodes multiplex the relayed data from the other nodes with their own
data, and where the goal is to decode all data at a single "collector" node.Comment: 5 pages, 3 figures, submitted to ISIT 201
Density evolution and power profile optimization for iterative multiuser decoders based on individually optimum multiuser detectors
Iterative multiuser joint decoding based on exact Belief Propagation (BP) is analyzed in the large system limit by means of the replica method. It is shown that performance can be improved by appropriate power assignment to the users. The optimum power assignment can be found by linear programming in most technically relevant cases. The performance of BP iterative multiuser joint decoding is compared to suboptimum approximations based on Interference Cancellation (IC). While IC receivers show a significant loss for equal-power users, they yield performance close to BP under optimum power assignment
Lossy data compression with random gates
We introduce a new protocol for a lossy data compression algorithm which is
based on constraint satisfaction gates. We show that the theoretical capacity
of algorithms built from standard parity-check gates converges exponentially
fast to the Shannon's bound when the number of variables seen by each gate
increases. We then generalize this approach by introducing random gates. They
have theoretical performances nearly as good as parity checks, but they offer
the great advantage that the encoding can be done in linear time using the
Survey Inspired Decimation algorithm, a powerful algorithm for constraint
satisfaction problems derived from statistical physics
Emulating opportunistic networks with KauNet Triggers
In opportunistic networks the availability of an end-to-end path is no longer required. Instead opportunistic networks may take advantage of temporary connectivity opportunities.
Opportunistic networks present a demanding environment for network emulation as the traditional emulation setup, where application/transport endpoints only send and receive packets from the network following a black box approach,
is no longer applicable. Opportunistic networking protocols
and applications additionally need to react to the dynamics of the underlying network beyond what is conveyed through the exchange of packets.
In order to support IP-level emulation evaluations of applications and protocols that react to lower layer events, we have proposed the use of emulation triggers. Emulation triggers can emulate arbitrary cross-layer feedback and can be synchronized with other emulation effects. After introducing the design and implementation of
triggers in the KauNet emulator, we describe the integration of triggers with the DTN2 reference implementation and illustrate how the functionality can be used to emulate a classical DTN data-mule scenario
Variabilité génétique du rendement a l'abattage et de la composition anatomique de lapins de trois races
International audienc
Posterior Reconstruction Before Anastomosis Improves the Anastomosis Time During Robot-Assisted Radical Prostatectomy
Posterior reconstruction prior to anastomosis decreased anastomotic time for robotic surgeons in training
Implementation aspects of list sphere decoder algorithms for MIMO-OFDM systems
A list sphere decoder (LSD) can be used to approximate the optimal maximum a posteriori (MAP) detector for the detection of multiple-input multiple-output (MIMO) signals. In this paper, we consider two LSD algorithms with different search methods and study some algorithm design choices which relate to the performance and computational complexity of the algorithm. We show that by limiting the dynamic range of log-likelihood ratio, the required LSD list size can be lowered, and, thus, the complexity of the LSD algorithm is decreased. We compare the real and the complex-valued signal models and their impact on the complexity of the algorithms. We show that the real-valued signal model is clearly the less complex choice and a better alternative for implementation. We also show the complexity of the sequential search LSD algorithm can be reduced by limiting the maximum number of checked nodes without sacrificing the performance of the system. Finally, we study the complexity and performance of an iterative receiver, analyze the tradeoff choices between complexity and performance, and show that the additional computational cost in LSD is justified to get better soft-output approximation.TekesFinnish Funding Agency for Technology and InnovationNokiaNokia Siemens Networks (NSN)ElekrobitUninor
Confining the Sol-Gel Reaction at the Water/Oil Interface:Creating Compartmentalized Enzymatic Nano-Organelles for Artificial Cells
Living organisms compartmentalize their catalytic reactions in membranes for increased efficiency and selectivity. To mimic the organelles of eukaryotic cells, we develop a mild approach for in situ encapsulating enzymes in aqueous-core silica nanocapsules. In order to confine the sol-gel reaction at the water/oil interface of miniemulsion, we introduce an aminosilane to the silica precursors, which serves as both catalyst and an amphiphilic anchor that electrostatically assembles with negatively charged hydrolyzed alkoxysilanes at the interface. The semi-permeable shell protects enzymes from proteolytic attack, and allows the transport of reactants and products. The enzyme-carrying nanocapsules, as synthetic nano-organelles, are able to perform cascade reactions when enveloped in a polymer vesicle, mimicking the hierarchically compartmentalized reactions in eukaryotic cells. This in situ encapsulation approach provides a versatile platform for the delivery of biomacromolecules.</p
- …