An algorithm to design prescribed length codes for single-tracked shaft encoders

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/8428

dc.contributor	Universitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.contributor	Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III
dc.contributor	Universitat Politècnica de Catalunya. Departament d'Enginyeria de Sistemes, Automàtica i Informàtica Industrial
dc.contributor	Universitat Politècnica de Catalunya. MD - Matemàtica Discreta
dc.contributor	Universitat Politècnica de Catalunya. GRINS - Grup de Recerca en Robòtica Intel·ligent i Sistemes
dc.contributor	Universitat Politècnica de Catalunya. LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge
dc.contributor.author	Balle Pigem, Borja de
dc.contributor.author	Ventura Capell, Enric
dc.contributor.author	Fuertes Armengol, José Mª
dc.date	2009-04-14
dc.identifier.citation	B. Balle; Ventura, E.; Fuertes, J. An algorithm to design prescribed length codes for single-tracked shaft encoders. A: IEEE International Conference on Mechatronics. "ICM 2009". Màlaga: 2009, p. 1-6.
dc.identifier.citation	978-1-4244-4194-5
dc.identifier.citation	10.1109/ICMECH.2009.4957199
dc.identifier.uri	http://hdl.handle.net/2117/8428
dc.language.iso	eng
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Informàtica::Enginyeria del software
dc.subject	Binary sequences
dc.subject	Codes
dc.subject	Seqüenciació
dc.title	An algorithm to design prescribed length codes for single-tracked shaft encoders
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/conferenceObject
dc.description.abstract	Abstract-Maximal-length binary shift register sequences have been known for a long time. They have many interesting properties, one of them is that when taken in blocks of n consecutive positions they form 2n - 1 different codes in a closed circular sequence. This property can be used for measuring absolute angular positions as the circle can be divided in as many parts as different codes can be retrieved. This paper describes how a closed binary sequence with arbitrary length can be effectively designed with the minimal possible block-length, using linear feedback shift registers (LFSR). Such sequences can be used for measuring a specified exact number of angular positions, using the minimal possible number of detectors allowed by linear methods.

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author