DIGITAL SIGNAL PROCESSING ARTICLE NO.
7, 145–146 (1997)
SP970297
EDITORIAL
Introduction to the Issue A hearty thank you to everyone who offered their suggestions for improvements to DSP: A Review Journal during the ICASSP’97 Conference in Munich. I hope everyone also had a chance to stop at the Academic Press booth to meet with our senior editor, Kate Brewin, out of AP’s London office. I am sure you were as impressed as I with Kate’s infectious enthusiasm and dedication to keeping DSP: A Review Journal at the forefront of the digital signal processing technical literature. Kate will e-mail a summary of the suggestions to the editorial board in short order. Kate is championing Academic Press’ state-of-the-art on-line journal access via their IDEAL system. IDEAL offers full-text journal access, including DSP: A Review Journal, on the internet at mirrored sites http://www.idealibrary.com or http://www.europe.idealibrary.com. This Academic Press Online Journal Library is very impressive and must be visited to be fully appreciated. For more information, please contact Academic Press Marketing Department, 525 B Street, Suite 1900, San Diego, California 92101-4495; Academic Press Limited, 24-28 Oval Road, London NW1 7DX, U.K., phone: 1 800 894 3434, 1 619 699 6742, or e-mail:
[email protected]. The July 1997 issue offers five quality technical papers within digital signal processing. In ‘‘Lossless Image Compression Using Predictive Codebooks,’’ Mandyam, Ahmed, and Magotra describe a method for lossless image compression. Lossless image compression is very important in applications, medical imaging, for example, wherein perfect image reconstruction is required for diagnostics. Direction-of-Arrival Estimation remains an active research field; now that the field has matured somewhat it has become very important to quantify the tradeoffs between competing algorithms. A paper by Fernandez del Rio and Catedra-Perez compares the Matrix Pencil method and the Root-MUSIC method to highlight the advantages obtained by each algorithm in different signal environments. Many popular speech coding methods rely on the use of vector quantization to achieve high-quality speech and reasonable data compression; a difficulty with vector quantization is the algorithmic complexity required to achieve real-time implementation. In ‘‘Fast Vector Quantization Encoding Based on K-d Tree Backtracking Search Algorithm,’’ Ramasubramanian and Paliwal analyze the K-d tree-based backtracking search algorithm for use in vector quantization encoding of speech signals. Multidimensional signal processing is considerably more computationally intensive than single dimensional signal processing for obvious reasons. A method for implementing multidimensional digital filters is presented by Deng in ‘‘Completely Parallel Realizations for Multidimensional Digital Filters,’’ suitable for high-speed signal processing. Blind channel estimation attempts to 1051-2004/97 $25.00 Copyright r 1997 by Academic Press All rights of reproduction in any form reserved.
145
estimate the impulse response of a channel from only the observed output measurements without any access to a channel input signal. A significantly improved version of a recently developed well-known blind channel estimation algorithm is presented by Qiu and Hua in ‘‘A GCD Method for Blind Channel Identification.’’ If you visit Adelaide in the future, please stop by CSSIP for a visit and to share your thoughts on DSP: A Review Journal. Jim Schroeder Co-Editor
146