Browsing by Author "Chen, AY"

Now showing 1 - 8 of 8

3DPAC Video Codec Transmission over Internet with QoS Provision
(2000)
Wen, KA
;
Chiou, CH
;
Chen, AY
;
Lin, CH
;
Lin, JL
In this work, a VOD-like network application especially for wireless LAN and low bit rate Internet transmission. With the derivation of the software platform, Three-dimensional Polynomial Approximation Coding (3DPAC) video compression algorithm is employed and some TCP/IP network operation is driven. A simple experimental video transmission platform over TCP/IP is constructed to investigate the features for guarantee of quality of service development of this video compression and transmission system, and two excellent features, fidelity and agility of 3DPAC for QoS development are discovered.
A case study on the multistage IC final testing scheduling problem with reentry
(2004-04-18)
Pearn, WL
;
Chung, SH
;
Chen, AY
;
Yang, MH
;
工業工程與管理學系
The integrated-circuit final testing scheduling problem (ICFTSP) with reentry is a variation of the complex flow-shop scheduling problem, which is also a generalization of the classical reentrant flow batch process problem, and the identical parallel machine problem. In this paper, we present a case study on the ICFTSP with reentry, which is taken from a final testing shop floor in an integrated circuit manufacturing factory. For the case investigated, the jobs are clustered by their product types, which must be processed on groups of parallel machines at various process stages following the manufacturing sequence, which must be completed before the due dates. The job processing time depends on the product type, and the machine setup time is sequentially dependent on the orders of jobs processed. The objective is to schedule jobs without violating all constraints, while the total machine workload is minimized. Since the ICFTSP has reentry characteristic, and involves job processing precedence, serial-processing stage, batch-processing stage, job clusters, job-cluster dependent processing time, due dates, machine capacity, and sequence dependent setup time, it is more difficult to solve than the classical flow-shop scheduling problem. We present three fast network algorithms to efficiently solve the ICFTSP with reentry and provide a performance comparison between the three algorithms on eight test problems. (C) 2003 Elsevier B.V. All rights reserved.
A systematic design of protocol processors
(1996)
Chen, AY
;
Chen, YS
;
Chang, RC
;
Wen, KA
;
交大名義發表
An innovative design methodology is proposed for protocol processors design. The protocol description is mapped to statecharts and statecharts are then mapped to a real-time operating system as well as microprocessors. The IS-54 protocol for cellular wireless communication mobile station is taken as the design example. And an efficient and easy-for-evaluation design environment is then constructed.
Dual-mode Viterbi decoder design for cellular mobile
(1996)
Chen, AY
;
Wu, CY
;
Wen, KA
;
交大名義發表
;
電子工程學系及電子研究所
The Viterbi algorithm is widely applied for communication to derive the maximun-likehood sequence estimates of transmitted data on channels with intersymbol interference (ISI) and/or coding. In this paper, we provide a VLSI design of Viterbi decoder for IS-54. Design features includes: switchable (2,1,5),(4,1,5) coder design, data inter-leaving, soft - decision. For hardware constrain, area efficiency is of great concern in handset design. Hence, optimized area efficient design is imple-mented.
Polynomial approximation coding for progressive image transmission
(1997-09-01)
Lu, CY
;
Chen, AY
;
Wen, KA
;
交大名義發表
;
National Chiao Tung University
This paper presents a progressive image transmission scheme in which polynomial approximation coding is effectively applied to encoding residual images at each stage. This polynomial approximation coding is derived from a regressive model based on the relation between a set of data and their positions. Because the close relation is embedded in a certain polynomial function, the highly efficient compression can be implemented and the decimation and interpolation are also easily realized at the receiving side. Simulations and experimental results are discussed in the later part of this paper. (C) 1997 Academic Press.
Polynomial approximation coding for progressive image transmission
(1997-09-01)
Lu, CY
;
Chen, AY
;
Wen, KA
;
交大名義發表
;
National Chiao Tung University
This paper presents a progressive image transmission scheme in which polynomial approximation coding is effectively applied to encoding residual images at each stage. This polynomial approximation coding is derived from a regressive model based on the relation between a set of data and their positions. Because the close relation is embedded in a certain polynomial function, the highly efficient compression can be implemented and the decimation and interpolation are also easily realized at the receiving side. Simulations and experimental results are discussed in the later part of this paper. (C) 1997 Academic Press.
Three-dimensional PAC video codec for wireless data transmission
(2000-12-01)
Wen, KA
;
Chen, AY
;
Lan, YJ
;
Lin, JL
;
Lin, CH
A newly derived algorithm called three-dimensional polynomial approximation coding (3DPAC) is being utilized in the applications of wireless video transmission. After combining the spatial and temporal domain, the video data is organized in a cube form, which has the features of processing parallelism and great compression ratio. Such a very low bit-rate video codec is able to support the wireless data transmission with a bit rate lower than 9.6 kbits/s, The system architecture will be presented and an experimental demonstration is also shown. For a video sequence of 176 x 144 frame size, PSNR up to 35 dB maybe obtained under 6.5 kbits/s transmission rate.
Three-dimensional regression polynomial coding for video transmission
(1998)
Lan, YJ
;
Chen, AY
;
Lin, JL
;
Wen, KA
;
電子工程學系及電子研究所
Video processing always needs excessive computation which may cause large computing time and thus demands for heavy computing power, it also needs large storage resources and high bandwidth communication channel. Hence, the major objective of video signal processing is to reduce the amount of data computation and use the limited resource bandwidth to handle it. Regression Polynomial Coding (RPC) is a new compression method based on polynomial coefficients which shapes out the waveform of the block. The computation mechanism employed greatly reduce the computation with serial but not parallel processing, and it is proved that RPC is effective and suitable in low bit rate applications in the environment with limited bandwidth. With the aid of variable length coding to gain more compression, RPC would be a great technique for wireless communications.