On minimizing the maximum broadcast decoding delay for instantly decodable network coding
Type
Conference PaperKAUST Department
Communication Theory LabComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Electrical Engineering Program
Date
2014-09Preprint Posting Date
2014-04-01Permanent link to this record
http://hdl.handle.net/10754/564978
Metadata
Show full item recordAbstract
In this paper, we consider the problem of minimizing the maximum broadcast decoding delay experienced by all the receivers of generalized instantly decodable network coding (IDNC). Unlike the sum decoding delay, the maximum decoding delay as a definition of delay for IDNC allows a more equitable distribution of the delays between the different receivers and thus a better Quality of Service (QoS). In order to solve this problem, we first derive the expressions for the probability distributions of maximum decoding delay increments. Given these expressions, we formulate the problem as a maximum weight clique problem in the IDNC graph. Although this problem is known to be NP-hard, we design a greedy algorithm to perform effective packet selection. Through extensive simulations, we compare the sum decoding delay and the max decoding delay experienced when applying the policies to minimize the sum decoding delay and our policy to reduce the max decoding delay. Simulations results show that our policy gives a good agreement among all the delay aspects in all situations and outperforms the sum decoding delay policy to effectively minimize the sum decoding delay when the channel conditions become harsher. They also show that our definition of delay significantly improve the number of served receivers when they are subject to strict delay constraints.Citation
Douik, A., Sorour, S., Alouini, M.-S., & Al-Naffouri, T. Y. (2014). On Minimizing the Maximum Broadcast Decoding Delay for Instantly Decodable Network Coding. 2014 IEEE 80th Vehicular Technology Conference (VTC2014-Fall). doi:10.1109/vtcfall.2014.6966079Conference/Event name
80th IEEE Vehicular Technology Conference, VTC 2014-FallISBN
9781479944491; 9781479944491arXiv
1404.0265Additional Links
http://arxiv.org/abs/arXiv:1404.0265v1ae974a485f413a2113503eed53cd6c53
10.1109/VTCFall.2014.6966079
Scopus Count
Related items
Showing items related by title, author, creator and subject.
-
Bidirectional Fano Algorithm for Lattice Coded MIMO ChannelsAl-Quwaiee, Hessa (2013-05-08) [Thesis]
Advisor: Alouini, Mohamed-Slim
Committee members: Alouini, Mohamed-Slim; Laleg-Kirati, Taous-Meriem; Sultan Salem, Ahmed KamalRecently, lattices - a mathematical representation of infinite discrete points in the Euclidean space, have become an effective way to describe and analyze communication systems especially system those that can be modeled as linear Gaussian vector channel model. Channel codes based on lattices are preferred due to three facts: lattice codes have simple structure, the code can achieve the limits of the channel, and they can be decoded efficiently using lattice decoders which can be considered as the Closest Lattice Point Search (CLPS). Since the time lattice codes were introduced to Multiple Input Multiple Output (MIMO) channel, Sphere Decoder (SD) has been an efficient way to implement lattice decoders. Sphere decoder offers the optimal performance at the expense of high decoding complexity especially for low signal-to-noise ratios (SNR) and for high- dimensional systems. On the other hand, linear and non-linear receivers, Minimum Mean Square Error (MMSE), and MMSE Decision-Feedback Equalization (DFE), provide the lowest decoding complexity but unfortunately with poor performance. Several studies works have been conducted in the last years to address the problem of designing low complexity decoders for the MIMO channel that can achieve near optimal performance. It was found that sequential decoders using backward tree search can bridge the gap between SD and MMSE. The sequential decoder provides an interesting performance-complexity trade-off using a bias term. Yet, the sequential decoder still suffers from high complexity for mid-to-high SNR values. In this work, we propose a new algorithm for Bidirectional Fano sequential Decoder (BFD) in order to reduce the mid-to-high SNR complexity. Our algorithm consists of first constructing a unidirectional Sequential Decoder based on forward search using the QL decomposition. After that, BFD incorporates two searches, forward and backward, to work simultaneously till they merge and find the closest lattice point to the received signal. We show via computer simulations that BFD can reduce the mid-to-high SNR complexity for the sequential decoder without changing the bias value. -
Delay reduction in persistent erasure channels for generalized instantly decodable network codingSorour, Sameh; Aboutorab, Neda; Sadeghi, Parastoo; Karim, Mohammad Shahriar; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim (2013 IEEE 77th Vehicular Technology Conference (VTC Spring), Institute of Electrical and Electronics Engineers (IEEE), 2013-06) [Conference Paper]In this paper, we consider the problem of minimizing the decoding delay of generalized instantly decodable network coding (G-IDNC) in persistent erasure channels (PECs). By persistent erasure channels, we mean erasure channels with memory, which are modeled as a Gilbert-Elliott two-state Markov model with good and bad channel states. In this scenario, the channel erasure dependence, represented by the transition probabilities of this channel model, is an important factor that could be exploited to reduce the decoding delay. We first formulate the G-IDNC minimum decoding delay problem in PECs as a maximum weight clique problem over the G-IDNC graph. Since finding the optimal solution of this formulation is NP-hard, we propose two heuristic algorithms to solve it and compare them using extensive simulations. Simulation results show that each of these heuristics outperforms the other in certain ranges of channel memory levels. They also show that the proposed heuristics significantly outperform both the optimal strict IDNC in the literature and the channel-unaware G-IDNC algorithms. © 2013 IEEE.
-
Architectural optimizations for low-power K-best MIMO decodersMondal, Sudip; Eltawil, Ahmed M.; Salama, Khaled N. (IEEE Transactions on Vehicular Technology, Institute of Electrical and Electronics Engineers (IEEE), 2009-09) [Article]Maximum-likelihood (ML) detection for higher order multiple-input-multiple-output (MIMO) systems faces a major challenge in computational complexity. This limits the practicality of these systems from an implementation point of view, particularly for mobile battery-operated devices. In this paper, we propose a modified approach for MIMO detection, which takes advantage of the quadratic-amplitude modulation (QAM) constellation structure to accelerate the detection procedure. This approach achieves low-power operation by extending the minimum number of paths and reducing the number of required computations for each path extension, which results in an order-of-magnitude reduction in computations in comparison with existing algorithms. This paper also describes the very-large-scale integration (VLSI) design of the low-power path metric computation unit. The approach is applied to a 4 × 4, 64-QAM MIMO detector system. Results show negligible performance degradation compared with conventional algorithms while reducing the complexity by more than 50%. © 2009 IEEE.