Rate allocation for serial concatenated convolutional codes

Access Full Text

Rate allocation for serial concatenated convolutional codes

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

The paper proposes an analytical method to solve the rate allocation problem in serial concatenated convolutional codes (SCCCs). The goal is to find the best rate allocation between the inner and the outer constituent convolutional codes of an SCCC for constant overall code rate, interleaver size and complexity. Simulation results are shown in the paper to demonstrate the optimum and superior design criteria. In addition, the ‘density evolution’ model is shown to verify the proposed rate allocation method, while indicating that a high rate inner code should not be used for SCCCs. Finally, it is also shown that the upper bounds on BER of ML decoded SCCCs do not provide good design criteria for allocating the rate in iteratively decoded SCCCs.

Inspec keywords: iterative decoding; convolutional codes; concatenated codes; error statistics

Other keywords: rate allocation method; density evolution model; serial concatenated convolutional codes; BER; iteratively decoded SCCC

Subjects: Codes; Other topics in statistics

References

    1. 1)
      • L. Bahl , J. Cocke , F. Jelinek , J. Raviv . Optimal decoding of linear codes for minimizing symbol error rate. IEEE Trans. Inf. Theory , 2 , 284 - 287
    2. 2)
      • Herro, M.A., Costello, D.J., Hu, L.: `Capacity and cutoff rate of a concatenated coding system with an inner convolutional code', Proc. Conf. Information Sciences and Systems, 19 March 1986, Princeton, New Jersey, USA, p. 352–356.
    3. 3)
    4. 4)
    5. 5)
    6. 6)
      • A.J. Viterbi . Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans. Inf. Theory , 2 , 260 - 269
    7. 7)
    8. 8)
    9. 9)
      • Divsalar, D., Dolinar, S., Pollara, F.: `Iterative turbo decoder analysis based on Gaussian density evolution', Proc. MILCOM 2000, 22–25 October 2000, Los Angeles, CA, 1, p. 202–208.
    10. 10)
    11. 11)
    12. 12)
      • D. Wiggert . (1988) Codes for error control and synchronization.
    13. 13)
      • Divsalar, D., Dolinar, S., Pollara, F.: `Iterative turbo decoder analysis based on density evolution', TMO Progress Report 42-144, 15 February 2001.
    14. 14)
      • S. Benedetto , E. Biglieri , V. Castellani . (1987) Digital transmission theory.
    15. 15)
    16. 16)
      • Griep, K., Hinedi, S., Ray, G.: `Serial concatenated codes for broadband satellite communications', Proc. GLOBECOM 98, 8–12 November 1998, Sydney, Australia, 5, p. 2936–2941.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com_20060030
Loading

Related content

content/journals/10.1049/iet-com_20060030
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading