Escolar Documentos
Profissional Documentos
Cultura Documentos
Introduction:
History:
The rapid and efficient deployment of new
The first radiotelephone service was introduced
wireless data and Internet services has emerged
in the US at the end of the 1940s, and was
as a critical priority for communications
meant to connect mobile users in cars to the
equipment manufacturers. Network
public fixed network. In the 1960s, a new
components that enable wireless data services
system launched by Bell Systems, called
are fundamental to the next- generation
Improved Mobile Telephone Service” (IMTS),
network infrastructure. Wireless data services
brought many improvements like direct dialing
are expected to see the same explosive growth
and higher bandwidth. The first analog cellular
in demand that Internet services and wireless
systems were based on IMTS and developed in
voice services have seen in recent years.
the late 1960s and early 1970s. The systems
were “cellular” because coverage areas were CDG and standards bodies that are taking place
split into smaller areas or “cells”, each of which toward cdma One evolution and 3G standards.
is served by a low power transmitter and
receiver.
3G Cell phone:
This first generation (1G) analog system for
A testing study focusing on popular 3G
mobile communications saw two key
handsets by Signals Research Group (SRG)
improvements during the 1970s: the invention
found dramatic differences in the ability of
of the microprocessor and the digitization of the
different phones to reliably make and maintain
control link between the mobile phone and the
calls. The study reached that conclusion despite
cell site. the fact that all of the phones in the reliability
tests passed industry-standard conformance
REFERENCES:
[1] M. Frigo and S. G. Johnson, “The FFTW web
Third Generation (3G) Wireless: page,”
http://www.fftw.org/, 2004.
Third Generation (3G) mobile devices and
[2] M. Frigo, “A fast Fourier transform compiler,” in
services will transform wireless
Proc. ACM SIGPLAN’
communications into on-line, real-time
99 Conference on Programming Language Design
connectivity. 3G wireless technology will allow
and Implementation
an individual to have immediate access to
(PLDI), vol. 34, no. 5. Atlanta, Georgia: ACM, May
location-specific services that offer
1999,
information on demand. The first generation of
pp. 169–180.
mobile phones consisted of the analog models
[3] M. Frigo and S. G. Johnson, “FFTW: An adaptive
that emerged in the early 1980s. The second
software architecture
generation of digital mobile phones appeared
for the FFT,” in Proc. IEEE Int’l Conf. Acoustics,
about ten years later along with the first digital
Speech, and Signal
mobile networks. During the second generation,
Processing, vol. 3, Seattle, WA, May 1998, pp. 1381–
the mobile telecommunications industry
1384.
experienced exponential growth both in terms
[4] G. Jayasumana, “Searching for the best Cooley-
of subscribers as well as new types of value-
Tukey FFT algorithms,”
added services. Mobile phones are rapidly
in Proc. IEEE Int’l Conf. Acoustics, Speech, and
becoming the preferred means of personal
Signal Processing,
communication, creating the world's largest
vol. 4, 1987, pp. 2408–2411.
consumer electronics industry.
[5] H. Massalin, “Superoptimizer: A look at the
The rapid and efficient deployment of new
smallest program,” in
wireless data and Internet services has emerged
Proc. 2nd Int’l Conf. Architectural Support for
as a critical priority for communications
Programming Languages
equipment manufacturers. Network
and Operating System (ASPLOS), 1987, pp. 122–127.
components that enable wireless data services
[6] J. Bilmes, K. Asanovi´c, C.-W. Chin, and J.
are fundamental to the next-generation network
Demmel, “Optimizing matrix
infrastructure. Wireless data services are
multiply using PHiPAC: a portable, high-
expected to see the same explosive growth in
performance, ANSI C coding
demand that Internet services and wireless
methodology,” in Proc. Int’l Conf. Supercomputing,
voice services have seen in recent years.
Vienna, Austria,
July 1997.
This white paper presents an overview of
[7] R. Whaley and J. Dongarra, “Automatically tuned
current technology trends in the wireless
linear algebra software,”
Computer Science Department, Univ. Tennessee, of the complex Fourier series,” Math. Computation,
Knoxville, TN, vol. 19, pp.
Tech. Rep. CS-97-366, 1997. 297–301, Apr. 1965.
[8] S. K. S. Gupta, C. Huang, P. Sadayappan, and R. [15] M. T. Heideman, D. H. Johnson, and C. S.
W. Johnson, “A Burrus, “Gauss and the
framework for generating distributed-memory history of the fast Fourier transform,” IEEE ASSP
parallel programs for Magazine, vol. 1,
block recursive algorithms,” J. Parallel and no. 4, pp. 14–21, 1984.
Distributed Computing, [16] P. Duhamel and M. Vetterli, “Fast Fourier
vol. 34, no. 2, pp. 137–153, May 1996. transforms: a tutorial review
[9] M. P¨uschel, B. Singer, J. Xiong, J. M. F. Moura, and a state of the art,” Signal Processing, vol. 19, pp.
J. Johnson, D. Padua, 259–299, Apr.
M. M. Veloso, and R. W. Johnson, “SPIRAL: A 1990.
generator for platformadapted
libraries of signal processing algorithms,” Journal of
High
Performance Computing and Applications, vol. 18,
no. 1, pp. 21–45,
2004.
[10] M. P¨uschel, J. M. F. Moura, J. Johnson, D.
Padua, M. Veloso, B. W.
Singer, J. Xiong, F. Franchetti, A. Gaˇci´c, Y.
Voronenko, K. Chen,
R. W. Johnson, and N. Rizzolo, “SPIRAL: Code
generation for DSP
transforms,” Proceedings of the IEEE, vol. 93, no. 2,
pp. 232–275, 2005,
special issue on “Program Generation, Optimization,
and Adaptation”.
[11] K. S. Gatlin, “Portable high performance
programming via architecturecognizant
divide-and-conquer algorithms,” Ph.D. dissertation,
University
of California, San Diego, 2000.
[12] T. H. Cormen, C. E. Leiserson, and R. L. Rivest,
Introduction to
Algorithms. Cambridge, Massachusetts: The MIT
Press, 1990.
[13] B. Singer and M. Veloso, “Learning to construct
fast signal processing
implementations,” J. Machine Learning Research,
vol. 3, pp. 887–919,
2002, special issue on the Eighteenth Int’l Conf.
Machine Learning
(ICML 2001).
[14] J. W. Cooley and J. W. Tukey, “An algorithm for
the machine computation