Ieice English

\documentclass[twocolumn,a4paper]{ieicejsp}
\usepackage[T1]{fontenc}
\usepackage{lmodern}
\usepackage{textcomp}
\usepackage{latexsym}
\usepackage[fleqn]{amsmath}
\usepackage{amssymb}
\usepackage{float}
\usepackage{graphicx}

\title{{\bf Sample IEICE Conference Manuscript (for \TeX\ Template)}}
\author{
  Tarou Denshi$^1$ \and
  Jiro Jouhou$^2$ \and
  John Smith$^3$
}
\affliate{%
  National Institute of Electronics$^1$
  \and
  ABC University$^2$
  \and
  XYZ Corporation$^3$
}

\begin{document}
\maketitle

\section{Introduction}

This document demonstrates the various features available in the IEICE conference \TeX\ template. Please create your manuscript using this template for the conference proceedings. The conference proceedings (WEB version) will maintain the original manuscript size, while the printed version will be published in B5 size (approximately 86\% reduction).

The remainder of this paper is organized as follows. Section~2 presents the methodology with mathematical formulations. Section~3 shows experimental results including figures and tables. Section~4 concludes the paper.

\section{Methodology}

\subsection{Problem Formulation}

Consider a signal processing problem where we want to minimize the following objective function:
\begin{equation}
  J(\mathbf{w}) = \frac{1}{2}\|\mathbf{y} - \mathbf{X}\mathbf{w}\|^2 + \lambda\|\mathbf{w}\|_1
\end{equation}
where $\mathbf{y} \in \mathbb{R}^n$ is the observation vector, $\mathbf{X} \in \mathbb{R}^{n \times p}$ is the design matrix, and $\lambda > 0$ is the regularization parameter.

\subsection{Proposed Algorithm}

The proposed algorithm consists of the following steps:
\begin{enumerate}
  \item Initialize $\mathbf{w}^{(0)} = \mathbf{0}$
  \item For $k = 0, 1, 2, \ldots$ until convergence:
  \begin{enumerate}
    \item Compute gradient $\nabla J(\mathbf{w}^{(k)})$
    \item Update $\mathbf{w}^{(k+1)} = \mathbf{w}^{(k)} - \alpha \nabla J(\mathbf{w}^{(k)})$
  \end{enumerate}
  \item Return $\mathbf{w}^{(k)}$
\end{enumerate}

\subsubsection{Convergence Analysis}

The convergence rate depends on the condition number of $\mathbf{X}^T\mathbf{X}$. Under standard assumptions, the algorithm achieves:
\begin{equation}
  \|\mathbf{w}^{(k)} - \mathbf{w}^*\| \leq \left(1 - \frac{\mu}{L}\right)^k \|\mathbf{w}^{(0)} - \mathbf{w}^*\|
\end{equation}
where $\mu$ and $L$ are the strong convexity and smoothness parameters, respectively.

\section{Experimental Results}

\subsection{Experimental Setup}

The experiments were conducted using the following configuration:
\begin{itemize}
  \item CPU: Intel Core i9-12900K
  \item Memory: 64GB DDR5
  \item Software: Python 3.11 with NumPy and SciPy
  \item Dataset: Synthetic data with $n=1000$, $p=500$
\end{itemize}

\subsection{Results and Discussion}

Figure~\ref{fig:sample} shows the convergence behavior of the proposed algorithm compared to baseline methods. The proposed method achieves faster convergence in terms of both iterations and wall-clock time.

\begin{figure}[tb]
  \centering
  \includegraphics[width=0.8\columnwidth]{sample.png}
  \caption{Sample result showing the performance comparison between different methods.}
  \label{fig:sample}
\end{figure}

Table~\ref{tab:comparison} summarizes the quantitative comparison between the proposed method and existing approaches. Our method achieves the best performance in terms of accuracy while maintaining competitive computational efficiency.

\begin{table}[tb]
  \centering
  \caption{Performance comparison of different methods.}
  \label{tab:comparison}
  \begin{tabular}{lccc}
    \hline
    Method & Accuracy (\%) & Time (s) & Memory (MB) \\
    \hline
    Baseline 1 & 85.2 & 12.3 & 256 \\
    Baseline 2 & 87.8 & 8.7 & 512 \\
    Baseline 3 & 89.1 & 15.2 & 384 \\
    \textbf{Proposed} & \textbf{92.4} & \textbf{6.5} & 320 \\
    \hline
  \end{tabular}
\end{table}

The key advantages of our approach include:
\begin{description}
  \item[Efficiency] Reduced computational complexity from $O(n^3)$ to $O(n^2)$
  \item[Accuracy] Improved accuracy by leveraging adaptive step sizes
  \item[Scalability] Linear memory scaling with problem size
\end{description}

\section{Conclusion}

This paper presented a novel optimization algorithm for signal processing applications. Experimental results demonstrated that the proposed method outperforms existing approaches in terms of both accuracy and computational efficiency. Future work includes extending the algorithm to handle non-convex objective functions.

\section*{Acknowledgment}

This work was supported by JSPS KAKENHI Grant Number JP12345678.

\begin{thebibliography}{9}
\bibitem{ref1}
A. Author and B. Coauthor, ``Title of the paper,'' \textit{IEEE Trans. Signal Process.}, vol.~70, no.~3, pp.~1234--1245, Mar. 2022.

\bibitem{ref2}
C. Researcher, \textit{Book Title}, 2nd ed. Publisher, City, 2021.

\bibitem{ref3}
D. Smith, E. Jones, and F. Brown, ``Conference paper title,'' in \textit{Proc. IEEE Int. Conf. Acoust., Speech, Signal Process. (ICASSP)}, 2023, pp.~100--104.
\end{thebibliography}

\end{document}