SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "L773:9789531841160 "

Sökning: L773:9789531841160

  • Resultat 1-6 av 6
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Eghbali, Amir, et al. (författare)
  • Flexible frequency-band reallocation MIMO networks for real signals
  • 2007
  • Ingår i: Proc. Int. Symp. Image, Signal Processing, Analysis, Istanbul, Turkey, Sept. 27-29, 2007. - : IEEE. - 9789531841160 ; , s. 75-80
  • Konferensbidrag (refereegranskat)abstract
    • In this paper, alow-complexity approach to implement a class of flexible frequency-band reallocation (FFBR) multi-input multi-output (MIMO) networks, which use variable oversampled complex-modulated filter banks, is introduced. Two alternatives in processing real signals using real input/output and complex input/output FFBR networks (or simply, real and complex FFBR networks, respectively) are considered. It is shown that to process each sample, the real case requires less number of real operations compared to its complex counterpart. Furthermore, the real case has a smaller growth rate in the number of real operations with respect to the prototype filter order. In addition, the real FFBR network eliminates the need for two Hilbert transformers whereas in the complex FFBR case, to achieve high efficiency in FBR, there is a need for high-order Hilbert transformers.
  •  
2.
  • Eghbali, Amir, et al. (författare)
  • On the complexity of multiplierless direct and polyphase FIR filter structures
  • 2007
  • Ingår i: Proc. Int. Symp. Image, Signal Processing, Analysis, Istanbul, Turkey, Sept. 27-29, 2007. - 9789531841160 ; , s. 200-205
  • Konferensbidrag (refereegranskat)abstract
    • This paper discusses the complexity trend in different finite length impulse response (FIR) filter structures when using multiplierless (shift-and-add) realization. We derive the total number of adders required by the transposed direct form, polyphase, and reduced-complexity polyphase FIR filter structures. A comparison of the arithmetic complexities of these structures for different filter characteristics is performed. The simulation results show that considering both the high level structure and the algorithm used to realize the subfilters gives a more accurate measure of complexity comparison between different FIR filter structures.
  •  
3.
  • Lindblad, Joakim, et al. (författare)
  • Defuzzification by Feature Distance Minimization Based on DC Programming
  • 2007
  • Ingår i: 5th International Symposium on Image and Signal Processing and Analysis, 2007. - 9789531841160 ; , s. 373-378
  • Konferensbidrag (refereegranskat)abstract
    • We introduce the use of DC programming, in combination with convex-concave regularization, as a deterministic approach for solving the optimization problem imposed by defuzzification by feature distance minimization. We provide a DC based algorithm for finding a solution to the defuzzification problem by expressing the objective function as a difference of two convex functions and iteratively solving a family of DC programs. We compare the performance with the previously recommended method, simulated annealing, on a number of test images. Encouraging results, together with several advantages of the DC based method, approve use of this approach, and motivate its further exploration.
  •  
4.
  • Strand, Robin, et al. (författare)
  • Minimal Cost-Path for Path-Based Distances
  • 2007
  • Ingår i: Proceedings of 5th International Symposium on Image and Signal Processing and Analysis (ISPA 2007). - 9789531841160 ; , s. 379-384
  • Konferensbidrag (refereegranskat)abstract
    • Distance functions defined by the minimal cost-path using weights and neighbourhood sequences (n.s.) are considered for the constrained distance transform (CDT). The CDT is then used to find one minimal cost-path between two points. The behaviour of some path-based distance functions is analyzed and a new error function is introduced. It is concluded that the weighted n.s.-distance with two weights (3 x 3 neighbourhood) and the weighted distance with three weights (5 x 5 neighbourhood) have similar properties in terms of minimal cost-path computation, while the former is more efficient to compute.
  •  
5.
  • Strand, Robin (författare)
  • Shape Representation wtih Maximal Path-Points for Path-Based Distances
  • 2007
  • Ingår i: Image and Signal Processing and Analysis, 2007. ISPA 2007. 5th International Symposium on. - 9789531841160 ; , s. 397-402
  • Konferensbidrag (refereegranskat)abstract
    • A general framework explaining the extraction of maximal path-points (related to the set of centres of maximal balls) for path-based distances is presented. The traditional weigthed distance and distance based on neighbourhood sequences are considered and compared with the recently developed weighted distance based on neighbouhood sequences.
  •  
6.
  • Wanhammar, Lars, et al. (författare)
  • Synthesis of Circulator-Tree Wave Digital Filters
  • 2007
  • Ingår i: PROCEEDINGS OF THE 5TH INTERNATIONAL SYMPOSIUM ON IMAGE AND SIGNAL PROCESSING AND ANALYSIS. - : IEEE. - 9789531841160 ; , s. 206-211
  • Konferensbidrag (refereegranskat)abstract
    • In this paper, we show that circulator-tree wave digital filters are an interesting alternative to lattice WDFs. Furthermore, we provide two simple programs for design of lattice and circulator-tree lowpass filters and compare the two structures with respect to element sensitivity.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-6 av 6

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy