Fast Acquisition of PN Sequences in DS-CDMA Systems with Incoherent Demodulator(Wireless Communication Technologies)
スポンサーリンク
概要
- 論文の詳細を見る
DS-CDMA systems employing long-period PN sequences are becoming a widespread standard of wireless communication systems. However, fast acquisition of long-period PN sequences at a low hardware cost is conventionally a difficult problem. This paper examines a recently proposed fast acquisition algorithm for a class of PN sequences, which includes m and GMW sequences as special cases, under conditions of unknown received RF phase and chip boundary timing. The result shows that under low input (chip) SNR and the required delay estimation accuracy of T_c/Δ, Δ=2,3,…, the mean acquisition time can be considerably reduced compared to other known representative acquisition schemes. Its fast acquisition capability is based on a decomposition of long PN sequences into a number of short ones and achieves a significantly reduced code phase uncertainty of acquisition at relatively small hardware cost, estimated as 2/3 of the equivalent parallel correlators system. It can be applied as a (part of) acquisition scheme of a DS-CDMA system instead of a slow sliding correlator or a costly matched filter schemes.
- 社団法人電子情報通信学会の論文
- 2006-12-01
著者
-
Sakaniwa Kohichi
Department Of Communications And Integrated Systems Graduate School Of Science And Engineering Tokyo
-
Sakaniwa Kohichi
Tokyo Inst. Of Technol. Tokyo Jpn
-
Sakaniwa Kohichi
The Dept. Of Electrical And Electronic Eng. Tokyo Institute Of Technology
-
BYCHENKOV Sergei
Department of Communications and Integrated Systems, Graduate School of Science and Engineering, Tok
-
MIKHAILOV Vladimir
Department of Radio Electronic Systems & Mobile Communications, Moscow State Aviation Institute
-
Sakaniwa Kohichi
Departmen Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Mikhailov Vladimir
Department Of Radio Electronic Systems & Mobile Communications Moscow State Aviation Institute
-
Sakaniwa K
Dept. Of Communications & Integrated Systems Tokyo Institute Of Technology
-
Bychenkov Sergei
Department Of Communications And Integrated Systems Graduate School Of Science And Engineering Tokyo
関連論文
- 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-6-2 Modified Cancellation for Non-Binary LDPC Codes
- A Super Resolution Reconstruction of MPEG Compressed Video Sequences
- Extended Symbol-Aided Estimation for Non-selective Rayleigh Fading Channels
- An Analysis of a 16QAM System Using Extended Symbol-Aided Estimation under Rician Fading Channels
- 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)
- An Associative Memory Neural Network to Recall Nearest Pattern from Input
- 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)
- Multi-edge type LDPC code ensembles with exponentially few codewords of linear small weight (情報理論)
- A note on analytical solution of covariance evolution for regular LDPC codes (情報理論)
- Performance Analysis of LDPC Code Ensembles with Support Weight Distribution
- A-6-1 Design of Irregular LDPC Codes with Uniform Check Node Degree Distributions
- Design of IRA codes with Joint Degree Distributions
- Stopping Set Distributions of IRA and IRA Type LDPC Code Ensembles
- Detailedly Represented Irregular Low-Density Parity-Check Codes(Coding Theory)(Information Theory and Its Applications)
- A Fast Blind Multiple Access Interference Reduction in DS/CDMA Systems Based on Adaptive Projected Subgradient Method(Signal Processing for Communications)(Digital Signal Processing)
- Iterative Decoding Based on the Concave-Convex Procedure(Coding Theory)
- Justesen-Type Modified Expander Codes and Their Decoding Algorithm(Coding Theory, Information Theory and Its Applications)
- On the Performance of Algebraic Geometric Codes
- A Note on Robust Adaptive Volterra Filtering Based on Parallel Subgradient Projection Techniques(Digital Signal Processing)
- A Lower Bound for Generalized Hamming Weights and a Condition for t-th Rank MDS
- Some Classes of Quasi-Cyclic LDPC Codes : Properties and Efficient Encoding Method(Coding Theory)
- Construction of Cyclic Codes Suitable for Iterative Decoding via Generating Idempotents
- Improvement of Extended Symbol-Aided Estimation for Rayleigh Fading Channels (Special Section on Information Theory and Its Applications)
- Rate-Compatible Non-Binary LDPC Codes for Rate Adaptive Systems
- Special Section on Information Theory and Its Applications
- Analysis of Stopping Constellation Distribution for Irregular Non-binary LDPC Code Ensemble
- Design and Performance of Rate-Compatible Non-binary LDPC Convolutional Codes
- Spatially Coupled Protograph-Based LDPC Codes for Decode-and-Forward in Erasure Relay Channel