Change search
Refine search result
1 - 2 of 2
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • 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
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1. Cresp, Gregory
    et al.
    Dam, Hai Huyen
    Zepernick, Hans-Jürgen
    Design of Sequence Family Subsets Using a Branch and Bound Technique2009In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 55, no 8, p. 3847-3857Article in journal (Refereed)
    Abstract [en]

    The number of spreading sequences required for Direct Sequence Code Division Multiple Access (DS-CDMA) systems depends on the number of simultaneous users in the system. Often a sequence family provides more sequences than are required; in many cases the selection of the employed sequences is a computationally intensive task. This selection is a key consideration, as the properties of the sequences assigned affect the error performance in the system. In this paper, a branch and bound algorithm is presented to perform this selection based on two different cost functions. Numerical results are presented to demonstrate the improved performance of this algorithm over previous work.

  • 2. Nilsson, Magnus
    et al.
    Lennerstad, Håkan
    An upper bound on the minimum Euclidean distance for block-coded phase-shift keying2000In: IEEE Transactions on Information Theory, ISSN 0018-9448, E-ISSN 1557-9654, Vol. 46, no 2, p. 656-662Article in journal (Refereed)
    Abstract [en]

    We present an upper bound on the minimum Euclidean distance d_{Emin}(C) valid for any linear and non-linear block coded PSK. There are several well known block codes that satisfy this upper bound with equality. With given parameters; the alphabet size q, the blocklength n and the number of codewords |C|, it therefore follows that these codes are best possible in terms of minimum Euclidean distance. We furthermore establish a lower bound valid for Gray coded binary block codes. The minimum Euclidean distance is bounded from below by the minimum Hamming distance of the corresponding binary code. For several Gray coded binary block codes the upper and the lower bounds coincide. It can then be concluded without calculating the minimum Euclidean distance that these codes are best possible.

1 - 2 of 2
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • harvard1
  • 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