On optimal transforms and quantization schemes in gaussian distributed source coding

Two different aspects of distributed source coding is discussed. First, a previously developed distributed uniform scalar quantization method is improved by adopting non-uniform quantization. It is observed that compared to uniform quantization, the non-uniform scheme further approaches to the distortion-rate bound by 0.5 bit. Turning then to sources with memory, the tradeoff between exploitation of time and space correlation is exposed. It is shown by example that optimal transforms deviate from their traditional counterparts. Specifically, optimal transforms in the distributed framework do not necessarily fully decorrelate each sequence in time