Pseudo Random Network Coding Design for IEEE 802.16m Enhanced Multicast and Broadcast Service

Chao, Cheng-Chih; Chou, Ching-Chun; Wei, Hung‐Yu

doi:10.1109/vetecs.2010.5493836

Cited by 20 publications

(21 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These coding coefficients are used at the receiver for decoding [4]. This introduces an extra overhead of K log(q) bits, therefore several other approaches [8]- [9] have been proposed to reduce such kind of overhead. However, this particular aspect is out of the scope of the paper and hence, we assume that the coding coefficients are known at the receiving ends.…”

Section: Y(t) = X(t)h(t) = S(t)g(t)h(t)mentioning

confidence: 99%

Network Coding Advantage over MDS Codes for Multimedia Transmission via Erasure Satellite Channels

Saxena

Vázquez-Castro

2013

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

Abstract. In this paper, we focus on the performance analysis of packetlevel Forward Error Correction (FEC) codes based on Systematic Random Linear Network Coding (SRNC) for multimedia transmission via erasure satellite channels. A performance comparison is presented against maximum distance separable (MDS) codes currently used in state-of-theart satellite transmission air interfaces, specifically Reed Solomon (RS) codes. Firstly, a theoretical analysis is presented for which we first develop a matricial erasure channel model. The theoretical analysis shows that both the RS and SRNC have, as expected, similar error correction performance over different packet erasure lengths for commonly used size fields. Secondly, we present an on-the-fly progressive algorithm for SRNC, which takes advantage of the inherent randomness of SRNC encoding. Thirdly, a performance comparison is presented for two different satellite scenarios: 1) DVB-S2/RCS railway scenario and 2) Broadband Global Area Network (BGAN) mobile scenario. We use real channel parameters for the first scenario and channel traces of video streaming sessions for the second scenario. Our simulation results confirm that both the RS codes and SNRC have the same packet recovery capabilities. However, for low coding rates, SRNC is shown to achieve up to 71% delay gain as compared to RS codes.

show abstract

Section: Y(t) = X(t)h(t) = S(t)g(t)h(t)mentioning

confidence: 99%

Network Coding Advantage over MDS Codes for Multimedia Transmission via Erasure Satellite Channels

Saxena

Vázquez-Castro

2013

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

show abstract

“…This coding scheme can recover one lost packet for each subset of W packets if the user receives all other packets in this subset and the corresponding retransmitted packet. Pseudo Random Network Coding (PRNC) scheme [5]: In this scheme, the coding coefficients {c il } are defined with two parameters as follows. For i = 1, c 1l = 1, ∀ l, i.e., a SPC coding across L packets For i > 1, the code coefficients c il are then generated using two positive integers a and s as…”

Section: System Descriptions and Existing Schemesmentioning

confidence: 99%

“…Then the code design is to find the optimal code that minimizes either the packet or frame error probability in (5) or (6).…”

Section: ) Encoding and Its Graph Representationmentioning

confidence: 99%

“…The code design then becomes the design of the set L M to minimize the error rates in (5) or (6) with additional constraints…”

Section: ) Residual Graph For Optimal Decodermentioning

confidence: 99%

“…However, it is assumed that the transmitter knows the indices of lost packets from every user, which requires a large overhead on the uplink feedback channel to deliver such information. Several network coding-based retransmission schemes are then proposed for the wireless broadcast without any user feedback [4], [5]. In this paper, we propose a new binary network coding scheme for the wireless broadcast without feedback information.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Design of Binary Network Coding for Wireless Broadcast

Yue¹,

Khojastepour²,

Rangarajan³

2011

2011 IEEE Global Telecommunications Conference - GLOBECOM 2011

View full text Add to dashboard Cite

In this paper, we consider the design of a binary network coding scheme for the wireless broadcast, in which the same packet sequence is broadcasted to multiple receivers. In the proposed coding scheme, a short block code is employed for the coding across the broadcasted packets to generate redundant packets to recover the lost packets for all terminals in the service. In particular, we assume the optimal decoder and consider the design of short block codes with a small number of redundancy. We present a residual graph based code design method and propose an iterative design algorithm with stochastic update. The short block code is then extended with an improved pseudorandom code to achieve the flexibility on redundancy. Numerical results show that the proposed coding scheme provides superior performance over other coding schemes.978-1-4244-9268-8/11/$26.00 ©2011 IEEE This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE Globecom 2011 proceedings.

show abstract

A limited feedback based network coding retransmission scheme for machine‐to‐machine wireless broadcasting

Wang

2015

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

In this paper, we focus on network coding based wireless broadcasting problem in a machine‐to‐machine (M2M) scenario where massive M2M devices (MDs) exist. On the finding that numerous feedback messages are required in traditional full feedback based network coding schemes, which imposes a heavy feedback load to the system, we propose a Limited Feedback based Network Coding Retransmission (LFNCR) scheme on the purpose of achieving a practical coverage rate CR (CR < 100%). Instead of the accurate feedback‐by‐packet mechanism, in LFNCR, a feedback‐by‐stage mechanism is applied, that is, each MD feeds back a generation for pseudo‐random network coded packets in a next retransmission stage; thus, feedback load is significantly decreased. In order to maximise broadcast efficiency, we further propose a two‐step generation optimization procedure. In particular, in the first step, each MD determines a local optimal generation and sends it to the base station; in the second step, base station selects a global optimal generation among local optimal generations corresponding to the target coverage rate. Theoretical analysis and simulation results show that in the proposed LFNCR, only extreme few feedback is required, compared with traditional full feedback based network coding retransmission schemes, meanwhile acceptable broadcast efficiency could be achieved. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

Pseudo Random Network Coding Design for IEEE 802.16m Enhanced Multicast and Broadcast Service

Cited by 20 publications

References 8 publications

Network Coding Advantage over MDS Codes for Multimedia Transmission via Erasure Satellite Channels

Network Coding Advantage over MDS Codes for Multimedia Transmission via Erasure Satellite Channels

Design of Binary Network Coding for Wireless Broadcast

A limited feedback based network coding retransmission scheme for machine‐to‐machine wireless broadcasting

Contact Info

Product

Resources

About