Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Tight Bounds on the Minimum Euclidean Distance for Block Coded Phase Shift Keying
Blekinge Institute of Technology, Department of Telecommunications and Mathematics.
Blekinge Institute of Technology, Department of Telecommunications and Mathematics.
1996 (English)Report (Refereed)
Abstract [en]

We present upper and lower bounds on the minimum Euclidean distance $d_{Emin}(C)$ for block coded PSK. The upper bound is an analytic expression depending on the alphabet size $q$, the block length $n$ and the number of codewords $|C|$ of the code $C$. This bound is valid for all block codes with $q\geq4$ and with medium or high rate - codes where $|C|>(q/3)^n$. The lower bound is valid for Gray coded binary codes only. This bound is a function of $q$ and of the minimum Hamming distance $d_{Hmin}(B)$ of the corresponding binary code $B$. We apply the results on two main classes of block codes for PSK; Gray coded binary codes and multilevel codes. There are several known codes in both classes which satisfy the upper bound on $d_{Emin}(C)$ with equality. These codes are therefore best possible, given $q,n$ and $|C|$. We can deduce that the upper bound for many parameters $q,n$ and $|C|$ is optimal or near optimal. In the case of Gray coded binary codes, both bounds can be applied. It follows for many binary codes that the upper and the lower bounds on $d_{Emin}(C)$ coincide. Hence, for these codes $d_{Emin}(C)$ is maximal.

Place, publisher, year, edition, pages
1996.
Series
Blekinge Tekniska Högskola Forskningsrapport, ISSN 1103-1581 ; 15
Keyword [en]
Block codes, phase shift keying, minimum Euclidean distance, multilevel codes, coded modulation, Gray code, non-linear codes.
National Category
Mathematical Analysis Telecommunications
Identifiers
URN: urn:nbn:se:bth-00032Local ID: oai:bth.se:forskinfo7D38723D4E550CDCC12568A3002CA9A4OAI: oai:DiVA.org:bth-00032DiVA: diva2:833698
Note
This is a revised version of the printed Research Report 15/96. Magnus Nilsson is assistant professor in telecommunications, Univ. of Kalmar, Sweden.Available from: 2015-06-25 Created: 2000-03-15 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(217 kB)103 downloads
File information
File name FULLTEXT01.pdfFile size 217 kBChecksum SHA-512
be98459c13c7294ce0b115d66b6ac18dea24158c3150b347fd202722da5160b15737b9c3ba1be4d5dcbbffadcb0a721260406c8fa41414fe9cabd5d4feab7104
Type fulltextMimetype application/pdf

Other links

http://traveler.bth.se/fou/forskinfo.nsf/all/7d38723d4e550cdcc12568a3002ca9a4/$file/STG44714http://traveler.bth.se/fou/forskinfo.nsf/all/7d38723d4e550cdcc12568a3002ca9a4/$file/STG38246

Search in DiVA

By author/editor
Lennerstad, Håkan
By organisation
Department of Telecommunications and Mathematics
Mathematical AnalysisTelecommunications

Search outside of DiVA

GoogleGoogle Scholar
Total: 103 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 131 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf