Serially concatenated turbo codes

Vafi, S; Wysocki, T; Abolhasan, M

Serially concatenated turbo codes

Vafi, S Wysocki, T Abolhasan, M

Permalink

Publication Type:: Conference Proceeding
Citation:: Proceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009, 2009
Issue Date:: 2009-12-01

Closed Access

	Filename	Description	Size
	2012005216OK.pdf		620.3 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Vafi, S	en_US
dc.contributor.author	Wysocki, T	en_US
dc.contributor.author	Abolhasan, M https://orcid.org/0000-0002-4282-6666	en_US
dc.date.issued	2009-12-01	en_US
dc.identifier.citation	Proceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009, 2009	en_US
dc.identifier.isbn	9781424436934	en_US
dc.identifier.uri	http://hdl.handle.net/10453/23647
dc.description.abstract	The paper presents a new scheme of concatenated codes, referred to as Serially Concatenated Turbo (SCT) codes. The code is constructed as the serial combinations of two turbo codes, i.e. turbo Recursive Systematic Convolutional (RSC) codes and turbo Bose Ray Chaudhuri Hocquenghem (BCH) codes, linked by a pseudo-random interleaver. In comparison with the conventional turbo RSC codes, SCT codes have higher minimum distance values. Based on conducted simulations, it is found that SCT codes outperform turbo RSC codes at the waterfall and error floor regions, while they require reasonable number of iterations at their iterative decoding structure to achieve good performance. ©2009 IEEE.	en_US
dc.relation.ispartof	Proceedings - 5th International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2009	en_US
dc.relation.isbasedon	10.1109/WICOM.2009.5303570	en_US
dc.title	Serially concatenated turbo codes	en_US
dc.type	Conference Proceeding
utslib.for	100503 Computer Communications Networks	en_US
dc.location.activity	Beijing, China	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Electrical and Data Engineering
pubs.organisational-group	/University of Technology Sydney/Strength - CRIN - Realtime Information Networks
pubs.organisational-group	/University of Technology Sydney/Strength - GBDTC - Global Big Data Technologies
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US

Abstract:

The paper presents a new scheme of concatenated codes, referred to as Serially Concatenated Turbo (SCT) codes. The code is constructed as the serial combinations of two turbo codes, i.e. turbo Recursive Systematic Convolutional (RSC) codes and turbo Bose Ray Chaudhuri Hocquenghem (BCH) codes, linked by a pseudo-random interleaver. In comparison with the conventional turbo RSC codes, SCT codes have higher minimum distance values. Based on conducted simulations, it is found that SCT codes outperform turbo RSC codes at the waterfall and error floor regions, while they require reasonable number of iterations at their iterative decoding structure to achieve good performance. ©2009 IEEE.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/23647