Name
Abstract | ||
|---|---|---|
A new class of spherical codes is constructed by selecting a finite subset of flat tori that foliate the unit sphere S2L-1 ⊂ R2L and constructing a structured codebook on each torus in the finite subset. The codebook on each torus is the image of a lattice restricted to a specific hyperbox in RL. Group structure and homogeneity, useful for efficient decoding, are inherited from the underlying lattice codebook. Upper and lower bounds on performance are derived and a systematic search algorithm is presented for constructing optimal codebooks. The torus layer spherical codes presented here exhibit good performance when compared to the well known apple-peeling, wrapped and laminated codes. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ISIT.2009.5205529 | Seoul |
Keywords | Field | DocType |
torus layer spherical code,finite subset,structured codebook,group structure,efficient decoding,spherical code,good performance,laminated code,underlying lattice codebook,flat torus,decoding,upper and lower bounds,codes,search algorithm | Discrete mathematics,Combinatorics,Sequential decoding,Search algorithm,Linde–Buzo–Gray algorithm,Lattice (order),Upper and lower bounds,Torus,Mathematics,Codebook,Unit sphere | Conference |
ISBN | Citations | PageRank |
978-1-4244-4313-0 | 4 | 0.47 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cristiano Torezzan | 1 | 7 | 3.65 |
| Sueli I. R. Costa | 2 | 21 | 8.66 |
| Vinay A. Vaishampayan | 3 | 367 | 43.11 |