Advances in Smart Antenna Systems for Wireless Communication

Dakulagi, Veerendra; Bakhar, Mohammed

doi:10.1007/s11277-019-06764-6

Cited by 30 publications

(14 citation statements)

References 89 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Figure 1 depicts the misalignments of the cyclic and leading DCD algorithms. A system matrix R is designed with small condition numbers in the interval [2,5]. It is seen that the cyclic DCD algorithm has a slightly slower convergence than the leading DCD algorithm.…”

Section: Numerical Resultsmentioning

confidence: 99%

“…Solving the problems in a wide range of signal processing applications is equivalent to getting the solution of a linear least squares (LS) problem [1]. These applications include adaptive antenna array applications [2], multi-user detection [3], multiple-input multiple-output (MIMO) detection [4], echo cancellation [5], equalization [6], and system identification [1,[7][8][9]. If the channel information is known, zero forcing (ZF) algorithm and minimum mean-square error (MMSE) algorithm are popular to be used in these applications.…”

Section: Introductionmentioning

confidence: 99%

“…Misalignments of the DCD algorithms in the system with small condition numbers in the range of[2,5]; U = 64, M b = 15, Q = 512.…”

mentioning

confidence: 99%

See 2 more Smart Citations

Improved Convergence Speed of a DCD-Based Algorithm for Sparse Solutions

Quan

2020

Algorithms

View full text Add to dashboard Cite

To solve a system of equations that needs few updates, such as sparse systems, the leading dichotomous coordinate descent (DCD) algorithm is better than the cyclic DCD algorithm because of its fast speed of convergence. In the case of sparse systems requiring a large number of updates, the cyclic DCD algorithm converges faster and has a lower error level than the leading DCD algorithm. However, the leading DCD algorithm has a faster convergence speed in the initial updates. In this paper, we propose a combination of leading and cyclic DCD iterations, the leading-cyclic DCD algorithm, to improve the convergence speed of the cyclic DCD algorithm. The proposed algorithm involves two steps. First, by properly selecting the number of updates of the solution vector used in the leading DCD algorithm, a solution is obtained from the leading DCD algorithm. Second, taking the output of the leading DCD algorithm as the initial values, an improved soft output is generated by the cyclic DCD algorithm with a large number of iterations. Numerical results demonstrate that when the solution sparsity γ is in the interval [ 1 / 8 , 6 / 8 ] , the proposed leading-cyclic DCD algorithm outperforms both the existing cyclic and leading DCD algorithms for all iterations.

show abstract

Section: Numerical Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Improved Convergence Speed of a DCD-Based Algorithm for Sparse Solutions

Quan

2020

Algorithms

View full text Add to dashboard Cite

show abstract

“…The LA has excellent direct and narrowest main beam lobe in a wanted direction, but in all azimuthal directions it does not work equally well, a major drawback of the PA is the question of presence on the opposite side of an additional large lobe of the same strength [6] the symmetry of the CA structure provides an obvious benefit since, it has no edge components, without a major change in the beamform, directional patterns synthesized with a CA can be rotated electronically in the array plane [7]. Many algorithms have been introduced to applicants on SA [8,9], one of the most public algorithms is least mean square (LMS) A commonly employed algorithm due to its low computational complexity and ease of implementation [10]. Other less square algorithms, such as recursive least squares (RLS), conjugate gradient (CG), will converge more easily and have a lower stable mean square error (MSE) than LMS [11].…”

Section: Introductionmentioning

confidence: 99%

Rabid Euclidean direction search algorithm for various adaptive array geometries

2021

View full text Add to dashboard Cite

One of the exciting technologies used to meet the increasing demand for wireless communication services is a smart antenna. A smart antenna is basically confirmed by an array of antennas and a digital beamformer unit through which cellular base station can direct the beam toward the desired user and set nulls toward interfering users. In this paper, different array configurations (linear, circular, and planer) with the REDS algorithm are implemented in the digital beam-forming unit. The wireless system performance is investigated to check the smart antenna potentials assuming Rayleigh fading channel environment beside the AWGN channel. Results show how the REDS algorithm offers a significant improvement through antenna radiation pattern optimization, sidelobe level, and interference reduction, and also the RDES algorithm proves fast convergence with minimum MSE and better sidelobe level reduction comparing with other algorithms.

show abstract

“…Consequently, it is necessary to keep up with the latest technologies that provide the system with higher capacity and data rate. Subsequently, the invention of smart antenna techniques is the solution for such needs [3], [4].…”

Section: Introductionmentioning

confidence: 99%

Comparative and analysis of evaluation of several direction of arrival estimation methods

2021

View full text Add to dashboard Cite

Modern-day, global, and clever array systems have several distinguished approaches with regard to a wireless device. In this paper, a comparative analysis has been carried out amongst nine direction of arrival (DOA) algorithms: Capon, multiple signal classification (MUSIC), Bartlett, Pisarenko, linear prediction, maximum entropies, and min-norm, root-MUSIC, and estimation of signal parameters via rotational invariance technique (ESPRIT). in this paper reduces the number of antennas and snaps necessary to observe six target swithout interference for several DOA estimation methods. After comparing and analyzing all the algorithms, it has been shown that the music algorithm is the best algorithm that reduces interference and detects the desired sources. MATLAB R2019b was used in the simulation process.

show abstract

Advances in Smart Antenna Systems for Wireless Communication

Cited by 30 publications

References 89 publications

Improved Convergence Speed of a DCD-Based Algorithm for Sparse Solutions

Improved Convergence Speed of a DCD-Based Algorithm for Sparse Solutions

Rabid Euclidean direction search algorithm for various adaptive array geometries

Comparative and analysis of evaluation of several direction of arrival estimation methods

Contact Info

Product

Resources

About