Recursive GF\((2^N)\) encoders using left-circulate function for optimum PSK-TCM schemes (Q985662)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Recursive GF\((2^N)\) encoders using left-circulate function for optimum PSK-TCM schemes |
scientific article; zbMATH DE number 5764597
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recursive GF\((2^N)\) encoders using left-circulate function for optimum PSK-TCM schemes |
scientific article; zbMATH DE number 5764597 |
Statements
Recursive GF\((2^N)\) encoders using left-circulate function for optimum PSK-TCM schemes (English)
0 references
6 August 2010
0 references
recursive GF\((2^N)\) encoders
0 references
left-circulate function
0 references
Trellis-coded modulation
0 references
