NDLI: Efficient, nearly optimum addressing schemes based on partitioning the constellation into the union of blocks

Content Provider	IEEE Xplore Digital Library
Author	Khandani, A.K. Kabal, P.
Copyright Year	1993
Description	Author affiliation: INRS-Telecommun., Verdun, Que., Canada (Khandani, A.K.; Kabal, P.)
Abstract	Two efficient addressing schemes for the nearly optimum shaping of multi-dimensional signal spaces are introduced. Using K concentric circles, the 2-D subspaces are partitioned into shells of equal volume. The 2-D shells are indexed in the radial direction from zero to K-1. The average energy of a 2-D shell is proportional to its index plus a fixed offset. In an N = 2n-D space, K/sup n/ shaping clusters of equal volume are obtained. Shaping is achieved by selecting T /spl les/ K/sup n/ of the N-D clusters with the least average energy (least sum of the 2-D indices). This results in a set of T integer n-tuples with components in the range [0, K-1] and the sum of the components being at most a given number L/sub max/. The problem of addressing is to find a one-to-one mapping between the set of these n-tuples and the set of the integers [0, T - 1] such that the mapping and its inverse can be easily implemented. In the proposed schemes, the N-D clusters are grouped into blocks such that the addressing within the blocks, which is achieved using a common algorithm for all the blocks, has a low complexity.<>
Starting Page	1076
Ending Page	1080
File Size	555005
Page Count	5
File Format	PDF
ISBN	0780309502
DOI	10.1109/ICC.1993.397443
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1993-05-23
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Constellation diagram Business Two dimensional displays Clustering algorithms Computational complexity Data communication Hypercubes Power engineering and energy Councils Table lookup
Content Type	Text
Resource Type	Article

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

An efficient block-based addressing scheme for the nearly optimum shaping of multidimensional signal spaces

Efficient, Nearly Optimum Addressing Schemes Based on Partitioning the Constellation into the Union of Blocks

Shaping of multidimensional signal constellations using a lookup table

Efficient addressing of multi-dimensional signal constellations using a lookup table.

An efficient addressing scheme for shaping of multi-dimensional signal constellations using a lookup table

Shaping of multi-dimensional signal constellations using a lookup table

Shaping of multi-dimensional signal constellations using a lookup table.

Using two-stage Approach to Clustering

Efficient output-pruning of the 2-D FFT algorithm

Efficient, nearly optimum addressing schemes based on partitioning the constellation into the union of blocks

Similar Documents

An efficient block-based addressing scheme for the nearly optimum shaping of multidimensional signal spaces

Efficient, Nearly Optimum Addressing Schemes Based on Partitioning the Constellation into the Union of Blocks

Shaping of multidimensional signal constellations using a lookup table

Efficient addressing of multi-dimensional signal constellations using a lookup table.

An efficient addressing scheme for shaping of multi-dimensional signal constellations using a lookup table

Shaping of multi-dimensional signal constellations using a lookup table

Shaping of multi-dimensional signal constellations using a lookup table.

Using two-stage Approach to Clustering

Efficient output-pruning of the 2-D FFT algorithm

Efficient, nearly optimum addressing schemes based on partitioning the constellation into the union of blocks