Abstract

Digital communication plays a vital role in today’s communication system in this electronic world. However, the applications of digital communication are limited due to the requirements of antenna with fully programmable circuits having modulators and de-modulators. It may also end with hardware complexities. In order to overcome such complexities, a universal modulator is designed with an efficient iterative method named as CORDIC algorithm in prior methods. Although, the CORDIC (Coordinate Rotation Digital Computer) algorithm works efficiently, it leads to computational as well as memory complexities. Additionally it creates a need for latency reduction strategy. Therefore, to compete with all these issues faced with the prior method, we proposed an amended CORDIC algorithm in universal modulator working with the principle of the harmonized Stone–Weierstrass theorem. In addition, the Newton–Raphson method and Remz algorithm are introduced here to reduce the memory complexity by doubling the number of iterations and to select the best carrier signal, respectively. Thus, our proposed work effectively unravels all the notorious issues caused with the conventional CORDIC algorithm and the proposed universal modulator is implemented in Xilinx.

摘要

在这个电子世界中，数字通信在当今的通信系统中起着至关重要的作用。然而，由于天线对具有调制器和解调器的完全可编程电路的要求，因此数字通信的应用受到限制。它也可能以硬件复杂性结束。为了克服这种复杂性，在现有方法中设计了一种通用的调制器，该方法采用一种称为CORDIC算法的有效迭代方法。尽管CORDIC（坐标旋转数字计算机）算法有效地起作用，但是它导致了计算和存储的复杂性。另外，它需要减少延迟的策略。因此，为了与现有方法所面临的所有这些问题竞争，我们根据Stone–Weierstrass定理的统一原理，提出了一种在通用调制器中使用的修正CORDIC算法。另外，这里引入了牛顿-拉夫森方法和Remz算法，分别通过将迭代次数加倍并选择最佳载波信号来降低存储器的复杂性。因此，我们提出的工作有效地解决了由传统的CORDIC算法引起的所有臭名昭著的问题，并且在Xilinx中实现了提出的通用调制器。