JPL Technical Report Server

Performance complexity tradeoffs for turbo and turbo-like codes

Show simple item record

dc.contributor.author Dolinar, S. en_US
dc.contributor.author Divsalar, D. en_US
dc.contributor.author Kiely, A. en_US
dc.contributor.author Pollara, F. en_US
dc.date.accessioned 2004-09-22T23:38:07Z
dc.date.available 2004-09-22T23:38:07Z
dc.date.issued 2001-06-24 en_US
dc.identifier.citation International Symposium on Information Theory en_US
dc.identifier.citation Washington D.C., USA en_US
dc.identifier.clearanceno 01-1031 en_US
dc.identifier.uri http://hdl.handle.net/2014/12761
dc.description.abstract We take a first empirical step toward understanding the performance-complexity tradeoffs that have newly arisen since the advent of turbo codes. en_US
dc.format.extent 113861 bytes
dc.format.mimetype application/pdf
dc.language.iso en_US
dc.subject.other turbo codes coding complexity en_US
dc.title Performance complexity tradeoffs for turbo and turbo-like codes en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search


Browse

My Account