2007
DOI: 10.1049/iet-map:20060186
|View full text |Cite
|
Sign up to set email alerts
|

Non-uniform sampling and polynomial interpolation for array synthesis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2008
2008
2009
2009

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(6 citation statements)
references
References 4 publications
0
6
0
Order By: Relevance
“…To reduce the error below 0.01 dB six iterations for the algorithm were considered. Represented by a dash and a dot line is the result for the approximated real array factor calculated by the method presented in [10]. It was necessary six iterations to produce an error below the referred one.…”
Section: Resultsmentioning
confidence: 99%
See 4 more Smart Citations
“…To reduce the error below 0.01 dB six iterations for the algorithm were considered. Represented by a dash and a dot line is the result for the approximated real array factor calculated by the method presented in [10]. It was necessary six iterations to produce an error below the referred one.…”
Section: Resultsmentioning
confidence: 99%
“…The sidelobe peaks are the desired points to control the array factor in the sidelobe zone. To determine the peak positions it can be used the procedure developed in [10]. For this, considering that x k is a root of G(x), the corresponding values on the β z variable are β zk = ln(x k )/(jd).…”
Section: Synthesis Methodsmentioning
confidence: 99%
See 3 more Smart Citations