1,967 research outputs found
Diversity-Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks
Synchronization of relay nodes is an important and critical issue in
exploiting cooperative diversity in wireless networks. In this paper, two
asynchronous cooperative diversity schemes are proposed, namely, distributed
delay diversity and asynchronous space-time coded cooperative diversity
schemes. In terms of the overall diversity-multiplexing (DM) tradeoff function,
we show that the proposed independent coding based distributed delay diversity
and asynchronous space-time coded cooperative diversity schemes achieve the
same performance as the synchronous space-time coded approach which requires an
accurate symbol-level timing synchronization to ensure signals arriving at the
destination from different relay nodes are perfectly synchronized. This
demonstrates diversity order is maintained even at the presence of asynchronism
between relay node. Moreover, when all relay nodes succeed in decoding the
source information, the asynchronous space-time coded approach is capable of
achieving better DM-tradeoff than synchronous schemes and performs equivalently
to transmitting information through a parallel fading channel as far as the
DM-tradeoff is concerned. Our results suggest the benefits of fully exploiting
the space-time degrees of freedom in multiple antenna systems by employing
asynchronous space-time codes even in a frequency flat fading channel. In
addition, it is shown asynchronous space-time coded systems are able to achieve
higher mutual information than synchronous space-time coded systems for any
finite signal-to-noise-ratio (SNR) when properly selected baseband waveforms
are employed
Evaluating Erasure Codes in Dicoogle PACS
DICOM (Digital Imaging and Communication in Medicine) is a standard for image and data transmission in medical purpose hardware and is commonly used for viewing, storing, printing and transmitting images. As a part of the way that DICOM transmits files, the PACS (Picture Archiving and Communication System) platform, Dicoogle, has become one of the most in-demand image processing and viewing platforms. However, the Dicoogle PACS architecture does not guarantee image information recovery in the case of information loss. Therefore, this paper proposes a file recovery solution in the Dicoogle architecture. The proposal consists of maximizing the encoding and decoding performance of medical images through computational parallelism. To validate the proposal, the Java programming language based on the Reed-Solomon algorithm is implemented in different performance tests. The experimental results show that the proposal is optimal in terms of image processing time for the Dicoogle PACS storage system.Ministry of Science, Innovation and Universities (MICINN) of Spain PGC2018 098883-B-C44European CommissionPrograma para el Desarrollo Profesional Docente para el Tipo Superior (PRODEP) of MexicoCorporacion Ecuatoriana para el Desarrollo de la Investigacion y la Academia (CEDIA) of Ecuador CEPRA XII-2018-13Universidad de Las Americas (UDLA), Quito, Ecuador IEA.WHP.21.0
A low-complexity turbo decoder architecture for energy-efficient wireless sensor networks
Turbo codes have recently been considered for energy-constrained wireless communication applications, since they facilitate a low transmission energy consumption. However, in order to reduce the overall energy consumption, Look-Up- Table-Log-BCJR (LUT-Log-BCJR) architectures having a low processing energy consumption are required. In this paper, we decompose the LUT-Log-BCJR architecture into its most fundamental Add Compare Select (ACS) operations and perform them using a novel low-complexity ACS unit. We demonstrate that our architecture employs an order of magnitude fewer gates than the most recent LUT-Log-BCJR architectures, facilitating a 71% energy consumption reduction. Compared to state-of- the-art Maximum Logarithmic Bahl-Cocke-Jelinek-Raviv (Max- Log-BCJR) implementations, our approach facilitates a 10% reduction in the overall energy consumption at ranges above 58 m
ProcNet: Deep Predictive Coding Model for Robust-to-occlusion Visual Segmentation and Pose Estimation
Systems involving human-robot collaboration necessarily require that steps be
taken to ensure safety of the participating human. This is usually achievable
if accurate, reliable estimates of the human's pose are available. In this
paper, we present a deep Predictive Coding (PC) model supporting visual
segmentation, which we extend to pursue pose estimation. The model is designed
to offer robustness to the type of transient occlusion naturally occurring when
human and robot are operating in close proximity to one another. Impact on
performance of relevant model parameters is assessed, and comparison to an
alternate pose estimation model (NVIDIA's PoseCNN) illustrates efficacy of the
proposed approach.Comment: 7 pages, 9 figure
On modelling network coded ARQ-based channels
Network coding (NC) has been an attractive research topic in recent years as a means of offering a throughput improvement, especially in multicast scenarios. The throughput gain is achieved by introducing an algebraic method for combining multiple input streams of packets which are addressing one output port at an intermediate node. We present a practical implementation of network coding in conjunction with error control schemes, namely the Stop-and-Wait (SW) and Selective Repeat (SR) protocols. We propose a modified NC scheme and apply it at an intermediate SW ARQ-based link to reduce ARQ control
signals at each transmission. We further extend this work to investigate the usefulness of NC in the Butterfly multicast network which adopts the SR ARQ protocol as an error control scheme. We validate our throughput analysis using a relatively recent discrete-event simulator, SimEvents®. The results show that the proposed scheme offers a throughput advantage of at least 50% over traditional SW ARQ, and that this is particularly noticeable in the presence of high error rates. In the multicast network, however, simulation results show
that when compared with the traditional scheme, NC-SR ARQ can achieve a throughput gain of between 2% and 96% in a low bandwidth channel and up to 19% in a high bandwidth channel with errors
- …