A low complexity branch-and-bound-based decoder for V-BLAST systems with PSK signals (Q1005785): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.sigpro.2008.08.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971242383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal lattice code decoder for fading channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closest point search in lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximum-likelihood detection and the search for the closest lattice point / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sphere-decoding algorithm I. Expected complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for tree search decoding: rediscovering the sequential decoder / rank
 
Normal rank

Latest revision as of 03:57, 29 June 2024

scientific article
Language Label Description Also known as
English
A low complexity branch-and-bound-based decoder for V-BLAST systems with PSK signals
scientific article

    Statements

    A low complexity branch-and-bound-based decoder for V-BLAST systems with PSK signals (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 March 2009
    0 references
    0 references
    space-time coding
    0 references
    multiple-input multiple-output
    0 references
    maximum likelihood detection
    0 references
    diversity
    0 references
    wireless communication
    0 references
    0 references