On faster than Nyquist signaling: Computing the minimum distance (Q757764): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Performance bound for maximum-likelihood reception of digital data / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On computing the minimum distance for faster than Nyquist signaling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Faster-Than-Nyquist Signaling / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Upper Bound on Error Probability for Detection With Unbounded Intersymbol Interference / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4143689 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimum probability of error for asynchronous Gaussian multiple-access channels / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 15:18, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On faster than Nyquist signaling: Computing the minimum distance |
scientific article |
Statements
On faster than Nyquist signaling: Computing the minimum distance (English)
0 references
1990
0 references
Nyquist signaling
0 references
data communications
0 references