Abstract
Various techniques, such as bidirectional search, have been employed in sequential decoding to reduce the decoding delay. In this paper, a bidirectional Fano algorithm (BFA) is proposed, in which a forward decoder (FD) and a backward decoder (BD) search in the opposite direction simultaneously. It is shown that the proposed BFA can reduce the average decoding delay by at least 50% compared to the unidirectional Fano algorithm (UFA). Due to the reduction in the variability of the computational effort by using bidirectional search, there is even higher decoding throughput improvement at low signal-to-noise-ratio (SNR). For example at Eb/No=3dB, there is 300% throughput improvement by using the BFA decoding compared to the conventional UFA decoding. The proposed BFA decoding technique can be employed in very high throughput wireless communication systems with low hardware complexity and power consumption.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
