Table of Contents Author Guidelines Submit a Manuscript
Journal of Computer Networks and Communications
Volume 2011, Article ID 365107, 9 pages
http://dx.doi.org/10.1155/2011/365107
Research Article

Multipath Detection Using Boolean Satisfiability Techniques

1Department of Computer Science and Engineering, American University of Sharjah, P.O. Box 26666 Sharjah, United Arab Emirates
2Department of Electrical Engineering, American University of Sharjah, P.O. Box 26666 Sharjah, United Arab Emirates

Received 13 March 2011; Revised 8 August 2011; Accepted 5 September 2011

Academic Editor: Daniele Tarchi

Copyright © 2011 Fadi A. Aloul and Mohamed El-Tarhuni. 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. M. Simon, J. Omura, R. Scholtz, and B. Levitt, Spread Spectrum Communications, McGraw-Hill, New York, NY, USA, 1994.
  2. O. S. Shin and K. B. Lee, “Utilization of multipaths for spread-spectrum code acquisition in frequency-selective Rayleigh fading channels,” IEEE Transactions on Communications, vol. 49, no. 4, pp. 734–743, 2001. View at Publisher · View at Google Scholar · View at Scopus
  3. W. Suwansantisuk and Z. Win, “Multipath aided rapid acquisition: optimal search strategies,” IEEE Transactions on Information Theory, vol. 53, no. 1, pp. 174–193, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  4. W. Suwansantisuk, M. Z. Win, and L. A. Shepp, “On the performance of wide-bandwidth signal acquisition in dense multipath channels,” IEEE Transactions on Vehicular Technology, vol. 54, no. 5, pp. 1584–1594, 2005. View at Publisher · View at Google Scholar
  5. L. L. Yang and L. Hanzo, “Serial acquisition performance of single-carrier and multicarrier DS-CDMA over nakagami-m fading channels,” IEEE Transactions on Wireless Communications, vol. 1, no. 4, pp. 692–702, 2002. View at Publisher · View at Google Scholar
  6. A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu, “Symbolic model checking using SAT procedures instead of BDDs,” in Proceedings of the 36th Annual Design Automation Conference (DAC '99), pp. 317–320, June 1999.
  7. G. J. Nam, F. Aloul, K. Sakallah, and R. Rutenbar, “A comparative study of two boolean formulations of FPGA detailed routing constraints,” in Proceedings of the International Symposium on Physical Design (ISPD '01), pp. 222–227, April 2001.
  8. F. Aloul, S. Hassoun, K. Sakallah, and D. Blaauw, “Robust SAT-based search algorithm for leakage power reduction,” in Proceedings of the International Workshop on Power and Timing Modeling, Optimization, and Simulation (PATMOS '02), pp. 167–177, 2002.
  9. A. Sagahyroon and F. A. Aloul, “Using SAT-based techniques in power estimation,” Microelectronics Journal, vol. 38, no. 6-7, pp. 706–715, 2007. View at Publisher · View at Google Scholar
  10. F. A. Aloul and N. Kandasamy, “Sensor deployment for failure diagnosis in networked aerial robots: a satisfiability-based approach,” in Proceedings of the 10th International Conference on Theory and Applications of Satisfiability Testing (SAT '07), vol. 4501 of Lecture Notes in Computer Science, pp. 369–376, Springer, 2007.
  11. M. Mneimneh, F. Aloul, C. Weaver, S. Chatterjee, K. Sakallah, and T. Austin, “Scalable hybrid verification of complex microprocessors,” in Proceedings of the 38th Design Automation Conference (DAC '01), pp. 41–46, June 2001.
  12. N. Creignou, S. Kanna, and M. Sudan, Complexity Classifications of Boolean Constraint Satisfaction Problems, SIAM, 2001.
  13. S. A. Cook, “The complexity of theorem proving procedures,” in Proceedings of the Symposium on the Theory of Computing, pp. 151–158, 2004.
  14. F. A. Aloul, A. Ramani, I. L. Markov, and K. A. Sakallah, “Generic ILP versus specialized 0-1 ILP: an update,” in Proceedings of the IEEE/ACM International Conference on Computer Aided Design (ICCAD '02), pp. 450–457, November 2002. View at Publisher · View at Google Scholar
  15. D. Chai and A. Kuehlmann, “A fast pseudo-boolean constraint solver,” in Proceedings of the 40th Design Automation Conference (DAC '03), pp. 830–835, June 2003.
  16. N. Een and N. Sorensson, “An extensible SAT-solver,” in Proceedings of the International Conference on Theory and Applications of Satisfiability Testing (SAT '03), pp. 502–508, 2003.
  17. K. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, “Chaff: engineering an efficient SAT solver,” in Proceedings of the 38th Design Automation Conference (DAC '01), pp. 530–535, June 2001.
  18. J. P. Marques-Silva and K. A. Sakallah, “GRASP: a search algorithm for propositional satisfiability,” IEEE Transactions on Computers, vol. 48, no. 5, pp. 506–521, 1999. View at Publisher · View at Google Scholar · View at MathSciNet
  19. H. M. Sheini and K. A. Sakallah, “Pueblo: a modern Pseudo-Boolean SAT solver,” in Proceedings of the Design, Automation and Test in Europe Conference (DATE '05), pp. 684–685, March 2005. View at Publisher · View at Google Scholar
  20. E. Goldberg and Y. Novikov, “BerkMin: a fast and Robust SAT-solver,” in Proceedings of the Design Automation and Test in Europe Conference (DATE '02), pp. 142–149, 2002.
  21. K. Pipatsrisawat and A. Darwiche, “A new clause learning scheme for efficient unsatisfiability proofs,” in Proceedings of the Conference on Artificial Intelligence, pp. 1481–1484, July 2008.
  22. H. E. Dixon and M. L. Ginsberg, “Inference methods for a pseudo-Boolean satisfiability solver,” in Proceedings of the 18th National Conference on Artificial Intelligence (AAAI '02), pp. 635–640, August 2002.
  23. W. Suwansantisuk, M. Chiani, and M. Z. Win, “Frame synchronization for variable-length packets,” IEEE Journal on Selected Areas in Communications, vol. 26, no. 1, pp. 52–69, 2008. View at Publisher · View at Google Scholar
  24. J. Hayes, Introduction to Digital Logic Design, Addison-Wesley, 1993.
  25. M. Davis, G. Longman, and D. Loveland, “A machine program for theorem proving,” Journal of the ACM, vol. 5, no. 7, pp. 394–397, 1962. View at Google Scholar
  26. M. Abramovici and D. Saab, “Satisfiability on reconfigurable hardware,” in Proceedings of the International Workshop on Field Programmable Logic and Application (FPL '97), pp. 448–456, 1997.
  27. A. Dandalis and V. K. Prasanna, “Run-time performance optimization of an FPGA-based deduction engine for SAT solvers,” ACM Transactions on Design Automation of Electronic Systems, vol. 7, no. 4, pp. 547–562, 2002. View at Publisher · View at Google Scholar · View at Scopus
  28. I. Skliarova and A. B. Ferrari, “A software/reconfigurable hardware SAT solver,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 12, no. 4, pp. 408–419, 2004. View at Publisher · View at Google Scholar · View at Scopus
  29. P. Zhong, M. Martonosi, P. Ashar, and S. Malik, “Using configurable computing to accelerate Boolean satisfiability,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 18, no. 6, pp. 861–868, 1999. View at Publisher · View at Google Scholar · View at Scopus