The search functionality is under construction.

Author Search Result

[Author] Tzi-Dar CHIUEH(5hit)

1-5hit
  • Heterogeneous Recurrent Neural Networks

    Jenn-Huei Jerry LIN  Jyh-Shan CHANG  Tzi-Dar CHIUEH  

     
    PAPER-Neural Networks

      Vol:
    E81-A No:3
      Page(s):
    489-499

    Noise cancelation and system identification have been studied for many years, and adaptive filters have proved to be a good means for solving such problems. Some neural networks can be treated as nonlinear adaptive filters, and are thus expected to be more powerful than traditional adaptive filters when dealing with nonlinear system problems. In this paper, two new heterogeneous recurrent neural network (HRNN) architectures will be proposed to identify some nonlinear systems and to extract a fetal electrocardiogram (ECG), which is corrupted by a much larger noise signal, Mother's ECG. The main difference between a heterogeneous recurrent neural network (HRNN) and a recurrent neural network (RNN) is that a complete neural network is used for the feedback path along with an error back-propagation (BP) neural network as the feedforward one. Different feedback neural networks can be used to provide different feedback capabilities. In this paper, a BP neural network is used as the feedback network in the architecture we proposed. And a self-organizing feature mapping (SOFM) network is used next as an alternative feedback network to form another heterogeneous recurrent neural network (HRNN). The heterogeneous recurrent neural networks (HRNN) successfully solve these two problems and prove their superiority to traditional adaptive filters and BP neural networks.

  • Design and Implementation of an Uplink Baseband Receiver for Wideband CDMA Communications

    Hsi-Pin MA  Steve Hengchen HSU  Tzi-Dar CHIUEH  

     
    PAPER

      Vol:
    E85-A No:12
      Page(s):
    2813-2821

    This paper presents architecture design, FPGA implementation, and measurement results of a real-time signal processing circuit for WCDMA uplink baseband receiver. To enhance uplink signal-to-interference-plus-noise ratio (SINR) performance, a four-element antenna array and a four-finger Rake combiner are integrated in the proposed receiver. Moreover, a low-complexity beamforming architecture using a correlator-based beam searcher, a decision-directed carrier synchronization loop, and a matched-filter based channel estimator is also designed. Simulations are based on the standard Doppler-fading scalar channel models provided by 3GPP and an extension to vector channel models that specify angle of arrival for each path is also made for beamformer simulation. Simulation and hardware emulation results show that the proposed architecture meets the specified requirements. In addition, this architecture, with its correlator-based beamformer weights, achieves such performance improvement with relatively low hardware complexity.

  • Image Vector Quantization Using Classified Binary-Tree-Structured Self-Organizing Feature Maps

    Jyh-Shan CHANG  Tzi-Dar CHIUEH  

     
    PAPER-Image Processing, Image Pattern Recognition

      Vol:
    E83-D No:10
      Page(s):
    1898-1907

    With the continuing growth of the World Wide Web (WWW) services over the Internet, the demands for rapid image transmission over a network link of limited bandwidth and economical image storage of a large image database are increasing rapidly. In this paper, a classified binary-tree-structured Self-Organizing Feature Map neural network is proposed to design image vector codebooks for quantizing images. Simulations show that the algorithm not only produces codebooks with lower distortion than the well-known CVQ algorithm but also can minimize the edge degradation. Because the adjacent codewords in the proposed algorithm are updated concurrently, the codewords in the obtained codebooks tend to be ordered according to their mutual similarity which means more compression can be achieved with this algorithm. It should also be noticed that the obtained codebook is particularly well suited for progressive image transmission because it always forms a binary tree in the input space.

  • Broadband Active Noise Control Using a Neural Network

    Casper K. CHEN  Tzi-Dar CHIUEH  Jyh-Horng CHEN  

     
    PAPER-Speech Processing and Acoustics

      Vol:
    E81-D No:8
      Page(s):
    855-861

    This paper presents a neural network-based control system for Adaptive Noise Control (ANC). The control system derives a secondary signal to destructively interfere with the original noise to cut down the noise power. This paper begins with an introduction to feedback ANC systems and then describes our adaptive algorithm in detail. Three types of noise signals, recorded in destroyer, F16 airplane and MR imaging room respectively, were then applied to our noise control system which was implemented by software. We obtained an average noise power attenuation of about 20 dB. It was shown that our system performed as well as traditional DSP controllers for narrow-band noise and achieved better results for nonlinear broadband noise problems. In this paper we also present a hardware implementation method for the proposed algorithm. This hardware architecture allows fast and efficient field training in new environments and makes real-time real-life applications possible.

  • IETQ: An Incrementally Extensible Twisted Cube

    Jyh-Shan CHANG  Sao-Jie CHEN  Tzi-Dar CHIUEH  

     
    PAPER-Graphs and Networks

      Vol:
    E85-A No:5
      Page(s):
    1140-1151

    In this paper, a new family of interconnection networks which we call the Incrementally Extensible Twisted Cube (IETQ) is proposed. The topology of this network is a novel generalization of the twisted cube. It inherits all the merits but without the limitations owned by a twisted cube. First, this proposed IETQ is incrementally extensible and can be adapted for use in any number of nodes; therefore, this network is particularly well suited for the design of a distributed communication network with an arbitrary number of nodes. Second, the vertex connectivity of IETQ is n. Measured by this vertex connectivity, we demonstrate that this network is optimally fault-tolerant . And it is almost regular, because the difference between the maximum and minimum degree of any node in an IETQ is at most one. A shortestpath routing algorithm for IETQ is proposed to generate path for any given pair of vertices in the network. Third, comparing with most of the other competitors, the diameter of this IETQ network is only half in size. This low diameter helps to reduce the internode communication delay. Moreover, IETQ also possesses the property of a pancyclic network. This attractive property would enable us to map rings of any length into the proposed network.