Skip to main content

Feasibility of the Circularly Connected Analog CNN Cell Array-Based Viterbi Decoder

  • Conference paper
Parallel Computing Technologies (PaCT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3606))

Included in the following conference series:

  • 496 Accesses

Abstract

The feasibility of the high speed Viterbi decoder with a circularly connected 2-dimensional analog CNN cell array has been investigated. In the previous study, the CNN-based analog Viterbi decoder was reported, in which a part of the trellis diagram of the convolutional coder is designed with analog circuit-based cells and connections. The circuits of the trellis diagram are connected circularly, forming a cylindrical shape so that the cells of the last stage are connected to those of the first stage. In this study, the performance of the CNN-based analog Viterbi decoder circuits have been measured through circuit simulations and its hardware feasibility has been investigated with two different kinds of tests such as the worst-case simulation and the Monte Carlo analysis. Results of such simulations are included.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Viterbi, A.J.: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory 13, 260–269 (1967)

    Article  MATH  Google Scholar 

  2. Forney Jr., G.D.: The Viterbi algorithm. Proc. of the IEEE 61(3) (March 1973)

    Google Scholar 

  3. Bellman, R.: Dynamic Programming. Princeton Univ. Press, Princeton (1957)

    Google Scholar 

  4. Gulak, P.G., Kailath, T.: Locally connected VLSI architecture for the Viterbi algorithm. IEEE J. on selected areas in comm. 6, 527–537 (1988)

    Article  Google Scholar 

  5. Shakiba, M.H., Johns, D.A., Martin, K.W.: BiCMOS circuits for analog Viterbi decoders. IEEE Trans. Circuits and Systems-II: Analog and Digital Signal Processing 45(12), 1527–1537 (1998)

    Article  Google Scholar 

  6. Chua, L.O., Yang, L.: Cellular neural networks: theory. IEEE Tr. on Circuits Systems 35, 1257–1272 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  7. Roska, T., Chua, L.O.: The CNN universal machine: an analogic array computer. IEEE Tr. on Circuits Systems II CAS-40, 163–173 (1993)

    Article  MathSciNet  Google Scholar 

  8. Kim, H., Son, H., Roska, T., Chua, L.O.: Very high speed Viterbi decoder with circularly connected analog CNN cell array. In: IEEE International Symposium on Circuits and Systems, vol. 3, pp. III-97–III-100 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Son, H., Kim, H., Kim, H., Chong, K.T. (2005). Feasibility of the Circularly Connected Analog CNN Cell Array-Based Viterbi Decoder. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2005. Lecture Notes in Computer Science, vol 3606. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11535294_13

Download citation

  • DOI: https://doi.org/10.1007/11535294_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28126-9

  • Online ISBN: 978-3-540-31826-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics