Synthesis of Linear and Planar Arrays With Minimum Element Selection

Nongpiur, R. C.; Shpak, D.J.

doi:10.1109/tsp.2014.2350966

Cited by 35 publications

(19 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here minimum side lobe attenuation is − ( ) max 20 log M SLL [21], and beam width deviation is the uniform array main lobe beam width minus the optimized array main lobe beam width. A positive value indicates that the main beam width is narrow or a more directed beam, whereas a negative value indicates that the main beam width is wide.…”

Section: Numerical Evaluationmentioning

confidence: 99%

Optimization of Leaky Feeder Slot Spacing for Better Beam Forming in Mines and Tunnels

Hassan¹,

Farjow²,

Fernando³

2016

IJCNS

View full text Add to dashboard Cite

The radiating cable (or leaky feeder) is the leading solution for distributed broadband wireless access in underground mines and tunnels. The traditional radiating cable has equally spaced slots along its axis radiating evenly. However, with the new requirement for tracking and localization of miners, this paper shows how to modify the leaky feeder to function as a beam forming antenna array by appropriately optimizing the slot spacing. Optimizing the leaky feeder slot distances using Genetic algorithm has a good impact on the channel parameters, making it an excellent choice for leaky feeder antennas. Linear, as well as bent practical leaky feeder shapes, were considered, and we tested five different optimization algorithms and compared side lobe energies, varying the slot distance which had an impact on side lobe level. Also, we derived the expression for the BER, spectral efficiency and throughput considering a time-varying wireless channel. We observed that as the radius of curvature of the feeder increased (approaching a straight line), the spectral efficiency decreased as expected. Interestingly different optimization algorithms perform differently at different carrier frequencies. An optimization method should be chosen according to the required goal to be achieved (maintaining uniform equal power along the cable, or a more directed beam, or using a certain frequency of operation).

show abstract

Section: Numerical Evaluationmentioning

confidence: 99%

Optimization of Leaky Feeder Slot Spacing for Better Beam Forming in Mines and Tunnels

Hassan¹,

Farjow²,

Fernando³

2016

IJCNS

View full text Add to dashboard Cite

show abstract

“…In addition to the advantages provided by a low-cost analog beamforming architecture employing LSAAs, the problem of antenna selection (AS) becomes important to reduce the power consumption and hardware complexity. Several works study the problem of AS in different applications [12][13][14][15][16]. The problem of designing nonuniformly spaced arrays is considered in [12] where the cost function is chosen to select the array with a minimum number of antenna elements.…”

Section: Introductionmentioning

confidence: 99%

Analog Beamforming With Antenna Selection For Large-Scale Antenna Arrays

Arora

Tsinos

et al. 2021

ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

View full text Add to dashboard Cite

In large-scale antenna array (LSAA) wireless communication systems employing analog beamforming architectures, the placement or selection of a subset of antennas can significantly reduce the power consumption and hardware complexity. In this work, we propose a joint design of analog beamforming with antenna selection (AS) or antenna placement (AP) for an analog beamforming system. We approach this problem from a beampattern matching perspective and formulate a sparse unit-modulus least-squares (SULS) problem, which is a nonconvex problem due to the unit-modulus and the sparsity constraints. To that end, we propose an efficient and scalable algorithm based on the majorization-minimization (MM) framework for solving the SULS problem. We show that the sequence of iterates generated by the algorithm converges to a stationary point of the problem. Numerical results demonstrate that the proposed joint design of analog beamforming with AS outperforms conventional array architectures with fixed inter-antenna element spacing.

show abstract

“…The synthesis of reconfigurable sparse arrays using multiple measurement vectors focal underdetermined system solver (M-FOCUSS) was recently introduced in [16]. The iterative reweighted ℓ 1 -norm minimisation technique was used in [17] to synthesise linear and planar arrays with predefined beamwidth and sidelobe levels using a minimum number of elements. The same technique was used in [18] to design sparse arrays with frequency-invariant-focused beams.…”

Section: Introductionmentioning

confidence: 99%

Minimising number of perturbed elements in linear and planar adaptive arrays with broad nulls using compressed sensing approach

El‐Khamy

Korany

Abdelhay

2019

IET Microwaves, Antennas & Propagation

View full text Add to dashboard Cite

Here, a new algorithm, based on compressed sensing (CS), is presented for generating broad nulls in linear and planar adaptive antenna arrays through the control of only a small number of elements. In particular, sparse recovery theorem and convex optimisation are used to generate the broad nulls by perturbing the complex weights of a minimum number of elements. The problem is first formulated as a sparse recovery problem and then relaxed to the form of a convex optimisation problem. In addition to the nulling constraints, another constraint is added to ensure that the perturbed elements do not cause a pointing error in the synthesised array pattern. Also, one more constraint is used to set a predefined peak value for the array response in the sidelobe region. The optimisation problem is then solved iteratively using the iterative re‐weighted ℓ1 ‐norm minimisation technique to reduce the number of perturbed array elements to the lowest possible number while satisfying the constraints on the radiation pattern. Simulations were conducted for linear and planar arrays. The results show that the proposed algorithm is capable of forming the required nulls by changing the complex weights of only a small percentage of the array elements.

show abstract

Synthesis of Linear and Planar Arrays With Minimum Element Selection

Cited by 35 publications

References 36 publications

Optimization of Leaky Feeder Slot Spacing for Better Beam Forming in Mines and Tunnels

Optimization of Leaky Feeder Slot Spacing for Better Beam Forming in Mines and Tunnels

Analog Beamforming With Antenna Selection For Large-Scale Antenna Arrays

Minimising number of perturbed elements in linear and planar adaptive arrays with broad nulls using compressed sensing approach

Contact Info

Product

Resources

About