July. 2005 C. Lee, J. Kim, E. Choi, C. Lee doc.: IEEE 802. 15-05-0426- 01-004a Submiss ion Slide 1 Project: IEEE P802.15 Working Group for Wireless Personal Area Project: IEEE P802.15 Working Group for Wireless Personal Area Networks (WPANs) Networks (WPANs) Submission Title: [Robust Ranging Algorithm for UWB radio] Date Submitted: [19 July, 2005] Source: [Cheolhyo Lee (1), Jae Young Kim (1), Eun Chang Choi (1), Chong Hyun Lee (2)] Company [(1) Electronics and Telecommunications Research Institute (ETRI) (2) Seokyeong University] Address [(1) 161 Gajeong-dong, Yuseong-gu, Daejeon, Republic of Korea (2) 16-1 Jungneung-Dong, Sungbuk-Ku, Seoul, Republic of Korea] Voice:[(1) +82 42 860 5577, (2) +82 2 940 7472], FAX: [(1) +82 42 860 5218 (2) +82 2 919 0345] E-Mail: [(1) [email protected], (2) [email protected]] Abstract: [The robust ranging algorithm is proposed for the alternative PHY for 802.15.4a] Purpose: [This submission is in response to the committee’s request to submit the proposal enabled by an alternate 802.15 TG4a PHY] Notice: This document has been prepared to assist the IEEE P802.15. It is offered as a basis for discussion and is not binding on the contributing individual(s) or organization(s). The material in this document is subject to change in form and content after further study. The contributor(s) reserve(s) the right to add, amend or withdraw material contained herein. Release: The contributor acknowledges and accepts that this
32
Embed
July. 2005 C. Lee, J. Kim, E. Choi, C. Lee doc.: IEEE 802. 15-05-0426-01-004a Submission Slide 1 Project: IEEE P802.15 Working Group for Wireless Personal.
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
July. 2005
C. Lee, J. Kim, E. Choi, C. Lee
doc.: IEEE 802. 15-05-0426-01-004a
Submission
Slide 1
Project: IEEE P802.15 Working Group for Wireless Personal Area Networks (WPANs)Project: IEEE P802.15 Working Group for Wireless Personal Area Networks (WPANs)
Submission Title: [Robust Ranging Algorithm for UWB radio]Date Submitted: [19 July, 2005]Source: [Cheolhyo Lee (1), Jae Young Kim (1), Eun Chang Choi (1), Chong Hyun Lee (2)] Company [(1) Electronics and Telecommunications Research Institute (ETRI) (2) Seokyeong University]Address [(1) 161 Gajeong-dong, Yuseong-gu, Daejeon, Republic of Korea (2) 16-1 Jungneung-Dong, Sungbuk-Ku, Seoul, Republic of Korea]Voice:[(1) +82 42 860 5577, (2) +82 2 940 7472], FAX: [(1) +82 42 860 5218 (2) +82 2 919 0345]E-Mail: [(1) [email protected], (2) [email protected]]Abstract: [The robust ranging algorithm is proposed for the alternative PHY for 802.15.4a] Purpose: [This submission is in response to the committee’s request to submit the proposal enabled by an alternate 802.15 TG4a PHY]Notice: This document has been prepared to assist the IEEE P802.15. It is offered as a basis for discussion and is not binding on the contributing individual(s) or organization(s). The material in this document is subject to change in form and content after further study. The contributor(s) reserve(s) the right to add, amend or withdraw material contained herein.Release: The contributor acknowledges and accepts that this contribution becomes the property of IEEE and may be made publicly available by P802.15.
July. 2005
C. Lee, J. Kim, E. Choi, C. Lee
doc.: IEEE 802. 15-05-0426-01-004a
Submission
Slide 2
Robust Ranging Algorithm for UWB Radio
Electronics and Telecommunications Research Institute (ETRI)
Seokyeong University
Republic of Korea
July. 2005
C. Lee, J. Kim, E. Choi, C. Lee
doc.: IEEE 802. 15-05-0426-01-004a
Submission
Slide 3
• Proposed Algorithm• Proposed algorithm flow & summary• Comparisons of complexities with MERL and
I2R• Simulations for CM1• Simulations for CM8• Conclusions
Outline
July. 2005
C. Lee, J. Kim, E. Choi, C. Lee
doc.: IEEE 802. 15-05-0426-01-004a
Submission
Slide 4
Proposed Algorithm
TOA Estimator
BPF
( )2
LPF / 1-4ns
integrator
ADC
Add few Frames & Compute Energy
FFT
Convert Time to Frequency
High Resolution Algorithm
SNR IncreaseCompute Energy
July. 2005
C. Lee, J. Kim, E. Choi, C. Lee
doc.: IEEE 802. 15-05-0426-01-004a
Submission
Slide 5
Other Architectures for Comparison
TOA Estimator
BPF
( )2
LPF / 2-4ns
integrator
ADC 1D to 2D Conversion
Length-3 Vertical Median or Minimum Filtering
Removes interference
2D to 1D Conversion with Energy Combining
Energy image generation
"Path-arrival dates" table
1D to 2D Conversion
Assumption path synchronization
Matrix
Filtering + Assumption/path
selectionTime base 1-2ns accuracy
Time stamping
Analog comparator
Sliding Correlator
Energy combining across symbols
interference suppression
1D-2D Conversion
2D-1D Conversion
Energy image generation
Bipolar template
MERL
I2R
FT R&D
July. 2005
C. Lee, J. Kim, E. Choi, C. Lee
doc.: IEEE 802. 15-05-0426-01-004a
Submission
Slide 6
Finding the Subspace
Finding Spectrum
Finding TOA
Proposed Algorithm Flow
• Algorithm based High Resolution TOA
July. 2005
C. Lee, J. Kim, E. Choi, C. Lee
doc.: IEEE 802. 15-05-0426-01-004a
Submission
Slide 7
Proposed Algorithm Summary
• Required Operation:– Correlation
– FFT
– Comparison
• Complexity (N: No. of Energy Block)– R: N point Correlation
– FFT: N point FFT
– Noise Subspace: N point scalar and vector multiplication
– Peak Finding: N point comparison
July. 2005
C. Lee, J. Kim, E. Choi, C. Lee
doc.: IEEE 802. 15-05-0426-01-004a
Submission
Slide 8
Complexity of the Proposed Algorithms Algorithm Complexity N = 32
Accumulation of signals
(Preamble symbols-1) x 31 chip sequences adds.
992 op. (= 32 x 31, assuming preamble symbols is 31)
N point FFT
(Two FFTs)
2x(N/2)log2N complex mults.
2xNlog2N complex additions
960 op. (=2x80 complex mults= 2x4x80 real mults. + 2x2x80 real adds.)
640 op. (= 2x160 complex adds. = 2x320 real adds.)
Correlation 3xN*N real multiplication
3xN*(N-1) real addition
3072 op. (=3x1024 real mults.)
2976 op. (= 3x992 real adds.)
Subspace N complex multiplication 192 op.
(=128 real mults. + 64 real adds.)
Finding Peaks N-1 Comparison 31 comparisons
Total Operations 8863 op. ( Complexity O(N2) )
Memory size N 32
July. 2005
C. Lee, J. Kim, E. Choi, C. Lee
doc.: IEEE 802. 15-05-0426-01-004a
Submission
Slide 9
Complexity of Algorithm by MERL
Algorithm Complexity N = 32
N x N image* (N x N) x 3
rearrange operations
3072 op. (= 32 x 32 x 3)
2D to 1D conversion (Preamble symbols-1) x 31 chip sequences adds.