Presentation 2009-01-23
A location estimetion in 3-D space on Viterbi Algorithm
Takeharu kohri,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) I have developed a novel location estimation method that is based on the Viterbi algorithm. Using this method enables us to estimate the most likely location at several 10 nsec by using past location transition and signal detection. In addition, the system implementing this method can be composed of a single LSI. Since the Viterbi algorithm has two functions, signal detection from noisy received signal and finding a maximum likelihood sequence path, this method can be applied to location estimation. The level of the received signal is proportional to the distance between the move terminal and the fixed node. The trellis of Viterbi decoder encoder is similar to the track of move terminal. The Viterbi algorithm has no backward search such as Fano algorithm, so the time needed for detection is fixed and short. The scale of the execution circuit is reduced with the truncation path memory because of the survivor path selection.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Location Estimation / Viterbi algorithm / Maximum likelihood
Paper # MoMuC2008-82
Date of Issue

Conference Information
Committee MoMuC
Conference Date 2009/1/15(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Mobile Multimedia Communications(MoMuC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A location estimetion in 3-D space on Viterbi Algorithm
Sub Title (in English)
Keyword(1) Location Estimation
Keyword(2) Viterbi algorithm
Keyword(3) Maximum likelihood
1st Author's Name Takeharu kohri
1st Author's Affiliation Shizuoka Institute of Science and Technology()
Date 2009-01-23
Paper # MoMuC2008-82
Volume (vol) vol.108
Number (no) 398
Page pp.pp.-
#Pages 6
Date of Issue