Turbo codes have recently been considered for energy-constrained wireless communication applications, since they facilitate a low transmission energy consumption. How- ever, in order to reduce the overall energy consumption, lookup table-log-BCJR (LUT-Log-BCJR) architectures having a low processing energy consumption are required. In this paper, Authors decompose the LUT-Log-BCJR architecture into its most funda- mental add compare (ACS) operations and perform them using a novel low-complexity ACS unit. We demonstrate that the proposed architecture employs an order of magnitude fewer gates than the most recent LUT-Log-BCJR architectures, facilitating a 71 energy consumption reduction. Compared to state-of-the-art maximum logarithmic Bahl-Cocke-Jelinek-Raviv implementations, proposed approach facilitates a 10 reduction in the overall energy consumption at ranges above 58 m.

06112200_2013.pdf

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．