Abstract
In this paper, based on a belief-propagation decoding strategy, a class of generalized parity-check codes called complex rotary codes is investigated. It is shown that, by using iterative sum-product decoding, the complex rotary codes have a much lower decoding complexity than Turbo codes, but have almost the same performance for the high code rate and short frame case (frame length< 500 bits). It is also shown that the prime block size of complex rotary codes is essential to achieve better performance because of its uniform checking characteristic.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
