• Title/Summary/Keyword: general Wiener space

Search Result 25, Processing Time 0.021 seconds

GENERALIZED FOURIER-FEYNMAN TRANSFORMS AND CONVOLUTIONS FOR EXPONENTIAL TYPE FUNCTIONS OF GENERALIZED BROWNIAN MOTION PATHS

  • Jae Gil Choi
    • Communications of the Korean Mathematical Society
    • /
    • v.38 no.4
    • /
    • pp.1141-1151
    • /
    • 2023
  • Let Ca,b[0, T] denote the space of continuous sample paths of a generalized Brownian motion process (GBMP). In this paper, we study the structures which exist between the analytic generalized Fourier-Feynman transform (GFFT) and the generalized convolution product (GCP) for functions on the function space Ca,b[0, T]. For our purpose, we use the exponential type functions on the general Wiener space Ca,b[0, T]. The class of all exponential type functions is a fundamental set in L2(Ca,b[0, T]).

An Efficient Low Complexity Blind Equalization Using Micro-Genetic Algorithm

  • Kim, Sung-Soo;Kang, Jee-Hye
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.4 no.3
    • /
    • pp.283-287
    • /
    • 2004
  • In this paper, a method of designing the efficient batch blind equalization with low complexity using a micro genetic algorithm (GA), is presented. In general, the blind equalization techniques that are focused on the complexity reduction might be carried out with minor effect on the performance. Among the advanced various subjects in the field of GAs, a micro genetic algorithm is employed to identity the unknown channel impulse response in order to reduce the search space effectively. A new cost function with respect to the constant modulus criterion is suggested considering its relation to the Wiener criterion. We provide simulation results to show the superiority of the proposed techniques compared to other existing techniques.

GENERALIZED ANALYTIC FOURIER-FEYNMAN TRANSFORMS AND CONVOLUTIONS ON A FRESNEL TYPE CLASS

  • Chang, Seung-Jun;Lee, Il-Yong
    • Bulletin of the Korean Mathematical Society
    • /
    • v.48 no.2
    • /
    • pp.223-245
    • /
    • 2011
  • In this paper, we de ne an $L_p$ analytic generalized Fourier Feynman transform and a convolution product of functionals in a Ba-nach algebra $\cal{F}$($C_{a,b}$[0, T]) which is called the Fresnel type class, and in more general class $\cal{F}_{A_1;A_2}$ of functionals de ned on general functio space $C_{a,b}$[0, T] rather than on classical Wiener space. Also we obtain some relationships between the $L_p$ analytic generalized Fourier-Feynman transform and convolution product for functionals in $\cal{F}$($C_{a,b}$[0, T]) and in $\cal{F}_{A_1,A_2}$.

MULTIPLE Lp ANALYTIC GENERALIZED FOURIER-FEYNMAN TRANSFORM ON A FRESNEL TYPE CLASS

  • Chang, Seung Jun;Lee, Il Yong
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.19 no.1
    • /
    • pp.79-99
    • /
    • 2006
  • In this paper, we define a class of functional defined on a very general function space $C_{a,b}[0,T]$ like a Fresnel class of an abstract Wiener space. We then define the multiple $L_p$ analytic generalized Fourier-Feynman transform and the generalized convolution product of functionals on function space $C_{a,b}[0,T]$. Finally, we establish some relationships between the multiple $L_p$ analytic generalized Fourier-Feynman transform and the generalized convolution product for functionals in $\mathcal{F}(C_{a,b}[0,T])$.

  • PDF

Robust Multiuser Detection Based on Least p-Norm State Space Filtering Model

  • Zha, Daifeng
    • Journal of Communications and Networks
    • /
    • v.9 no.2
    • /
    • pp.185-191
    • /
    • 2007
  • Alpha stable distribution is better for modeling impulsive noises than Gaussian distribution in signal processing. This class of process has no closed form of probability density function and finite second order moments. In general, Wiener filter theory is not meaningful in S$\alpha$SG environments because the expectations may be unbounded. We proposed a new adaptive recursive least p-norm Kalman filtering algorithm based on least p-norm of innovation process with infinite variances, and a new robust multiuser detection method based on least p-norm Kalman filtering. The simulation experiments show that the proposed new algorithm is more robust than the conventional Kalman filtering multiuser detection algorithm.