2005
DOI: 10.1002/0471739219
|View full text |Cite
|
Sign up to set email alerts
|

Error Correction Coding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
178
0
3

Year Published

2008
2008
2014
2014

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 612 publications
(212 citation statements)
references
References 0 publications
0
178
0
3
Order By: Relevance
“…Since pseudo-random sequences are non-orthogonal, collisions will occur between different channels (or users). Thus the system requires heavy use of Forward Error Correction (FEC, see [15] and references therein) to provide a required Bit Error Rates (BER) according to the capacity of the system. In this paper, we show that the use of FEC allows attaining a peak medium utilization of approximately 35%, close to that of the slotted-aloha protocol, a similar but non-secure transmission scheme [16].…”
Section: Secure Time-hopping Cdmamentioning
confidence: 99%
See 1 more Smart Citation
“…Since pseudo-random sequences are non-orthogonal, collisions will occur between different channels (or users). Thus the system requires heavy use of Forward Error Correction (FEC, see [15] and references therein) to provide a required Bit Error Rates (BER) according to the capacity of the system. In this paper, we show that the use of FEC allows attaining a peak medium utilization of approximately 35%, close to that of the slotted-aloha protocol, a similar but non-secure transmission scheme [16].…”
Section: Secure Time-hopping Cdmamentioning
confidence: 99%
“…In experiments, delay (the time for a bit to traverse the network) was very high, due to Reed-Solomon 223/255 coding, a frame to support up to 16 users and the low capacity of the physical media. A more sensible choice of FEC algorithm (like BCH [15]) could drastically reduce data delay. Simple pulse shaping is realized using a pass-band filter at the output of the modulation and also at the input of the demodulator.…”
Section: Modulation and Synchronizationmentioning
confidence: 99%
“…They are usually represented by bipartite Tanner graphs [14], connecting Bit Nodes (BN) and Check Nodes (CN). The in-formation received from the channel is propagated, processed and exchanged between neighboring nodes of the graph, as depicted by the arrows in figure 1.…”
Section: Dvb-s2 Ldpc Codes and Decoding Algorithmmentioning
confidence: 99%
“…A simple but powerful outer Reed-Solomon code can improve this by another 1 dB at the cost of minor bandwidth expansion. Higher coding gain can be obtained by more complex low-density parity-check (LDPC) or turbo codes [18].…”
Section: Signal Constructionmentioning
confidence: 99%
“…A simple but powerful outer Reed-Solomon code can improve this by another 1 dB at the cost of minor bandwidth expansion. Higher coding gain can be obtained by more complex low-density parity-check (LDPC) or turbo codes [18].Trellis-coded modulation, in spite of its limited coding gain, offers a compact, low-power, low-latency decoding which can be combined with a decision feedback equalizer to eliminate error propagation by replacing the tentative decision with more . LDPC-assisted coded modulation is adopted for the 10GBASE-T standard [21].…”
mentioning
confidence: 99%