2010
DOI: 10.1109/tit.2009.2034821
|View full text |Cite
|
Sign up to set email alerts
|

On Unequal Error Protection of Convolutional Codes From an Algebraic Perspective

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 37 publications
0
4
0
Order By: Relevance
“…Based on this fact, we chose to protect the bitstreams with UEP pre-code that possesses three SVC/MGS layers with 1:1:1 ratio among the bit rates and proper erasure protection. More precisely, we adopted as pre-code a three-layered UEP convolutional code [36] because it provides a code designer capability to cope with variations of the input stream size, although, it suffers from a minor sacrifice of the overall coding rate. In order to reduce the inflation rate of the composite code, we decided to raise the code rate of the pre-code through puncturing providing the maximum separation vector.…”
Section: Protecting Svc Multicastmentioning
confidence: 99%
“…Based on this fact, we chose to protect the bitstreams with UEP pre-code that possesses three SVC/MGS layers with 1:1:1 ratio among the bit rates and proper erasure protection. More precisely, we adopted as pre-code a three-layered UEP convolutional code [36] because it provides a code designer capability to cope with variations of the input stream size, although, it suffers from a minor sacrifice of the overall coding rate. In order to reduce the inflation rate of the composite code, we decided to raise the code rate of the pre-code through puncturing providing the maximum separation vector.…”
Section: Protecting Svc Multicastmentioning
confidence: 99%
“…As shown by [33], UEP coding theory for block codes [30], [31] can be extended to convolutional codes as well. In fact, UEP capabilities can be expected since we have a rate r = k/n convolutional code with k > 1 [33]- [35]. However, the inherent UEP properties of G(D) are closely related to the polynomials G x (D) [34], [35].…”
Section: Distributed Network/channel Codementioning
confidence: 99%
“…In fact, UEP capabilities can be expected since we have a rate r = k/n convolutional code with k > 1 [33]- [35]. However, the inherent UEP properties of G(D) are closely related to the polynomials G x (D) [34], [35]. It is important to note that the convolutional codes used at the sources should be chosen in order to avoid catastrophic convolutional codes seen at the relays [29].…”
Section: Distributed Network/channel Codementioning
confidence: 99%
“…It is realized by multiple coding schemes, so the structures of the encoder and decoder are more complicated. The latter was first proposed by Masnick in [12], it is often used to provide better protection to one subset of bits in a coding block and ensure that the bits of higher protection level have less error probability than the bits with lower protection level [10][11][12]. The bit-wise method constructs unequal distances for information bits in one coding block by algebraic means and assigns them with different error correcting capabilities in once coding process without changing the coding rate.…”
Section: A Unequal Error Protection Codesmentioning
confidence: 99%