Synthesis of unequally spaced arrays using dynamic programming

Arora, Rishabh; Krisnamacharyulu, N.

doi:10.1109/tap.1968.1139250

Cited by 32 publications

(11 citation statements)

References 4 publications

(2 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…is a combinatorial optimization problem and has been studied extensively in the past [25][26][27][28][29][30][31][32][33]. The effect of thinning on the array gain and main lobe width is predictable.…”

Section: Thinned Array Pattern Synthesismentioning

confidence: 99%

“…For an array N -element array, the number of subsets with exactly an exhaustive search over the entire space to find arrays with good sidelobe behavior is impractical. Therefore, heuristic optimization techniques based on simulated annealing, genetic algorithms and its variants have been proposed to find near-optimal solutions to the array thinning problem [25][26][27][28][29][30][31][32][33]. Since simulated annealing based methods have been reported [34] achieve best array performance compared to other techniques, we will use it to develop an efficient optimization algorithm for antenna subset selection.…”

Section: Thinned Array Pattern Synthesismentioning

confidence: 99%

See 1 more Smart Citation

Antenna Subset Modulation for secure millimeter-wave wireless communication

Valliappan

Heath

Lozano

2013

2013 IEEE Globecom Workshops (GC Wkshps)

View full text Add to dashboard Cite

The small carrier wavelength at millimeter-wave (mm-Wave) frequencies allows the possibility of implementing a large number of antennas on a single chip. This work uses the potential of large antenna arrays at these frequencies to develop a low-complexity directional modulation technique: Antenna Subset Modulation (ASM) for point-to-point secure wireless communication. The main idea in ASM is to communicate information by modulating the far-field radiation pattern of the array at the symbol rate. By driving only a subset of antennas and changing the subset used for each symbol transmission the far-field pattern is modulated. Two techniques for implementing antenna subset selection are proposed. The first technique is simple where the antenna subset to be used is selected at random for every symbol transmission. While randomly switching antenna subsets does not affect the symbol modulation for a desired receiver along the main lobe direction, it effectively randomizes the amplitude and phase of the received symbol for an eavesdropper along a sidelobe. Using a simplified statistical model for random antenna v subset selection, an expression for the average symbol error rate (SER) is derived as a function of observation angle for linear arrays. To overcome the problem of large peak sidelobe level in random antenna subset switching, an optimized antenna subset selection procedure based on simulated annealing is then discussed. Finally, numerical results comparing the average SER performance of the proposed techniques against conventional array transmission are presented. While both methods produce a narrower information beam-width in the desired direction, the optimized antenna subset selection technique is shown to offer better security and array performance.vi

show abstract

Section: Thinned Array Pattern Synthesismentioning

confidence: 99%

Section: Thinned Array Pattern Synthesismentioning

confidence: 99%

Antenna Subset Modulation for secure millimeter-wave wireless communication

Valliappan

Heath

Lozano

2013

2013 IEEE Globecom Workshops (GC Wkshps)

View full text Add to dashboard Cite

show abstract

“…The number of array elements is chosen as 25 so that it is the same as [6][7][8][9]. The positions of starting and ending elements are fixed as d 1 = 0 and d 2N−1 = 50 , respectively.…”

Section: Numerical Examplesmentioning

confidence: 99%

“…In general, the antenna array design includes beamwidth, sidelobe level (SLL), directivity, etc. The SLL reduction is most useful for array pattern synthesis design via adjusting the positions, weights and phases [1][2][3][4][5][6][7][8][9]. In this paper, the element positions and their weights are adjusted for array pattern optimization to achieve maximal SLL reduction.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Array pattern optimization using electromagnetism-like algorithm

Jhang

Lee

2009

AEU - International Journal of Electronics and Communications

View full text Add to dashboard Cite

Sparse Sampling in Array Processing

Holm

Austeng

Iranpour

et al. 2001

Nonuniform Sampling

View full text Add to dashboard Cite

Sparsely sampled irregular arrays and random arrays have been used or proposed in several fields such as radar, sonar, ultrasound imaging, and seismics. We start with an introduction to array processing and then consider the combinatorial problem of finding the best layout of elements in sparse 1-D and 2-D arrays. The optimization criteria are then reviewed: creation of beampatterns with low mainlobe width and low sidelobes, or as uniform as possible coarray. The latter case is shown here to be nearly equivalent to finding a beampattern with minimal peak sidelobes.We have applied several optimization methods to the layout problem, including linear programming, genetic algorithms and simulated annealing. The examples given here are both for 1-D and 2-D arrays. The largest problem considered is the selection of K = 500 elements in an aperture of 50 by 50 elements. Based on these examples we propose that an estimate of the achievable peak level in an algorithmically optimized array is inverse proportional to K and is close to the estimate of the average level in a random array.Active array systems use both a transmitter and receiver aperture and they need not necessarily be the same. This gives additional freedom in design of the thinning patterns, and favorable solutions can be found by using periodic patterns with different periodicity for the two apertures, or a periodic pattern in combination with an algorithmically optimized pattern with the condition that there be no overlap between transmitter and receiver elements. With the methods given here one has the freedom to choose a design method for a sparse array system using either the same elements for the receiver and the transmitter, no overlap between the receiver and transmitter or partial overlap as in periodic arrays.

show abstract

Synthesis of unequally spaced arrays using dynamic programming

Cited by 32 publications

References 4 publications

Antenna Subset Modulation for secure millimeter-wave wireless communication

Antenna Subset Modulation for secure millimeter-wave wireless communication

Array pattern optimization using electromagnetism-like algorithm

Sparse Sampling in Array Processing

Contact Info

Product

Resources

About