Multiple-antenna systems employ different signal processing techniques at both ends of the communication to exploit the spatial dimensions and serve multiple users simultaneously in the same time-frequency domain. In this way, high spectral efficiency can be reached without the need of extra bandwidth. However, such gain depends on a highly accurate channel state information at the transmitter (CSIT). Perfect CSIT allows the system to suppress the multi user interference (MUI), which is the main responsible of the performance degradation. Nonetheless, assuming perfect CSIT is rather optimistic since the estimation procedure, quantization errors and delays of real system lead to CSIT uncertainties. In this context, rate splitting (RS) has arisen as a promising technique to deal with CSIT imperfections. Basically, RS splits the data into a common stream and private streams and then superimposes the common stream on top of the private streams. This thesis proposes several processing techniques which further enhance the benefits of RS systems. We consider the downlink (DL) of a wireless communications system, where the transmitter sends independent messages to each receiver. The ergodic sum rate (ESR) is adopted as the main metric to evaluate the performance of the system. Different from conventional RS works, we consider that the users are equipped with multiple antennas. This allows us to implement stream combiners for the common stream at the receivers. The implementations of the stream combiners improves the common rate performance, which is a major problem of RS systems since the common rate is limited by the performance of the worst user and can be heavily degraded. In this work, three different stream combiners are proposed along with analytical expressions to compute their sum rate performance. Specifically, the combiners are derived employing the min-max, maximum ratio combining (MRC), and minimum mean square error (MMSE) criteria. The min-max criterion selects at each user the best receive antenna to decode the common symbol. The MRC criterion aims at maximizing the SNR when decoding the common symbol. Finally, the MMSE criterion minimizes the squared difference between the common symbol and the received signal. So far, RS has been predominantly considered with channel inversiontype linear precoders. Therefore, this motivates us to investigate the performance of RS with non-linear precoders. For this purpose, we employ different architectures of the Tomlinson-Harashima precoder (THP) which are based on the zero-forcing (ZF) and MMSE precoders. We then propose a multi-branch (MB) algorithm for the proposed RS-THP, which creates several transmit patterns and selects the best for transmission. This pre-processing techniques further enhance the sum rate obtained since the performance of THP is dependent on the symbol ordering but also increases the computational complexity. Analytical expressions to calculate the sum rate of the proposed techniques are derived through statistical evaluation of key parameters. Finally, we propose four different adaptive power allocation techniques, which are characterized by their low computational complexity. Two of them are designed for conventional SDMA systems whereas the other two are intended for RS systems. One major objective of the proposed algorithms is to perform robust power allocation capable of dealing with the detrimental effects of imperfect CSIT. It is important to mention that power allocation in RS systems is one of the critical tasks that should be carefully performed. If the power is not properly allocated the performance of RS systems is heavily degraded and conventional architectures such as SDMA and NOMA could perform better. However, RS rely on solving complex optimization problems to perform power allocation, increasing the time and effort dedicated to signal processing. The proposed adaptive power allocation algorithms reduce the computational complexity and are an attractive solution for practical applications with large-scale systems.