Filippo Tosato
Research Subjects
Filippo Tosato has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
Magnus Sandell
Toshiba Research Europe, Telecommunications Research Laboratory, Bristol, U.K.
1 shared publication- Magnus Sandell
Bristol Research and Innovation Laboratory, Toshiba Research Europe Ltd., Bristol, U.K.
1 shared publication Makoto Tanahashi
Toshiba Research and Development Center, 1 Komukai-Toshiba-cho, Kawasaki 212-8582 Japan
1 shared publication
Latest Publications
- 1 May 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Tone reservation for PAPR reduction: An optimal approach through sphere encoding
Tone reservation (TR) is a well-known and practical strategy to reduce peak-to-average power ratio (PAPR) in OFDM signals. In TR some unused or reserved subcarriers are used to accommodate a peak-cancelling signal that lowers the PAPR of the time domain OFDM signal. Several methods have been proposed to optimise the peak-cancelling signal, amongst which the so called active-set method has been shown to converge very quickly to a minimum PAPR solution for a real baseband signal with no additional power constraints. However, for a general complex baseband signal and/or when the peak-cancelling signal has to be power limited, there is no guarantee of optimality. Moreover, in the complex baseband model, the TR optimisation problem is a quadratically constrained quadratic program (QCQP), which has a prohibitive computational cost. In this paper we introduce a tree-search approach to designing the TR signal based on the sphere decoding/encoding principle. The method is proved to provide the minimum PAPR solution in the limit of fine lattice quantisation. Simulation results show a significant margin of improvement over the best known active-set method.
- 1 May 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Tone reservation for PAPR reduction: An optimal approach through sphere encoding
Tone reservation (TR) is a well-known and practical strategy to reduce peak-to-average power ratio (PAPR) in OFDM signals. In TR some unused or reserved subcarriers are used to accommodate a peak-cancelling signal that lowers the PAPR of the time domain OFDM signal. Several methods have been proposed to optimise the peak-cancelling signal, amongst which the so called active-set method has been shown to converge very quickly to a minimum PAPR solution for a real baseband signal with no additional power constraints. However, for a general complex baseband signal and/or when the peak-cancelling signal has to be power limited, there is no guarantee of optimality. Moreover, in the complex baseband model, the TR optimisation problem is a quadratically constrained quadratic program (QCQP), which has a prohibitive computational cost. In this paper we introduce a tree-search approach to designing the TR signal based on the sphere decoding/encoding principle. The method is proved to provide the minimum PAPR solution in the limit of fine lattice quantisation. Simulation results show a significant margin of improvement over the best known active-set method.
- 8 July 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 60 (9) , 5304-5314
Irregular MDS Array Codes
In this paper, we extend the concept of maximum-distance separable (MDS) array codes to a larger class of codes, where the array columns contain a variable number of data and parity symbols and the codewords cannot be arranged, in general, in a regular array structure with equal column length. These new codes, named irregular MDS array codes, find applications in problems of distributed data storage with multiple sources of information generating data at unequal rates. We solve the problem of finding optimal parity symbol allocations that achieve minimum redundancy for a given level of protection against block erasures. We provide a classification of irregular MDS array codes according to the parameters of their parity symbol allocation and we show how regular MDS array codes are a special case of this wider class. We derive necessary and sufficient conditions for such irregular array codes to be MDS and extend the concept of the lowest density generator matrix. Finally, we show how a simple constructive method allows to design irregular lowest density MDS array codes with alphabet size independent of the size of the array columns.
- 8 July 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 60 (9) , 5304-5314
Irregular MDS Array Codes
In this paper, we extend the concept of maximum-distance separable (MDS) array codes to a larger class of codes, where the array columns contain a variable number of data and parity symbols and the codewords cannot be arranged, in general, in a regular array structure with equal column length. These new codes, named irregular MDS array codes, find applications in problems of distributed data storage with multiple sources of information generating data at unequal rates. We solve the problem of finding optimal parity symbol allocations that achieve minimum redundancy for a given level of protection against block erasures. We provide a classification of irregular MDS array codes according to the parameters of their parity symbol allocation and we show how regular MDS array codes are a special case of this wider class. We derive necessary and sufficient conditions for such irregular array codes to be MDS and extend the concept of the lowest density generator matrix. Finally, we show how a simple constructive method allows to design irregular lowest density MDS array codes with alphabet size independent of the size of the array columns.