526 research outputs found
Achievable Rate and Optimal Physical Layer Rate Allocation in Interference-Free Wireless Networks
We analyze the achievable rate in interference-free wireless networks with
physical layer fading channels and orthogonal multiple access. As a starting
point, the point-to-point channel is considered. We find the optimal physical
and network layer rate trade-off which maximizes the achievable overall rate
for both a fixed rate transmission scheme and an improved scheme based on
multiple virtual users and superposition coding. These initial results are
extended to the network setting, where, based on a cut-set formulation, the
achievable rate at each node and its upper bound are derived. We propose a
distributed optimization algorithm which allows to jointly determine the
maximum achievable rate, the optimal physical layer rates on each network link,
and an opportunistic back-pressure-type routing strategy on the network layer.
This inherently justifies the layered architecture in existing wireless
networks. Finally, we show that the proposed layered optimization approach can
achieve almost all of the ergodic network capacity in high SNR.Comment: 5 pages, to appear in Proc. IEEE ISIT, July 200
Diversity analysis, code design, and tight error rate lower bound for binary joint network-channel coding
Joint network-channel codes (JNCC) can improve the performance of communication in wireless networks, by combining, at the physical layer, the channel codes and the network code as an overall error-correcting code. JNCC is increasingly proposed as an alternative to a standard layered construction, such as the OSI-model. The main performance metrics for JNCCs are scalability to larger networks and error rate. The diversity order is one of the most important parameters determining the error rate. The literature on JNCC is growing, but a rigorous diversity analysis is lacking, mainly because of the many degrees of freedom in wireless networks, which makes it very hard to prove general statements on the diversity order. In this article, we consider a network with slowly varying fading point-to-point links, where all sources also act as relay and additional non-source relays may be present. We propose a general structure for JNCCs to be applied in such network. In the relay phase, each relay transmits a linear transform of a set of source codewords. Our main contributions are the proposition of an upper and lower bound on the diversity order, a scalable code design and a new lower bound on the word error rate to assess the performance of the network code. The lower bound on the diversity order is only valid for JNCCs where the relays transform only two source codewords. We then validate this analysis with an example which compares the JNCC performance to that of a standard layered construction. Our numerical results suggest that as networks grow, it is difficult to perform significantly better than a standard layered construction, both on a fundamental level, expressed by the outage probability, as on a practical level, expressed by the word error rate
Iterative Soft Input Soft Output Decoding of Reed-Solomon Codes by Adapting the Parity Check Matrix
An iterative algorithm is presented for soft-input-soft-output (SISO)
decoding of Reed-Solomon (RS) codes. The proposed iterative algorithm uses the
sum product algorithm (SPA) in conjunction with a binary parity check matrix of
the RS code. The novelty is in reducing a submatrix of the binary parity check
matrix that corresponds to less reliable bits to a sparse nature before the SPA
is applied at each iteration. The proposed algorithm can be geometrically
interpreted as a two-stage gradient descent with an adaptive potential
function. This adaptive procedure is crucial to the convergence behavior of the
gradient descent algorithm and, therefore, significantly improves the
performance. Simulation results show that the proposed decoding algorithm and
its variations provide significant gain over hard decision decoding (HDD) and
compare favorably with other popular soft decision decoding methods.Comment: 10 pages, 10 figures, final version accepted by IEEE Trans. on
Information Theor
Cross-layer optimization of unequal protected layered video over hierarchical modulation
Abstract-unequal protection mechanisms have been proposed at several layers in order to improve the reliability of multimedia contents, especially for video data. The paper aims at implementing a multi-layer unequal protection scheme, which is based on a Physical-Transport-Application cross-layer design. Hierarchical modulation, in the physical layer, has been demonstrated to increase the overall user capacity of a wireless communications. On the other hand, unequal erasure protection codes at the transport layer turned out to be an efficient method to protect video data generated by the application layer by exploiting their intrinsic properties. In this paper, the two techniques are jointly optimized in order to enable recovering lost data in case the protection is performed separately. We show that the cross-layer design proposed herein outperforms the performance of hierarchical modulation and unequal erasure codes taken independently
On the Energy Efficiency of LT Codes in Proactive Wireless Sensor Networks
This paper presents an in-depth analysis on the energy efficiency of Luby
Transform (LT) codes with Frequency Shift Keying (FSK) modulation in a Wireless
Sensor Network (WSN) over Rayleigh fading channels with pathloss. We describe a
proactive system model according to a flexible duty-cycling mechanism utilized
in practical sensor apparatus. The present analysis is based on realistic
parameters including the effect of channel bandwidth used in the IEEE 802.15.4
standard, active mode duration and computation energy. A comprehensive
analysis, supported by some simulation studies on the probability mass function
of the LT code rate and coding gain, shows that among uncoded FSK and various
classical channel coding schemes, the optimized LT coded FSK is the most
energy-efficient scheme for distance d greater than the pre-determined
threshold level d_T , where the optimization is performed over coding and
modulation parameters. In addition, although the optimized uncoded FSK
outperforms coded schemes for d < d_T , the energy gap between LT coded and
uncoded FSK is negligible for d < d_T compared to the other coded schemes.
These results come from the flexibility of the LT code to adjust its rate to
suit instantaneous channel conditions, and suggest that LT codes are beneficial
in practical low-power WSNs with dynamic position sensor nodes.Comment: accepted for publication in IEEE Transactions on Signal Processin
- …