Table of Contents
ISRN Communications and Networking
Volume 2011 (2011), Article ID 239412, 9 pages
http://dx.doi.org/10.5402/2011/239412
Research Article

Detector Design and Complexity Analysis for Cooperative Communications in Intersymbol Interference Fading Channels

Department of Electrical & Computer Engineering, Worcester Polytechnic Institute, Worcester, MA 01609, USA

Received 31 March 2011; Accepted 1 May 2011

Academic Editor: M. S. Hwang

Copyright © 2011 Yanjie Peng et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. Proakis, Digital Communications, McGraw-Hill, New York, NY, USA, 4th edition, 2000.
  2. I. E. Telatar, “Capacity of multi-antenna gaussian channels,” Tech. Rep., AT&T Bell Laboratories, October 1995, http://mars.bell-labs.com/papers/proof/. View at Google Scholar
  3. G. J. Foschini, “Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas,” Bell Labs Technical Journal, vol. 1, no. 2, pp. 41–59, 1996. View at Google Scholar · View at Scopus
  4. W. Jakes Jr., Microwave Mobile Communications, chapter 1 and 5, John Wiley & Sons, New York, NY, USA, 1974.
  5. A. Sendonaris, E. Erkip, and B. Aazhang, “User cooperation diversity, parts I & II,” IEEE Transactions on Communications, vol. 51, 2003. View at Google Scholar
  6. J. N. Laneman, D. N. C. Tse, and G. W. Wornell, “Cooperative diversity in wireless networks: efficient protocols and outage behavior,” IEEE Transactions on Information Theory, vol. 50, no. 12, pp. 3062–3080, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. G. Kramer, M. Gastpar, and P. Gupta, “Cooperative strategies and capacity theorems for relay networks,” IEEE Transactions on Information Theory, vol. 51, no. 9, pp. 3037–3063, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. A. Sendonaris, E. Erkip, and B. Aazhang, “Increasing uplink capacity via user cooperation diversity,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT '98), p. 156, August 1998.
  9. J. N. Laneman, G. W. Wornell, and D. N. C. Tse, “An efficient protocol for realizing cooperative diversity in wireless networks,” in Proceedings of the IEEE International Symposium on Information Theory (ISIT '01), p. 294, June 2001. View at Scopus
  10. P. Murphy, A. Sabharwal, and B. Aazhang, “Building a cooperative communications system,” Computing Research Repository, http://arxiv.org/abs/0707.2998.
  11. S. Wei, D. L. Goeckel, and M. C. Valenti, “Asynchronous cooperative diversity,” IEEE Transactions on Wireless Communications, vol. 5, no. 6, pp. 1547–1557, 2006. View at Publisher · View at Google Scholar · View at Scopus
  12. K. Azarian, H. El Gamal, and P. Schniter, “On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels,” IEEE Transactions on Information Theory, vol. 51, no. 12, pp. 4152–4172, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. N. Benvenuto and R. Marchesani, “The Viterbi algorithm for sparse channels,” IEEE Transactions on Communications, vol. 44, no. 3, pp. 287–289, 1996. View at Google Scholar · View at Scopus
  14. P. Hoeher, “A statistical discrete-time model for the wssus multipath channel,” IEEE Transactions on Vehicular Technology, vol. 41, no. 4, pp. 461–468, 1992. View at Publisher · View at Google Scholar · View at Scopus
  15. G. D. Forney Jr., “Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference,” IEEE Transactions on Information Theory, vol. 18, no. 3, pp. 363–378, 1972. View at Google Scholar · View at Scopus
  16. A. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,” IEEE Transactions on Information Theory, vol. 13, no. 2, pp. 260–269, 1967. View at Google Scholar
  17. M. Kamuf, V. Owall, and J. B. Anderson, “Optimization and implementation of a Viterbi decoder under flexibility constraints,” IEEE Transactions on Circuits and Systems I, vol. 55, no. 8, pp. 2411–2422, 2008. View at Publisher · View at Google Scholar · View at Scopus
  18. Y. Gang, A. T. Erdogan, and T. Arslan, “An efficient pre-traceback architecture for the Viterbi decoder targeting wireless communication applications,” IEEE Transactions on Circuits and Systems I, vol. 53, no. 9, pp. 1918–1927, 2006. View at Publisher · View at Google Scholar · View at Scopus
  19. G. Feygin and P. G. Gulak, “Architectural tradeoffs for survivor sequence memory management in Viterbi decoders,” IEEE Transactions on Communications, vol. 41, no. 3, pp. 425–429, 1993. View at Publisher · View at Google Scholar · View at Scopus
  20. R. Cypher and C. B. Shung, “Generalized trace-back techniques for survivor memory management in the Viterbi algorithm,” Journal of VLSI Signal Processing, vol. 5, no. 1, pp. 85–94, 1993. View at Publisher · View at Google Scholar · View at Scopus
  21. P. J. Black and T. H. Meng, “A 140-Mb/s, 32-state, radix-4 Viterbi decoder,” IEEE Journal of Solid-State Circuits, vol. 27, no. 12, pp. 1877–1885, 1992. View at Publisher · View at Google Scholar · View at Scopus
  22. Y. Peng, A. G. Klein, and X. Huang, “Design of a maximum-likelihood detector for cooperative communications in intersymbol interference channels,” in Proceedings of the 19th ACM Great Lakes Symposium on VLSI (GLSVLSI '09), pp. 429–432, ACM, May 2009. View at Publisher · View at Google Scholar · View at Scopus
  23. N. C. McGinty, R. A. Kennedy, and P. Hoeher, “Parallel trellis viterbi algorithm for sparse channels,” IEEE Communications Letters, vol. 2, no. 5, pp. 143–145, 1998. View at Google Scholar · View at Scopus
  24. Guidelines for Evaluation of Radio Transmission Technologies for IMT-2000, Recommendation ITU-R M.1225, 1997.