The spiral search: a linear complexity algorithm for the generation of convex MIMO instruction-set extensions

C Galuzzi, K Bertels, S Vassiliadis

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

6 Citations (Scopus)

Original language	Undefined/Unknown
Title of host publication	ICFPT 2007
Editors	Andy Ye Takeshi Ikenaga Hideharu Amano
Publisher	s.l.
Pages	337-340
Number of pages	4
ISBN (Print)	978-1-4244-1472-7
Publication status	Published - 2007

Name
Publisher	s.l.

NEO

Keywords

@inproceedings{0b56104f804f4318a73895cfa529deda,

title = "The spiral search: a linear complexity algorithm for the generation of convex MIMO instruction-set extensions",

keywords = "conference contrib. refereed, Conf.proc. > 3 pag",

author = "C Galuzzi and K Bertels and S Vassiliadis",

note = "NEO",

year = "2007",

language = "Undefined/Unknown",

isbn = "978-1-4244-1472-7",

publisher = "s.l.",

pages = "337--340",

editor = "{Takeshi Ikenaga Hideharu Amano}, {Andy Ye}",

booktitle = "ICFPT 2007",

}

TY - GEN

T1 - The spiral search: a linear complexity algorithm for the generation of convex MIMO instruction-set extensions

AU - Galuzzi, C

AU - Bertels, K

AU - Vassiliadis, S

N1 - NEO

PY - 2007

Y1 - 2007

KW - conference contrib. refereed

KW - Conf.proc. > 3 pag

M3 - Conference contribution

SN - 978-1-4244-1472-7

SP - 337

EP - 340

BT - ICFPT 2007

A2 - Takeshi Ikenaga Hideharu Amano, Andy Ye

PB - s.l.

ER -