Koc University Digital Collections
metadata only
Optimum low-complexity decoder for ppatial modulation
In this paper, a novel low-complexity detection algorithm for spatial modulation (SM), referred to as the minimum-distance of maximum-length (m-M) algorithm, is proposed and analyzed. The proposed m-M algorithm is a smart searching method that is applied for the SM tree-search decoders. The behavior
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- RTP Payload Format for H.264 Reduced-Complexity Decoding Operation (RCDO) Video#501364
- Method Optimization for the Quantification of the NAD#1074693
- Complexity#743635
- Analytical Framework of Radial Resolution for Near-Field Communications#1064277
- CVE-2026-100661 — HIGH 8.7#1107816
Record · ID 955796
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive