# Computational Efficiency

View this topic in

# 12,378 resources related to Computational Efficiency

### IEEE Organizations related to Computational Efficiency

No organizations are currently tagged "Computational Efficiency"

### Conferences related to Computational Efficiency

2020 IEEE International Symposium on Antennas and Propagation and North American Radio Science Meeting

The joint meeting is intended to provide an international forum for the exchange of information on state of the art research in the area of antennas and propagation, electromagnetic engineering and radio science

2020 IEEE Radio and Wireless Symposium (RWS)

RWW2020 will be an international conference covering all aspects of radio and wireless. RWW2020's multidisciplinary events will bring together innovations that are happening across the broad wireless spectrum. RWS2020, this conference application, acts as the main conference for the entire RWW of events that includes the following conferences: PAWR2020, SiRF2020, WiSNet2020, and TWiOS2020 (IEEE Topical Conference on RF/microwave Power Amplifiers, IEEE Topical Meeting on Silicon Monolithic Integrated Circuits in RF Systems, IEEE Topical Conference on Wireless Sensors and Sensor Networks, and IEEE Topical Workshop on the Internet of Space IoS, respectively). In addition to traditional podium presentations and poster sessions, tracks for IEEE Distinguished Lectures, Sunday half-day workshops, Monday panels, and a demo session are planned. A RWW2020 plenary talk are a parallel IoT Summit are planned. A student competition is also planned.

ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

The ICASSP meeting is the world's largest and most comprehensive technical conference focused on signal processing and its applications. The conference will feature world-class speakers, tutorials, exhibits, and over 50 lecture and poster sessions.

IGARSS 2020 - 2020 IEEE International Geoscience and Remote Sensing Symposium

All fields of satellite, airborne and ground remote sensing.

### Periodicals related to Computational Efficiency

No periodicals are currently tagged "Computational Efficiency"

### Xplore Articles related to Computational Efficiency

1996 8th European Signal Processing Conference (EUSIPCO 1996), 1996

The document that should appear here is not currently available.

The possibility of reducing the sampling point density in the numerical evaluation of radiation integrals is discussed by resorting to asymptotic high-frequency technique concepts. It is shown that the numerical evaluation of the radiation integrals becomes computationally more efficient by introducing an adaptive sampling. Using this approach, the number of sampling points is found to be drastically smaller than that ...

1996 8th European Signal Processing Conference (EUSIPCO 1996), 1996

A realization of the Modified DFT (MDFT) filter bank introduced in [1, 2, 3] was proposed in [4]. The analysis and synthesis filter bank consist each of two DFT polyphase filter banks, one without delay and one delayed by M/2 samples where M represents the number of channels of the MDFT filter bank. In this paper, we will show that ...

17th European Wireless 2011 - Sustainable Wireless Technologies, 2011

A pilot-based spectrum sensing approach in the presence of unknown timing and frequency offset is proposed in this paper. Our major idea is to utilize the second order statistics of the received samples, such as autocorrelation, to avoid the frequency offset problem. Base on the property of the pilot symbols, where the different symbol blocks usually have the same pilot ...

Proceedings of the IEEE 2013 Custom Integrated Circuits Conference, 2013

The continued trend toward increased silicon integration in recent years has enabled large, complex SoC systems encompassing an ever-expanding range of capabilities. Maintaining energy-efficient operation continues to be at the heart of high-performance and low-power mobile applications alike, highlighting the crucial role of low-power design methodologies and techniques.

### Educational Resources on Computational Efficiency

#### IEEE-USA E-Books

• The document that should appear here is not currently available.

• The possibility of reducing the sampling point density in the numerical evaluation of radiation integrals is discussed by resorting to asymptotic high-frequency technique concepts. It is shown that the numerical evaluation of the radiation integrals becomes computationally more efficient by introducing an adaptive sampling. Using this approach, the number of sampling points is found to be drastically smaller than that resulting from a standard Nyquist sampling rate.

• A realization of the Modified DFT (MDFT) filter bank introduced in [1, 2, 3] was proposed in [4]. The analysis and synthesis filter bank consist each of two DFT polyphase filter banks, one without delay and one delayed by M/2 samples where M represents the number of channels of the MDFT filter bank. In this paper, we will show that the two DFTs can be reduced to a single one for prototypes of the lengths N = r · M + 1 and N = r · M + M/2 +1, respectively, by doing some simple combinations with the input signals. Hereby the modulation cost is nearly halved.

• A pilot-based spectrum sensing approach in the presence of unknown timing and frequency offset is proposed in this paper. Our major idea is to utilize the second order statistics of the received samples, such as autocorrelation, to avoid the frequency offset problem. Base on the property of the pilot symbols, where the different symbol blocks usually have the same pilot symbols, some nonzero terms will appear in the frequency domain. To test the proposed approach, computer simulations are carried out for the typical Orthogonal frequency-division multiplexing (OFDM) system. It is observed that the proposed approach always outperforms the classic time domain Neyman-Pearson approach at least 4dB. Moreover, the proposed approach get the same performance as the weighted linear combination based approach when the transmitted data block size is equal to 2048, while a small computational cost is keep at the same time. Therefore, it can be said that the proposed approach can achieve a good trade-off between reliability, latency and the computational cost, when the transmitted data block size of the primary system is larger than 1000.

• The continued trend toward increased silicon integration in recent years has enabled large, complex SoC systems encompassing an ever-expanding range of capabilities. Maintaining energy-efficient operation continues to be at the heart of high-performance and low-power mobile applications alike, highlighting the crucial role of low-power design methodologies and techniques.

• The main factors affecting the overall efficiency of any numerical procedure for the solution of large antenna or scattering problems, that is, the problem size, the memory occupation, and the computational cost, are introduced and are briefly discussed. It is shown how the size can be rigorously defined and estimated and the corresponding minimum, ideal computational cost is determined. Then the problem of developing algorithms approaching the ideal limit is examined, and possible ways to achieve the goal are enumerated. In particular, it is shown that in the case of large metallic scatterers in free space, the method of auxiliary sources, coupled to some kind of multilevel fast multipole algorithm, can allow development of numerical procedures whose effectiveness approaches the ideal limit.

• Basic theory of matrix equilibration is presented, relating it to other techniques for decreasing the condition number of matrix equations obtained by the method of moments (MOM) applied to surface integral equations (SIEs). It is shown that matrix equilibration is a general technique that can be used for both (1) balancing field and source quantities in SIEs, which is used to decrease the condition number in the case of SIEs of mixed type and high contrast in material properties, and (2) scaling basis and test functions in MOM, which is used to decrease the condition number in the case of higher- order bases and patches of different sizes. In particular, it is demonstrated that a combination of such balancing and scaling can be performed using simple matrix equilibration based on magnitudes of diagonal elements and 2-norms of rows/columns of the MOM matrix.

• An efficient x-recursive numerical scheme is presented to compute Legendre polynomials Pn(x) and their derivatives P'n(x) on the interval (0, 1) for a fixed-order $n\in\mathbb{N}$. The numerical properties are discussed and, as an example of use in computational electromagnetics, the method is applied to improve a recently proposed spherical-multipole based time domain near-to-far- field transformation algorithm.

• The computational method of conjugate gradients for linear operator equations is given. This technique is applied to the solution of the integral equation that relates the aperture distribution and the far-field pattern. This problem is treated from the variational setting by minimizing an error functional. In searching for the solution, a sequence of expanding subspaces in a function space is generated via the Frechet differential of the error functional. The error functional is minimized in each of the subspaces and thus forms a sequence of approximating solutions. This iterative procedure may be conveniently implemented on a computer. Two synthesis problems are treated using this technique, and the results are discussed.

• In this paper, a new algorithm for the fast and precise computation of Green's function for the 2-D Poisson equation in rectangular waveguides is presented. For this purpose, Green's function is written in terms of Jacobian elliptic functions involving complex arguments. A new algorithm for the fast and accurate evaluation of such Green's function is detailed. The main benefit of this algorithm is successfully shown within the frame of the Boundary Integral Resonant Mode Expansion method, where a substantial reduction of the computational effort related to the evaluation of the cited Green's function is obtained.