Dr Min Li

Dr Min Li

Post-Doctoral Fellow

School of Electrical Engineering and Computing

Career Summary

Biography

Min Li received the B.E. degree in telecommunications engineering, the M.E. degree in information and communication engineering from Zhejiang University, Hangzhou, China, and the Ph.D. degree in electrical engineering from Pennsylvania State University, State College, PA, USA, in 2006, 2008, and 2012, respectively.

Since June 2016, he has been a Post-Doctoral Fellow with the School of Electrical Engineering and Computer Science, The University of Newcastle, Callaghan, N.S.W., Australia. Previously from September 2012 to June 2016, he was a Research Fellow in wireless communications with the Department of Engineering, Macquarie University, Sydney, N.S.W., Australia. He was also a Visiting Scientist at Australian Commonwealth Scientific and Industrial Research Organisation (CSIRO) between April 2013 and April 2015. 

His research interests include network information theory and coding theory, wireless communication theory and system designs (5G technologies) and optimization techniques. His current research topics include index coding, network information theory, multi-user MIMO and millimeter-wave (mmWave) cellular communications. 

He has served as a Technical Program Committee (TPC) Member for several prestigious IEEE international conferences such as the IEEE ICC, the GLOBECOM and the VTC. He was also on the organizing committee of the 15th Australian Communications Theory Workshop (AusCTW) hosted by Macquarie University.

Research Expertise

network information theory, coding theory, wireless communication theory and system designs (5G technologies), and optimization for networks 

Teaching Expertise

information theory, coding theory, wireless communications/networks, and digital electronics



Qualifications

  • Doctor of Philosophy, Pennsylvania State University - USA

Keywords

  • 5G technologies
  • index coding
  • millimeter-wave communications
  • network information theory
  • optimization for networks
  • wireless communications

Languages

  • English (Fluent)
  • Mandarin (Mother)

Fields of Research

Code Description Percentage
100510 Wireless Communications 40
080401 Coding and Information Theory 60

Professional Experience

UON Appointment

Title Organisation / Department
Post-Doctoral Fellow University of Newcastle
School of Electrical Engineering and Computing
Australia

Academic appointment

Dates Title Organisation / Department
6/09/2012 - 10/06/2016 Research Fellow

Conducted research on novel techniques for next-generation (5G and beyond) cellular networks, including multi-user MIMO, base station cooperation and coordination, heterogeneous networks and millimeter wave (mmWave) communications.

Macquarie University
Australia

Awards

Distinction

Year Award
2007 ASUS Distinguished Graduate Student Scholarship
Zhejiang University

Scholarship

Year Award
2008 Graduate Research Assistant Scholarship
Pennsylvania State University

Teaching

Code Course Role Duration
ELEC887 Heterogeneous Networks: Theory and Practice
Macquarie University
  • developed unit guide for this brand-new course for the newly launched Master of Engineering Program at Macquarie University
  • designed all course materials from scratch (including lectures, tutorials, assignments, projects/tests)
  • delivered lectures (twice a week)
  • marked assignments/tests/reports
  • offered consultations
Lecturer 29/02/2016 - 10/06/2016
ENGG200 Engineering Practice
Macquarie University
  • developed and delivered two introductory lectures on Matlab programming ("A Tutorial on Matlab")
Guest Lecturer 7/04/2014 - 21/04/2014
Edit

Publications

For publications that are currently unpublished or in-press, details are shown in italics.

Highlighted Publications

Year Citation Altmetrics Link
2013 Li M, Simeone O, Yener A, 'Multiple access channels with states causally known at transmitters', IEEE Transactions on Information Theory, 59 1394-1404 (2013)

It has been recently shown by Lapidoth and Steinberg that strictly causal state information can be beneficial in multiple access channels (MACs). Specifically, it was proved that ... [more]

It has been recently shown by Lapidoth and Steinberg that strictly causal state information can be beneficial in multiple access channels (MACs). Specifically, it was proved that the capacity region of a two-user MAC with independent states, each known strictly causally to one encoder, can be enlarged by letting the encoders send compressed past state information to the decoder. In this study, a generalization of the said strategy is proposed whereby the encoders compress also the past transmitted codewords along with the past state sequences. The proposed scheme uses a combination of long-message encoding, compression of the past state sequences and codewords without binning, and joint decoding over all transmission blocks. The proposed strategy has been recently shown by Lapidoth and Steinberg to strictly improve upon the original one. Capacity results are then derived for a class of channels that include two-user modulo-additive state-dependent MACs. Moreover, the proposed scheme is extended to state-dependent MACs with an arbitrary number of users. Finally, output feedback is introduced and an example is provided to illustrate the interplay between feedback and availability of strictly causal state information in enlarging the capacity region. © 1963-2012 IEEE.

DOI 10.1109/TIT.2012.2229459
Citations Scopus - 14
2013 Li M, Simeone O, Yener A, 'Degraded broadcast diamond channels with Noncausal state information at the source', IEEE Transactions on Information Theory, 59 8210-8223 (2013)

A state-dependent degraded broadcast diamond channel is studied where the source-to-relays cut is modeled with two noiseless, finite-capacity digital links with a degraded broadca... [more]

A state-dependent degraded broadcast diamond channel is studied where the source-to-relays cut is modeled with two noiseless, finite-capacity digital links with a degraded broadcasting structure, while the relays-to-destination cut is a general multiple access channel controlled by a random state. It is assumed that the source has noncausal channel state information and the relays have no state information. Under this model, first, the capacity is characterized for the case where the destination has state information, i.e., has access to the state sequence. It is demonstrated that in this case, a joint message and state transmission scheme via binning is optimal. Next, the case where the destination does not have state information, i.e., the case with state information at the source only, is considered. For this scenario, lower and upper bounds on the capacity are derived for the general discrete memoryless model. Achievable rates are then computed for the case in which the relays-to-destination cut is affected by an additive Gaussian state. Numerical results are provided that illuminate the performance advantages that can be accrued by leveraging noncausal state information at the source. © 1963-2012 IEEE.

DOI 10.1109/TIT.2013.2279877
2016 Li M, Collings IB, Hanly SV, Liu C, Whiting P, 'Multicell Coordinated Scheduling with Multiuser Zero-Forcing Beamforming', IEEE Transactions on Wireless Communications, 15 827-842 (2016)

© 2002-2012 IEEE.Coordinated scheduling/beamforming (CS/CB) is a cost-effective coordinated multipoint (CoMP) transmission paradigm that has been incorporated in the recent long-... [more]

© 2002-2012 IEEE.Coordinated scheduling/beamforming (CS/CB) is a cost-effective coordinated multipoint (CoMP) transmission paradigm that has been incorporated in the recent long-term evolution cellular standard. In this paper, we study CS/CB with the aim of developing low-complexity multicell coordinated user scheduling policies. We focus on a class of multicell interfering broadcast networks in which base stations have only local data and local channel state information, but each has sufficient antennas to serve multiple users using zero-forcing beamforming. The coordination problem is formulated as finding scheduling decisions across the cells such that the network sum rate is maximized. Starting from the two-cell model, we uncover the structure for a good scheduling decision, which in turn leads to the definition of two distributed scheduling policies of differing complexity and intercell coordination. Asymptotic theoretical bounds on the average sum rate are derived to predict the performance of the policies proposed. We extend to some example networks containing more than two cells and develop network-wide coordination policies. Numerical results confirm the effectiveness of the proposed policies and shed light on practical coordinated system design.

DOI 10.1109/TWC.2015.2479226
Citations Scopus - 2
2016 Liu C, Li M, Hanly S, Collings I, Whiting P, 'Millimeter Wave Beam Alignment: Large Deviations Analysis and Design Insights', : arXiv, manuscript available at https://arxiv.org/abs/1611.04212 (2016)
2017 Liu C, Li M, Collings IB, Hanly SV, Whiting P, 'Design and Analysis of Transmit Beamforming for Millimetre Wave Base Station Discovery', IEEE Transactions on Wireless Communications, 16 797-811 (2017)
DOI 10.1109/TWC.2016.2630681
2017 Li M, Ong L, Johnson S, 'Cooperative Multi-Sender Index Coding', : arXiv, manuscript available at https://arxiv.org/abs/1701.03877 (2017)
Co-authors Sarah Johnson, Lawrence Ong

Journal article (7 outputs)

Year Citation Altmetrics Link
2017 Liu C, Li M, Collings IB, Hanly SV, Whiting P, 'Design and Analysis of Transmit Beamforming for Millimetre Wave Base Station Discovery', IEEE Transactions on Wireless Communications, 16 797-811 (2017)
DOI 10.1109/TWC.2016.2630681
2017 Liu C, Li M, Hanly SV, Whiting P, 'Joint Downlink User Association and Interference Management in Two-Tier HetNets with Dynamic Resource Partitioning', IEEE Transactions on Vehicular Technology, 66 1365-1378 (2017)

© 2016 IEEE.We investigate a joint user association and interference management problem in two-tier downlink heterogeneous networks where pico base stations (BSs) are densely dep... [more]

© 2016 IEEE.We investigate a joint user association and interference management problem in two-tier downlink heterogeneous networks where pico base stations (BSs) are densely deployed in areas of high traffic demand. We employ macro almost blanking subframes (ABSs) to mitigate cross-tier interference. To manage co-tier interference among picocells, we introduce pico operation mode (POM): During each POM, a distinct subset of picocells serve users simultaneously; different POMs operate at different times at different durations. We formulate the problem as maximizing the network utility under proportional fairness with the optimization over user association and resource partitioning (RP) (including the macro ABS and the amount of time allocated to each POM). As an exhaustive search over all possible POMs in the optimization may become computationally infeasible, we propose a method of preselecting favorable POMs to reduce the dimension of the optimization. With the selected POMs, we explicitly examine the structure of the optimal solutions and show that 1) the optimal user association is load-aware and can be determined by rate bias values of each BS, and 2) all the POMs and the macro BSs have balanced load in the sense that the ratios of the number of associated users to the allocated time are the same. Based on the analysis, an alternating algorithm is developed to obtain the RP and the biases. We demonstrate through numerical examples that 1) the proposed POM selection method does not incur significant performance loss, compared with the case where all possible POMs are considered; 2) the alternating algorithm provides near-optimal cell association and RP solutions; 3) by applying the proposed framework, significant network performance improvement can be achieved with dense pico deployments, compared with baselines without co-tier interference management and baselines with sparse pico deployments.

DOI 10.1109/TVT.2016.2565538
2017 Li M, Liu C, Hanly SV, 'Precoding for the Sparsely Spread MC-CDMA Downlink with Discrete-Alphabet Inputs', IEEE Transactions on Vehicular Technology, 66 1116-1129 (2017)

© 2016 IEEE.Sparse signatures have been proposed for the code-division multiple-access (CDMA) uplink to reduce multiuser detection complexity, but they have not yet been fully ex... [more]

© 2016 IEEE.Sparse signatures have been proposed for the code-division multiple-access (CDMA) uplink to reduce multiuser detection complexity, but they have not yet been fully exploited for its downlink counterpart. In this paper, we propose multicarrier CDMA (MC-CDMA) downlink communication whereby regular sparse signatures are deployed in the frequency domain. Taking the symbol detection point of view, we formulate a problem appropriate for the downlink with discrete alphabets as inputs. The solution to the problem provides a power-efficient precoding algorithm for the base station (BS), subject to minimum symbol error probability (SEP) requirements at the mobile stations (MSs). In the algorithm, signature sparsity is shown to be crucial for reducing precoding complexity. Numerical results confirm system-load-dependent power reduction gain from the proposed precoding over the zero-forcing (ZF) precoding and the regularized ZF (RZF) precoding with optimized regularization parameter under the same SEP targets. For a fixed system load, it is also demonstrated that sparse MC-CDMA with a proper choice of sparsity level attains almost the same power efficiency and link throughput as that of dense MC-CDMA yet with reduced precoding complexity due to the sparse signatures.

DOI 10.1109/TVT.2016.2551726
2016 Li M, Collings IB, Hanly SV, Liu C, Whiting P, 'Multicell Coordinated Scheduling with Multiuser Zero-Forcing Beamforming', IEEE Transactions on Wireless Communications, 15 827-842 (2016)

© 2002-2012 IEEE.Coordinated scheduling/beamforming (CS/CB) is a cost-effective coordinated multipoint (CoMP) transmission paradigm that has been incorporated in the recent long-... [more]

© 2002-2012 IEEE.Coordinated scheduling/beamforming (CS/CB) is a cost-effective coordinated multipoint (CoMP) transmission paradigm that has been incorporated in the recent long-term evolution cellular standard. In this paper, we study CS/CB with the aim of developing low-complexity multicell coordinated user scheduling policies. We focus on a class of multicell interfering broadcast networks in which base stations have only local data and local channel state information, but each has sufficient antennas to serve multiple users using zero-forcing beamforming. The coordination problem is formulated as finding scheduling decisions across the cells such that the network sum rate is maximized. Starting from the two-cell model, we uncover the structure for a good scheduling decision, which in turn leads to the definition of two distributed scheduling policies of differing complexity and intercell coordination. Asymptotic theoretical bounds on the average sum rate are derived to predict the performance of the policies proposed. We extend to some example networks containing more than two cells and develop network-wide coordination policies. Numerical results confirm the effectiveness of the proposed policies and shed light on practical coordinated system design.

DOI 10.1109/TWC.2015.2479226
Citations Scopus - 2
2014 Li M, Liu C, Hanly SV, 'Distributed transmitter optimization for the wyner-type downlink via belief propagation', IEEE Communications Letters, 18 471-474 (2014)

We study a Wyner-type downlink network, where any two adjacent base stations (BSs) can communicate with each other and cooperate on transmission of discrete data symbols to their ... [more]

We study a Wyner-type downlink network, where any two adjacent base stations (BSs) can communicate with each other and cooperate on transmission of discrete data symbols to their intended mobile stations (MSs) situated along a circular array. With focus on the binary case, we take the symbol detection point of view and formulate a novel non-linear precoding optimization problem by imposing minimum Symbol Error Probabilities as Quality-of-Service constraints at MSs. We then cast the problem into a factor graph and propose a belief propagation (BP) framework to solve the problem in a distributed manner based on only local communication between adjacent BSs. Numerical results confirm the convergence of the distributed algorithm and demonstrate the transmit power saving from the proposed precoder over two state-of-the-art linear precoders. To the best of our knowledge, this is the first work that leverages the BP method for non-linear precoding. © 2014 IEEE.

DOI 10.1109/LCOMM.2014.012114.132515
Citations Scopus - 3
2013 Li M, Simeone O, Yener A, 'Multiple access channels with states causally known at transmitters', IEEE Transactions on Information Theory, 59 1394-1404 (2013)

It has been recently shown by Lapidoth and Steinberg that strictly causal state information can be beneficial in multiple access channels (MACs). Specifically, it was proved that ... [more]

It has been recently shown by Lapidoth and Steinberg that strictly causal state information can be beneficial in multiple access channels (MACs). Specifically, it was proved that the capacity region of a two-user MAC with independent states, each known strictly causally to one encoder, can be enlarged by letting the encoders send compressed past state information to the decoder. In this study, a generalization of the said strategy is proposed whereby the encoders compress also the past transmitted codewords along with the past state sequences. The proposed scheme uses a combination of long-message encoding, compression of the past state sequences and codewords without binning, and joint decoding over all transmission blocks. The proposed strategy has been recently shown by Lapidoth and Steinberg to strictly improve upon the original one. Capacity results are then derived for a class of channels that include two-user modulo-additive state-dependent MACs. Moreover, the proposed scheme is extended to state-dependent MACs with an arbitrary number of users. Finally, output feedback is introduced and an example is provided to illustrate the interplay between feedback and availability of strictly causal state information in enlarging the capacity region. © 1963-2012 IEEE.

DOI 10.1109/TIT.2012.2229459
Citations Scopus - 14
2013 Li M, Simeone O, Yener A, 'Degraded broadcast diamond channels with Noncausal state information at the source', IEEE Transactions on Information Theory, 59 8210-8223 (2013)

A state-dependent degraded broadcast diamond channel is studied where the source-to-relays cut is modeled with two noiseless, finite-capacity digital links with a degraded broadca... [more]

A state-dependent degraded broadcast diamond channel is studied where the source-to-relays cut is modeled with two noiseless, finite-capacity digital links with a degraded broadcasting structure, while the relays-to-destination cut is a general multiple access channel controlled by a random state. It is assumed that the source has noncausal channel state information and the relays have no state information. Under this model, first, the capacity is characterized for the case where the destination has state information, i.e., has access to the state sequence. It is demonstrated that in this case, a joint message and state transmission scheme via binning is optimal. Next, the case where the destination does not have state information, i.e., the case with state information at the source only, is considered. For this scenario, lower and upper bounds on the capacity are derived for the general discrete memoryless model. Achievable rates are then computed for the case in which the relays-to-destination cut is affected by an additive Gaussian state. Numerical results are provided that illuminate the performance advantages that can be accrued by leveraging noncausal state information at the source. © 1963-2012 IEEE.

DOI 10.1109/TIT.2013.2279877
Show 4 more journal articles

Conference (10 outputs)

Year Citation Altmetrics Link
2016 Li M, Liu C, Suzuki H, Hanly SV, Collings IB, Whiting P, 'Measurements and analysis of multiuser MIMO-OFDM channels in campus environment', 2016 Australian Communications Theory Workshop, AusCTW 2016 (2016)

© 2016 IEEE.This paper describes a channel measurement campaign undertaken on the Macquarie University (MQ) campus, Sydney, Australia, based on a multiuser multiple-input multipl... [more]

© 2016 IEEE.This paper describes a channel measurement campaign undertaken on the Macquarie University (MQ) campus, Sydney, Australia, based on a multiuser multiple-input multiple-output orthogonal frequency division multiplexing (MU-MIMO-OFDM) system, developed by Commonwealth Scientific and Industrial Research Organisation (CSIRO) and installed in MQ campus. The MU-MIMO-OFDM system consists of a central node with a twelve-element antenna array and up to six remote nodes each with a single antenna. This paper reports on the analysis of user spatial correlation and the measured MU-MIMO-OFDM system capacity for different scenarios in a campus environment. It was found that channels of users concentrated in a local area with limited scattering can be highly correlated, and thus careful user selection is needed when supporting multiple users in such a scenario by the system. Our results also indicate that a significant portion of the theoretical sum-rate predicted under i.i.d. Rayleigh channels can be achieved in various realistic environments, despite differences observed between the measured channels and the theoretical i.i.d. channels.

DOI 10.1109/AusCTW.2016.7433667
2014 Li M, Hanly SV, 'Precoding optimization for the sparse MC-CDMA downlink communication', 2014 IEEE International Conference on Communications, ICC 2014 (2014)

We introduce a novel Multi-Carrier Code Division Multiple Access (MC-CDMA) system, where random sparse signatures are deployed in the frequency domain. Data symbols transmitted fr... [more]

We introduce a novel Multi-Carrier Code Division Multiple Access (MC-CDMA) system, where random sparse signatures are deployed in the frequency domain. Data symbols transmitted from base station (BS) to mobile stations (MSs) are drawn from discrete finite alphabets, such as M-QAM constellations. Transmitter-based precoding is introduced so as to allow simple despreading followed by single-user detection at MSs. A power-efficient non-linear precoding optimization problem is formulated by imposing minimum Symbol Error Probability (SEP) targets at MSs. We first elaborate on how to translate the SEP targets into exact constraint regions on noiseless received components at MSs. With relaxation on the exact regions, a tractable convex problem is obtained. A dual-decomposition-based algorithm is then developed to accommodate parallel processors to perform precoding calculation. The signature sparsity turns out to be vital to reduce interprocessor communication overhead and computational complexity for pre-coding. The scheme proposed offers considerable transmit power reduction compared with the conventional zero-forcing precoder. © 2014 IEEE.

DOI 10.1109/ICC.2014.6883634
2014 Li M, Liu C, Collings IB, Hanly SV, 'Multicell coordinated scheduling with multiuser ZF beamforming', 2014 IEEE International Conference on Communications, ICC 2014 (2014)

We investigate a coordinated scheduling problem in a two-cell network where in each cell, two users are scheduled for simultaneous communication. Zero-forcing (ZF) beamforming is ... [more]

We investigate a coordinated scheduling problem in a two-cell network where in each cell, two users are scheduled for simultaneous communication. Zero-forcing (ZF) beamforming is employed at each base station to suppress both intra- and inter-cell interference. The coordinated scheduling/beamforming problem is formulated as finding proper scheduling decisions and hence beamformers across the network such that a weighted sum-throughput is maximized. We propose three distributed scheduling policies that only require local data and local channel state information at each cell, and consume much less computation and communication overhead than the global optimization approach via exhaustive search. The proposed policies illustrate the complexity-performance tradeoff for the coordinated system. Nevertheless, numerical results show that at all levels of complexity, the proposed policies perform close to the global optimization approach with ZF beamforming and outperform the scheme with matched filtering beamforming even with global coordination. © 2014 IEEE.

DOI 10.1109/ICC.2014.6884114
Citations Scopus - 2
2014 Li M, Collings IB, Hanly SV, Liu C, Whiting P, 'Multicell coordinated scheduling with multiuser ZF beamforming: Policies and performance bounds', 2014 IEEE Information Theory Workshop, ITW 2014 (2014)

© 2014 IEEE.We consider a coordinated multiuser scheduling problem for a multicell mutually interfering broadcast network. In particular, we focus on a two-cell cluster, where bo... [more]

© 2014 IEEE.We consider a coordinated multiuser scheduling problem for a multicell mutually interfering broadcast network. In particular, we focus on a two-cell cluster, where both base stations have only local data and local channel state information, but each has sufficient number of antennas to serve multiple homogeneous users under a full zero-forcing beamforming transmission. The scheduling problem is formulated as finding proper scheduled users and hence beamformers across the cells such that the sum rate is maximized. We uncover the structure for a good scheduling decision, which in turn motivates three distributed coordinated scheduling policies of different levels of complexity. For the simplest policy, we derive a lower bound on the expected achievable sum rate. It is shown in the large user population limit, the simplest policy suffices to preserve the best possible multiplexing gain and multiuser diversity gain for the model studied, but it does induce a pairing loss on the sum rate due to the limited coordination between cells.

DOI 10.1109/ITW.2014.6970840
2013 Li M, Liu C, Hanly SV, Collings IB, 'Transmitter optimization for the network MIMO downlink with finite-alphabet and QoS constraints', 2013 Australian Communications Theory Workshop, AusCTW 2013 (2013)

We consider a network MIMO downlink communication where base stations (BSs) can cooperate on transmission of data symbols to their intended mobile stations (MSs). We assume the da... [more]

We consider a network MIMO downlink communication where base stations (BSs) can cooperate on transmission of data symbols to their intended mobile stations (MSs). We assume the data symbols for each user come from a finite alphabet. We formulate a novel power optimization problem for the downlink communication starting with the binary inputs: we take a symbol detection point of view, impose minimum Symbol Error Probability (SEP) as Quality-of-Service (QoS) constraints at the MSs, and show that the resulting problem is convex. We first tackle the problem via centralized approaches and then propose a distributed algorithm to solve the power optimization problem, where only local communication among the base stations is required. We compare with state of the art linear precoding techniques, and demonstrate significant reduction in consumed transmit power attained by the proposed schemes. We also provide an extension of the problem to general finite-alphabet inputs. © 2013 IEEE.

DOI 10.1109/AusCTW.2013.6510063
Citations Scopus - 1
2013 Li M, Simeone O, Yener A, 'The state-dependent degraded broadcast diamond channel', 2013 Australian Communications Theory Workshop, AusCTW 2013 (2013)

A state-dependent degraded broadcast diamond channel is studied where the source-to-relays cut is modeled with two noiseless, finite-capacity digital links with a degraded broadca... [more]

A state-dependent degraded broadcast diamond channel is studied where the source-to-relays cut is modeled with two noiseless, finite-capacity digital links with a degraded broadcasting structure, while the relays-to-destination cut is a general multiple access channel controlled by a random state. It is assumed that the source has non-causal channel state information, the relays have no state information and the destination may or may not have state information. First, the capacity is found for the case where the destination has access to the state sequence. It is demonstrated that a joint message and state transmission scheme via binning is optimal. Next, for the case with state information at the source only, lower and upper bounds on the capacity are derived for the general discrete memoryless model. Achievable rates are then computed for the case in which the relays-to-destination cut is affected by an additive Gaussian state. © 2013 IEEE.

DOI 10.1109/AusCTW.2013.6510045
2013 Li M, Liu C, Hanly SV, 'Distributed base station cooperation with finite alphabet and QoS constraints', IEEE International Symposium on Information Theory - Proceedings (2013)

This work studies a novel power-efficient precoder design problem for a linear cellular array with base station (BS) cooperation: data symbols intended for mobile stations (MSs) a... [more]

This work studies a novel power-efficient precoder design problem for a linear cellular array with base station (BS) cooperation: data symbols intended for mobile stations (MSs) are drawn from discrete finite alphabets, precoding is performed among BSs to produce appropriate signals transmitted over the channel, symbol-by-symbol detection is performed at each MS, and a minimum Symbol Error Probability (SEP) for detection is introduced as the Quality-of-Service (QoS) metric at each MS. With regular constellations such as 16-QAM deployed as system data inputs, the SEP constraints are formulated and characterized by a set of convex relaxations on the received signals. A convex power optimization problem is then formulated subject to the SEP constraints. By the primal-dual decomposition approach, a distributed algorithm is developed to solve the problem in which only local communication among BSs is required. Our scheme is shown to significantly outperform linear zero-forcing precoder in terms of transmit power consumption. © 2013 IEEE.

DOI 10.1109/ISIT.2013.6620408
Citations Scopus - 3
2013 Liu C, Li M, Hanly SV, 'Power-efficient transmission design for MISO broadcast systems with QoS constraints', 2013 Information Theory and Applications Workshop, ITA 2013 - Conference Proceedings (2013)

This paper considers a novel transmitter optimization problem for MISO broadcast systems, where a multi-antenna base station (BS) serves a set of single-antenna mobile stations (M... [more]

This paper considers a novel transmitter optimization problem for MISO broadcast systems, where a multi-antenna base station (BS) serves a set of single-antenna mobile stations (MSs) with Quality of Service (QoS) targets formulated in terms of Symbol Error Probability (SEP): data inputs are drawn from a discrete alphabet, precoding is performed by the BS to generate appropriate signals transmitted over the channel, symbol-by-symbol detection is performed at each MS, and a minimum SEP target is imposed at each MS as the QoS target. Starting with the system adopting standard constellations and with focus on 16-QAM, the SEP constraints are formulated and characterized by a set of convex relaxations on the received signals. The resulting problem is convex, and can be efficiently solved by the primal-dual interior point method. Numerical results demonstrate that the proposed precoder provides significant transmission power reduction compared with the linear zero-forcing (ZF) precoder under the same SEP targets. Turning to the system with Tomlinson-Harashima type constellations, a similar convex relaxation approach is applied and the corresponding convex optimization problem is presented. The proposed precoding scheme is shown to outperform both the previous scheme (based on regular constellations with convex relaxation) and the standard Tomlinson-Harashima precoding using zero forcing. © 2013 IEEE.

DOI 10.1109/ITA.2013.6502940
Citations Scopus - 2
2011 Li M, Simeone O, Yener A, 'Message and state cooperation in a relay channel when the relay has strictly causal state information', 2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings (2011)

A state-dependent relay channel is studied in which strictly causal channel state information is available at the relay and no state information is available at the source and des... [more]

A state-dependent relay channel is studied in which strictly causal channel state information is available at the relay and no state information is available at the source and destination. Source and relay are connected via two unidirectional out-of-band orthogonal links of finite capacity, and a state-dependent memoryless channel connects source and relay, on one side, and the destination, on the other. Via the orthogonal links, the source can convey information about the message to be delivered to the destination to the relay while the relay can forward state information to the source. This exchange enables cooperation between source and relay on both transmission of message and state information to the destination. First, an achievable scheme, inspired by noisy network coding, is proposed that exploits both message and state cooperation. Next, based on the given achievable rate and appropriate upper bounds, capacity results are identified for some special cases. Finally, a Gaussian model is studied, along with corresponding numerical results that illuminate the relative merits of state and message cooperation. © 2011 IEEE.

DOI 10.1109/ITA.2011.5743602
2011 Li M, Simeone O, Yener A, 'Leveraging strictly causal state information at the encoders for multiple access channels', IEEE International Symposium on Information Theory - Proceedings (2011)

The state-dependent multiple access channel (MAC) is considered where the state sequences are known strictly causally to the encoders. First, a two-user MAC with two independent s... [more]

The state-dependent multiple access channel (MAC) is considered where the state sequences are known strictly causally to the encoders. First, a two-user MAC with two independent states each known strictly causally to one encoder is revisited, and a new achievable scheme inspired by the recently proposed noisy network coding is presented. This scheme is shown to achieve a rate region that is potentially larger than that provided by recent work for the same model. Next, capacity results are presented for a class of channels that include modulo-additive state-dependent MACs. It is shown that the proposed scheme can be easily extended to an arbitrary number of users. Finally, a similar scheme is proposed for a MAC with common state known strictly causally to all encoders. The corresponding achievable rate region is shown to reduce to the one given in the previous work as a special case for two users. © 2011 IEEE.

DOI 10.1109/ISIT.2011.6034086
Citations Scopus - 4
Show 7 more conferences

Patent (1 outputs)

Year Citation Altmetrics Link
2011 Zhao M, Li M, Yang L, Lei L, Zhao H, Shen W, et al., Decoding Method and Reconfigurable Decoding Apparatus for Block-Structured LDPC Codes (2011)

Other (3 outputs)

Year Citation Altmetrics Link
2017 Li M, Ong L, Johnson S, 'Cooperative Multi-Sender Index Coding', : arXiv, manuscript available at https://arxiv.org/abs/1701.03877 (2017)
Co-authors Sarah Johnson, Lawrence Ong
2016 Liu C, Li M, Hanly S, Collings I, Whiting P, 'Millimeter Wave Beam Alignment: Large Deviations Analysis and Design Insights', : arXiv, manuscript available at https://arxiv.org/abs/1611.04212 (2016)
2011 Li M, Simeone O, Yener A, 'Message and State Cooperation in a Relay Channel When Only the Relay Knows the State', : manuscript available at http://arxiv.org/abs/1102.0768 (2011)

Thesis / Dissertation (1 outputs)

Year Citation Altmetrics Link
2012 Li M, Information Theoretic Limits of Multi-user Channels with State, The Pennsylvania State University (2012)
Edit

Research Supervision

Number of supervisions

Completed0
Current1

Total current UON EFTSL

PhD0.05

Current Supervision

Commenced Level of Study Research Title Program Supervisor Type
2014 PhD Index Coding: How to Utilize Side Information? PhD (Electrical Engineering), Faculty of Engineering and Built Environment, The University of Newcastle Co-Supervisor
Edit

Research Collaborations

The map is a representation of a researchers co-authorship with collaborators across the globe. The map displays the number of publications against a country, where there is at least one co-author based in that country. Data is sourced from the University of Newcastle research publication management system (NURO) and may not fully represent the authors complete body of work.

Country Count of Publications
Australia 13
United States 5
Edit

Dr Min Li

Position

Post-Doctoral Fellow
School of Electrical Engineering and Computing
Faculty of Engineering and Built Environment

Contact Details

Email min.li@newcastle.edu.au
Phone (02) 49215291
Mobile 0452667558

Office

Room ES214
Building ES Building.
Location Callaghan University Drive Callaghan, NSW 2308 Australia
University Drive
Callaghan, NSW 2308
Australia
Edit