2012 International Conference on Advances in Mobile Network, Communication and Its Applications 2012
DOI: 10.1109/mncapps.2012.7
|View full text |Cite
|
Sign up to set email alerts
|

A Novelistic Approach for Rapid Beam Forming in Smart Antennas for Wireless Applications Using Smart-Fractal Concepts and New Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2012
2012
2012
2012

Publication Types

Select...
2

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 7 publications
0
3
0
Order By: Relevance
“…While the advantages of fractal concepts over the development of rapid beamforming algorithms in smart antennas [15,16], the concept can now be extended to another new algorithm technique called "Assignment of Usage Time and Location Tag Algorithm." Let us consider the same case of four users.…”
Section: Assignment Of Usage Time and Location Tag Algorithmmentioning
confidence: 99%
“…While the advantages of fractal concepts over the development of rapid beamforming algorithms in smart antennas [15,16], the concept can now be extended to another new algorithm technique called "Assignment of Usage Time and Location Tag Algorithm." Let us consider the same case of four users.…”
Section: Assignment Of Usage Time and Location Tag Algorithmmentioning
confidence: 99%
“…Details of antenna design techniques are discussed in [33], and particularly about printed antenna design in [34]. The application of these algorithms for rapid beam forming in smart antennas is discussed in [35,36]. Table 1 shows the increase in speed factor as the values of P and δ varies.…”
Section: Graphical Analysis Of Array-factor and Directivity Of Fractamentioning
confidence: 99%
“…For example, with for P = 4 & δ = 7 the fractal array factor is 300 times faster to calculate than the conventional case. This property can be utilized in smart antennas to produce rabid beam forming algorithms [35,36].…”
Section: Graphical Analysis Of Array-factor and Directivity Of Fractamentioning
confidence: 99%