Abstract:
Systematic Luby Transform (fountain) codes are investigated as a possible incremental redundancy scheme for EDGE. The convolutional incremental redundancy scheme currentl...Show MoreMetadata
Abstract:
Systematic Luby Transform (fountain) codes are investigated as a possible incremental redundancy scheme for EDGE. The convolutional incremental redundancy scheme currently used by EDGE is replaced by the fountain approach. The results of the simulations performed for each incremental redundancy scheme show that the fountain approach outperforms the convolutional approach on the second retransmission when implemented on the EDGE platform. The results also indicate that if the packet sizes used by a specific platform is large enough the fountain approach will always outperform the convolutional approach.
Published in: IEEE Africon '11
Date of Conference: 13-15 September 2011
Date Added to IEEE Xplore: 10 November 2011
ISBN Information:
ISSN Information:
Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- Systematic Coding ,
- Incremental Scheme ,
- Incremental Redundancy ,
- Luby Transform Codes ,
- Luby Transform ,
- Convolutional Approach ,
- Data Rate ,
- Likelihood Ratio Test ,
- Degree Distribution ,
- Bitrate ,
- Codeword ,
- Decoding Process ,
- Dynamic Matrix ,
- Noisy Channels ,
- Phase Shift Keying ,
- Parity-check ,
- Belief Propagation ,
- Factor Graph ,
- Binary Phase Shift Keying ,
- Payload Data ,
- Run To Completion ,
- Convolutional Codes ,
- Amount Of Edges ,
- Amount Of Cycles ,
- Decoding Time ,
- Successful Decoding
Keywords assist with retrieval of results and provide a means to discovering other relevant content. Learn more.
- IEEE Keywords
- Index Terms
- Systematic Coding ,
- Incremental Scheme ,
- Incremental Redundancy ,
- Luby Transform Codes ,
- Luby Transform ,
- Convolutional Approach ,
- Data Rate ,
- Likelihood Ratio Test ,
- Degree Distribution ,
- Bitrate ,
- Codeword ,
- Decoding Process ,
- Dynamic Matrix ,
- Noisy Channels ,
- Phase Shift Keying ,
- Parity-check ,
- Belief Propagation ,
- Factor Graph ,
- Binary Phase Shift Keying ,
- Payload Data ,
- Run To Completion ,
- Convolutional Codes ,
- Amount Of Edges ,
- Amount Of Cycles ,
- Decoding Time ,
- Successful Decoding