Conclusions and Future Works
5.2. FUTURE WORKS 113
teristics is not predictable if the system is not LTI. However, communication systems are usually not LTI systems. Therefore, to reduce the design time for system optimization is a research topic.
Multipliers are mostly often used for VLSI design. However, for deep sub-micron de-signs, local wire delay can affect the design performance, and hence, the wire delay must be tightly merged to gate delay, and the optimization of multipliers becomes complex.
Simulation-annealing, and genetic algorithm are hence suitable for solving this problem.
Bibliography
[1] M.-L. Ku and C.-C. Huang, “A complementary codes pilot-based transmitter diver-sity technique for OFDM systems,” IEEE Transactions on Wireless Communica-tions, vol. 5, pp. 504–508, March 2006.
[2] L. Cai and D. Gajski, “Transaction level modeling: An overview,” IEEE/ACM/IFIP International Conference on Hardware/Software and System Synthesis, pp. 19–24, October 2003.
[3] J. Dorsey, S. Searles, M. Ciraula, S. Johnson, N. Bujanos, D. Wu, M. Braganza, S. Meyers, E. Frang, and R. Kumar, “An integrated quad-core Opteron proces-sor,” IEEE International Solid-State Circuits Conference Digest of Technical Papers, pp. 102–103, 2007.
[4] J. Song, T. Shepherd, M. Chau, A. Huq, I. Syed, S. Roy, A. Thippana, K. Shi, and U. Ko, “A low power open multimedia application platform for 3G wireless,” IEEE International Conference on Systems-on-Chip, pp. 377–380, 2003.
115
[5] M. Dillinger, K. Madani, and N. Alonistioti, “Software defined radio : architectures, systems, and functions,” John Wiley & Sons Ltd, 2003.
[6] G.-H. Chen, “Design methodology at electronic system level: A case study of OFDM system,” Master Dissertation, National Chiao Tung University, Taiwan, Au-gust 2006.
[7] L. Benini and G. D. Micheli, “Networks on chips: a new SoC paradigm,” IEEE Computer Magazine, vol. 35, pp. 70–78, January 2002.
[8] A. Jantsch and H. Tenhunen, “Networks on chip,” Kluwer Academic Publishers, 2003.
[9] D. Densmore, A. Sangiovanni-Vincentelli, and R. Passerone, “A platform-based tax-onomy for ESL design,” IEEE Design & Test of Computers, vol. 23, pp. 359–374, September–October 2006.
[10] J. Hu and R. Marculescu, “Energy- and performance-aware mapping for regular NoC architecture,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 24, pp. 551–562, April 2005.
[11] E. Rijpkema, K. Goossens, A. Radulescu, J. Dielissen, J. van Meerbergen, P. Wielage, and E. Waterlander, “Trade-offs in the design of a router with both
guar-BIBLIOGRAPHY 117
anteed and best-effort services for networks on chip,” Proceedings of ACM/IEEE Design Automation and Test in Europe, pp. 350–355, 2003.
[12] P. P. Pande, C. Grecu, A. Ivanov, R. Saleh, and G. D. Micheli, “Design, synthesis, and test of networks on chips,” IEEE Design & Test of Computers, vol. 22, pp. 404–
413, September–October 2005.
[13] W. J. Dally, “Performance analysis of a k-ary n-cube interconnect networks,” IEEE Transactions on Computers, vol. 39, pp. 775–785, June 1990.
[14] L. P. Carloni, K. L. McMillan, A. Saldanha, and A. L. Sangiovanni-Vincentelli, “A methodology for correct-by-construction latency insensitive design,” Proceedings of IEEE/ACM International Conference on Computer-Aided Design, pp. 309–315, 1999.
[15] L. P. Carloni and A. L. Sangiovanni-Vincentelli, “Coping with latency in soc design,”
IEEE Micro, vol. 22, pp. 24–35, October 2002.
[16] J. Y. Chang, W. J. Kim, Y. H. Bae, J. H. Han, H. J. Cho, and H. B. Jung, “Perfor-mance analysis for MPEG-4 video codec based on on-chip network,” ETRI Journal, vol. 27, pp. 497–503, 2005.
[17] A. Marquardt, V. Betz, and J. Rose, “Timing-driven placement for FPGAs,” ACM Symposium on FPGAs, pp. 203–213, 2000.
[18] C. Ebeling, L. McMurchie, S. A. Hauck, and S. Burns, “Placement and routing tools for the Triptych FPGA,” IEEE Transactions on Very Large Scale Integration Systems, vol. 3, pp. 473–482, December 1995.
[19] C. Y. Lee, “An algorithm for path connections and its applications,” IRE Transac-tions Electron Computing, vol. 10, pp. 346–365, 1961.
[20] E. Dijkstra, “A note on two problems in connexion with graphs,” Numerical Math, vol. 1, pp. 269–271, 1959.
[21] J. Duato, S. Yalamanchili, and L. Ni, “Interconnection networks: An engineering approach,” Morgan Kaufmann, 2003.
[22] R. P. Dick, D. L. Rhodes, and W. Wolf, “TGFF: task graphs for free,” Proceedings of the 6th IEEE International Workshop on Hardware/Software Codesign, pp. 97–101, 1998.
[23] J. W. Cooley and J. W. Tukey, “An algorithm for the machine calculation of complex fourier series,” Mathematics Computation, vol. 19, pp. 297–301, 1965.
[24] L. R. Rabiner and G. Gold, “Theory and application of digital signal processing,”
Prentice-Hall, Inc., 1975.
[25] E. H. Wold and A. M. Despain, “Pipelined and parallel-pipeline FFT processors for
BIBLIOGRAPHY 119
VLSI implementation,” IEEE Transactions on Computers, vol. C–33(5), pp. 414–
426, May 1984.
[26] S.-S. He and M. Torkelson, “A new approach to pipeline FFT processor,” Proceed-ings of the 10thIEEE International Parallel and Distributed Processing Symposium, pp. 766–770, 1996.
[27] S.-S. He and M. Torkelson, “Designing pipeline FFT processors for OFDM (de)modulation,” Proceedings of 1998 URSI International Symposium on Signals, Systems, and Electronics, pp. 257–262, October 1998.
[28] J.-C. Choi, W.-C. Choi, S.-G. Hwang, M. M.-O. Lee, and K.-R. Cho, “Design of a new IFFT/FFT for IEEE 802.11a WLAN based on the statistics distribution of the input data,” IEEE Proceedings on High-Speed Networks and Multimedia Communi-cations, vol. 3079, pp. 589–597, June 2004.
[29] J. yeol Oh and M. seob Lim, “Area and power efficient pipeline FFT algorithm,”
IEEE Workshop on Signal Processing Systems Design and Implementation, pp. 520–
525, November 2005.
[30] L. Yang, K. Zhang, H. Liu, J. Huang, and S. Huang, “An efficient locally pipelined FFT processor,” IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 53, pp. 585–589, July 2006.
[31] P. D. Welch, “A fixed-point fast fourier transform error analysis,” IEEE Transactions on Audio and Electroacoustics, vol. AU-17, pp. 151–157, June 1969.
[32] A. V. Oppenheim and C. J. Wenstein, “Effects of finite register length in digital filtering and the fast fourier transform,” IEEE Proceedings, vol. 60, pp. 957–976, August 1972.
[33] R. Meyer, “Error analysis and comparison of FFT implementation structures,”
IEEE International Conference on Acoustics, Speech and Signal Processing, vol. 2, pp. 888–891, May 1989.
[34] A. Pomerleau, H. L. Buijs, and M. Fournier, “A two-pass fixed point fast fourier transform error analysis,” IEEE Transactions on Acoustics, Speech and Signal Pro-cessing, vol. 25, pp. 582–585, December 1977.
[35] S. Johansson, S. He, and P. Nilsson, “Wordlength optimization of a pipelined FFT processor,” Proceedings of IEEE International Midwest Symposium on Circuits and Systems, vol. 1, pp. 501–503, 1999.
[36] A. V. Oppenheim and R. W. Schafer, “Discrete-time signal processing,” Second Edi-tion, Prentice Hall, 1999.
[37] R. E. Walpole, R. H. Myers, and S. L. Myers, “Probability and statistics for engineers and scientists,” Sixth Edition, Prentice Hall, 1998.
BIBLIOGRAPHY 121
[38] “SystemC Version 2.0 User’s Guide,” http://www.systemc.org, 2002.
[39] J. Bhasker, “A SystemC Primer,” Star Galaxy, 2002.
[40] W. C. Yeh, “Arithmetic module design and its application to FFT,” PhD. Disserta-tion, National Chiao Tung University, Taiwan, July 2001.
[41] “Synopsys Design Analyzer,” http://www.synopsys.com, 2000.
[42] “Synopsys Design Ware,” http://www.synopsys.com, 2000.
[43] “Artisan TSMC 0.25µm process high-density dual-port SRAM (HD-SRAM-DP) generator user manual, release 1.0,” http://www.artisan.com, June 2000.
[44] “Artisan TSMC 0.25µm process high-speed single-port SRAM (HS-SRAM-SP) generator user manual, release 3.0,” http://www.artisan.com, June 2000.
[45] H. A. Al-Twaijry, “Area and performance optimized CMOS multipliers,” PhD The-sis, Stanford University, August 1997.
[46] C. S. Wallace, “A suggestion for a fast multiplier,” IEEE Transactions on Computers, vol. 13, pp. 14–17, February 1964.
[47] V. G. Oklobdzija, D. Villeger, and S. S. Liu, “A method for speed optimized partial product reduction and generation of fast parallel multipliers using an algorithmic approach,” IEEE Transactions on Computers, vol. 45, pp. 294–306, March 1996.
[48] P. F. Stelling, C. U. Martel, V. G. Oklobdzija, and R. Ravi, “Optimal circuits for parallel multipliers,” IEEE Transactions on Computers, vol. 47, pp. 273–285, March 1998.
[49] W. C. Elmore, “The transient response of damped linear networks with particular regard to wide-band amplifiers,” Journal of Applied Physics, vol. 19, pp. 55–63, January 1948.
[50] S. F. Oberman and M. J. Flynn, “Design issues in division and other floating-point operations,” IEEE Transactions on Computers, vol. 46, pp. 154–161, February 1997.