Design of conformal antenna for aircraft application

Laxminarayen N V; Lokeshwaran G; Murugan K S; Jothilakshmi P

Home/Archive/arXiv

arXiv · 2207.07310

Design of conformal antenna for aircraft application

Laxminarayen N V·Lokeshwaran G·Murugan K S·Jothilakshmi P

View original source ↗Read source document ↗Export metadata ↓

Abstract

The most challenging thing in the real world is communicating with aircraft, even though several communication technologies have been adopted for tracking and monitoring the aircraft there is no cent per cent efficiency, for the implementation of a conformal antenna for transmission and reception of the signal is preferred. In radio communication and avionics, a conformal antenna or conformal array is a flat radio antenna which is designed to conform to or follow some prescribed shape, for example, a curved conformal antenna is designed and is mounted on or embedded in a curved surface. The conformal antenna is a collection of a large number of smaller antennas (PAA) each one is connected to a phase shifter. The phased array antenna will have high directivity in the desired application. Conformal arrays are typically limited to high frequencies in the UHF or microwave range, where the wavelength of the waves is small enough that small antennas can be used. The main objective of this project is to embed this conformal antenna on the surface of the aircraft with increased gain. To implement the above-mentioned problem we are using CST microwave software. Conventional methods now used in aircraft are done by using the conformal antenna to save space and even military applications to be anonymous. The antenna stands to be an interface between the transmitter and the receiver. By working on the software and hardware features of antennas we can develop an antenna with better gain. By adopting better gain, the antenna will be more efficient. Thus by implementing this conformal antenna on the aircraft surface with an increased gain high degree of accuracy, clarity and effective communication link can be achieved.

Explore related subjects

eess.SY cs.SY

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Laxminarayen N V, Lokeshwaran G, Murugan K S, Jothilakshmi P. 2022-07-27. Design of conformal antenna for aircraft application. https://arxiv.org/abs/2207.07310

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Failure-Aware Iterative Learning of State-Control Invariant Sets

In this paper, we address the problem of computing maximal state-control invariant sets for deterministic linear systems using failing trajectories. We introduce the concept of state-control invariance, which extends control invariance from the state space to the joint state-control space. The maximal state-control invariant (MSCI) set simultaneously encodes the maximal control invariant set (MCI) and, for each state in the MCI, the set of control inputs that preserve invariance. We prove that the state projection of the MSCI is the MCI and the state-dependent sections of the MSCI are the admissible invariance-preserving inputs. Building on this framework, we develop a Failure-Aware Iterative Learning (FAIL) algorithm for deterministic linear time-invariant systems with polytopic constraints. The algorithm iteratively updates a constraint set in the state-control space by learning predecessor halfspaces from one-step failing state-input pairs, without knowing the dynamics. For each failure, FAIL learns the violated halfspaces of the predecessor of the constraint set by a regression on failing trajectories. We prove that the learned constraint set converges monotonically to the MSCI. Numerical experiments on a double integrator system validate the proposed approach.

eess.SY↗

arXiv2026

Consensus and Synchronization of Multi-agent Systems over Finite Fields - Graph Topologies

This paper presents cooperative protocols for multi-agent systems with agents having a finite state-space. Both scalar single-integrator consensus and general LTI system synchronization are considered. Systems having a finite state-space describe agents with minimal memory capacity processing only a finite alphabet. Such systems are remarkably resilient to communication noise. The crucial problem, however, is to construct the admissible communication topology, which is NP-hard. We address this by efficiently exploring the subsets of admissible graph matrices and propose two new algorithms to generate them. Simulations validate the proposed approach.

eess.SY↗

arXiv2026

Extracting Exact Lie Derivatives Without Backpropagation: A Dual Compiler for Neural Control Barrier Functions

A safety filter based on a neural control barrier function (CBF) deployed in an embedded control loop evaluates, at each control cycle, the trained network and its Lie derivatives along the system vector fields, under the memory and worst-case execution time (WCET) constraints that safety-oriented coding standards impose. Reverse-mode automatic differentiation, by which training frameworks obtain these derivatives, retains an activation cache whose size grows with the sum of the layer widths, and general-purpose differentiation runtimes allocate the computational graph from the heap at each call. This paper presents a compiler that evaluates a neural CBF and its exact Lie derivatives by forward-mode dual-number arithmetic. The compiler emits self-contained C++ code in which a single forward pass, without backpropagation, returns the barrier value and its exact Lie derivative along a given vector field; the drift and input Lie derivatives of the safety constraint are obtained from one such pass per vector field, and a second-order extension based on hyper-dual numbers returns the exact second-order Lie derivatives required by CBFs of relative degree two. The dual forward pass requires a workspace bounded by four times the widest layer, independent of network depth, and the emitted code contains no allocation call sites, so the absence of dynamic allocation is verifiable by inspection of the code. On an ESP32-S3 microcontroller, the compiled filter assembles the complete safety constraint in under one millisecond from statically allocated buffers of at most 768 bytes, and the maximum execution time over 1000 evaluations lies within 5% of the median in all three examples, whereas a heap-allocating reverse-mode baseline shows maxima 33% and 70% above its median in the two first-order examples. The compiler and the embedded experiments are released as open-source software.

eess.SY↗