In reply to dave_59:
Thank you Dave, I watched the useful video link you shared. I have got some follow up questions from your video.
Under the title “Signed Expressions” you have explained how below code will work,
bit signed [2:0] A = -1;
bit [3:0] B = 14;
A + B < 14
First question : why expression will get evaluated in 32 bit context, as I thought it should be evaluated to the highest variable bits in the expression, i.e 4 bit (from previous explanation in the video, please correct me if required)
Second question : I understand the if there is one unsigned value in the expression, whole expression will turn unsigned, my question is for the value, how 3 bit signed value (which is shown as -1) will become unsigned 32’d7 , how did you converted from -1 to 7 ?