We present two new nonlinearity tolerant modulation formats at spectral efficiencies lower than 4bits/4D-symbol, obtained using a simplified bit-to-symbol mapping approach to set-partition PDM-QPSK in 8 dimensions. OCIS codes: (060.4080) Modulation; (060.1660) Coherent Communications; (190.4370) Nonlinear Optics, Fibers.

In this paper, we propose a new method called coset partitioning to generate easily and efficiently the best space-time trellis codes (STTCs), thereby reducing considerably the usual important search time. This method, used in the case of 2-PSK STTCs, is an extension of the set partitioning proposed by Ungerboeck based on the coset and lattice Calderbank’s approach. The main guideline of the co...

In this paper we study the following problem: how to divide a cake among the children attending a birthday party such that all the children get the same amount of cake and the same amount of icing. This leads us to the study of the following. A perfect k-partitioning of a convex set S is a partitioning of S into k convex pieces such that each piece has the same area and 1 k of the perimeter of ...

We present an 8-dimensional trellis-coded 8PSK with a symbol transition constraint that is similar to that of =4-shift quadrature phase shift keying(QPSK). This scheme can achieve a coding gain of 1.6 to 2.4 dB at the same rate of =4shift QPSK on Gaussian channel, and it has also an immunity against the integer multiples of 90 phase ambiguities. In order to label the constellation of the propos...

In this work, we present the applications of three-dimensional set partitioning methods to the sequence of still color images. The set partitioning methods we use in this paper are SPIHT, a state-of-the-art encoder and SPECK, a more recently developed, low complexity encoder. The three-dimensional versions of these methods are based on the observation that the sequences of images are contiguous...

In the Complete Set Partitioning problem we are given a finite set of elements where every subset is associated with avalue, and the goal is to partition this set into disjoint subsets so as to maximise the sum of subset values. This abstractproblem captures theCoalition Structure Generation problem in cooperative games in characteristic function form, whereeach subset, or coali...

Column generation is often used to solve problems involving set-partitioning constraints, such as vehicle-routing and crew-scheduling problems. When these constraints are in large numbers and the columns have on average more than 8–12 nonzero elements, column generation often becomes inefficient because solving the master problem requires very long solution times at each iteration due to high d...

The hypergraph partitioning problem has many applications in scientific computing and provides a more accurate inter-processor communication model for distributed systems than the equivalent graph problem. In this paper, we propose a sequential multi-level hypergraph partitioning algorithm. The algorithm makes novel use of the technique of rough set clustering in categorising the vertices of th...

In this paper we study the following problem: how to divide a cake among the children attending a birthday party such that all the children get the same amount of cake and the same amount of icing. This leads us to the study of the following. A perfect k-partitioning of a convex set S is a partitioning of S into k convex pieces such that each piece has the same area and 1 k of the perimeter of ...