This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
en:projects:details:har01 [2009/06/05 10:24] cronie |
en:projects:details:har01 [2009/06/05 23:13] cangiani |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | === Low-Density Lattice Codes === | ||
| - | Low-density parity-check (LDPC) codes are able to achieve a near-capacity performance on several binary channels for acceptable decoding complexity. LDPC codes are linear codes which can be decoded with a sub-optimal algorithm on a sparse graph. | ||
| - | |||
| - | For channels with an Euclidean input space, continuous alphabet codes might be more appropriate. Lattice codes are the Euclidean space analog of linear codes. In this project the goal is to analyze and design low-density lattice codes for the additive white Gaussian noise channel. | ||
| - | |||
| - | The project is suitable for students with a theoretical and practical interest. | ||
| - | |||
| ---- dataentry project ---- | ---- dataentry project ---- | ||
| title : Low-Density Lattice Codes | title : Low-Density Lattice Codes | ||
| Line 23: | Line 16: | ||
| template:datatemplates:project | template:datatemplates:project | ||
| ---- | ---- | ||
| + | |||
| + | Low-density parity-check (LDPC) codes are able to achieve a near-capacity | ||
| + | performance on several binary channels for acceptable decoding complexity. | ||
| + | LDPC codes are linear codes which can be decoded with a sub-optimal algorithm on a sparse graph. | ||
| + | |||
| + | For channels with an Euclidean input space, continuous alphabet codes | ||
| + | might be more appropriate. Lattice codes are the Euclidean space analog | ||
| + | of linear codes. In this project the goal is to analyze and design low-density | ||
| + | lattice codes for the additive white Gaussian noise channel. | ||
| + | |||
| + | The project is suitable for students with a theoretical and practical interest. | ||
| + | |||
| + | |||