Remote sensing satellites allow continuous information acquisition from large areas of the earth and have been intensively applied in a number of applications, from agriculture to defense. A major challenge in remote sensing is that satellite communication systems present bandwidth restrictions and several issues typical of time-variant channels, which justifies the need for signal coding techniques. In that sense, this letter proposes an unequal error protection method for aerospace applications using the recommendations for source and channel coding created by the Consultative Committee for Space Data System (CCSDS) as frameworks. The proposed method makes use of the CCSDS-recommended convolutional code to ensure a channel coding step as low complex as possible, which allows implementation in a wide range of embedded platforms. This letter exploits the natural data division delivered by the compressor to unequally protect the information. The proposed method, which relies on a multiobjective optimization problem, allows one to find rate arrangements that minimize the distortion of the received image for a given value of an average coding rate within a granular range. The system performance is evaluated over an additive white Gaussian noise channel model. The obtained results show that the proposed method presents several advantages over an equal error protection strategy, and paves the way for scenarios with stringent energy and bandwidth constraints.

In this paper, we consider the problem of transmitting a continuous alphabet discrete-time source over an additive white Gaussian noise channel in the bandwidth expansion case. We propose a constructive scheme based on a set of curves on the surface of a 2N-dimensional sphere. Our approach shows that the design of good codes for this communication problem relies on geometrical properties of spherical codes and projections of N-dimensional rectangular lattices. Theoretical comparisons with some previous works in terms of the mean squared error as a function of the channel SNR, as well as simulations, are provided.

A new class of spherical codes is constructed by selecting a finite subset of flat tori from a foliation of the unit sphere S2L-1⊂ R2Land designing a structured codebook on each torus layer. The resulting spherical code can be the image of a lattice restricted to a specific box in RLin each layer. Group structure and homogeneity, useful for efficient storage and decoding, are inherited from the underlying lattice codebook. A systematic method for constructing such codes are presented as well some examples of constructions. Upper and lower bounds on the performance, the asymptotic packing density and a method for decoding are derived.

In this paper we consider the problem of transmitting a continuous alphabet discrete-time source over an AWGN channel. The design of good curves for this purpose relies on geometrical properties of spherical codes and projections of N-dimensional lattices. We propose a constructive scheme based on a set of curves on the surface of a 2N-dimensional sphere and present comparisons with some previous works.

A new class of spherical codes is constructed by selecting a finite subset of flat tori that foliate the unit sphere S2L-1sub R2Land constructing a structured codebook on each torus in the finite subset. The codebook on each torus is the image of a lattice restricted to a specific hyperbox in RL. Group structure and homogeneity, useful for efficient decoding, are inherited from the underlying lattice codebook. Upper and lower bounds on performance are derived and a systematic search algorithm is presented for constructing optimal codebooks. The torus layer spherical codes presented here exhibit good performance when compared to the well known apple-peeling, wrapped and laminated codes.