• Journal of Advanced Navigation Technology
• /
• v.8 no.2
• /
• pp.184-190
• /
• 2004

A feedforward linear power amplifier (FLPA) has been developed for UHF-band RFID reader applications. The main and error amplifiers are composed of a 2 stage so that linearity of the FLPA can be improved. The FLPA has been implemented on an FR-4 substrate (Er=4.7 and thickness=0.8 mm) with 3-dB and 10-dB hybrid couplers for input/output power divider and combiner. For 2-tone measurement (input level=-11 dBm at $f_1$=915 MHz and $f_2$=916 MHz), the FLPA exhibits a -18.52 dBm of $IMD_3$, which indicates that $IMD_3$ cancellation with feedforward loop is more than 27 dB. From 890 to 960 MHz, 1-dB gain compression output power and power gain of the FLPA are higher than 30 dBm and 40 dB, respectively.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.26 no.3
• /
• pp.227-233
• /
• 2023

In this paper, to substitute the existing TWTA(Travailing Wave Tube Amplifier) component in small radar system, we developed the Ku band SSPA(Solid-State Power Amplifier) based on the fabrication of power MMIC (Monolithic Microwave Integrated Circuit) chips. For the development of the 500 W SSPA, the 40 W-grade power MMIC was designed by ADS(Advanced Design System) at Keysight company with UMS GH015 library, and was processed by UMS foundry service. And 70 W main power modules were achieved the 2-way T-junction combiner method by using the 40 W-grade power MMICs. Finally, the 500 W SSPA was fabricated by the wave guide type power divider between the drive power amplifier and power modules, and power combiner with same type between power modules and output port. The electrical properties of this SSPA had 504 W output power, -58.11 dBc spurious, 1.74 °/us phase variation, and -143 dBm/Hz noise level.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.185-191
• /
• 2022

This paper proposed a division algorithm of performance complexity $O{\frac{n(n+1)}{2}}$ for a change-making problem(CMP) in which polynomial time algorithms are not known as NP-hard problem. CMP seeks to minimize the sum of the x_j number of coins exchanged when a given amount of money C is exchanged for c_j,j=1,2,⋯,n coins. Known polynomial algorithms for CMPs are greedy algorithms(GA), divide-and-conquer (DC), and dynamic programming(DP). The optimal solution can be obtained by DP of O(nC), and in general, when given C>2ⁿ, the performance complexity tends to increase exponentially, so it cannot be called a polynomial algorithm. This paper proposes a simple algorithm that calculates quotient by dividing upper triangular matrices and main diagonal for k×n matrices in which only j columns are placed in descending order of c_j of n for c_j ≤ C and i rows are placed k excluding all the dividers in c_j. The application of the proposed algorithm to 39 benchmarking experimental data of various types showed that the optimal solution could be obtained quickly and accurately with only a calculator.