Results 181 to 190 of about 16,511 (214)
The Optimization of the Bandpass Lengths in the Multi-Bandpass Problem
The Bandpass problem has applications to provide a cost reduction in design and operating telecommunication network. Given a binary matrix Am × n and a positive integer B called the Bandpass length, a set of B consecutive non-zero elements in any column is called a Bandpass. No two bandpasses in the same column can have common rows.
Mehmet Kurt +3 more
core +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Guohui Lin, Lin Guohui
exaly +4 more sources
Scatter search for the bandpass problem
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jesus Sánchez-Oro +2 more
exaly +3 more sources
An Improved Approximation Algorithm for the Bandpass-2 Problem
The bandpass-2 problem (Bandpass-2, for short) is a generalization of the maximum traveling salesman problem (Max TSP, for short). Of particular interest is the difference between the two problems, where the edge weights in Bandpass-2 are dynamic rather than given at the front. A trivial approximation algorithm for Bandpass-2 can achieve a ratio of 0.5.
Zhi-Zhong Chen +2 more
exaly +3 more sources
An Improved Approximation Algorithm for the Bandpass Problem
The general Bandpass-B problem is NP-hard and can be approximated by a reduction into the B -set packing problem, with a worst case performance ratio of O (B 2). When B =2, a maximum weight matching gives a 2-approximation to the problem. The Bandpass-2 problem, or simply the Bandpass problem, can be viewed as a variation of the maximum traveling ...
Weitian Tong, Randy Goebel, Wei Ding
exaly +3 more sources
Summary Continuous parameter genetic algorithm (CPGA) is applied tosynthesis of monolithic GaAs FET bandpass distributed amplifiers for desired flat gain and maximum cutoff bandwidth. The results obtained by CPGA are compared with the results obtained by fuzzy genetic algorithm (FGA) and binary genetic algorithm (BGA).
Tayfun Gunel, Mustafa Emre Aydemir
exaly +3 more sources
ON THE COMPLEXITY OF THE BANDPASS PROBLEM
In this paper, we prove that the Bandpass Problem is NP-hard by restriction from the Bandpass Problem to the Satisfiability Problem. Furthermore, we define the 1-Bandpass De-cision Problem, and show that there is a one-to-one correspondence between the k-Satisfiability Decision Problem and the 1-Bandpass Decision Problem.
Kurt, Mehmet +3 more
openalex +2 more sources
Fully integrated bandpass filters for wireless transceivers-problems and promises
Despite decades of research into developing true, single-chip radio transceivers, most commercial designs continue to rely on off-chip components for bandpass filtering. Implementing these filters on-chip remains nearly as challenging today as it was 10 years ago, due to the demanding system requirements of modern radio standards, and few technologies ...
W.B. Kuhn
openalex +2 more sources
The problem of the reversed aliasing of sampled bandpass signals
Studies the spectral reversed aliasing of sampled bandpass signals and the sampling frequencies that will cause this to happen in the frequency domain. The method of making use of the spectral aliasing in Fourier spectral analysis is introduced and, specifically, a computer simulation has proved these studies to be true. >
Youfang Huang
openalex +2 more sources
The complex-envelope representation of bandpass-limited signals is used to formulate a bandpass-limited vector wave equation and a new finite-difference time-domain (FDTD) scheme that solves the bandpass-limited vector wave equation is presented. For narrow-band electromagnetic systems, this new method allows the time step to be several orders of ...
J.D. Pursel, Paul M. Goggans
openalex +2 more sources

