• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.2
• /
• pp.323-342
• /
• 2013

Let $C[0,t]$ denote the function space of all real-valued continuous paths on $[0,t]$. Define $Xn:C[0,t]{\rightarrow}\mathbb{R}^{n+1}$ and $X_{n+1}:C[0,t]{\rightarrow}\mathbb{R}^{n+2}$ by $X_n(x)=(x(t_0),x(t_1),{\cdots},x(t_n))$ and $X_{n+1}(x)=(x(t_0),x(t_1),{\cdots},x(t_n),x(t_{n+1}))$, where $0=t_0$ < $t_1$ < ${\cdots}$ < $t_n$ < $t_{n+1}=t$. In the present paper, using simple formulas for the conditional expectations with the conditioning functions $X_n$ and $X_{n+1}$, we evaluate the $L_p(1{\leq}p{\leq}{\infty})$-analytic conditional Fourier-Feynman transforms and the conditional convolution products of the functions which have the form $${\int}_{L_2[0,t]}{{\exp}\{i(v,x)\}d{\sigma}(v)}{{\int}_{\mathbb{R}^r}}\;{\exp}\{i{\sum_{j=1}^{r}z_j(v_j,x)\}dp(z_1,{\cdots},z_r)$$ for $x{\in}C[0,t]$, where $\{v_1,{\cdots},v_r\}$ is an orthonormal subset of $L_2[0,t]$ and ${\sigma}$ and ${\rho}$ are the complex Borel measures of bounded variations on $L_2[0,t]$ and $\mathbb{R}^r$, respectively. We then investigate the inverse transforms of the function with their relationships and finally prove that the analytic conditional Fourier-Feynman transforms of the conditional convolution products for the functions, can be expressed in terms of the products of the conditional Fourier-Feynman transforms of each function.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.83-86
• /
• 1996

In this paper we study the problem of augmenting a physical network to improve the topology for new survivable network architectures. We are given a graph G=(V,E,F), where V is a set of nodes that represents transmission systems which be interconnected by physical links, and E is a collection of edges that represent the possible pairs of nodes between which a direct transmission link can be placed. F, a subset of E is defined as a set of the existing direct links, and E/F is defined as a set of edges for the possible new connection. The cost of establishing network $N_{H}$=(V,H,F) is defined by the sum of the costs of the individual links contained in new link set H. We call that $N_{H}$=(V,H,F) is feasible if certain connectivity constrints can be satisfied in $N_{H}$=(V,H,F). The computational goal for the suggested model is to find a minimum cost network among the feasible solutions. For a k edge (node) connected component S .subeq. F, we charactrize some optimality conditions with respect to S. By this characterization we can find part of the network that formed by only F-edges. We do not need to augment E/F edges for these components in an optimal solution. Hence we shrink the related component into a node. We study some good primal heuristics by considering construction and exchange ideas. For the construction heuristics, we use some greedy methods and relaxation methods. For the improvement heuristics we generalize known exchange heuristics such as two-optimal cycle, three-optimal cycle, pretzel, quezel and one-optimal heuristics. Some computational experiments show that our heuristic is more efficient than some well known heuristics.stics.

• Journal of Communications and Networks
• /
• v.13 no.3
• /
• pp.232-239
• /
• 2011

This paper investigates the user selection problem of successive zero-forcing precoded multiuser multiple-input multiple-output (MU-MIMO) downlink systems, in which the base station and mobile receivers are equipped with multiple antennas. Assuming full knowledge of the channel state information at the transmitter, dirty paper coding (DPC) is an optimal precoding strategy, but practical implementation is difficult because of its excessive complexity. As a suboptimal DPC solution, successive zero-forcing DPC (SZF-DPC) was recently proposed; it employs partial interference cancellation at the transmitter with dirty paper encoding. Because of a dimensionality constraint, the base station may select a subset of users to serve in order to maximize the total throughput. The exhaustive search algorithm is optimal; however, its computational complexity is prohibitive. In this paper, we develop two low-complexity user scheduling algorithms to maximize the sum rate capacity of MU-MIMO systems with SZF-DPC. Both algorithms add one user at a time. The first algorithm selects the user with the maximum product of the maximum column norm and maximum eigenvalue. The second algorithm selects the user with the maximum product of the minimum column norm and minimum eigenvalue. Simulation results demonstrate that the second algorithm achieves a performance similar to that of a previously proposed capacity-based selection algorithm at a high signal-to-noise (SNR), and the first algorithm achieves performance very similar to that of a capacity-based algorithm at a low SNR, but both do so with much lower complexity.