• No results found

reduction in computational complexity

Computational Complexity Reduction of OFDM Signals by PTS with Alternate Optimised Grouping Phase Weighting Method

Computational Complexity Reduction of OFDM Signals by PTS with Alternate Optimised Grouping Phase Weighting Method

... In order to reduce the computational complexity compared to O-PTS, GPW has been proposed in [34]. It offers same PAPR reduction performance with respect to O-PTS. In GPW, all the subblocks are split ...

7

A Novel Low Computational Complexity Multiple Signal Representation Technique for PAPR Reduction in OFDM Systems

A Novel Low Computational Complexity Multiple Signal Representation Technique for PAPR Reduction in OFDM Systems

... in complexity in terms of complex ...that computational complexity is significantly reduced with the help of this proposed novel ...PAPR reduction capability remains similar but at reduced ...

9

Addressing Computational Complexity of Electromagnetic Systems Using Parameterized Model Order Reduction

Addressing Computational Complexity of Electromagnetic Systems Using Parameterized Model Order Reduction

... where ] M s = [ M 00 s , M 10 s , K , M n0 s contains the series coefficients corresponding to powers of ( s − s 0 ) i , M h = [ M 01 h , M 02 h , K , M 0m h ] contains the series coefficients corresponding to powers of ...

114

Addressing Computational Complexity of High Speed Distributed Circuits Using Model Order Reduction

Addressing Computational Complexity of High Speed Distributed Circuits Using Model Order Reduction

... addressing complexity of nonlinear distributed interconnect networks [19]- ...order reduction algorithm will be developed to efficiently link nonlinear elements to the reduced order system without having to ...

143

The Computational Complexity of Linear Optics

The Computational Complexity of Linear Optics

... a reduction that estimates the phase Per(X) / | Per (X )| of a permanent Per(X ) given only the ability to estimate |Per (X )| (for most Gaussian matrices X ...our reduction proceeds by induction on n: we ...

110

A low computational complexity normalized subband adaptive filter algorithm employing signed regressor of input signal

A low computational complexity normalized subband adaptive filter algorithm employing signed regressor of input signal

... There are some classes of adaptive filter algorithms that make use of the signum of either the error signal or the input signal, or both. These approaches have been applied to the LMS algorithm for the simplicity of im- ...

23

Radial Basis Function Assisted Turbo Equalization

Radial Basis Function Assisted Turbo Equalization

... Structural, computational complexity, and perfor- mance comparisons of the RBF-based and trellis-based TEQs are ...lower computational complexity, ...the computational complexity ...

12

PAPR Reduction of ODFM by using Shifting Null Subcarriers Among Data Subcarrier &Partial Transmit Sequence

PAPR Reduction of ODFM by using Shifting Null Subcarriers Among Data Subcarrier &Partial Transmit Sequence

... PAPR reduction at the expense of increase in transmitting signal power, increase in data rate loss, increase in computational complexity, distortion and channel side information ...

5

Review of SLM and Modified SLM Scheme for PAPR Reduction in OFDM System

Review of SLM and Modified SLM Scheme for PAPR Reduction in OFDM System

... PAPR reduction in the conventional SLM scheme, it is necessary to generate a sufficiently large number of alternative OFDM signal sequences that causes high computational complexity because IFFT ...

7

The computational complexity of approximation of partition functions

The computational complexity of approximation of partition functions

... Bubley and Dyer studied #SFO and gave an FPRAS [15]. They showed as a corol- lary that there is an FPRAS for counting solutions to a formula in conjunctive normal form in which every variable appears at most twice, which ...

225

Low Complex PAPR Reduction Schemes for OFDM Systems

Low Complex PAPR Reduction Schemes for OFDM Systems

... PAPR reduction schemes; however, the thesis mainly focus on the selective mapping] (SLM) scheme, which has efficient PAPR ...the computational complexity of the SLM scheme while keeping a ...

118

 THE MIXTURE MODEL: COMBINING LEAST SQUARE METHOD AND DENSITY BASED CLASS 
BOOST ALGORITHM IN PRODUCING MISSING DATA AND BETTER MODELS

 THE MIXTURE MODEL: COMBINING LEAST SQUARE METHOD AND DENSITY BASED CLASS BOOST ALGORITHM IN PRODUCING MISSING DATA AND BETTER MODELS

... Lattice Reduction mainly deals with finding improved representations of a given lattice using algorithms like Lenstra, Lenstra, Lovász (LLL) ...lattice reduction turned out to be extremely useful for ...

6

Low Delay Noise Reduction and Dereverberation for Hearing Aids

Low Delay Noise Reduction and Dereverberation for Hearing Aids

... while algorithms based on a time-averaging [13] exhibit a high signal delay. Coherence-based speech enhancement algorithms such as [14] or [15] can suppress background noise and reverberation, but they are rather ...

9

HYBRID TECHNIQUE FOR PAPR REDUCTION IN OFDM USING PARTIAL TRANSMIT SEQUENCES

HYBRID TECHNIQUE FOR PAPR REDUCTION IN OFDM USING PARTIAL TRANSMIT SEQUENCES

... Abstract: This Orthogonal frequency division multiplexing (OFDM) is a robust and effective multicarrier transmission technique for high speed communication in wireless mobile environment and applications. A major ...

8

Computing the Moore Penrose Inverse of a Matrix Through Symmetric Rank One Updates

Computing the Moore Penrose Inverse of a Matrix Through Symmetric Rank One Updates

... low computational complexity. The details of its computational complexity will be in- cluded in the ...its computational com- plexity, a variant is also ...

5

PLANT GROWTH MODELING OF ZINNIA ELEGANS JACQ USING FUZZY MAMDANI AND L SYSTEM 
APPROACH WITH MATHEMATICA

PLANT GROWTH MODELING OF ZINNIA ELEGANS JACQ USING FUZZY MAMDANI AND L SYSTEM APPROACH WITH MATHEMATICA

... The procedure used for the evaluation of service time distribution is based on the universal generating function (u-function) technique, which was introduced in [10] and which proved to be very effective for the ...

9

Computational Complexity of Weighted Threshold Games

Computational Complexity of Weighted Threshold Games

... In this paper we consider the computational complexity of solution concepts for weighted threshold games. A weighted threshold game is one in which each player is given a nu- meric weight, and a coalition ...

6

The Computational Complexity of Untrapped Choice Procedures

The Computational Complexity of Untrapped Choice Procedures

... [14] Aziz, H., Brandt, F., Elkind, E. and Skowron, P. Computational Social Choice: The First Ten Years and Beyond. In: Steffen, B. and Woeginger, G., Eds., Computing and Software Science , Vol. 10000 of Lecture ...

10

Epistemic virtues, metavirtues, and computational complexity

Epistemic virtues, metavirtues, and computational complexity

... of complexity theory that are so general that it is hard to see how they could fail to apply to any cognitive process of any finite ...of complexity, then more complex but perfectly un-mysterious processes ...

40

Complexity Computational Environments (CCE) Architecture

Complexity Computational Environments (CCE) Architecture

... for computational steering, a richer interactive environment, and three-dimensional GIS-like objects and ...results. Computational steering requires the ability to subset large data sets, interactively pan ...

32

Show all 10000 documents...

Related subjects