Project:%20IEEE%20P802.15%20Working%20Group%20for%20Wireless%20Personal%20Area%20Networks%20(WPANs)

About This Presentation

Title:

Project:%20IEEE%20P802.15%20Working%20Group%20for%20Wireless%20Personal%20Area%20Networks%20(WPANs)

Description:

Robust Ranging Algorithm for UWB Radio ... Complexity of the Proposed Algorithms. 992 op. (= 32 x 31, assuming preamble symbols is 31) ... – PowerPoint PPT presentation

Number of Views:44

Avg rating:3.0/5.0

Slides: 33

Provided by: Groupe66

Learn more at: https://grouper.ieee.org

Category:

more less

Transcript and Presenter's Notes

Title: Project:%20IEEE%20P802.15%20Working%20Group%20for%20Wireless%20Personal%20Area%20Networks%20(WPANs)

1

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) clee7_at_etri.re.kr, (2)
chonglee_at_skuniv.ac.kr
Abstract The robust ranging algorithm is
proposed for the alternative PHY for 802.15.4a
Purpose This submission is in response to the
committees 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.

2
Robust Ranging Algorithm for UWB Radio
Electronics and Telecommunications Research
Institute (ETRI) Seokyeong University Republic
of Korea
3
Outline

Proposed Algorithm
Proposed algorithm flow summary
Comparisons of complexities with MERL and I2R
Simulations for CM1
Simulations for CM8
Conclusions

4
Proposed Algorithm
TOA Estimator
5
Other Architectures for Comparison
FT RD
TOA Estimator
I2R
MERL
6
Proposed Algorithm Flow

Algorithm based High Resolution TOA

Finding the Subspace
Finding Spectrum
Finding TOA
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

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 3xNN 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
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. 992 op. ( 31 x 32)
Total operation 4064 op. ( Complexity O (N2) )
Memory size N x N N2 1024
- Complexity Ratio Proposed/MERL 8863/4064
218 -gt Two times
Sorting (3 point Median Filtering) 32
rearrange operations (Compare allocation) 9
10
Complexity of Algorithm by I2R
Algorithm Complexity N 32
Sliding Correlation NN real adds. 1024 real adds.
N/2 x N image sliding correlation x 31 chip sequences 31744 op. ( 1024 x 31)
2D to 1D conversion (Preamble symbols-1) x 31 chip sequences adds. 465 op. ( 15 x 31)
Total operation 32209 op. ( 31744465) ( Complexity O(N3) )
Memory size Preamble symbols x 31 chip sequences 496 ( 16 x 31)
- Complexity Ratio Proposed/I2R 8863/32209
27.4 -gt less than I2R
11
Simulation Parameters for CM1