Tony Ottosson

Tony Ottosson

Auto-generated profile, based on publicly available information

Tony Ottosson

Department of Signals and Systems, Chalmers University of Technology, Göteborg, Sweden

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2000 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
GBG.E. Bottomley
G.E. Bottomley
TOT. Ottosson
T. Ottosson
YWY.-P.E. Wang
Y.-P.E. Wang
Currently, a global third-generation cellular system based on code-division multiple-access (CDMA) is being developed with a wider bandwidth than existing second-generation systems. The wider bandwidth provides increased multipath resolution in a time-dispersive channel, leading to higher frequency-selectivity. A generalized RAKE receiver for interference suppression and multipath mitigation is proposed. The receiver exploits the fact that time dispersion significantly distorts the interference spectrum from each base station in the downlink of a wideband CDMA system. Compared to the conventional RAKE receiver, this generalized RAKE receiver may have more fingers and different combining weights. The weights are derived from a maximum likelihood formulation, modeling the intracell interference as colored Gaussian noise. This low-complexity detector is especially useful for systems with orthogonal downlink spreading codes, as orthogonality between own cell signals cannot be maintained in a frequency-selective channel. The performance of the proposed receiver is quantified via analysis and simulation for different dispersive channels, including Rayleigh fading channels. Gains on the order of 1-3.5 dB are achieved, depending on the dispersiveness of the channel, with only a modest increase in the number of fingers. For a wideband CDMA (WCDMA) system and a realistic mobile radio channel, this translates to capacity gains of the order of 100%.

1 November 1999 in IEEE Communications Letters
Verified
Journal Article
Closed access
PFP. Frenger
P. Frenger
POP. Orten
P. Orten
TOT. Ottosson
T. Ottosson
New convolutional codes with rates 1/2, 1/3, and 1/4 are presented for constraint lengths ranging from 3 to 15. These new codes are maximum free-distance codes. Furthermore, the codes have optimized information error weights, resulting in a low bit-error rate for binary communication on both additive white Gaussian noise (AWGN) and Rayleigh fading channels. Improved coding gains of as much as 0.6 dB compared to previously published codes have been observed for coherent BPSK over a Rayleigh fading channel and a wide range of signal-to-noise ratios.

1 August 2000 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
YWY.-P.E. Wang
Y.-P.E. Wang
TOT. Ottosson
T. Ottosson
In a CDMA cellular system, the process of the mobile station searching for a cell and achieving code and time synchronization to its downlink scrambling code is referred to as cell search. Cell search is performed in three scenarios: initial cell search when a mobile station is switched on, idle mode search when inactive, and active mode search during a call. The latter two are also called target cell search. This paper presents algorithms and results for both initial and target cell search scenarios for the wideband CDMA (W-CDMA) standard. In W-CDMA, the cell search itself is divided into five acquisition stages: slot synchronization, frame synchronization and scrambling code group identification, scrambling code identification, frequency acquisition, and cell identification. Initial cell search needs all five stages, while target cell search in general does not need the last two stages. A pipelined process of the first three stages that minimizes the average code and time acquisition time, while keeping the complexity at a reasonable level, is considered. The frequency error in initial cell search, which may be as large as 20 kHz, is taken care of by partial symbol despreading and noncoherent combining. Optimization of key system parameters such as the loading factors for primary synchronization channel, synchronization channel, and common pilot channel for achieving the smallest average code and time acquisition time is studied. After code and time synchronization (the first three stages), a maximum likelihood (ML)-based frequency acquisition method is used to bring down the frequency error to about 200 Hz. The gain of this method is more than 10 dB compared to an alternative scheme that obtains a frequency error estimate using differential detection.

6 December 2007 in Proceedings of the IEEE
Verified
Journal Article
Closed access
MSMikael Sternad
Mikael Sternad
TSTommy Svensson
Tommy Svensson
TOTony Ottosson
Tony Ottosson
AAAnders Ahlen
Anders Ahlen
ASArne Svensson
Arne Svensson
Anna BrunstromAnna Brunstrom
Anna Brunstrom
High data rates, high spectral efficiency, flexibility, and low delays over the air interface will be important features in next-generation wireless systems. The overall challenge will be packet scheduling and adaptive radio transmission for multiple users, via multiple antennas and over frequency-selective wideband channels. This problem needs to be structured to obtain feasible solutions. The basic simplifying assumptions used here are clustering of antennas into cells, orthogonal transmission by use of cyclic-prefix orthogonal frequency-division multiplexing (OFDM) and a time-scale separation view of the total link adaptation, scheduling and intercell coordination problem. Based on these assumptions, we survey techniques that adapt the transmission to the temporal, frequency, and spatial channel properties. We provide a systematic overview of the design problems, such as the dimensioning of the allocated time-frequency resources, the influence of duplexing schemes, adaptation control issues for downlinks and uplinks, timing issues, and their relation to the required performance of channel predictors. Specific design choices are illustrated by recent research within the Swedish Wireless IP program and the EU IST-WINNER project. The presented results indicate that high-performance adaptive OFDM transmission systems are indeed feasible, also for challenging scenarios that involve vehicular velocities, high carrier frequencies, and high bandwidths.

17 November 2003 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
JLJ. Lassing
J. Lassing
ESErik G. Ström
Erik G. Ström
EAE. Agrell
E. Agrell
TOT. Ottosson
T. Ottosson
The problem of calculating the average bit-error probability (BEP) of coherent M-ary phase-shift keying (PSK) over a Gaussian channel has been studied previously in the literature. A solution to the problem for systems using a binary reflected Gray code (BRGC) to map bits to symbols was first presented by P.J. Lee (see ibid., vol.COM-34, p.488-91, 1986). We show that the results obtained by Lee are incorrect for M/spl ges/16. We show that the reason for this is an invalid assumption that the bit-error rate (BER) is independent of the transmitted symbols, an assumption which has also propagated to textbooks. We give a new expression for the BER of M-PSK systems using the BRGC and compare this with Lee's results.

1 January 2000 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
PFP. Frenger
P. Frenger
POP. Orten
P. Orten
TOT. Ottosson
T. Ottosson