ADAPTIVE ALGORITHMS FOR ADAPTIVE BEAM COMMUNICATION ANTENNAS ARCHITECTURAL STUDY

AN ADAPTIVE ALGORITHM STUDY FOR ARRAY SIGNAL PROCESSORS IS SOUGHT. THE BASIC APPROACH IS TO STUDY THE HARDWARE/SOFTWARE TRADEOFFS OF CONVENTIONAL (VON NEUMANN) AND NON-VON (PARALLEL, PIPELINE, VECTOR, ARRAY, AND CUSTOM PROCESSORS) WITH NONCONVENTIONAL ARITHMETIC (SBNR) IN AN ATTEMPT TO IDENTIFY OPTIMAL ALGORITHMS (OF ORDER AREA X TIME) WHICH ARE COMPUTATIONALLY FAST YET FLEXIBLE. A TWO STEP PROCESS IS ASSUMED; FIRST THE SEQUENTIAL ALGORITHMS ARE TO BE SPEEDED-UP (SEEKING INHERENT PARALLELISM) AND SECOND, FAST ALGORITHMS ARE TO BE MAPPED ONTO NEW VLSI ARCHITECTURES (VIA RECURSION AND PIPELINING). THE PURPOSE OF THIS STUDY IS TO PROVIDE THEORETICAL DESIGN TOOLS AND INTERCONNECTION STRATEGIES CAPABLE OF ACHIEVING REAL-TIME IMPLEMENTATION OF SIGNAL PROCESSING ALGORITHMS VIA LIMITED USER-PROGRAMMABLE MECHANISMS (E.G., FIRMWARE). FLEXIBLE FIRMWARE-ORIENTED ARCHITEC TURES DEDICATED TO SIGNAL PROCESSING CAN THEN BE IDENTIFIED. A SYSTOLIC ARRAY FOR PERFORMING RECURSIVE LEAST-SQUARES MINIMIZATION IS PROPOSED. IT PERFORMS AN ORTHOGONAL TRIANGULARIZATION OF THE DATA MATRIX USING A PIPELINED SEQUENCE OF GIVENS ROTATIONS AND GENERATES THE REQUIRED RESIDUAL WITHOUT HAVING TO SOLVE THE ASSOCIATED TRIANGULAR LINEAR SYSTEM BY BACK-SUBSTITUTION.