NDLI: SISO APP Searches in Lattices With Tanner Graphs

Content Provider	IEEE Xplore Digital Library
Author	Ionescu, D.M. Haidong Zhu
Copyright Year	1963
Abstract	An efficient, low-complexity, soft-output detector for general lattices is presented, based on their Tanner graph (TG) representations. Closest-point searches in lattices can be performed as nonbinary belief propagation on associated TGs; soft-information output is naturally generated in the process; the algorithm requires no backtrack (cf. classic sphere decoding), and extracts extrinsic information. A lattice's coding gain enables equivalence relations between lattice points, which can be thereby partitioned in cosets. Total and extrinsic a posteriori probabilities at the detector's output further enable the use of soft detection information in iterative schemes. The algorithm is illustrated via two scenarios that transmit a 32-point, uncoded super-orthogonal (SO) constellation for multiple-input multiple-output (MIMO) channels, carved from an 8-dimensional nonorthogonal lattice D₄⊕D₄: it achieves maximum likelihood performance in quasistatic fading; and, performs close to interference-free transmission, and identically to list sphere decoding, in independent fading with coordinate interleaving and iterative equalization and detection. Latter scenario outperforms former despite absence of forward error correction coding-because the inherent lattice coding gain allows for the refining of extrinsic information. The lattice constellation is the same as the one employed in the SO space-time trellis codes first introduced for 2 × 2 MIMO by Ionescu et al., then independently by Jafarkhani and Seshadri. Algorithmic complexity is log-linear in lattice dimensionality versus cubic in classic sphere decoders.
Sponsorship	IEEE Information Theory Society
Starting Page	2672
Ending Page	2688
Page Count	17
File Size	760000
File Format	PDF
ISSN	00189448
Volume Number	58
Issue Number	5
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-05-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Lattices Vectors Generators MIMO Decoding Constellation diagram Iterative decoding Tanner graph Belief propagation closest lattice point search complexity iterative decoder soft-output sphere decoder
Content Type	Text
Resource Type	Article
Subject	Library and Information Sciences Information Systems Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Faster Recursions in Sphere Decoding

Soft–Input Soft–Output Single Tree-Search Sphere Decoding

An Enhanced Deterministic Sequential Monte Carlo Method for Near-Optimal MIMO Demodulation With QAM Constellations

MMSE-based lattice-reduction-aided fixed-complexity sphere decoder for low-complexity near-ML MIMO detection

Soft-input soft-output lattice sphere decoder for linear channels

A computationally efficient soft-output Lattice Reduction-aided Selective Spanning Sphere Decoder for wireless MIMO systems

Improved radius selection in sphere decoder for MIMO System

Finding the Closest Lattice Point by Iterative Slicing

A Scalable VLSI Architecture for Soft-Input Soft-Output Single Tree-Search Sphere Decoding

SISO APP Searches in Lattices With Tanner Graphs

Similar Documents

Faster Recursions in Sphere Decoding

Soft–Input Soft–Output Single Tree-Search Sphere Decoding

An Enhanced Deterministic Sequential Monte Carlo Method for Near-Optimal MIMO Demodulation With QAM Constellations

MMSE-based lattice-reduction-aided fixed-complexity sphere decoder for low-complexity near-ML MIMO detection

Soft-input soft-output lattice sphere decoder for linear channels

A computationally efficient soft-output Lattice Reduction-aided Selective Spanning Sphere Decoder for wireless MIMO systems

Improved radius selection in sphere decoder for MIMO System

Finding the Closest Lattice Point by Iterative Slicing

A Scalable VLSI Architecture for Soft-Input Soft-Output Single Tree-Search Sphere Decoding

SISO APP Searches in Lattices With Tanner Graphs