A Practical Subspace Blind Identification Algorithm with Reduced Computational Complexity(Digital Signal Processing)
スポンサーリンク
概要
- 論文の詳細を見る
We propose a practical blind channel identification algorithm based on the principal component analysis. The algorithm estimates (1) the channel order, (2) the noise variance, and then identifies (3) the channel impulse response, from the autocorrelation of the channel output signal without using the eigenvalue and singular-value decomposition. The special features of the proposed algorithm are (1) practical method to find the channel order and (2) reduction of computational complexity. Numerical examples show the effectiveness of the proposed algorithm.
- 社団法人電子情報通信学会の論文
- 2004-12-01
著者
-
TSUJII Shigeo
Research and Development Initiative, Chuo University
-
SAKANIWA Kohichi
Dept. of Communications & Integrated Systems, Tokyo Institute of Technology
-
Sakaniwa Kohichi
Tokyo Inst. Of Technol. Tokyo Jpn
-
Sakaniwa Kohichi
Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Tsujii S
Institute Of Information Security
-
Tsujii Shigeo
Graduate School Of Information Security Institute Of Information Security:research And Development I
-
Tsujii Shigeo
Institute Of Information Security
-
TANABE Nari
Dept. of Communications and Integrated Systems, Tokyo Institute of Technology
-
FURUKAWA Toshihiro
Dept. of Management Science, Tokyo University of Science
-
Tanabe Nari
Department Of Electronic Systems Engineering Tokyo University Of Science
-
Tsujii Shigeo
Graduate School Of Information Security Institute Of Information Security
-
Tsujii S
Graduate School Of Information Security Institute Of Information Security:research And Development I
-
FURUKAWA Toshihiro
Department of Management Science, Tokyo University of Science
-
Furukawa Toshihiro
Department Of Management Science Tokyo University Of Science
関連論文
- Key-Generation Algorithms for Linear Piece In Hand Matrix Method
- Anonymous Query Language Retrieval (ライフインテリジェンスとオフィス情報システム)
- Anonymous Query Language Retrieval (情報セキュリティ)
- An Edge-Preserving Super-Precision for Simultaneous Enhancement of Spacial and Grayscale Resolutions
- An Iterative MPEG Super-Resolution with an Outer Approximation of Framewise Quantization Constraint(Image)
- Discrete Time-Frequency Projection Filtering Based on an Alias-Free Discrete Time-Frequency Analysis(Digital Signal Processing)
- A Truncated Polynomial Interpolation and Its Application to Polynomially WLS Design of IIR Filters(Digital Signal Processing)
- Discrete Time-Frequency Projection Filtering based on an Alias-Free Discrete Time-Frequency Analysis (第6回ネットワークシンポジウム講演論文集)
- A Higher Order Generalization of an Alias-Free Discrete Time-Frequency Analysis(Special Section on Digital Signal Processing)
- A higher order generalization of an alias-free discrete time-frequency analysis
- A truncated polynomial interpolation theorem and its application to the WLS design of IIR filters
- A Design of Near Perfect Reconstruction Linear-Phase QMF Banks Based on Hybrid Steepest Descent Method(Special Section on Digital Signal Processing)
- A Note on Constrained Least Squares Design of M-D FIR Filter Based on Convex Projection Techniques(Special Section on Digital Signal Processing)
- CONSTRAINED LEAST SQUARES DESIGN OF M-D FIR FILTER BASED ON CONVEX PROJECTION TECHNIQUES
- A Super Resolution Reconstruction of MPEG Compressed Video Sequences
- Key-Generation Algorithms for Linear Piece In Hand Matrix Method
- Dually-Perturbed Matsumoto-Imai Signature (DPMS) Scheme
- Security Enhancement of Various MPKCs by 2-Layer Nonlinear Piece in Hand Method
- Proposal for Piece in Hand Matrix : General Concept for Enhancing Security of Multivariate Public Key Cryptosystems(Discrete Mathematics and Its Applications)
- An Edge-Preserving Super-Precision for Simultaneous Enhancement of Spacial and Grayscale Resolutions
- A Subspace Blind Identification Algorithm with Reduced Computational Complexity : Colored Noise Case(Digital Signal Processing)
- A Practical Subspace Blind Identification Algorithm with Reduced Computational Complexity : Colored Noise Case
- A Practical Subspace Blind Identification Algorithm with Reduced Computational Complexity(Digital Signal Processing)
- On Generalized Hamming Weights of Codes Constructed on Affine Algebraic Varieties (Special Section on Information Theory and Its Applications)
- On the Comparison of Lower Bounds for Generalized Hamming Weights
- Fast Acquisition of PN Sequences in DS-CDMA Systems with Incoherent Demodulator(Wireless Communication Technologies)
- Fast Acquisition of PN Sequences in DS/CDMA Systems(Regular Section)
- Simple Estimation for the Dimension of Subfield Subcodes of AG Codes
- An Improved Bound for the Dimension of Subfield Subcodes
- A Simple Nonlinear Pre-Filtering for a Set-Theoretic Linear Blind Deconvolution Scheme(Special Section on Digital Signal Processing)
- A Set-Theoretic Blind Image Deconvolution Based on Hybrid Steepest Descent Method (Special Section on Digital Signal Processing)
- Detailed Evolution of Degree Distributions in Residual Graphs with Joint Degree Distributions
- Average Bit Erasure Probability of Regular LDPC Code Ensembles under MAP Decoding over BEC(Information Theory and Its Applications)
- Performance of Standard Irregular LDPC Codes under Maximum Likelihood Decoding(Coding Theory)
- Sufficient Conditions for a Regular LDPC Code Better than an Irregular LDPC Code(Coding Theory)
- Design of Irregular Repeat Accumulate Codes with Joint Degree Distributions(Coding Theory)
- Average Coset Weight Distribution of Multi-Edge Type LDPC Code Ensembles(Coding Theory,Information Theory and Its Applications)
- Average Error Probability of Standard Irregular LDPC Code Ensemble under Maximum Likelihood Decoding
- Weight and Stopping Set Distributions of Two-Edge Type LDPC Code Ensembles(Coding Theory, Information Theory and Its Applications)
- Stopping Set Distributions of IRA and IRA Type LDPC Code Ensembles
- Asymptotic Weight and Stopping Set Distributions for Detailedly Represented Irregular LDPC Code Ensembles(Coding Theory)(Information Theory and Its Applications)
- Asymptotic Stopping Set Distribution for Detailedly Represented Irregular LDPC Code Ensembles
- Improvements of Addition Algorithm on Genus 3 Hyperellipic Curves and Their Implementation(Public Key Cryptography)(Cryptography and Information Security)
- Baby Step Giant Step Algorithms in Point Counting of Hyperelliptic Curves
- On Waveform Equalization and its Economical Profit in Optical Fiber PCM Transmission System
- Modified Low Density MDS Array Codes for RAID and Memory Systems
- An Efficient Encoding Method for LDPC Codes Based on Cyclic Shift
- Robust noise suppression algorithm using the only Kalman filter theory for white and colored noises (Speech) -- (国際ワークショップ"Asian workshop on speech science and technology")
- Robust Noise Suppression Algorithm with the Kalman Filter Theory for White and Colored Disturbance
- Robust noise suppression algorithm using the only Kalman filter theory for white and colored noises
- A CGM APPROACH TO SUBSPACE BASED BLIND CHANNEL IDENTIFICATION
- Weight Distributions of Multi-Edge Type LDPC Codes
- Spectrum Estimation as a Problem of Finding Symmetric Positive Definite Block Toeplitz Matrices by the Hybrid Steepest Descent Method
- Factor graphs for cyclic codes with no cycles of length four
- An Optimal Design of Signal Adapted Orthonormal Wavelet by The Hybrid Steepest Descent Method
- Fourier Domain Decoding Algorithm of Non-binary LDPC Codes for Parallel Implementation
- Weight Distributions of Non-binary LDPC Codes
- Special Section on Information Theory and Its Applications
- Spatially-Coupled MacKay-Neal Codes and Hsu-Anastasopoulos Codes
- Analysis of Error Floors of Non-binary LDPC Codes over MBIOS Channel
- Analysis of Error Floors of Non-binary LDPC Codes over BEC
- Analysis of Error Floors for Non-binary LDPC Codes over General Linear Group through q-Ary Memoryless Symmetric Channels
- Simple Nonbinary Coding Strategy for Very Noisy Relay Channels
- Weight Distribution for Non-binary Cluster LDPC Code Ensemble